Image de couverture de livre

Model-Based Reinforcement Learning for Offline Zero-Sum Markov Games

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Yan, Yuling, Li, Gen, Chen, Yuxin, Fan, Jianqing
Format:	Preprint
Publié:	2022
Sujets:	Machine Learning Computer Science and Game Theory Information Theory Statistics Theory
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Minimax-Optimal Reward-Agnostic Exploration in Reinforcement Learning
par: Li, Gen, et autres
Publié: (2023)

Isotonic Mechanism for Exponential Family Estimation in Machine Learning Peer Review
par: Yan, Yuling, et autres
Publié: (2023)

Offline Two-Player Zero-Sum Markov Games with KL Regularization
par: Chen, Claire, et autres
Publié: (2026)

Leveraging Noisy Observations in Zero-Sum Games
par: Athanasakos, Emmanouil M, et autres
Publié: (2024)

Corruption-Robust Offline Two-Player Zero-Sum Markov Games
par: Nika, Andi, et autres
Publié: (2024)

Inference for Heteroskedastic PCA with Missing Data
par: Yan, Yuling, et autres
Publié: (2021)

Settling the Sample Complexity of Model-Based Offline Reinforcement Learning
par: Li, Gen, et autres
Publié: (2022)

Learning in Zero-Sum Markov Games: Relaxing Strong Reachability and Mixing Time Assumptions
par: Ouhamma, Reda, et autres
Publié: (2023)

Multi-Player Zero-Sum Markov Games with Networked Separable Interactions
par: Park, Chanwoo, et autres
Publié: (2023)

Pessimism-Free Offline Learning in General-Sum Games via KL Regularization
par: Chen, Claire, et autres
Publié: (2026)

Bayesian Learning in Episodic Zero-Sum Games
par: Yueh, Chang-Wei, et autres
Publié: (2026)

Last-Iterate Convergence of Payoff-Based Independent Learning in Zero-Sum Stochastic Games
par: Chen, Zaiwei, et autres
Publié: (2024)

Breaking the Sample Size Barrier in Model-Based Reinforcement Learning with a Generative Model
par: Li, Gen, et autres
Publié: (2020)

ELA: Exploited Level Augmentation for Offline Learning in Zero-Sum Games
par: Lei, Shiqi, et autres
Publié: (2024)

Improving Sample Efficiency of Model-Free Algorithms for Zero-Sum Markov Games
par: Feng, Songtao, et autres
Publié: (2023)

The Curious Price of Distributional Robustness in Reinforcement Learning with a Generative Model
par: Shi, Laixi, et autres
Publié: (2023)

Achieving Logarithmic Regret in KL-Regularized Zero-Sum Markov Games
par: Nayak, Anupam, et autres
Publié: (2025)

Two-Player Zero-Sum Games with Bandit Feedback
par: Yılmaz, Elif, et autres
Publié: (2025)

Towards Faster Non-Asymptotic Convergence for Diffusion-Based Generative Models
par: Li, Gen, et autres
Publié: (2023)

Solving Zero-Sum Convex Markov Games
par: Kalogiannis, Fivos, et autres
Publié: (2025)

Optimism Without Regularization: Constant Regret in Zero-Sum Games
par: Lazarsfeld, John, et autres
Publié: (2025)

Fast and Furious Symmetric Learning in Zero-Sum Games: Gradient Descent as Fictitious Play
par: Lazarsfeld, John, et autres
Publié: (2025)

Beyond Pessimism: Offline Learning in KL-regularized Games
par: Zhang, Yuheng, et autres
Publié: (2026)

State-Constrained Zero-Sum Differential Games with One-Sided Information
par: Ghimire, Mukesh, et autres
Publié: (2024)

Bayesian Algorithms for Adversarial Online Learning: from Finite to Infinite Action Spaces
par: Terenin, Alexander, et autres
Publié: (2025)

Optimal Scoring Rule Design under Partial Knowledge
par: Chen, Yiling, et autres
Publié: (2021)

Learning to Bid in Non-Stationary Repeated First-Price Auctions
par: Hu, Zihao, et autres
Publié: (2025)

Scale-Invariant Regret Matching and Online Learning with Optimal Convergence: Bridging Theory and Practice in Zero-Sum Games
par: Zhang, Brian Hu, et autres
Publié: (2025)

Transformers as Game Players: Provable In-context Game-playing Capabilities of Pre-trained Models
par: Shi, Chengshuai, et autres
Publié: (2024)

On the Limitations and Possibilities of Nash Regret Minimization in Zero-Sum Matrix Games under Noisy Feedback
par: Maiti, Arnab, et autres
Publié: (2023)

Tight Regret Upper and Lower Bounds for Optimistic Hedge in Two-Player Zero-Sum Games
par: Tsuchiya, Taira
Publié: (2025)

Can Reinforcement Learning Solve Asymmetric Combinatorial-Continuous Zero-Sum Games?
par: Li, Yuheng, et autres
Publié: (2025)

Envy-Free Allocation of Indivisible Goods via Noisy Queries
par: Li, Zihan, et autres
Publié: (2026)

Stochastic contextual bandits with graph feedback: from independence number to MAS number
par: Wen, Yuxiao, et autres
Publié: (2024)

Pure Exploration via Frank-Wolfe Self-Play
par: Liu, Xinyu, et autres
Publié: (2025)

A Framework for Finding Local Saddle Points in Two-Player Zero-Sum Black-Box Games
par: Agarwal, Shubhankar, et autres
Publié: (2025)

Finite-Sample Guarantees for Learning Dynamics in Zero-Sum Polymatrix Games
par: Faizal, Fathima Zarin, et autres
Publié: (2024)

Near-Optimal Policy Optimization for Correlated Equilibrium in General-Sum Markov Games
par: Cai, Yang, et autres
Publié: (2024)

Learning from Random Demonstrations: Offline Reinforcement Learning with Importance-Sampled Diffusion Models
par: Fang, Zeyu, et autres
Publié: (2024)

Approximating Nash Equilibria in General-Sum Games via Meta-Learning
par: Sychrovský, David, et autres
Publié: (2025)