paper-with-me

Papers

Variance-Constrained Actor-Critic Algorithms for Discounted and Average Reward MDPs

2014-03-25 · Prashanth L. A., Mohammad Ghavamzadeh

In many sequential decision-making problems we may want to manage risk by minimizing some measure of variability in rewards in addition to maximizing a standard criterion. Variance related risk measures are among the most common risk-sensitive criteria in finance and operations research. However, optimizing many such criteria is known to be a hard problem. In this paper, we consider both discounted and average reward Markov decision processes. For each formulation, we first define a measure of variability for a policy, which in turn gives us a set of risk-sensitive criteria to optimize. For each of these criteria, we derive a formula for computing its gradient. We then devise actor-critic algorithms that operate on three timescales - a TD critic on the fastest timescale, a policy gradient (actor) on the intermediate timescale, and a dual ascent for Lagrange multipliers on the slowest timescale. In the discounted setting, we point out the difficulty in estimating the gradient of the variance of the return and incorporate simultaneous perturbation approaches to alleviate this. The average setting, on the other hand, allows for an actor update using compatible features to estimate the gradient of the variance. We establish the convergence of our algorithms to locally risk-sensitive optimal policies. Finally, we demonstrate the usefulness of our algorithms in a traffic signal control application.

📄 PDF Abstract BibTeX arXiv:1403.6530

Code (0)

등록된 구현이 없습니다.

Tasks

Decision MakingSequential Decision MakingTraffic Signal Control

Similar Papers 제목 키워드 기반

A Deeper Look at Discounting Mismatch in Actor-Critic Algorithms

2020-10-02 · Shangtong Zhang, Romain Laroche, Harm van Seijen, Shimon Whiteson 외

We investigate the discounting mismatch in actor-critic algorithm implementations from a representation learning perspective. Theoretically, actor-critic algorithms usually have discounting for both actor and critic, i.e…

Representation Learning

A constrained optimization perspective on actor critic algorithms and application to network routing

2015-07-28 · Prashanth L. A., H. L. Prasad, Shalabh Bhatnagar, Prakash Chandra

We propose a novel actor-critic algorithm with guaranteed convergence to an optimal policy for a discounted reward Markov decision process. The actor incorporates a descent direction that is motivated by the solution of …

Finite Time Analysis of Temporal Difference Learning for Mean-Variance in a Discounted MDP

2024-06-12 · Tejaram Sangadi, L. A. Prashanth, Krishna Jagannathan

Motivated by risk-sensitive reinforcement learning scenarios, we consider the problem of policy evaluation for variance in a discounted reward Markov decision process (MDP). For this problem, a temporal difference (TD) t…

Refined Analysis of Entropy-Regularized Actor-Critic

2026-05-23 · Safwan Labbi, Paul Mangold, Daniil Tiapkin, Eric Moulines arxiv

In this paper, we study the role of the critic in actor--critic for entropy-regularized, finite, discounted environments. We establish that, when the critic is exact, using the latter as a baseline is a variance-reductio…

Finite-Time Complexity of Online Primal-Dual Natural Actor-Critic Algorithm for Constrained Markov Decision Processes

2021-10-21 · Sihan Zeng, Thinh T. Doan, Justin Romberg

We consider a discounted cost constrained Markov decision process (CMDP) policy optimization problem, in which an agent seeks to maximize a discounted cumulative reward subject to a number of constraints on discounted cu…