Active, anytime-valid risk controlling prediction sets

• URL: http://arxiv.org/abs/2406.10490v2
• Date: Thu, 31 Oct 2024 15:28:49 GMT
• Title: Active, anytime-valid risk controlling prediction sets
• Abstract summary: We provide risk controlling prediction sets (RCPS) for producing prediction sets that are statistically guaranteed low risk from machine learning models. Our method extends this notion to the sequential setting, where we provide guarantees even when the data is collected adaptively. We describe how to use predictors (i.e., the machine learning model for which we provide risk control guarantees) to further improve the utility of our RCPSes.
• Score: 14.981405797741662
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Rigorously establishing the safety of black-box machine learning models concerning critical risk measures is important for providing guarantees about model behavior. Recently, Bates et. al. (JACM '24) introduced the notion of a risk controlling prediction set (RCPS) for producing prediction sets that are statistically guaranteed low risk from machine learning models. Our method extends this notion to the sequential setting, where we provide guarantees even when the data is collected adaptively, and ensures that the risk guarantee is anytime-valid, i.e., simultaneously holds at all time steps. Further, we propose a framework for constructing RCPSes for active labeling, i.e., allowing one to use a labeling policy that chooses whether to query the true label for each received data point and ensures that the expected proportion of data points whose labels are queried are below a predetermined label budget. We also describe how to use predictors (i.e., the machine learning model for which we provide risk control guarantees) to further improve the utility of our RCPSes by estimating the expected risk conditioned on the covariates. We characterize the optimal choices of label policy and predictor under a fixed label budget and show a regret result that relates the estimation error of the optimal labeling policy and predictor to the wealth process that underlies our RCPSes. Lastly, we present practical ways of formulating label policies and empirically show that our label policies use fewer labels to reach higher utility than naive baseline labeling strategies on both simulations and real data.

Related papers

• Conformal Risk-Averse Decision Making with Optimized Certainty Equivalent Risk Control [31.006941545235396]
  We study risk-averse decision making in which an agent selects actions while being uncertain about the true system state.<n>We characterize the optimal policy under known distributions, and show that it reduces to a prediction set-based solution for the CVaR.<n>For unknown distributions, we develop a data-driven calibration strategy, based on a synthetic model for the likelihood and held-out calibration data.
  arXiv  Detail & Related papers  (2026-08-28T10:45:23Z)
• Prediction-Powered Active Testing [14.083979525233316]
  Active testing provides a label--efficient approach to risk estimation by adaptively selecting which test points should be labelled.<n>We propose bfbfPrediction--Powered Active Testing (PPAT), a novel label--efficient risk estimation framework.
  arXiv  Detail & Related papers  (2026-07-09T10:52:24Z)
• Risk-Consistent Multiclass Learning from Random Label-Subset Membership Queries [23.692455958661668]
  This paper proposes a multiclass learn ing framework under random label-subset queries.<n>We derive an unbiased estimator of the target risk under the empirical risk minimization (ERM) framework.<n>To address negative empirical risk and the associated overfitting problem, we introduce corrected risk estimators based on non-negative and absolute-value corrections.
  arXiv  Detail & Related papers  (2026-05-08T08:05:02Z)
• Generative Adversarial Regression (GAR): Learning Conditional Risk Scenarios [0.2864713389096699]
  We propose Generative Adversarial Regression (GAR), a framework for learning conditional risk scenarios through generators aligned with downstream risk objectives.<n>GAR builds on a regression characterization of conditional risk for elicitable functionals, including quantiles, expectiles, and jointly elicitable pairs.<n>We extend this principle to generative modeling by training generators whose policy-induced risk matches that of real data under the same context.
  arXiv  Detail & Related papers  (2026-03-09T16:16:59Z)
• Prediction-Powered Risk Monitoring of Deployed Models for Detecting Harmful Distribution Shifts [51.37000123503367]
  We propose prediction-powered risk monitoring (PPRM), a semi-supervised risk-monitoring approach based on prediction-powered inference (PPI)<n>PPRM constructs anytime-valid lower bounds on the running risk by combining synthetic labels with a small set of true labels.<n>We demonstrate the effectiveness of PPRM through extensive experiments on image classification, large language model (LLM) and telecommunications monitoring tasks.
  arXiv  Detail & Related papers  (2026-02-02T15:32:14Z)
• LEC: Linear Expectation Constraints for False-Discovery Control in Selective Prediction and Routing Systems [95.35293543918762]
  Large language models (LLMs) often generate unreliable answers, while uncertainty methods fail to fully distinguish correct from incorrect predictions.<n>We address this issue through the lens of false discovery rate (FDR) control, ensuring that among all accepted predictions, the proportion of errors does not exceed a target risk level.<n>We propose LEC, which reinterprets selective prediction as a constrained decision problem by enforcing a Linear Expectation Constraint.
  arXiv  Detail & Related papers  (2025-12-01T11:27:09Z)
• COIN: Uncertainty-Guarding Selective Question Answering for Foundation Models with Provable Risk Guarantees [51.5976496056012]
  COIN is an uncertainty-guarding selection framework that calibrates statistically valid thresholds to filter a single generated answer per question.<n>COIN estimates the empirical error rate on a calibration set and applies confidence interval methods to establish a high-probability upper bound on the true error rate.<n>We demonstrate COIN's robustness in risk control, strong test-time power in retaining admissible answers, and predictive efficiency under limited calibration data.
  arXiv  Detail & Related papers  (2025-06-25T07:04:49Z)
• Conformal Prediction with Corrupted Labels: Uncertain Imputation and Robust Re-weighting [25.916898357807455]
  We introduce a framework for robust uncertainty quantification in situations where labeled training data are corrupted.<n>We build on conformal prediction, a statistical tool for generating prediction sets.<n>We introduce uncertain imputation, a new conformal method that does not rely on weight estimation.
  arXiv  Detail & Related papers  (2025-05-07T18:46:02Z)
• Coverage-Guaranteed Speech Emotion Recognition via Calibrated Uncertainty-Adaptive Prediction Sets [0.0]
  Road rage, often triggered by emotional suppression and sudden outbursts, significantly threatens road safety by causing collisions and aggressive behavior.<n>Speech emotion recognition technologies can mitigate this risk by identifying negative emotions early and issuing timely alerts.<n>We propose a novel risk-controlled prediction framework providing statistically rigorous guarantees on prediction accuracy.
  arXiv  Detail & Related papers  (2025-03-24T12:26:28Z)
• A Planning Framework for Adaptive Labeling [8.883000217198843]
  We introduce an adaptive labeling framework where measurement effort can be reallocated in batches. We show that even one-step lookahead policy can substantially outperform common adaptive labelings. We propose a direct backpropagation-based approach, Smoothed-Autodiff, based on a carefully smoothed version of the original non-differentiable MDP.
  arXiv  Detail & Related papers  (2025-02-10T00:01:08Z)
• Robust Online Conformal Prediction under Uniform Label Noise [10.059818934854038]
  We investigate the robustness of online conformal prediction under uniform label noise with a known noise rate. We propose Noise Robust Online Conformal Prediction (dubbed NR-OCP) by updating the threshold with a novel robust pinball loss. Our theoretical analysis shows that NR-OCP eliminates the coverage gap in both constant and dynamic learning rate schedules.
  arXiv  Detail & Related papers  (2025-01-30T14:08:26Z)
• Online scalable Gaussian processes with conformal prediction for guaranteed coverage [32.21093722162573]
  The consistency of the resulting uncertainty values hinges on the premise that the learning function conforms to the properties specified by the GP model. We propose to wed the GP with the prevailing conformal prediction (CP), a distribution-free post-processing framework that produces it prediction sets with a provably valid coverage.
  arXiv  Detail & Related papers  (2024-10-07T19:22:15Z)
• An Unbiased Risk Estimator for Partial Label Learning with Augmented Classes [46.663081214928226]
  We propose an unbiased risk estimator with theoretical guarantees for PLLAC. We provide a theoretical analysis of the estimation error bound of PLLAC. Experiments on benchmark, UCI and real-world datasets demonstrate the effectiveness of the proposed approach.
  arXiv  Detail & Related papers  (2024-09-29T07:36:16Z)
• Efficient Online Set-valued Classification with Bandit Feedback [10.882001129426726]
  We propose Bandit Class-specific Conformal Prediction (BCCP), offering coverage guarantees on a class-specific granularity. BCCP overcomes the challenges of sparsely labeled data in each iteration and generalizes the reliability and applicability of conformal prediction to online decision-making environments.
  arXiv  Detail & Related papers  (2024-05-07T15:14:51Z)
• PAC Prediction Sets Under Label Shift [52.30074177997787]
  Prediction sets capture uncertainty by predicting sets of labels rather than individual labels. We propose a novel algorithm for constructing prediction sets with PAC guarantees in the label shift setting. We evaluate our approach on five datasets.
  arXiv  Detail & Related papers  (2023-10-19T17:57:57Z)
• Active Learning in the Predict-then-Optimize Framework: A Margin-Based Approach [5.371816551086118]
  We develop a learning method that sequentially decides whether to request the "labels" of feature samples from an unlabeled data stream. Our active learning method is the first to be directly informed by the decision error induced by the predicted parameters.
  arXiv  Detail & Related papers  (2023-05-11T05:44:36Z)
• Conformal Off-Policy Prediction in Contextual Bandits [54.67508891852636]
  Conformal off-policy prediction can output reliable predictive intervals for the outcome under a new target policy. We provide theoretical finite-sample guarantees without making any additional assumptions beyond the standard contextual bandit setup.
  arXiv  Detail & Related papers  (2022-06-09T10:39:33Z)
• Holdouts set for predictive model updating [0.9749560288448114]
  Updating risk scores can lead to biased risk estimates. We propose using a holdout set' - a subset of the population that does not receive interventions guided by the risk score. We prove that this approach enables total costs to grow at a rate $Oleft(N2/3right)$ for a population of size $N$, and argue that in general circumstances there is no competitive alternative.
  arXiv  Detail & Related papers  (2022-02-13T18:04:00Z)
• Delving into Probabilistic Uncertainty for Unsupervised Domain Adaptive Person Re-Identification [54.174146346387204]
  We propose an approach named probabilistic uncertainty guided progressive label refinery (P$2$LR) for domain adaptive person re-identification. A quantitative criterion is established to measure the uncertainty of pseudo labels and facilitate the network training. Our method outperforms the baseline by 6.5% mAP on the Duke2Market task, while surpassing the state-of-the-art method by 2.5% mAP on the Market2MSMT task.
  arXiv  Detail & Related papers  (2021-12-28T07:40:12Z)
• Risk Minimization from Adaptively Collected Data: Guarantees for Supervised and Policy Learning [57.88785630755165]
  Empirical risk minimization (ERM) is the workhorse of machine learning, but its model-agnostic guarantees can fail when we use adaptively collected data. We study a generic importance sampling weighted ERM algorithm for using adaptively collected data to minimize the average of a loss function over a hypothesis class. For policy learning, we provide rate-optimal regret guarantees that close an open gap in the existing literature whenever exploration decays to zero.
  arXiv  Detail & Related papers  (2021-06-03T09:50:13Z)
• RATT: Leveraging Unlabeled Data to Guarantee Generalization [96.08979093738024]
  We introduce a method that leverages unlabeled data to produce generalization bounds. We prove that our bound is valid for 0-1 empirical risk minimization. This work provides practitioners with an option for certifying the generalization of deep nets even when unseen labeled data is unavailable.
  arXiv  Detail & Related papers  (2021-05-01T17:05:29Z)
• Distribution-free uncertainty quantification for classification under label shift [105.27463615756733]
  We focus on uncertainty quantification (UQ) for classification problems via two avenues. We first argue that label shift hurts UQ, by showing degradation in coverage and calibration. We examine these techniques theoretically in a distribution-free framework and demonstrate their excellent practical performance.
  arXiv  Detail & Related papers  (2021-03-04T20:51:03Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.