Pith. sign in

REVIEW 2 cited by

Learning to solve the credit assignment problem

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 1906.00889 v4 pith:4YXUII3W submitted 2019-06-03 q-bio.NC cs.NE

classification q-bio.NCcs.NE
keywords learningapproachapproximategradientnetworksbackpropagationfeedbackhowever
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Backpropagation is driving today's artificial neural networks (ANNs). However, despite extensive research, it remains unclear if the brain implements this algorithm. Among neuroscientists, reinforcement learning (RL) algorithms are often seen as a realistic alternative: neurons can randomly introduce change, and use unspecific feedback signals to observe their effect on the cost and thus approximate their gradient. However, the convergence rate of such learning scales poorly with the number of involved neurons. Here we propose a hybrid learning approach. Each neuron uses an RL-type strategy to learn how to approximate the gradients that backpropagation would provide. We provide proof that our approach converges to the true gradient for certain classes of networks. In both feedforward and convolutional networks, we empirically show that our approach learns to approximate the gradient, and can match or the performance of exact gradient-based learning. Learning feedback weights provides a biologically plausible mechanism of achieving good performance, without the need for precise, pre-specified learning rules.

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. SCAR: Shapley Credit Assignment for More Efficient RLHF

    cs.AI 2025-05 conditional novelty 5.0 of 10

    SCAR redistributes the terminal RLHF reward to tokens and spans via Shapley values, preserving the total return while improving training efficiency and final reward across three LLM alignment tasks.

  2. Sign-Symmetry Learning Rules are Robust Fine-Tuners

    cs.LG 2025-02 reject novelty 4.0 of 10

    Fine-tuning with sign-symmetry rules preserves accuracy while resisting white-box adversarial attacks, but the robustness appears to be gradient masking rather than genuine defense.

Pith tools