Beyond Monotonicity: Stochastic Online Optimization under Semi-Bandit Feedback
cs.LG
Submitted: 2026-11-02
Updated: 2026-11-02
Terminology
Sources
- Near-Optimal Regret Bounds for Monotone Stochastic Optimization under Semi-Bandit Feedback
- Online Algorithms for Repeated Optimal Stopping: Balancing Baseline Guarantees and Regret
- Near-Optimal Regret for Semi-Bandit Learning of Monotone Stochastic Problems
Related papers
- A Physics-Regulated Neural Framework for Learning 3D Grain Growth Dynamics
- FlexMoE: Learning One-for-All Multi-Budget Expert Pruning for Flexible MoE Deployment
- OptiMind: Improving Small Language Models for Optimization Modeling through Formulation Guidance and Multi-Turn Learning
- Staying in the Sweet Spot: Boost Reasoning Evolution via Responsive Rollout Difficulty Manipulation
- Examining the Impact of Data and Training Methods on Emergent and Subliminal Misalignment
- Rethinking Black-Box On-Policy Distillation: A Rubric-based Analysis