m-Set Adversarial Bandits with Winner Feedback

arXiv:2610.10128 · cs.LG, stat.ML · Submitted 2026-10-07 · Read on arXiv

cs.LG, stat.ML

Submitted: 2026-10-07

Updated: 2026-10-07

Code: https://github.com/T3p/konbini

Terminology

• Regret — 87× in this paper · explained in 3 episodes
• Core — 14× in this paper · explained in 2 episodes
• Action Space — 4× in this paper · explained in 1 episode
• Adaptation — 4× in this paper · explained in 1 episode
• Combinatorial Optimization — 3× in this paper · explained in 2 episodes
• Exchangeability — 3× in this paper · explained in 2 episodes
• Minimax Regret — 3× in this paper · explained in 2 episodes
• Objective Function — 3× in this paper · explained in 2 episodes
• Decoupling — 1× in this paper · explained in 2 episodes
• Elias — 1× in this paper · explained in 2 episodes
• Generalization — 1× in this paper · explained in 13 episodes
• Online Stochastic Mirror Descent — 1× in this paper
• Reward Function — 1× in this paper · explained in 2 episodes

Related papers

• Polynomial-Augmented Neural Networks (PANNs) with Weak Orthogonality Constraints for Enhanced Function and PDE Approximation
• AIRL-S: Unifying Reinforcement Learning and Search-Based Test-Time Scaling via Adversarial Inverse Reinforcement Learning
• Transformers as Bayesian In-Context Experimenters: Smoothness-Adaptive Efficient ATE Estimation
• Convergence issues in Relational Concept Analysis based on AOC-posets
• Beliefs Beyond Posteriors: Local-Consistency Optimisation for Bayesian Neural Networks
• Understanding Diffusion Models via Ratio-Based Function Approximation with SignReLU Networks