Pith. sign in

REVIEW 1 cited by

Worst Cases Policy Gradients

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1911.03618 v1 pith:WIYNHGGT submitted 2019-11-09 cs.LG cs.AI

classification cs.LGcs.AI
keywords learningpoliciespolicyactionsbehaviorsdifferentfoundfuture
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Recent advances in deep reinforcement learning have demonstrated the capability of learning complex control policies from many types of environments. When learning policies for safety-critical applications, it is essential to be sensitive to risks and avoid catastrophic events. Towards this goal, we propose an actor-critic framework that models the uncertainty of the future and simultaneously learns a policy based on that uncertainty model. Specifically, given a distribution of the future return for any state and action, we optimize policies for varying levels of conditional Value-at-Risk. The learned policy can map the same state to different actions depending on the propensity for risk. We demonstrate the effectiveness of our approach in the domain of driving simulations, where we learn maneuvers in two scenarios. Our learned controller can dynamically select actions along a continuous axis, where safe and conservative behaviors are found at one end while riskier behaviors are found at the other. Finally, when testing with very different simulation parameters, our risk-averse policies generalize significantly better compared to other reinforcement learning approaches.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Reward Redistribution for CVaR MDPs using a Bellman Operator on L-infinity

    cs.LG 2026-02 conditional novelty 5.0 of 10

    A shifted-value transformation turns static CVaR MDPs into a bounded, contracting Bellman operator with dense rewards, enabling discretized value iteration and Q-learning with explicit error bounds.

Pith tools