Image de couverture de livre

Chained Information-Theoretic bounds and Tight Regret Rate for Linear Bandit Problems

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Gouverneur, Amaury, Rodríguez-Gálvez, Borja, Oechtering, Tobias J., Skoglund, Mikael
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

An Information-Theoretic Analysis of Thompson Sampling for Logistic Bandits
par: Gouverneur, Amaury, et autres
Publié: (2024)

An Information-Theoretic Analysis of Thompson Sampling with Infinite Action Spaces
par: Gouverneur, Amaury, et autres
Publié: (2025)

Information-Theoretic Minimax Regret Bounds for Reinforcement Learning based on Duality
par: Bongole, Raghav, et autres
Publié: (2024)

Refined PAC-Bayes Bounds for Offline Bandits
par: Gouverneur, Amaury, et autres
Publié: (2025)

Instantiating Bayesian CVaR lower bounds in Interactive Decision Making Problems
par: Bongole, Raghav, et autres
Publié: (2026)

An Information-Theoretic Approach to Generalization Theory
par: Rodríguez-Gálvez, Borja, et autres
Publié: (2024)

More PAC-Bayes bounds: From bounded losses, to losses with general tail behaviors, to anytime validity
par: Rodríguez-Gálvez, Borja, et autres
Publié: (2023)

A note on generalization bounds for losses with finite moments
par: Rodríguez-Gálvez, Borja, et autres
Publié: (2024)

A Coding-Theoretic Analysis of Hyperspherical Prototypical Learning Geometry
par: Lindström, Martin, et autres
Publié: (2024)

On Information Theoretic Fairness: Compressed Representations With Perfect Demographic Parity
par: Zamani, Amirreza, et autres
Publié: (2024)

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

Thompson Sampling for Stochastic Bandits with Noisy Contexts: An Information-Theoretic Regret Analysis
par: Jose, Sharu Theresa, et autres
Publié: (2024)

A Hierarchical Sampling Framework for bounding the Generalization Error of Federated Learning
par: Filatrella, Dario, et autres
Publié: (2026)

Integrated Sensing and Communication with Distributed Rate-Limited Helpers
par: Chen, Yiqi, et autres
Publié: (2025)

Parameter-Free Dynamic Regret for Unconstrained Linear Bandits
par: Rumi, Alberto, et autres
Publié: (2026)

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

Tight Rates for Bandit Control Beyond Quadratics
par: Sun, Y. Jennifer, et autres
Publié: (2024)

Risk level dependent Minimax Quantile lower bounds for Interactive Statistical Decision Making
par: Bongole, Raghav, et autres
Publié: (2025)

Near-Optimal Regret in Linear MDPs with Aggregate Bandit Feedback
par: Cassel, Asaf, et autres
Publié: (2024)

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

Multi-terminal Strong Coordination subject to Secrecy Constraints
par: Ramachandran, Viswanathan, et autres
Publié: (2024)

Multi-terminal Strong Coordination over Noisy Channels with Encoder Co-operation
par: Ramachandran, Viswanathan, et autres
Publié: (2025)

Generalizing the Fano inequality further
par: Bongole, Raghav, et autres
Publié: (2026)

Evaluating Differential Privacy on Correlated Datasets Using Pointwise Maximal Leakage
par: Saeidian, Sara, et autres
Publié: (2025)

Satisficing Regret Minimization in Bandits: Constant Rate and Light-Tailed Distribution
par: Feng, Qing, et autres
Publié: (2024)

Gradient Coding in Decentralized Learning for Evading Stragglers
par: Li, Chengxi, et autres
Publié: (2024)

Generalized Linear Bandits: Almost Optimal Regret with One-Pass Update
par: Zhang, Yu-Jie, et autres
Publié: (2025)

On Bits and Bandits: Quantifying the Regret-Information Trade-off
par: Shufaro, Itai, et autres
Publié: (2024)

Information Capacity Regret Bounds for Bandits with Mediator Feedback
par: Eldowa, Khaled, et autres
Publié: (2024)

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

Improved Regret Bounds for Linear Bandits with Heavy-Tailed Rewards
par: Tajdini, Artin, et autres
Publié: (2025)

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

Distributed Learning based on 1-Bit Gradient Coding in the Presence of Stragglers
par: Li, Chengxi, et autres
Publié: (2024)

Open Problem: Tight Bounds for Kernelized Multi-Armed Bandits with Bernoulli Rewards
par: Mussi, Marco, et autres
Publié: (2024)

Regret minimization in Linear Bandits with offline data via extended D-optimal exploration
par: Vijayan, Sushant, et autres
Publié: (2025)

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 is not enough! Bandits with General Constraints through Adaptive Regret Minimization
par: Bernasconi, Martino, et autres
Publié: (2024)

Modified Meta-Thompson Sampling for Linear Bandits and Its Bayes Regret Analysis
par: Li, Hao, et autres
Publié: (2024)

Tangential Randomization in Linear Bandits (TRAiL): Guaranteed Inference and Regret Bounds
par: Güçlü, Arda, et autres
Publié: (2024)