Conference item icon

Conference item

Selective omniprediction and fair abstention

Abstract:
We propose new learning algorithms for building selective classifiers, which are predictors that are allowed to abstain on some fraction of the domain. We study the model where a classifier may abstain from predicting at a fixed cost. Building on the recent framework on multigroup fairness and omniprediction, given a prespecified class of loss functions, we provide an algorithm for building a single classifier that learns abstentions and predictions optimally for every loss in the entire class, where the abstentions are decided efficiently for each specific loss function by applying a fixed post-processing function. Our algorithm and theoretical guarantees generalize the previously-known algorithms for learning selective classifiers in formal learning-theoretic models.

We then extend the traditional multigroup fairness algorithms to the selective classification setting and show that we can use a calibrated and multiaccurate predictor to efficiently build selective classifiers that abstain optimally not only globally but also locally within each of the groups in any pre-specified collection of possibly intersecting subgroups of the domain, and are also accurate when they do not abstain. We show how our abstention algorithms can be used as conformal prediction methods in the binary classification setting to achieve both marginal and group-conditional coverage guarantees for an intersecting collection of groups. We provide empirical evaluations for all of our theoretical results, demonstrating the practicality of our learning algorithms for abstaining optimally and fairly.
Publication status:
Published
Peer review status:
Peer reviewed

Actions

Access Document

Publication website:
https://neurips.cc/virtual/2025/loc/san-diego/poster/119346

Authors

More by this author
Institution:
University of Oxford
Division:
MPLS
Department:
Computer Science
Role:
Author
More by this author
Institution:
University of Oxford
Division:
MPLS
Department:
Computer Science
Role:
Author
ORCID:
0000-0002-2300-4819


More from this funder
Funder identifier:
https://ror.org/04v48nr57
Funding agency for:
Casacuberta, S


Publisher:
NeurIPS
Article number:
119346
Publication date:
2025-12-04
Acceptance date:
2025-09-17
Event title:
39th Conference on Neural Information Processing Systems (NeurIPS 2025)
Event location:
San Diego, CA, USA
Event website:
https://neurips.cc/Conferences/2025
Event start date:
2025-12-02
Event end date:
2025-12-07


Language:
English
Pubs id:
2320326
Local pid:
pubs:2320326
Deposit date:
2025-11-09
ARK identifier:

Terms of use


Views and Downloads






If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP