ACI-style updates with boundary actions achieve adversarial coverage validity and sublinear cost regret in conformal selection under bandit feedback.
Bandits with knapsacks.J
4 Pith papers cite this work, alongside 137 external citations. Polarity classification is still indexing.
4
Pith papers citing it
137
external citations · OpenAlex
citation-role summary
background 1
citation-polarity summary
years
2026 4roles
background 1polarities
background 1representative citing papers
Formalizes support-exclusion in constrained pricing and introduces target-aware controller with certified bands and regret-information accounting that identifies when polynomial target mass succeeds but 1/t branches fail without extra movement.
Develops COF algorithm for MAB-CS that intelligently checks cheap arm feasibility by pooling samples, with generalized instance-dependent lower bounds and matching upper bounds on cumulative cost and quality regret.
A dueling bandit algorithm with belief-aware upper confidence bound is introduced for efficient, interaction-based selection of LLMs matching user latent preferences.
citing papers explorer
-
Efficient Online Conformal Selection with Limited Feedback
ACI-style updates with boundary actions achieve adversarial coverage validity and sublinear cost regret in conformal selection under bandit feedback.
-
Resource-Constrained Adaptive Inference for Sequential Pricing
Formalizes support-exclusion in constrained pricing and introduces target-aware controller with certified bands and regret-information accounting that identifies when polynomial target mass succeeds but 1/t branches fail without extra movement.
-
Cost-Ordered Feasibility for Multi-Armed Bandits with Cost Subsidy
Develops COF algorithm for MAB-CS that intelligently checks cheap arm feasibility by pooling samples, with generalized instance-dependent lower bounds and matching upper bounds on cumulative cost and quality regret.
-
CUPID in the Model Zoo: Online Matchmaking for Selecting Your Dream LLM
A dueling bandit algorithm with belief-aware upper confidence bound is introduced for efficient, interaction-based selection of LLMs matching user latent preferences.