Pith. sign in

REVIEW 1 cited by

Selective Credit Assignment

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 2202.09699 v1 pith:YYEF4DVL submitted 2022-02-20 cs.LG cs.AIstat.ML

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

Efficient credit assignment is essential for reinforcement learning algorithms in both prediction and control settings. We describe a unified view on temporal-difference algorithms for selective credit assignment. These selective algorithms apply weightings to quantify the contribution of learning updates. We present insights into applying weightings to value-based learning and planning algorithms, and describe their role in mediating the backward credit distribution in prediction and control. Within this space, we identify some existing online learning algorithms that can assign credit selectively as special cases, as well as add new algorithms that assign credit backward in time counterfactually, allowing credit to be assigned off-trajectory and off-policy.

Discussion (0). Sign in to comment.

Forward citations

Cited by 1 Pith paper

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

  1. Beyond Uniform Credit Assignment: Selective Eligibility Traces for RLVR

    cs.LG 2026-05 unverdicted novelty 6.0 of 10

    S-trace adds sparse eligibility traces to RLVR that mask low-entropy tokens, outperforming GRPO by 0.49-3.16% pass@16 on Qwen3 models while improving sample and token efficiency.

Pith tools