Cover Image

No-Regret Linear Bandits under Gap-Adjusted Misspecification

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Liu, Chong, Qiao, Dan, Yin, Ming, Bogunovic, Ilija, Wang, Yu-Xiang
Format:	Preprint
Published:	2025
Subjects:	Machine Learning
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Corruption-Robust Linear Bandits: Minimax Optimality and Gap-Dependent Misspecification
by: Liu, Haolin, et al.
Published: (2024)

PROWL: Prioritized Regret-Driven Optimization for World Model Learning
by: Güzel, Ahmet H., et al.
Published: (2026)

Robust Bayesian Optimisation with Unbounded Corruptions
by: Ezzerg, Abdelhamid, et al.
Published: (2025)

Sample-efficient Bayesian Optimisation Using Known Invariances
by: Brown, Theodore, et al.
Published: (2024)

Nonasymptotic Regret Analysis of Adaptive Linear Quadratic Control with Model Misspecification
by: Lee, Bruce D., et al.
Published: (2023)

REDUCR: Robust Data Downsampling Using Class Priority Reweighting
by: Bankes, William, et al.
Published: (2023)

Prior Diffusiveness and Regret in the Linear-Gaussian Bandit
by: Zhu, Yifan, et al.
Published: (2026)

Not-a-Bandit: Provably No-Regret Drafter Selection in Speculative Decoding for LLMs
by: Liu, Hongyi, et al.
Published: (2025)

Right Now, Wrong Then: Non-Stationary Direct Preference Optimization under Preference Drift
by: Son, Seongho, et al.
Published: (2024)

On the Optimal Regret of Locally Private Linear Contextual Bandit
by: Li, Jiachun, et al.
Published: (2024)

Parameter-Free Dynamic Regret for Unconstrained Linear Bandits
by: Rumi, Alberto, et al.
Published: (2026)

Generalized Linear Bandits: Almost Optimal Regret with One-Pass Update
by: Zhang, Yu-Jie, et al.
Published: (2025)

Near-Optimal Regret in Linear MDPs with Aggregate Bandit Feedback
by: Cassel, Asaf, et al.
Published: (2024)

Variance-Dependent Regret Bounds for Non-stationary Linear Bandits
by: Wang, Zhiyong, et al.
Published: (2024)

wd1: Weighted Policy Optimization for Reasoning in Diffusion Language Models
by: Tang, Xiaohang, et al.
Published: (2025)

Mean-Field Bayesian Optimisation
by: Steinberg, Petar, et al.
Published: (2025)

Adversarially Robust Decision Transformer
by: Tang, Xiaohang, et al.
Published: (2024)

Revisiting Matrix Sketching in Linear Bandits: Achieving Sublinear Regret via Dyadic Block Sketching
by: Wen, Dongxie, et al.
Published: (2024)

PROSAC: Provably Safe Certification for Machine Learning Models under Adversarial Attacks
by: Feng, Chen, et al.
Published: (2024)

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

Near-Optimal Regret in Adversarial Kernel Bandits
by: Zhang, Yu-Jie, et al.
Published: (2026)

Chained Information-Theoretic bounds and Tight Regret Rate for Linear Bandit Problems
by: Gouverneur, Amaury, et al.
Published: (2024)

Local Anti-Concentration Class: Logarithmic Regret for Greedy Linear Contextual Bandit
by: Kim, Seok-Jin, et al.
Published: (2024)

Quantum Non-Linear Bandit Optimization
by: Siam, Zakaria Shams, et al.
Published: (2025)

Synthetic Data is Sufficient for Zero-Shot Visual Generalization from Offline Data
by: Güzel, Ahmet H., et al.
Published: (2025)

How Does Variance Shape the Regret in Contextual Bandits?
by: Jia, Zeyu, et al.
Published: (2024)

Efficient Imitation under Misspecification
by: Espinosa-Dice, Nicolas, et al.
Published: (2025)

Regret minimization in Linear Bandits with offline data via extended D-optimal exploration
by: Vijayan, Sushant, et al.
Published: (2025)

Bayesian Regret Minimization in Offline Bandits
by: Petrik, Marek, et al.
Published: (2023)

Optimal Regret for Single Index Bandits
by: Dey, Devdan, et al.
Published: (2026)

No-Regret is not enough! Bandits with General Constraints through Adaptive Regret Minimization
by: Bernasconi, Martino, et al.
Published: (2024)

Offline Policy Evaluation for Reinforcement Learning with Adaptively Collected Data
by: Madhow, Sunil, et al.
Published: (2023)

Near-Optimal Reinforcement Learning with Self-Play under Adaptivity Constraints
by: Qiao, Dan, et al.
Published: (2024)

Modified Meta-Thompson Sampling for Linear Bandits and Its Bayes Regret Analysis
by: Li, Hao, et al.
Published: (2024)

Tangential Randomization in Linear Bandits (TRAiL): Guaranteed Inference and Regret Bounds
by: Güçlü, Arda, et al.
Published: (2024)

Achieving Optimal Static and Dynamic Regret Simultaneously in Bandits with Deterministic Losses
by: Qian, Jian, et al.
Published: (2026)

Fast Best-in-Class Regret for Contextual Bandits
by: Girard, Samuel, et al.
Published: (2025)

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

Optimal Regret for Policy Optimization in Contextual Bandits
by: Levy, Orin, et al.
Published: (2026)

Efficient Swap Regret Minimization in Combinatorial Bandits
by: Kontogiannis, Andreas, et al.
Published: (2026)