Pith. sign in

REVIEW 1 cited by

Risk-Aware Reinforcement Learning through Optimal Transport Theory

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 2309.06239 v1 pith:NTG7XVFY submitted 2023-09-12 cs.LG cs.SYeess.SY

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

In the dynamic and uncertain environments where reinforcement learning (RL) operates, risk management becomes a crucial factor in ensuring reliable decision-making. Traditional RL approaches, while effective in reward optimization, often overlook the landscape of potential risks. In response, this paper pioneers the integration of Optimal Transport (OT) theory with RL to create a risk-aware framework. Our approach modifies the objective function, ensuring that the resulting policy not only maximizes expected rewards but also respects risk constraints dictated by OT distances between state visitation distributions and the desired risk profiles. By leveraging the mathematical precision of OT, we offer a formulation that elevates risk considerations alongside conventional RL objectives. Our contributions are substantiated with a series of theorems, mapping the relationships between risk distributions, optimal value functions, and policy behaviors. Through the lens of OT, this work illuminates a promising direction for RL, ensuring a balanced fusion of reward pursuit and risk awareness.

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. Wasserstein Adaptive Value Estimation for Actor-Critic Reinforcement Learning

    cs.LG 2025-01 reject novelty 4.0 of 10

    WAVE adds an adaptively weighted Sinkhorn approximation of the Wasserstein distance between successive Q-value distributions to the critic loss in actor-critic reinforcement learning.

Pith tools