Optimal and Efficient Contextual Combinatorial Semi-bandits with General Function Approximation
cs.LG
Submitted: 2026-07-15
Updated: 2026-11-04
Terminology
Sources
- From Contextual Combinatorial Semi-Bandits to Bandit List Classification: Improved Sample Complexity with Sparse Rewards
- The Statistical Complexity of Interactive Decision Making
- Efficient Best-of-Both-Worlds Algorithms for Contextual Combinatorial Semi-Bandits
- Adaptive LLM Routing under Budget Constraints
- Taming the Monster Every Context: Complexity Measure and Unified Framework for Offline-Oracle Efficient Contextual Bandits
- Introducing LETOR 4.0 Datasets
- Upper Counterfactual Confidence Bounds: a New Optimism Principle for Contextual Bandits
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