Pith. sign in

REVIEW 2 cited by

Value Gradient weighted Model-Based 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 2204.01464 v2 pith:BZFJEOER submitted 2022-04-04 cs.LG cs.AI

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

Model-based reinforcement learning (MBRL) is a sample efficient technique to obtain control policies, yet unavoidable modeling errors often lead performance deterioration. The model in MBRL is often solely fitted to reconstruct dynamics, state observations in particular, while the impact of model error on the policy is not captured by the training objective. This leads to a mismatch between the intended goal of MBRL, enabling good policy and value learning, and the target of the loss function employed in practice, future state prediction. Naive intuition would suggest that value-aware model learning would fix this problem and, indeed, several solutions to this objective mismatch problem have been proposed based on theoretical analysis. However, they tend to be inferior in practice to commonly used maximum likelihood (MLE) based approaches. In this paper we propose the Value-gradient weighted Model Learning (VaGraM), a novel method for value-aware model learning which improves the performance of MBRL in challenging settings, such as small model capacity and the presence of distracting state dimensions. We analyze both MLE and value-aware approaches and demonstrate how they fail to account for exploration and the behavior of function approximation when learning value-aware models and highlight the additional goals that must be met to stabilize optimization in the deep learning setting. We verify our analysis by showing that our loss function is able to achieve high returns on the Mujoco benchmark suite while being more robust than maximum likelihood based approaches.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

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

  1. On the Role of Computation in Reinforcement Learning

    cs.LG 2026-02 conditional novelty 6.0 of 10

    Policies with more compute can provably solve and generalize to longer-horizon RL tasks that policies with less compute cannot, and a minimal recurrent (IRU) architecture realizes these benefits.

  2. Policy-shaped prediction: avoiding distractions in model-based reinforcement learning

    cs.LG 2024-12 conditional novelty 6.0 of 10

    Policy-Shaped Prediction weights a world model's reconstruction loss by policy-gradient salience aggregated through SAM segmentation, plus an adversarial action head, improving MBRL robustness to learnable distractors.

Pith tools