Cover Image

Improved Algorithms for Stochastic Linear Bandits Using Tail Bounds for Martingale Mixtures

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Flynn, Hamish, Reeb, David, Kandemir, Melih, Peters, Jan
Format:	Preprint
Published:	2023
Subjects:	Machine Learning
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Tighter Confidence Bounds for Sequential Kernel Regression
by: Flynn, Hamish, et al.
Published: (2024)

Weighted Sequential Bayesian Inference for Non-Stationary Linear Contextual Bandits
by: Werge, Nicklas, et al.
Published: (2023)

Linear Bandits with Non-i.i.d. Noise
by: Abélès, Baptiste, et al.
Published: (2025)

Posterior Sampling Reinforcement Learning with Gaussian Processes for Continuous Control: Sublinear Regret Bounds for Unbounded State Spaces
by: Flynn, Hamish, et al.
Published: (2026)

Improved Regret Bounds for Linear Bandits with Heavy-Tailed Rewards
by: Tajdini, Artin, et al.
Published: (2025)

Sparse Nonparametric Contextual Bandits
by: Flynn, Hamish, et al.
Published: (2025)

Deterministic Uncertainty Propagation for Improved Model-Based Offline Reinforcement Learning
by: Akgül, Abdullah, et al.
Published: (2024)

Relative Information Gain and Gaussian Process Regression
by: Flynn, Hamish
Published: (2025)

Improved Algorithm for Adversarial Linear Mixture MDPs with Bandit Feedback and Unknown Transition
by: Li, Long-Fei, et al.
Published: (2024)

Bayesian Bandit Algorithms with Approximate Inference in Stochastic Linear Bandits
by: Huang, Ziyi, et al.
Published: (2024)

Improving Actor-Critic Training with Steerable Action-Value Approximation Errors
by: Tasdighi, Bahareh, et al.
Published: (2024)

Continual Learning of Multi-modal Dynamics with External Memory
by: Akgül, Abdullah, et al.
Published: (2022)

Improved Bound for Robust Causal Bandits with Linear Models
by: Yan, Zirui, et al.
Published: (2024)

Improved Algorithms for Nash Welfare in Linear Bandits
by: Sarkar, Dhruv, et al.
Published: (2026)

A Measure-Theoretic Finite-Sample Theory for Adaptive-Data Fitted Q-Iteration
by: Haussmann, Manuel, et al.
Published: (2026)

Algorithmic Stability of Stochastic Gradient Descent with Momentum under Heavy-Tailed Noise
by: Dang, Thanh, et al.
Published: (2025)

Confidence Sequences for Generalized Linear Models via Regret Analysis
by: Clerico, Eugenio, et al.
Published: (2025)

Self-Normalized Martingales and Uniform Regret Bounds for Linear Regression
by: Chen, Fan, et al.
Published: (2026)

An Improved Algorithm for Adversarial Linear Contextual Bandits via Reduction
by: van Erven, Tim, et al.
Published: (2025)

EdVAE: Mitigating Codebook Collapse with Evidential Discrete Variational Autoencoders
by: Baykal, Gulcin, et al.
Published: (2023)

Disentanglement with Factor Quantized Variational Autoencoders
by: Baykal, Gulcin, et al.
Published: (2024)

Overcoming Non-stationary Dynamics with Evidential Proximal Policy Optimization
by: Akgül, Abdullah, et al.
Published: (2025)

Minimax Rate-Optimal Algorithms for High-Dimensional Stochastic Linear Bandits
by: Liu, Jingyu, et al.
Published: (2025)

Sparse Optimistic Information Directed Sampling
by: Schwartz, Ludovic, et al.
Published: (2025)

Heavy-Tailed Linear Bandits: Huber Regression with One-Pass Update
by: Wang, Jing, et al.
Published: (2025)

Active Learning for Stochastic Contextual Linear Bandits
by: Brunskill, Emma, et al.
Published: (2026)

Regret Distribution in Stochastic Bandits: Optimal Trade-off between Expectation and Tail Risk
by: Simchi-Levi, David, et al.
Published: (2023)

Regret Tail Characterization of Optimal Bandit Algorithms with Generic Rewards
by: Panda, Subhodip, et al.
Published: (2026)

A Simple and Optimal Policy Design with Safety against Heavy-Tailed Risk for Stochastic Bandits
by: Simchi-Levi, David, et al.
Published: (2022)

Data-Driven Upper Confidence Bounds with Near-Optimal Regret for Heavy-Tailed Bandits
by: Tamás, Ambrus, et al.
Published: (2024)

Improved Regret Bounds for Bandits with Expert Advice
by: Cesa-Bianchi, Nicolò, et al.
Published: (2024)

Hitting Time Isomorphism for Multi-Stage Planning with Foundation Policies
by: Boock, Magnus Victor, et al.
Published: (2026)

Bridging the Performance Gap Between Target-Free and Target-Based Reinforcement Learning
by: Vincent, Théo, et al.
Published: (2025)

Optimal and Practical Batched Linear Bandit Algorithm
by: Yu, Sanghoon, et al.
Published: (2025)

Linear Bandits on Ellipsoids: Minimax Optimal Algorithms
by: Zhang, Raymond, et al.
Published: (2025)

Preference-centric Bandits: Optimality of Mixtures and Regret-efficient Algorithms
by: Tatlı, Meltem, et al.
Published: (2025)

Policy-based Tuning of Autoregressive Image Models with Instance- and Distribution-Level Rewards
by: Baran, Orhun Buğra, et al.
Published: (2026)

Truncated LinUCB for Stochastic Linear Bandits
by: Song, Yanglei, et al.
Published: (2022)

Rising Rested Bandits: Lower Bounds and Efficient Algorithms
by: Fiandri, Marco, et al.
Published: (2024)

Learning to Sparsify Stochastic Linear Bandits
by: Wang, Zhengmiao, et al.
Published: (2026)