{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:42:24Z","timestamp":1773376944203,"version":"3.50.1"},"reference-count":37,"publisher":"IEEE","license":[{"start":{"date-parts":[[2025,6,22]],"date-time":"2025-06-22T00:00:00Z","timestamp":1750550400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,6,22]],"date-time":"2025-06-22T00:00:00Z","timestamp":1750550400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025,6,22]]},"DOI":"10.1109\/isit63088.2025.11195427","type":"proceedings-article","created":{"date-parts":[[2025,10,20]],"date-time":"2025-10-20T17:48:08Z","timestamp":1760982488000},"page":"1-6","source":"Crossref","is-referenced-by-count":1,"title":["Error Exponents for Robust Hypothesis Testing with Abstention"],"prefix":"10.1109","author":[{"given":"Malhar","family":"Managoli","sequence":"first","affiliation":[{"name":"School of Tech. and Comp. Sc., Tata Institute of Fundamental Research,Mumbai,India"}]},{"given":"K. R.","family":"Sahasranand","sequence":"additional","affiliation":[{"name":"Mehta Family School of DS & AI, Indian Institute of Technology Palakkad,India"}]},{"given":"Vinod M.","family":"Prabhakaran","sequence":"additional","affiliation":[{"name":"School of Tech. and Comp. Sc., Tata Institute of Fundamental Research,Mumbai,India"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/isit63088.2025.11195427"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TEC.1957.5222035"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1970.1054406"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1002\/cjs.5550340410"},{"issue":"8","key":"ref5","article-title":"Classification with a reject option using a hinge loss","volume":"9","author":"Bartlett","year":"2008","journal-title":"Journal of Machine Learning Research"},{"issue":"1","key":"ref6","article-title":"Classification methods with reject option based on convex risk minimization","volume":"11","author":"Yuan","year":"2010","journal-title":"Journal of Machine Learning Research"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1214\/07-EJS058"},{"key":"ref8","article-title":"Support vector machines with a reject option","volume":"21","author":"Grandvalet","year":"2008","journal-title":"Advances in neural information processing systems"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-46379-7_5"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2021.3081433"},{"key":"ref11","first-page":"35 379","article-title":"Efficient active learning with abstention","volume":"35","author":"Zhu","year":"2022","journal-title":"Advances in Neural Information Processing Systems"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-023-06494-8"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2011.6089531"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6284675"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541591"},{"key":"ref16","first-page":"448","article-title":"A survey of sampling from contaminated distributions","author":"Tukey","year":"1960","journal-title":"Contributions to probability and statistics: Essays in Honor of Harold Hotelling"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177703732"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177699803"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.2008128"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2016.76"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/3055399.3055491"},{"key":"ref22","article-title":"Learning discrete distributions from untrusted batches","volume-title":"9th Innovations in Theoretical Computer Science Conference (ITCS 2018). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik","author":"Qiao","year":"2018"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1137\/17M1126680"},{"key":"ref24","first-page":"4512","article-title":"Learning structured distributions from untrusted batches: Faster and simpler","volume":"33","author":"Chen","year":"2020","journal-title":"Advances in Neural Information Processing Systems"},{"key":"ref25","first-page":"4651","article-title":"Optimal robust learning of discrete distributions from batches","volume-title":"International Conference on Machine Learning. PMLR","author":"Jain","year":"2020"},{"key":"ref26","first-page":"4698","article-title":"Robust density estimation from batches: The best things in life are (nearly) free","volume-title":"International Conference on Machine Learning. PMLR","author":"Jain","year":"2021"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1017\/9781108943161"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/ITA50056.2020.9244996"},{"key":"ref29","first-page":"12774","article-title":"Towards optimally abstaining from prediction with ood test examples","volume":"34","author":"Kalai","year":"2021","journal-title":"Advances in Neural Information Processing Systems"},{"key":"ref30","first-page":"8027","article-title":"Adversarial resilience in sequential prediction via abstention","volume":"36","author":"Goel","year":"2023","journal-title":"Advances in Neural Information Processing Systems"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177700150"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1974.1055254"},{"key":"ref33","first-page":"181","article-title":"On the error exponent for source coding and for testing simple statistical hypotheses","volume":"6","author":"Csisz\u00e1r","year":"1971","journal-title":"Studia Sci. Math. Hungar."},{"key":"ref34","doi-asserted-by":"crossref","DOI":"10.1017\/9781108966351","volume-title":"Information theory: From coding to learning","author":"Polyanskiy","year":"2024"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-4380-9_35"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.2979704"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1002\/0471200611"}],"event":{"name":"2025 IEEE International Symposium on Information Theory (ISIT)","location":"Ann Arbor, MI, USA","start":{"date-parts":[[2025,6,22]]},"end":{"date-parts":[[2025,6,27]]}},"container-title":["2025 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11195206\/11195207\/11195427.pdf?arnumber=11195427","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:29:30Z","timestamp":1773347370000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11195427\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,22]]},"references-count":37,"URL":"https:\/\/doi.org\/10.1109\/isit63088.2025.11195427","relation":{},"subject":[],"published":{"date-parts":[[2025,6,22]]}}}