Near-Optimal Regret Bounds for Monotone Stochastic Optimization under Semi-Bandit Feedback

arXiv:2610.17320 · cs.LG, cs.DS, stat.ML · Submitted 2026-10-12 · Read on arXiv

cs.LG, cs.DS, stat.ML

Submitted: 2026-10-12

Updated: 2026-10-12

Comments: 68 pages, 20 figures, 1 table

License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/

Terminology

• Regret — 1× in this paper · explained in 3 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: The Predictive Cost of ELBO Binding
• Understanding Diffusion Models via Ratio-Based Function Approximation with SignReLU Networks