Pith. sign in

REVIEW 1 cited by

Interpreting learning in biological neural networks as zero-order optimization method

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 2301.11777 v2 pith:HYQZPXE4 submitted 2023-01-27 cs.LG cs.NEmath.STstat.TH

classification cs.LGcs.NEmath.STstat.TH
keywords brainlearningmethodnetworksneuralannsbiologicalbnns
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Recently, significant progress has been made regarding the statistical understanding of artificial neural networks (ANNs). ANNs are motivated by the functioning of the brain, but differ in several crucial aspects. In particular, the locality in the updating rule of the connection parameters in biological neural networks (BNNs) makes it biologically implausible that the learning of the brain is based on gradient descent. In this work, we look at the brain as a statistical method for supervised learning. The main contribution is to relate the local updating rule of the connection parameters in BNNs to a zero-order optimization method. It is shown that the expected values of the iterates implement a modification of gradient descent.

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. Improving the Convergence Rates of Forward Gradient Descent with Repeated Sampling

    math.ST 2024-11 accept novelty 7.0 of 10

    Repeating forward gradient descent updates on each sample ℓ times improves the linear-model error rate from d²/n to d²/(ℓ∧d)n, matching SGD when ℓ≈d.

Pith tools