Image de couverture de livre

Soft Robust MDPs and Risk-Sensitive MDPs: Equivalence, Policy Gradient, and Sample Complexity

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Zhang, Runyu, Hu, Yang, Li, Na
Format:	Preprint
Publié:	2023
Sujets:	Optimization and Control Machine Learning
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Efficient Duple Perturbation Robustness in Low-rank MDPs
par: Hu, Yang, et autres
Publié: (2024)

Scalable spectral representations for multi-agent reinforcement learning in network MDPs
par: Ren, Zhaolin, et autres
Publié: (2024)

Last-Iterate Convergent Policy Gradient Primal-Dual Methods for Constrained MDPs
par: Ding, Dongsheng, et autres
Publié: (2023)

Planning and Learning in Average Risk-aware MDPs
par: Wang, Weikai, et autres
Publié: (2025)

Landscape of Policy Optimization for Finite Horizon MDPs with General State and Action
par: Chen, Xin, et autres
Publié: (2024)

Non-Rectangular Average-Reward Robust MDPs: Optimal Policies and Their Transient Values
par: Wang, Shengbo, et autres
Publié: (2026)

Policy Gradient Algorithms for Robust MDPs with Non-Rectangular Uncertainty Sets
par: Li, Mengmeng, et autres
Publié: (2023)

Span-Based Optimal Sample Complexity for Average Reward MDPs
par: Zurek, Matthew, et autres
Publié: (2023)

Recursive Entropic Risk Optimization in Discounted MDPs: Sample Complexity Bounds with a Generative Model
par: Mortensen, Oliver, et autres
Publié: (2025)

The Plug-in Approach for Average-Reward and Discounted MDPs: Optimal Sample Complexity Analysis
par: Zurek, Matthew, et autres
Publié: (2024)

Offline-Online Reinforcement Learning for Linear Mixture MDPs
par: Zhang, Zhongjun, et autres
Publié: (2026)

Span-Based Optimal Sample Complexity for Weakly Communicating and General Average Reward MDPs
par: Zurek, Matthew, et autres
Publié: (2024)

Faster Fixed-Point Methods for Multichain MDPs
par: Zurek, Matthew, et autres
Publié: (2025)

Achieving Tractable Minimax Optimal Regret in Average Reward MDPs
par: Boone, Victor, et autres
Publié: (2024)

Optimal Horizon-Free Reward-Free Exploration for Linear Mixture MDPs
par: Zhang, Junkai, et autres
Publié: (2023)

Efficient Model-Free Exploration in Low-Rank MDPs
par: Mhammedi, Zakaria, et autres
Publié: (2023)

Joint MDPs and Reinforcement Learning in Coupled-Dynamics Environments
par: Kaya, Ege C., et autres
Publié: (2026)

Model approximation in MDPs with unbounded per-step cost
par: Bozkurt, Berk, et autres
Publié: (2024)

Reinforcement Learning in MDPs with Information-Ordered Policies
par: Zhang, Zhongjun, et autres
Publié: (2025)

Learning Infinite-Horizon Average-Reward Linear Mixture MDPs of Bounded Span
par: Chae, Woojin, et autres
Publié: (2024)

Optimism as Risk-Seeking in Multi-Agent Reinforcement Learning
par: Zhang, Runyu, et autres
Publié: (2025)

Towards Efficient Risk-Sensitive Policy Gradient: An Iteration Complexity Analysis
par: Liu, Rui, et autres
Publié: (2024)

Constraint-Generation Policy Optimization (CGPO): Nonlinear Programming for Policy Optimization in Mixed Discrete-Continuous MDPs
par: Gimelfarb, Michael, et autres
Publié: (2024)

Representative Action Selection for Large Action Space: From Bandits to MDPs
par: Zhou, Quan, et autres
Publié: (2025)

Optimal Variance-Dependent Regret Bounds for Infinite-Horizon MDPs
par: Zamir, Guy, et autres
Publié: (2026)

Probabilistic Safety Guarantee for Stochastic Control Systems Using Average Reward MDPs
par: Omidi, Saber, et autres
Publié: (2025)

Provable Offline Reinforcement Learning for Structured Cyclic MDPs
par: Lee, Kyungbok, et autres
Publié: (2026)

Quantizer Design for Finite Model Approximations, Model Learning, and Quantized Q-Learning for MDPs with Unbounded Spaces
par: Bicer, Osman, et autres
Publié: (2025)

Convergence and sample complexity of natural policy gradient primal-dual methods for constrained MDPs
par: Ding, Dongsheng, et autres
Publié: (2022)

Policy Gradient Algorithms in Average-Reward Multichain MDPs
par: Lee, Jongmin, et autres
Publié: (2026)

Robustness to Model Approximation, Model Learning From Data, and Sample Complexity in Wasserstein Regular MDPs
par: Zhou, Yichen, et autres
Publié: (2024)

Thinking Beyond Visibility: A Near-Optimal Policy Framework for Locally Interdependent Multi-Agent MDPs
par: DeWeese, Alex, et autres
Publié: (2025)

Operator-Theoretic Foundations and Policy Gradient Methods for General MDPs with Unbounded Costs
par: Gupta, Abhishek, et autres
Publié: (2026)

Near-Optimal Sample Complexity for MDPs via Anchoring
par: Lee, Jongmin, et autres
Publié: (2025)

Robust Risk-Sensitive Reinforcement Learning with Conditional Value-at-Risk
par: Ni, Xinyi, et autres
Publié: (2024)

Policy Gradient Methods for Risk-Sensitive Distributional Reinforcement Learning with Provable Convergence
par: Xiao, Minheng, et autres
Publié: (2024)

The Sample Complexity of Gradient Descent in Stochastic Convex Optimization
par: Livni, Roi
Publié: (2024)

Deterministic Policy Gradient Primal-Dual Methods for Continuous-Space Constrained MDPs
par: Rozada, Sergio, et autres
Publié: (2024)

Accelerated Gradient Methods with Biased Gradient Estimates: Risk Sensitivity, High-Probability Guarantees, and Large Deviation Bounds
par: Gürbüzbalaban, Mert, et autres
Publié: (2025)

Epsilon-Optimal Policies for Average-Cost Separable MDPs with Perturbations
par: Kantawala, Dhairya
Publié: (2025)