Methods › General › Stochastic Optimization › Forward gradient

Forward gradient

12 papers tagged archive 2025-07-28

Introduced by Atılım Güneş Baydin et al. in Gradients without Backpropagation

archive 2025-07-28 Description, source and code snippet are the archive's method entry.

Forward gradients are unbiased estimators of the gradient ∇f(θ) for a function f: ℝⁿ →ℝ, given by g(θ) = ⟨∇f(θ) , v ⟩v.

Here v = (v₁, …, vₙ) is a random vector, which must satisfy the following conditions in order for g(θ) to be an unbiased estimator of ∇f(θ)

Forward gradients can be computed with a single jvp (Jacobian Vector Product), which enables the use of the forward mode of autodifferentiation instead of the usual reverse mode, which has worse computational characteristics.

PaperSource

In Syntology name not resolved (unknown_name). The lookup matched no method, paper or venue by this name; that asserts nothing about whether code exists.

Near matches the lookup lists, each a different name: Split Forward Gradient (Split-FG); Forward-DP; gradient EM; Forward DEER; Forward Flow; Fast Forward; Gradient Cuff; Forward Replay.

Syntology's have check for this name (free, it answers coverage only), read 2026-10-05; ask it again live. A level is the served verification level of that one answer; nothing here is summed across methods.

Papers archive 2025-07-28

archive papers tagged: 12 · with a code link: 8 · where Syntology ran a sample: 4 (4 with a run with no instrument failure, 0 where every run was a failure of Syntology's instrument) Syntology

Show: all tagged papersonly where code ran (4 of 12 tagged: 4 with a run with no instrument failure, 0 where every run was a failure of Syntology's instrument)

Page 1 of 1: papers 1 to 12 of 12, newest first by the archive's date (ties by slug), in archive order.

Repository counts are the archive's code-links table. A Syntology line states what Syntology ran from that paper's harvested code, as “N ran (of which C constructed an object rather than computing a result; K with no instrument failure: H honoured, V violated, P with no contract checked; I where Syntology's instrument failed) · U unverified”; the instrument figure counts failures of Syntology's instrument, not of the code. It is per sample and not a correctness claim. When the archive marks a repository official for the paper, the line starts with that repository's state (the archive's flag, not a verdict on who wrote the code; “community repositories only” when every sample that ran came from a community repository, “official: no sample here; runs from other or unrecorded repositories” when some came from a repository the paper names or has in its text, or from none recorded); hover it for the repositories the samples that ran came from.

Tasks archive 2025-07-28

7 tasks the archive attaches to papers tagged with this method, by distinct papers. A task without a page in the catalog is plain text.

TaskPapers
Benchmarking1
Imitation Learning1
Memorization1
Model Optimization1
Offline RL1
Reinforcement Learning (RL)1
regression1

Usage over time archive 2025-07-28

Papers per year tagged with Forward gradient: 2022 to 2025, peak 4 4 0 2022: 4 papers 2022 2023: 3 papers 2023 2024: 4 papers 2024 2025: 1 paper 2025
Papers per year the archive tags with this method, by the paper's archive date (12 dated). Bars are counts, not a trend claim.

Components: the archive holds no method-to-method composition, so PwC's Components table cannot be rebuilt; the Papers list carries no Results column for the same reason (the archive does not join its leaderboard rows to method tags).

Categories archive 2025-07-28

Stochastic Optimization

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections