


























Abstract:We consider selective classification with abstention in the fixed-pool (or transductive) setting, where the unlabeled pool is given beforehand and only a subset of points can be queried for labels. Our main insight is to view selective prediction through agreement: given queried labels and Lipschitz margin constraints in an embedding space, the version space of Lipschitz-consistent classification heads is well defined. We obtain upper and lower Lipschitz margin bounds that define, for each pool point, a set of certified valid labels containing the prediction of every head in the version space. The model therefore predicts only when the label is forced (i.e., all consistent heads agree), and abstains otherwise. We also propose a monotone submodular geometric proxy for budgeted querying, and show that a greedy algorithm retains the standard approximation factor.
| Subjects: | Machine Learning (cs.LG) |
| Cite as: | arXiv:2605.02611 [cs.LG] |
| (or arXiv:2605.02611v1 [cs.LG] for this version) | |
| https://doi.org/10.48550/arXiv.2605.02611 arXiv-issued DOI via DataCite (pending registration) |
From: Mohamadsadegh Khosravani [view email]
[v1]
Mon, 4 May 2026 13:58:56 UTC (50 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。