Cover Image

Minimax Rate-Optimal Algorithms for High-Dimensional Stochastic Linear Bandits

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Liu, Jingyu, Song, Yanglei
Format:	Preprint
Published:	2025
Subjects:	Statistics Theory Machine Learning
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

Stochastic Optimization in Semi-Discrete Optimal Transport: Convergence Analysis and Minimax Rate
by: Genans, Ferdinand, et al.
Published: (2025)

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

Navigating Sparsities in High-Dimensional Linear Contextual Bandits
by: Zhao, Rui, et al.
Published: (2025)

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

FLIPHAT: Joint Differential Privacy for High Dimensional Sparse Linear Bandits
by: Chakraborty, Sunrit, et al.
Published: (2024)

Minimax-Optimal Spectral Clustering with Covariance Projection for High-Dimensional Anisotropic Mixtures
by: Huang, Chengzhu, et al.
Published: (2025)

Minimax Rates of Estimation for Optimal Transport Map between Infinite-Dimensional Spaces
by: Ponnoprat, Donlapark, et al.
Published: (2025)

Sequential Multiple Testing: A Second-Order Asymptotic Analysis
by: Liu, Jingyu, et al.
Published: (2026)

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

Minimax Linear Regression under the Quantile Risk
by: Hanchi, Ayoub El, et al.
Published: (2024)

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

Statistical Complexity and Optimal Algorithms for Non-linear Ridge Bandits
by: Rajaraman, Nived, et al.
Published: (2023)

Towards Efficient and Optimal Covariance-Adaptive Algorithms for Combinatorial Semi-Bandits
by: Zhou, Julien, et al.
Published: (2024)

Online Covariance Estimation in Averaged SGD: Improved Batch-Mean Rates and Minimax Optimality via Trajectory Regression
by: Ni, Yijin, 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)

Gradient Descent with Projection Finds Over-Parameterized Neural Networks for Learning Low-Degree Polynomials with Nearly Minimax Optimal Rate
by: Yang, Yingzhen, et al.
Published: (2026)

Minimax Optimal Algorithms with Fixed-$k$-Nearest Neighbors
by: Ryu, J. Jon, et al.
Published: (2022)

The Fragility of Optimized Bandit Algorithms
by: Fan, Lin, et al.
Published: (2021)

Minimax Optimality of the Probability Flow ODE for Diffusion Models
by: Cai, Changxiao, et al.
Published: (2025)

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

The High Line: Exact Risk and Learning Rate Curves of Stochastic Adaptive Learning Rate Algorithms
by: Collins-Woodfin, Elizabeth, et al.
Published: (2024)

Testing the Feasibility of Linear Programs with Bandit Feedback
by: Gangrade, Aditya, et al.
Published: (2024)

Optimal Recovery Meets Minimax Estimation
by: DeVore, Ronald, et al.
Published: (2025)

Minimax Rates for Learning Pairwise Interactions in Attention-Style Models
by: Zucker, Shai, et al.
Published: (2025)

Minimax-Optimal Two-Sample Test with Sliced Wasserstein
by: Tran, Binh Thuan, et al.
Published: (2025)

The Empirical Mean is Minimax Optimal for Local Glivenko-Cantelli
by: Cohen, Doron, et al.
Published: (2024)

Minimax Optimality of Score-based Diffusion Models: Beyond the Density Lower Bound Assumptions
by: Zhang, Kaihong, et al.
Published: (2024)

Minimax and Bayes Optimal Best-Arm Identification
by: Kato, Masahiro
Published: (2025)

Improving Minimax Estimation Rates for Contaminated Mixture of Multinomial Logistic Experts via Expert Heterogeneity
by: Yan, Fanqi, et al.
Published: (2026)

Transfer Learning for Benign Overfitting in High-Dimensional Linear Regression
by: Kim, Yeichan, et al.
Published: (2025)

Design Experiments to Compare Multi-armed Bandit Algorithms
by: Meng, Huiling, et al.
Published: (2026)

Minimax Optimal Estimation of Transport-Growth Pairs in Unbalanced Optimal Transport
by: Ponnoprat, Donlapark, et al.
Published: (2026)

High-Dimensional Importance-Weighted Information Criteria: Theory and Optimality
by: Cao, Yong-Syun, et al.
Published: (2025)

Extended Wasserstein-GAN Approach to Causal Distribution Learning: Density-Free Estimation and Minimax Optimality
by: Tamano, Shu, et al.
Published: (2026)

Minimax Optimal Fair Classification with Bounded Demographic Disparity
by: Zeng, Xianli, et al.
Published: (2024)

Asymptotically Optimal Problem-Dependent Bandit Policies for Transfer Learning
by: Prevost, Adrien, et al.
Published: (2025)

Alignment-Sensitive Minimax Rates for Spectral Algorithms with Learned Kernels
by: Huang, Dongming, et al.
Published: (2025)

Federated PCA and Estimation for Spiked Covariance Matrices: Optimal Rates and Efficient Algorithm
by: Li, Jingyang, et al.
Published: (2024)