Image de couverture de livre

How Does Variance Shape the Regret in Contextual Bandits?

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Jia, Zeyu, Qian, Jian, Rakhlin, Alexander, Wei, Chen-Yu
Format:	Preprint
Publié:	2024
Sujets:	Machine Learning
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

On the Minimax Regret of Sequential Probability Assignment via Square-Root Entropy
par: Jia, Zeyu, et autres
Publié: (2025)

Variance-Dependent Regret Lower Bounds for Contextual Bandits
par: He, Jiafan, et autres
Publié: (2025)

Self-Normalized Martingales and Uniform Regret Bounds for Linear Regression
par: Chen, Fan, et autres
Publié: (2026)

Variance-Aware Regret Bounds for Stochastic Contextual Dueling Bandits
par: Di, Qiwei, et autres
Publié: (2023)

Achieving Optimal Static and Dynamic Regret Simultaneously in Bandits with Deterministic Losses
par: Qian, Jian, et autres
Publié: (2026)

The Sample Complexity of Multiclass and Sparse Contextual Bandits
par: Erez, Liad, et autres
Publié: (2026)

Offline Reinforcement Learning: Role of State Aggregation and Trajectory Data
par: Jia, Zeyu, et autres
Publié: (2024)

Batch Ensemble for Variance Dependent Regret in Stochastic Bandits
par: Cassel, Asaf, et autres
Publié: (2024)

Fast Best-in-Class Regret for Contextual Bandits
par: Girard, Samuel, et autres
Publié: (2025)

Optimal Regret for Policy Optimization in Contextual Bandits
par: Levy, Orin, et autres
Publié: (2026)

Do We Need to Verify Step by Step? Rethinking Process Supervision from a Theoretical Perspective
par: Jia, Zeyu, et autres
Publié: (2025)

A Gapped Scale-Sensitive Dimension and Lower Bounds for Offset Rademacher Complexity
par: Jia, Zeyu, et autres
Publié: (2025)

Variance-Dependent Regret Bounds for Non-stationary Linear Bandits
par: Wang, Zhiyong, et autres
Publié: (2024)

Queue Length Regret Bounds for Contextual Queueing Bandits
par: Bae, Seoungbin, et autres
Publié: (2026)

On the Variance, Admissibility, and Stability of Empirical Risk Minimization
par: Kur, Gil, et autres
Publié: (2023)

Active Context Selection Improves Simple Regret in Contextual Bandits
par: Shahverdikondori, Mohammad, et autres
Publié: (2026)

On the Optimal Regret of Locally Private Linear Contextual Bandit
par: Li, Jiachun, et autres
Publié: (2024)

Refined Risk Bounds for Unbounded Losses via Transductive Priors
par: Qian, Jian, et autres
Publié: (2024)

Outcome-Based Online Reinforcement Learning: Algorithms and Fundamental Limits
par: Chen, Fan, et autres
Publié: (2025)

Assouad, Fano, and Le Cam with Interaction: A Unifying Lower Bound Framework and Characterization for Bandit Learnability
par: Chen, Fan, et autres
Publié: (2024)

Variance-Aware Linear UCB with Deep Representation for Neural Contextual Bandits
par: Bui, Ha Manh, et autres
Publié: (2024)

Local Anti-Concentration Class: Logarithmic Regret for Greedy Linear Contextual Bandit
par: Kim, Seok-Jin, et autres
Publié: (2024)

Regret Bounds for Adversarial Contextual Bandits with General Function Approximation and Delayed Feedback
par: Levy, Orin, et autres
Publié: (2025)

Variance-Aware Feel-Good Thompson Sampling for Contextual Bandits
par: Li, Xuheng, et autres
Publié: (2025)

Trajectory Bellman Residual Minimization: A Simple Value-Based Method for LLM Reasoning
par: Yuan, Yurun, et autres
Publié: (2025)

Not-a-Bandit: Provably No-Regret Drafter Selection in Speculative Decoding for LLMs
par: Liu, Hongyi, et autres
Publié: (2025)

Improved Regret Analysis in Gaussian Process Bandits: Optimality for Noiseless Reward, RKHS norm, and Non-Stationary Variance
par: Iwazaki, Shogo, et autres
Publié: (2025)

Near-Optimal Regret in Adversarial Kernel Bandits
par: Zhang, Yu-Jie, et autres
Publié: (2026)

An Improved Algorithm for Adversarial Linear Contextual Bandits via Reduction
par: van Erven, Tim, et autres
Publié: (2025)

Online Estimation via Offline Estimation: An Information-Theoretic Framework
par: Foster, Dylan J., et autres
Publié: (2024)

Decentralized Contextual Bandits with Network Adaptivity
par: Deng, Chuyun, et autres
Publié: (2025)

Regret Distribution in Stochastic Bandits: Optimal Trade-off between Expectation and Tail Risk
par: Simchi-Levi, David, et autres
Publié: (2023)

Bayesian Regret Minimization in Offline Bandits
par: Petrik, Marek, et autres
Publié: (2023)

Optimal Regret for Single Index Bandits
par: Dey, Devdan, et autres
Publié: (2026)

No-Regret Linear Bandits under Gap-Adjusted Misspecification
par: Liu, Chong, et autres
Publié: (2025)

No-Regret is not enough! Bandits with General Constraints through Adaptive Regret Minimization
par: Bernasconi, Martino, et autres
Publié: (2024)

Improved Regret Bounds for Bandits with Expert Advice
par: Cesa-Bianchi, Nicolò, et autres
Publié: (2024)

Prior Diffusiveness and Regret in the Linear-Gaussian Bandit
par: Zhu, Yifan, et autres
Publié: (2026)

Efficient Swap Regret Minimization in Combinatorial Bandits
par: Kontogiannis, Andreas, et autres
Publié: (2026)

Neural Risk-sensitive Satisficing in Contextual Bandits
par: Ito, Shogo, et autres
Publié: (2025)