Cover Image

Enjoying Non-linearity in Multinomial Logistic Bandits: A Minimax-Optimal Algorithm

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Boudart, Pierre, Gaillard, Pierre, Rudi, Alessandro
Format:	Preprint
Published:	2025
Subjects:	Machine Learning Artificial Intelligence Statistics Theory
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Minimax Optimal Variance-Aware Regret Bounds for Multinomial Logistic MDPs
by: Boudart, Pierre, et al.
Published: (2026)

Structured Prediction in Online Learning
by: Boudart, Pierre, et al.
Published: (2024)

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

Minimax-optimal and Locally-adaptive Online Nonparametric Regression
by: Liautaud, Paul, et al.
Published: (2024)

Minimax Adaptive Online Nonparametric Regression over Besov Spaces
by: Liautaud, Paul, et al.
Published: (2025)

High-Probability Minimax Adaptive Estimation in Besov Spaces via Online-to-Batch
by: Liautaud, Paul, et al.
Published: (2026)

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

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

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

Near-Optimal Regret for KL-Regularized Multi-Armed Bandits
by: Ji, Kaixuan, et al.
Published: (2026)

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

On the Optimal Sample Complexity of Offline Multi-Armed Bandits with KL Regularization
by: Ji, Kaixuan, et al.
Published: (2026)

LIBRA: Language Model Informed Bandit Recourse Algorithm for Personalized Treatment Planning
by: Cao, Junyu, et al.
Published: (2026)

Smooth Non-Stationary Bandits
by: Jia, Su, et al.
Published: (2023)

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

A Diffusion Analysis of Policy Gradient for Stochastic Bandits
by: Lattimore, Tor
Published: (2026)

Towards a Sharp Analysis of Offline Policy Learning for $f$-Divergence-Regularized Contextual Bandits
by: Zhao, Qingyue, et al.
Published: (2025)

MetaCURL: Non-stationary Concave Utility Reinforcement Learning
by: Moreno, Bianca Marin, et al.
Published: (2024)

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

Fast Rates for Offline Contextual Bandits with Forward-KL Regularization under Single-Policy Concentrability
by: Zhao, Qingyue, et al.
Published: (2026)

Low-Dimensional Adaptation of Rectified Flow: A Diffusion and Stochastic Localization Perspective
by: Roy, Saptarshi, et al.
Published: (2026)

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

Optimal rates for density and mode estimation with expand-and-sparsify representations
by: Sinha, Kaushik, et al.
Published: (2026)

Outcome-Based Online Reinforcement Learning: Algorithms and Fundamental Limits
by: Chen, Fan, et al.
Published: (2025)

Path Regularization: A Near-Complete and Optimal Nonasymptotic Generalization Theory for Multilayer Neural Networks and Double Descent Phenomenon
by: Yu, Hao
Published: (2025)

Finite-Particle Convergence Rates for Conservative and Non-Conservative Drifting Models
by: Balasubramanian, Krishnakumar
Published: (2026)

Unified Algorithms for RL with Decision-Estimation Coefficients: PAC, Reward-Free, Preference-Based Learning, and Beyond
by: Chen, Fan, et al.
Published: (2022)

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

Fast Model Selection and Stable Optimization for Softmax-Gated Multinomial-Logistic Mixture of Experts Models
by: Tran, TrungKhang, et al.
Published: (2026)

Statistical Inference for Optimal Transport Maps: Recent Advances and Perspectives
by: Balakrishnan, Sivaraman, et al.
Published: (2025)

Revisiting Incremental Stochastic Majorization-Minimization Algorithms with Applications to Mixture of Experts
by: Tran, TrungKhang, et al.
Published: (2026)

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

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)

RMLR: Extending Multinomial Logistic Regression into General Geometries
by: Chen, Ziheng, et al.
Published: (2024)

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

Identifying All ε-Best Arms in (Misspecified) Linear Bandits
by: Li, Zhekai, et al.
Published: (2025)

Statistical and Algorithmic Foundations of Reinforcement Learning
by: Chi, Yuejie, et al.
Published: (2025)

Inference with the Upper Confidence Bound Algorithm
by: Khamaru, Koulik, et al.
Published: (2024)

Near-Optimal Learning and Planning in Separated Latent MDPs
by: Chen, Fan, et al.
Published: (2024)