paper-with-me

Papers

Efficient Online Set-valued Classification with Bandit Feedback

2024-05-07 · Zhou Wang, Xingye Qiao

Conformal prediction is a distribution-free method that wraps a given machine learning model and returns a set of plausible labels that contain the true label with a prescribed coverage rate. In practice, the empirical coverage achieved highly relies on fully observed label information from data both in the training phase for model fitting and the calibration phase for quantile estimation. This dependency poses a challenge in the context of online learning with bandit feedback, where a learner only has access to the correctness of actions (i.e., pulled an arm) but not the full information of the true label. In particular, when the pulled arm is incorrect, the learner only knows that the pulled one is not the true class label, but does not know which label is true. Additionally, bandit feedback further results in a smaller labeled dataset for calibration, limited to instances with correct actions, thereby affecting the accuracy of quantile estimation. To address these limitations, we propose Bandit Class-specific Conformal Prediction (BCCP), offering coverage guarantees on a class-specific granularity. Using an unbiased estimation of an estimand involving the true label, BCCP trains the model and makes set-valued inferences through stochastic gradient descent. Our approach overcomes the challenges of sparsely labeled data in each iteration and generalizes the reliability and applicability of conformal prediction to online decision-making environments.

📄 PDF Abstract BibTeX arXiv:2405.04393

Code (0)

등록된 구현이 없습니다.

Tasks

ClassificationConformal PredictionDecision Making

Methods 이 논문이 사용한 방법론

SET Dynamic Sparse Training method where weight mask is updated randomly periodically

Similar Papers 제목 키워드 기반

Online Learning with Set-Valued Feedback

2023-06-09 · Vinod Raman, Unique Subedi, Ambuj Tewari

We study a variant of online multiclass classification where the learner predicts a single label but receives a \textit{set of labels} as feedback. In this model, the learner is penalized for not outputting a label conta…

Preference-based Online Learning with Dueling Bandits: A Survey

2018-07-30 · Viktor Bengs, Robert Busa-Fekete, Adil El Mesaoudi-Paul, Eyke Hüllermeier

In machine learning, the notion of multi-armed bandits refers to a class of online learning problems, in which an agent is supposed to simultaneously explore and exploit a given set of choice alternatives in the course o…

Multi-Armed BanditsSurvey

Multiclass Online Learnability under Bandit Feedback

2023-08-08 · Ananth Raman, Vinod Raman, Unique Subedi, Idan Mehalel 외

We study online multiclass classification under bandit feedback. We extend the results of Daniely and Helbertal [2013] by showing that the finiteness of the Bandit Littlestone dimension is necessary and sufficient for ba…

Multiclass Classification using dilute bandit feedback

2021-05-17 · Gaurav Batra, Naresh Manwani

This paper introduces a new online learning framework for multiclass classification called learning with diluted bandit feedback. At every time step, the algorithm predicts a candidate label set instead of a single label…

Classification

Online Multiclass Boosting with Bandit Feedback

2018-10-11 · Daniel T. Zhang, Young Hun Jung, Ambuj Tewari

We present online boosting algorithms for multiclass classification with bandit feedback, where the learner only receives feedback about the correctness of its prediction. We propose an unbiased estimate of the loss usin…

General Classification