REVIEW 3 cited by
Scaling Forward Gradient With Local Losses
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
read the original abstract
Forward gradient learning computes a noisy directional gradient and is a biologically plausible alternative to backprop for learning deep neural networks. However, the standard forward gradient algorithm, when applied naively, suffers from high variance when the number of parameters to be learned is large. In this paper, we propose a series of architectural and algorithmic modifications that together make forward gradient learning practical for standard deep learning benchmark tasks. We show that it is possible to substantially reduce the variance of the forward gradient estimator by applying perturbations to activations rather than weights. We further improve the scalability of forward gradient by introducing a large number of local greedy loss functions, each of which involves only a small number of learnable parameters, and a new MLPMixer-inspired architecture, LocalMixer, that is more suitable for local learning. Our approach matches backprop on MNIST and CIFAR-10 and significantly outperforms previously proposed backprop-free algorithms on ImageNet.
Forward citations
Cited by 3 Pith papers
-
TITAN-Guide: Taming Inference-Time AligNment for Guided Text-to-Video Diffusion Models
A training-free guidance method that uses forward gradients instead of backpropagation to steer text-to-video diffusion latents with lower GPU memory.
-
Learning long range dependencies through time reversal symmetry breaking
RHEL computes backpropagation-equivalent gradients for Hamiltonian recurrent networks using finite differences of time-reversed, nudged trajectories, and matches BPTT accuracy on sequence tasks up to 50k steps.
-
Backpropagation-Free Metropolis-Adjusted Langevin Algorithm
Forward-mode automatic differentiation can replace backpropagation inside the Metropolis-Adjusted Langevin Algorithm, yielding four MCMC samplers that are sometimes faster and lower-memory than standard MALA.
Discussion (0). Sign in to comment.