Theory and Algorithms for Learning with Multi-Class Abstention and Multi-Expert Deferral
Anqi Mao

TL;DR
This paper develops new theoretical frameworks and algorithms for multi-expert deferral and abstention in classification and regression, providing strong guarantees and demonstrating empirical effectiveness.
Contribution
It introduces novel surrogate losses and consistency guarantees for learning with abstention and multi-expert deferral, addressing both classification and regression tasks.
Findings
Proposed surrogate losses achieve strong $H$-consistency bounds.
Algorithms outperform existing methods on CIFAR datasets.
Framework effectively handles continuous labels and multiple experts.
Abstract
Large language models (LLMs) have achieved remarkable performance but face critical challenges: hallucinations and high inference costs. Leveraging multiple experts offers a solution: deferring uncertain inputs to more capable experts improves reliability, while routing simpler queries to smaller, distilled models enhances efficiency. This motivates the problem of learning with multiple-expert deferral. This thesis presents a comprehensive study of this problem and the related problem of learning with abstention, supported by strong consistency guarantees. First, for learning with abstention (a special case of deferral), we analyze score-based and predictor-rejector formulations in multi-class classification. We introduce new families of surrogate losses and prove strong non-asymptotic, hypothesis set-specific consistency guarantees, resolving two existing open questions. We analyze…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMachine Learning and Algorithms · Machine Learning and Data Classification · Topic Modeling
