paper-with-me

Papers

Primal-Dual Stochastic Mirror Descent for MDPs

2021-02-27 · Daniil Tiapkin, Alexander Gasnikov

We consider the problem of learning the optimal policy for infinite-horizon Markov decision processes (MDPs). For this purpose, some variant of Stochastic Mirror Descent is proposed for convex programming problems with Lipschitz-continuous functionals. An important detail is the ability to use inexact values of functional constraints and compute the value of dual variables. We analyze this algorithm in a general case and obtain an estimate of the convergence rate that does not accumulate errors during the operation of the method. Using this algorithm, we get the first parallel algorithm for mixing average-reward MDPs with a generative model without reduction to discounted MDP. One of the main features of the presented method is low communication costs in a distributed centralized setting, even with very large networks.

📄 PDF Abstract BibTeX arXiv:2103.00299

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Efficiently Solving MDPs with Stochastic Mirror Descent

2020-08-28 · ICML 2020 1 · Yujia Jin, Aaron Sidford

We present a unified framework based on primal-dual stochastic mirror descent for approximately solving infinite-horizon Markov decision processes (MDPs) given a generative model. When applied to an average-reward MDP wi…

Policy Optimization for Constrained MDPs with Provable Fast Global Convergence

2021-10-31 · Tao Liu, Ruida Zhou, Dileep Kalathil, P. R. Kumar 외

We address the problem of finding the optimal policy of a constrained Markov decision process (CMDP) using a gradient descent-based algorithm. Previous results have shown that a primal-dual approach can achieve an $\math…

Improved Rate of First Order Algorithms for Entropic Optimal Transport

2023-01-23 · Yiling Luo, Yiling Xie, Xiaoming Huo

This paper improves the state-of-the-art rate of a first-order algorithm for solving entropy regularized optimal transport. The resulting rate for approximating the optimal transport (OT) has been improved from $\widetil…

Variational Principles for Mirror Descent and Mirror Langevin Dynamics

2023-03-16 · Belinda Tzen, Anant Raj, Maxim Raginsky, Francis Bach

Mirror descent, introduced by Nemirovski and Yudin in the 1970s, is a primal-dual convex optimization method that can be tailored to the geometry of the optimization problem at hand through the choice of a strongly conve…

Mirrorless Mirror Descent: A Natural Derivation of Mirror Descent

2020-04-02 · Suriya Gunasekar, Blake Woodworth, Nathan Srebro

We present a primal only derivation of Mirror Descent as a "partial" discretization of gradient flow on a Riemannian manifold where the metric tensor is the Hessian of the Mirror Descent potential. We contrast this discr…