Pith. sign in

REVIEW 6 cited by

Risk-Averse Offline Reinforcement Learning

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 2102.05371 v1 pith:LNUPY4HR submitted 2021-02-10 cs.LG

classification cs.LG
keywords risk-averseofflinepoliciesaverageo-raacperformancecriteriacvar
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Training Reinforcement Learning (RL) agents in high-stakes applications might be too prohibitive due to the risk associated to exploration. Thus, the agent can only use data previously collected by safe policies. While previous work considers optimizing the average performance using offline data, we focus on optimizing a risk-averse criteria, namely the CVaR. In particular, we present the Offline Risk-Averse Actor-Critic (O-RAAC), a model-free RL algorithm that is able to learn risk-averse policies in a fully offline setting. We show that O-RAAC learns policies with higher CVaR than risk-neutral approaches in different robot control tasks. Furthermore, considering risk-averse criteria guarantees distributional robustness of the average performance with respect to particular distribution shifts. We demonstrate empirically that in the presence of natural distribution-shifts, O-RAAC learns policies with good average performance.

Discussion (0). Sign in to comment.

Forward citations

Cited by 6 Pith papers

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

  1. Towards Efficient and Expressive Offline RL via Flow-Anchored Noise-conditioned Q-Learning

    cs.LG 2026-05 unverdicted novelty 7.0 of 10

    FAN achieves state-of-the-art offline RL performance on robotic tasks by anchoring flow policies and using single-sample noise-conditioned Q-learning, with proven convergence and reduced runtimes.

  2. RS-Diffuser: Risk-Sensitive Diffusion Planning with Distributional Value Guidance

    cs.LG 2026-06 unverdicted novelty 6.0 of 10

    RS-Diffuser integrates diffusion planners, quantile regression critics, and CVaR-style guidance to produce risk-averse to risk-seeking behaviors from one model in offline RL.

  3. Towards Efficient and Expressive Offline RL via Flow-Anchored Noise-conditioned Q-Learning

    cs.LG 2026-05 unverdicted novelty 6.0 of 10

    FAN simplifies expressive flow policies and distributional critics in offline RL via single-iteration behavior regularization and single-sample noise conditioning to claim SOTA performance with lower training and infe...

  4. Distributional Inverse Reinforcement Learning

    cs.LG 2025-10 reject novelty 6.0 of 10

    DistIRL recovers reward distributions and risk-aware policies from offline demonstrations by minimizing first-order stochastic dominance violations between agent and expert returns.

  5. Distributional Inverse Reinforcement Learning

    cs.LG 2025-10 unverdicted novelty 5.0 of 10

    A distributional offline IRL method minimizes first-order stochastic dominance violations to recover reward distributions and distribution-aware policies, with O(ε^{-2}) convergence and reported SOTA results on synthe...

  6. MASK: Multi-Agent Semantic K-Scheduling for Risk-Sensitive 6G Robotics

    cs.RO 2026-06 unverdicted novelty 4.0 of 10

    MASK schedules top-K agents via semantic gating and a global encoder to achieve risk-aware multi-robot coordination that matches unconstrained baselines under bandwidth caps.

Pith tools