Cover Image

Linear Bandits on Ellipsoids: Minimax Optimal Algorithms

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Zhang, Raymond, Hadiji, Hedi, Combes, Richard
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

Tractable Instances of Bilinear Maximization: Implementing LinUCB on Ellipsoids
by: Zhang, Raymond, et al.
Published: (2025)

Diversity-Preserving K-Armed Bandits, Revisited
by: Hadiji, Hédi, et al.
Published: (2020)

Multimodal Bandits: Regret Lower Bounds and Optimal Algorithms
by: Réveillard, William, et al.
Published: (2025)

Thompson Sampling For Combinatorial Bandits: Polynomial Regret and Mismatched Sampling Paradox
by: Zhang, Raymond, et al.
Published: (2024)

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

Tracking solutions of time-varying variational inequalities
by: Hadiji, Hédi, et al.
Published: (2024)

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

On Instability of Minimax Optimal Optimism-Based Bandit Algorithms
by: Praharaj, Samya, et al.
Published: (2025)

An Online Feasible Point Method for Benign Generalized Nash Equilibrium Problems
by: Sachs, Sarah, et al.
Published: (2024)

Accelerated Rates between Stochastic and Adversarial Online Convex Optimization
by: Sachs, Sarah, et al.
Published: (2023)

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

Nearly Minimax Optimal Submodular Maximization with Bandit Feedback
by: Tajdini, Artin, et al.
Published: (2023)

Nearly Minimax Optimal Regret for Multinomial Logistic Bandit
by: Lee, Joongkyu, et al.
Published: (2024)

Almost Minimax Optimal Best Arm Identification in Piecewise Stationary Linear Bandits
by: Hou, Yunlong, et al.
Published: (2024)

Enjoying Non-linearity in Multinomial Logistic Bandits: A Minimax-Optimal Algorithm
by: Boudart, Pierre, et al.
Published: (2025)

Learning What to Recommend: Minimax Optimal Simple Regret in Logistic Bandits
by: Liu, Shuai, et al.
Published: (2026)

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

Practical and Optimal Algorithm for Linear Contextual Bandits with Rare Parameter Updates
by: Yu, Sanghoon, et al.
Published: (2026)

Optimal Thresholding Linear Bandit
by: Rivera, Eduardo Ochoa, et al.
Published: (2024)

Asymptotically and Minimax Optimal Regret Bounds for Multi-Armed Bandits with Abstention
by: Yang, Junwen, et al.
Published: (2024)

Contextual Linear Bandits under Noisy Features: Towards Bayesian Oracles
by: Kim, Jung-hun, et al.
Published: (2017)

Optimal Batched Linear Bandits
by: Ren, Xuanfei, et al.
Published: (2024)

A Jointly Efficient and Optimal Algorithm for Heteroskedastic Generalized Linear Bandits with Adversarial Corruptions
by: Kim, Sanghwa, et al.
Published: (2026)

Minimax Optimal Two-Stage Algorithm For Moment Estimation Under Covariate Shift
by: Zhang, Zhen, et al.
Published: (2025)

Gap-Dependent Bounds for Nearly Minimax Optimal Reinforcement Learning with Linear Function Approximation
by: Zhang, Haochen, et al.
Published: (2026)

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

Linear Bandits beyond Inner Product Spaces, the case of Bandit Optimal Transport
by: Croissant, Lorenzo
Published: (2025)

Nearly-Optimal Algorithm for Adversarial Kernelized Bandits
by: Iwazaki, Shogo
Published: (2026)

Optimal Streaming Algorithms for Multi-Armed Bandits
by: Jin, Tianyuan, et al.
Published: (2024)

Near-Optimal Algorithms for Making the Gradient Small in Stochastic Minimax Optimization
by: Chen, Lesi, et al.
Published: (2022)

Differentially Private Sliced Inverse Regression: Minimax Optimality and Algorithm
by: Xia, Xintao, et al.
Published: (2024)

Reward Maximization for Pure Exploration: Minimax Optimal Good Arm Identification for Nonparametric Multi-Armed Bandits
by: Cho, Brian, et al.
Published: (2024)

Nearly Minimax Optimal Regret for Learning Linear Mixture Stochastic Shortest Path
by: Di, Qiwei, et al.
Published: (2024)

Best-of-Both-Worlds Algorithms for Linear Contextual Bandits
by: Kuroki, Yuko, et al.
Published: (2023)

A Reduction Algorithm for Markovian Contextual Linear Bandits
by: Buyukkalayci, Kaan, et al.
Published: (2026)

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

Near-Optimal Algorithm for Non-Stationary Kernelized Bandits
by: Iwazaki, Shogo, et al.
Published: (2024)

LinearAPT: An Adaptive Algorithm for the Fixed-Budget Thresholding Linear Bandit Problem
by: Wu, Yun-Ang, et al.
Published: (2024)

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

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