Abstract:As interactive generative systems are increasingly deployed in real-world applications, their tendency to generate unreliable or false responses raises serious concerns. Conformal abstention mitigates this risk by ensuring that the system answers only when confident. However, real-world deployments typically provide only partial user feedback (e.g., thumbs up/down) on the selected response and often operate in non-stationary or adversarial environments, for which effective learning methods are largely missing. To bridge this gap, we propose ExAUL, a novel online learning framework for conformal abstention with adversarial and partial feedback. Technically, we introduce (i) a novel conversion lemma}that translates the regret of any bandit algorithm into an FDR bound, and (ii) feedback unlocking, a strategy that exploits the structure of conformal abstention to extract additional learning signals from partial feedback. We prove that ExAUL achieves a regret bound of $O(\sqrt{T \ln |{H}|})$, which translates into an ${O}(\sqrt{T})$ bound on FDR risk control, matching the controllability of full-information settings despite receiving only partial feedback. While applicable to general generative tasks, we demonstrate the efficacy of ExAUL for ensuring the reliability of Large Language Models (LLMs) through empirical validation on question-answering tasks across diverse non-stationary and adversarial settings. Our results demonstrate that ExAUL robustly controls the FDR while maintaining competitive answering coverage.
| Comments: | 11 pages |
| Subjects: | Machine Learning (cs.LG) |
| Cite as: | arXiv:2506.14067 [cs.LG] |
| (or arXiv:2506.14067v4 [cs.LG] for this version) | |
| https://doi.org/10.48550/arXiv.2506.14067 arXiv-issued DOI via DataCite |
From: Minjae Lee [view email]
[v1]
Mon, 16 Jun 2025 23:51:30 UTC (5,307 KB)
[v2]
Mon, 13 Oct 2025 14:48:23 UTC (7,331 KB)
[v3]
Thu, 5 Mar 2026 04:04:15 UTC (8,964 KB)
[v4]
Tue, 5 May 2026 02:13:52 UTC (6,589 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理，仅供阅读参考。 原文来自 — 版权归原作者所有。