Cover Image

Towards Minimax Optimality of Model-based Robust Reinforcement Learning

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Clavier, Pierre, Pennec, Erwan Le, Geist, Matthieu
Format:	Preprint
Published:	2023
Subjects:	Machine Learning
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Bootstrapping Expectiles in Reinforcement Learning
by: Clavier, Pierre, et al.
Published: (2024)

RRLS : Robust Reinforcement Learning Suite
by: Zouitine, Adil, et al.
Published: (2024)

Time-Constrained Robust MDPs
by: Zouitine, Adil, et al.
Published: (2024)

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

The Curious Price of Distributional Robustness in Reinforcement Learning with a Generative Model
by: Shi, Laixi, et al.
Published: (2023)

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

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

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

Periodic agent-state based Q-learning for POMDPs
by: Sinha, Amit, et al.
Published: (2024)

Convergence of regularized agent-state-based Q-learning in POMDPs
by: Sinha, Amit, et al.
Published: (2025)

Minimax Optimal Strategy for Delayed Observations in Online Reinforcement Learning
by: Lee, Harin, et al.
Published: (2026)

Closing the Gap between TD Learning and Supervised Learning -- A Generalisation Point of View
by: Ghugare, Raj, et al.
Published: (2024)

Solving robust MDPs as a sequence of static RL problems
by: Zouitine, Adil, 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)

ShiQ: Bringing back Bellman to LLMs
by: Clavier, Pierre, et al.
Published: (2025)

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

VITS : Variational Inference Thompson Sampling for contextual bandits
by: Clavier, Pierre, et al.
Published: (2023)

Learning Equilibria from Data: Provably Efficient Multi-Agent Imitation Learning
by: Freihaut, Till, et al.
Published: (2025)

Self-Improving Robust Preference Optimization
by: Choi, Eugene, et al.
Published: (2024)

Population-aware Online Mirror Descent for Mean-Field Games with Common Noise by Deep Reinforcement Learning
by: Wu, Zida, et al.
Published: (2025)

Towards Optimal Adversarial Robust Reinforcement Learning with Infinity Measurement Error
by: Li, Haoran, et al.
Published: (2025)

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

Nested subspace learning with flags
by: Szwagier, Tom, et al.
Published: (2025)

A Survey of Temporal Credit Assignment in Deep Reinforcement Learning
by: Pignatelli, Eduardo, et al.
Published: (2023)

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

Toward Finding Strong Pareto Optimal Policies in Multi-Agent Reinforcement Learning
by: Le, Bang Giang, et al.
Published: (2024)

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

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

Space Robotics Bench: Robot Learning Beyond Earth
by: Orsula, Andrej, et al.
Published: (2025)

Minimax Optimality in Contextual Dynamic Pricing with General Valuation Models
by: Gong, Xueping, et al.
Published: (2024)

Leveraging Procedural Generation for Learning Autonomous Peg-in-Hole Assembly in Space
by: Orsula, Andrej, et al.
Published: (2024)

Learning Tool-Aware Adaptive Compliant Control for Autonomous Regolith Excavation
by: Orsula, Andrej, et al.
Published: (2025)

Learning from Similar Linear Representations: Adaptivity, Minimaxity, and Robustness
by: Tian, Ye, et al.
Published: (2023)

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

Robust Minimax Boosting with Performance Guarantees
by: Mazuelas, Santiago, et al.
Published: (2025)

Policy-Driven World Model Adaptation for Robust Offline Model-based Reinforcement Learning
by: Chen, Jiayu, et al.
Published: (2025)

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)