:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Lee, Harin, Jamieson, Kevin
Format:	Preprint
Published:	2026
Subjects:	Machine Learning
Online Access:	https://arxiv.org/abs/2603.03480
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Minimax Optimal Reinforcement Learning with Quasi-Optimism
by: Lee, Harin, et al.
Published: (2025)

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

Unified Framework of Distributional Regret in Multi-Armed Bandits and Reinforcement Learning
by: Lee, Harin, et al.
Published: (2026)

Near-Minimax-Optimal Distributional Reinforcement Learning with a Generative Model
by: Rowland, Mark, et al.
Published: (2024)

Lasso Bandit with Compatibility Condition on Optimal Arm
by: Lee, Harin, et al.
Published: (2024)

Minimax-Optimal Multi-Agent Robust Reinforcement Learning
by: Jiao, Yuchen, et al.
Published: (2024)

Towards Minimax Optimality of Model-based Robust Reinforcement Learning
by: Clavier, Pierre, et al.
Published: (2023)

Optimal Posterior Sampling for Policy Identification in Tabular Markov Decision Processes
by: Kone, Cyrille, et al.
Published: (2026)

Deep Reinforcement Learning for Online Optimal Execution Strategies
by: Micheli, Alessandro, et al.
Published: (2024)

Infrequent Exploration in Linear Bandits
by: Lee, Harin, et al.
Published: (2025)

Improved Regret of Linear Ensemble Sampling
by: Lee, Harin, et al.
Published: (2024)

Minimax-Optimal Reward-Agnostic Exploration in Reinforcement Learning
by: Li, Gen, et al.
Published: (2023)

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

Minimax Optimal and Computationally Efficient Algorithms for Distributionally Robust Offline Reinforcement Learning
by: Liu, Zhishuai, et al.
Published: (2024)

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

Minimax Optimal Q Learning with Nearest Neighbors
by: Zhao, Puning, et al.
Published: (2023)

Best-of-Majority: Minimax-Optimal Strategy for Pass@$k$ Inference Scaling
by: Di, Qiwei, et al.
Published: (2025)

Sample Complexity Reduction via Policy Difference Estimation in Tabular Reinforcement Learning
by: Narang, Adhyyan, et al.
Published: (2024)

Learning to Actively Learn: A Robust Approach
by: Zhang, Jifan, et al.
Published: (2020)

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

Model-Based Reinforcement Learning under Random Observation Delays
by: Karamzade, Armin, et al.
Published: (2025)

Reinforcement Learning from Delayed Observations via World Models
by: Karamzade, Armin, et al.
Published: (2024)

Efficient Near-Optimal Algorithm for Online Shortest Paths in Directed Acyclic Graphs with Bandit Feedback Against Adaptive Adversaries
by: Maiti, Arnab, et al.
Published: (2025)

Exactly Minimax-Optimal Locally Differentially Private Sampling
by: Park, Hyun-Young, et al.
Published: (2024)

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

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

Transformers are Minimax Optimal Nonparametric In-Context Learners
by: Kim, Juno, et al.
Published: (2024)

Tackling Heavy-Tailed Rewards in Reinforcement Learning with Function Approximation: Minimax Optimal and Instance-Dependent Regret Bounds
by: Huang, Jiayi, et al.
Published: (2023)

Decoding Game: On Minimax Optimality of Heuristic Text Generation Strategies
by: Chen, Sijin, et al.
Published: (2024)

On the Minimax Regret in Online Ranking with Top-k Feedback
by: Zhang, Mingyuan, et al.
Published: (2023)

ORVIT: Near-Optimal Online Distributionally Robust Reinforcement Learning
by: Ghosh, Debamita, et al.
Published: (2025)

High Effort, Low Gain: Fundamental Limits of Active Learning for Linear Dynamical Systems
by: Chatzikiriakos, Nicolas, et al.
Published: (2025)

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

Minimax Optimal Estimation of Stability Under Distribution Shift
by: Namkoong, Hongseok, et al.
Published: (2022)

Computational Efficient and Minimax Optimal Nonignorable Matrix Completion
by: A, Yuanhong, et al.
Published: (2025)

Reward Transfer from Inverse Reinforcement Learning: A Coupled Minimax Approach
by: Hao, Guang-Yuan, et al.
Published: (2026)

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

Information-Theoretic Minimax Regret Bounds for Reinforcement Learning based on Duality
by: Bongole, Raghav, et al.
Published: (2024)

Online Matching via Reinforcement Learning: An Expert Policy Orchestration Strategy
by: Mignacco, Chiara, et al.
Published: (2025)

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