Copertina

Minimax Optimal Strategy for Delayed Observations in Online Reinforcement Learning

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Lee, Harin, Jamieson, Kevin
Natura:	Preprint
Pubblicazione:	2026
Soggetti:	Machine Learning
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

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

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

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

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

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

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

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

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

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

Infrequent Exploration in Linear Bandits
di: Lee, Harin, et al.
Pubblicazione: (2025)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Online Pre-Training for Offline-to-Online Reinforcement Learning
di: Shin, Yongjae, et al.
Pubblicazione: (2025)

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

Settling the Sample Complexity of Online Reinforcement Learning
di: Zhang, Zihan, et al.
Pubblicazione: (2023)

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