Gaussian-Width Bounds for Offline-to-Online Linear Bandits
cs.LG
Submitted: 2026-10-09
Updated: 2026-10-09
Sources
- Optimal Best-Arm Identification in Bandits with Access to Offline Data
- Artificial Replay: A Meta-Algorithm for Harnessing Historical Data in Bandits
- Direction-Aware Offline-to-Online Learning in Linear Contextual Bandits
- On the Benefits of Free Exploration for Regret Minimization in Multi-Armed Bandits
- Balancing optimism and pessimism in offline-to-online learning
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