Cover Image

Minimax-Optimal Multi-Agent Robust Reinforcement Learning

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Jiao, Yuchen, Li, Gen
Format:	Preprint
Published:	2024
Subjects:	Machine Learning
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

Optimal Convergence Analysis of DDPM for General Distributions
by: Jiao, Yuchen, et al.
Published: (2025)

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

Instance-dependent Convergence Theory for Diffusion Models
by: Jiao, Yuchen, et al.
Published: (2024)

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

Sample Complexity of Average-Reward Q-Learning: From Single-agent to Federated Reinforcement Learning
by: Jiao, Yuchen, et al.
Published: (2026)

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

Provable Efficiency of Guidance in Diffusion Models for General Data Distribution
by: Li, Gen, et al.
Published: (2025)

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

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

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

Is Q-Learning Minimax Optimal? A Tight Sample Complexity Analysis
by: Li, Gen, et al.
Published: (2021)

Towards a unified framework for guided diffusion models
by: Jiao, Yuchen, et al.
Published: (2025)

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

Connections between reinforcement learning with feedback,test-time scaling, and diffusion guidance: An anthology
by: Jiao, Yuchen, et al.
Published: (2025)

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

Are First-Order Diffusion Samplers Really Slower? A Fast Forward-Value Approach
by: Jiao, Yuchen, et al.
Published: (2025)

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

Transformers Meet In-Context Learning: A Universal Approximation Theory
by: Li, Gen, et al.
Published: (2025)

Provable Memory Efficient Self-Play Algorithm for Model-free Reinforcement Learning
by: Li, Na, et al.
Published: (2025)

Robust Multi-Agent Reinforcement Learning by Mutual Information Regularization
by: Li, Simin, et al.
Published: (2023)

Towards Fault Tolerance in Multi-Agent Reinforcement Learning
by: Shi, Yuchen, et al.
Published: (2024)

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

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)

Dashing for the Golden Snitch: Multi-Drone Time-Optimal Motion Planning with Multi-Agent Reinforcement Learning
by: Wang, Xian, et al.
Published: (2024)

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

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

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

Nonparametric Instrumental Regression via Kernel Methods is Minimax Optimal
by: Meunier, Dimitri, et al.
Published: (2024)

Distributionally Robust Multi-Agent Reinforcement Learning for Dynamic Chute Mapping
by: Liu, Guangyi, et al.
Published: (2025)

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

Asymptotically and Minimax Optimal Regret Bounds for Multi-Armed Bandits with Abstention
by: Yang, Junwen, et al.
Published: (2024)

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

Empirical Study on Robustness and Resilience in Cooperative Multi-Agent Reinforcement Learning
by: Li, Simin, et al.
Published: (2025)

AGILE: A Novel Reinforcement Learning Framework of LLM Agents
by: Feng, Peiyuan, et al.
Published: (2024)

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

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

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

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