{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/method/forward-gradient","slug":"forward-gradient","name":"Forward gradient","full_name":"Forward gradient","full_name_withheld":false,"description_markdown":"Forward gradients are unbiased estimators of the gradient $\\nabla f(\\theta)$ for a function $f: \\mathbb{R}^n \\rightarrow \\mathbb{R}$, given by $g(\\theta) = \\langle \\nabla f(\\theta) , v \\rangle v$. \r\n\r\nHere $v = (v_1, \\ldots, v_n)$ is a random vector, which must satisfy the following conditions in order for $g(\\theta)$ to be an unbiased estimator of $\\nabla f(\\theta)$\r\n\r\n* $v_i \\perp v_j$ for all $i \\neq j$\r\n* $\\mathbb{E}[v_i] = 0$ for all $i$\r\n* $\\mathbb{V}[v_i] = 1$ for all $i$\r\n\r\nForward 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.","description_state":"present","introduced_year":null,"introduced_by":{"title":"Gradients without Backpropagation","paper":"/paper/gradients-without-backpropagation","first_author":"Atılım Güneş Baydin","n_authors":5,"url_abs":null,"archive_paper_url":"https://paperswithcode.com/paper/gradients-without-backpropagation"},"source":{"url":"https://arxiv.org/abs/2202.08587v1","title":"Gradients without Backpropagation","url_on_a_paper_host":true},"code_snippet_url":null,"code_snippet_url_on_a_code_host":false,"categories":[{"area":"General","area_id":"general","collection":"Stochastic Optimization","url":"/methods/category/stochastic-optimization","pwc_aliases":[]}],"n_papers_tagged":12,"archive_num_papers":12,"papers_newest_first":[{"paper":"/paper/a-scalable-hybrid-training-approach-for","slug":"a-scalable-hybrid-training-approach-for","title":"A Scalable Hybrid Training Approach for Recurrent Spiking Neural Networks","date":"2025-06-17","arxiv_id":"2506.14464","n_code_links":1,"syntology":null},{"paper":null,"slug":"flexible-and-efficient-surrogate-gradient","title":"Flexible and Efficient Surrogate Gradient Modeling with Forward Gradient Injection","date":"2024-05-31","arxiv_id":"2406.00177","n_code_links":0,"syntology":null},{"paper":null,"slug":"forward-gradient-based-frank-wolfe","title":"Projected Forward Gradient-Guided Frank-Wolfe Algorithm via Variance Reduction","date":"2024-03-19","arxiv_id":"2403.12511","n_code_links":0,"syntology":null},{"paper":"/paper/revisiting-zeroth-order-optimization-for","slug":"revisiting-zeroth-order-optimization-for","title":"Revisiting Zeroth-Order Optimization for Memory-Efficient LLM Fine-Tuning: A Benchmark","date":"2024-02-18","arxiv_id":"2402.11592","n_code_links":1,"syntology":{"ran":9,"of":13,"n_ran_checked":3,"n_instrument":6,"unverified":4,"pointer_only":13,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 0 violated, 2 with no contract checked; 6 where Syntology's instrument failed) · 4 unverified","official":{"repos":["zo-bench/zo-llm"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":4,"ran_from_kinds":["official"]}}},{"paper":"/paper/odice-revealing-the-mystery-of-distribution","slug":"odice-revealing-the-mystery-of-distribution","title":"ODICE: Revealing the Mystery of Distribution Correction Estimation via Orthogonal-gradient Update","date":"2024-02-01","arxiv_id":"2402.00348","n_code_links":1,"syntology":{"ran":8,"of":8,"n_ran_checked":5,"n_instrument":3,"unverified":0,"pointer_only":8,"phrase":"8 ran (of which 1 constructed an object rather than computing a result; 5 with no instrument failure: 1 honoured, 0 violated, 4 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","official":{"repos":["maoliyuan/odice-pytorch"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":1,"n_ran_no_instrument_failure":5,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"convergence-guarantees-for-forward-gradient","title":"Convergence guarantees for forward gradient descent in the linear regression model","date":"2023-09-26","arxiv_id":"2309.15001","n_code_links":0,"syntology":null},{"paper":null,"slug":"accelerated-on-device-forward-neural-network","title":"Accelerated On-Device Forward Neural Network Training with Module-Wise Descending Asynchronism","date":"2023-09-21","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":"/paper/can-forward-gradient-match-backpropagation","slug":"can-forward-gradient-match-backpropagation","title":"Can Forward Gradient Match Backpropagation?","date":"2023-06-12","arxiv_id":"2306.06968","n_code_links":1,"syntology":null},{"paper":"/paper/directional-direct-feedback-alignment","slug":"directional-direct-feedback-alignment","title":"Low-Variance Forward Gradients using Direct Feedback Alignment and Momentum","date":"2022-12-14","arxiv_id":"2212.07282","n_code_links":1,"syntology":null},{"paper":"/paper/scaling-forward-gradient-with-local-losses","slug":"scaling-forward-gradient-with-local-losses","title":"Scaling Forward Gradient With Local Losses","date":"2022-10-07","arxiv_id":"2210.03310","n_code_links":1,"syntology":null},{"paper":"/paper/optimization-without-backpropagation","slug":"optimization-without-backpropagation","title":"Optimization without Backpropagation","date":"2022-09-13","arxiv_id":"2209.06302","n_code_links":1,"syntology":{"ran":6,"of":8,"n_ran_checked":6,"n_instrument":0,"unverified":2,"pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","official":{"repos":["gbelouze/forward-gradient"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":2,"ran_from_kinds":["official"]}}},{"paper":"/paper/gradients-without-backpropagation","slug":"gradients-without-backpropagation","title":"Gradients without Backpropagation","date":"2022-02-17","arxiv_id":"2202.08587","n_code_links":3,"syntology":{"ran":4,"of":4,"n_ran_checked":4,"n_instrument":0,"unverified":0,"pointer_only":2,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","official":null}}],"papers_shown":12,"papers_order":"date (newest first), then slug","paper_counts":{"archive_papers_tagged":12,"with_a_code_link":8,"where_syntology_ran_a_sample":4,"not_listed_spam_title":0,"listed":12,"listed_where_code_ran":4,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":4,"every_run_a_failure_of_syntologys_instrument":0,"listed_with_a_run_with_no_instrument_failure":4,"listed_every_run_a_failure_of_syntologys_instrument":0,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"papers_where_code_ran":4,"papers_where_code_ran_first_page":"/method/forward-gradient/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not isolate this method inside it.","pages":[{"order":"ran","page":1,"of":1,"url":"/method/forward-gradient/papers/ran/1","json":"/method/forward-gradient/papers/ran/1.json","rows":4}],"tasks":[{"task":"/task/benchmarking","name":"Benchmarking","papers":1},{"task":"/task/imitation-learning","name":"Imitation Learning","papers":1},{"task":"/task/memorization","name":"Memorization","papers":1},{"task":"/task/model-optimization","name":"Model Optimization","papers":1},{"task":"/task/offline-rl","name":"Offline RL","papers":1},{"task":"/task/reinforcement-learning-1","name":"Reinforcement Learning (RL)","papers":1},{"task":"/task/regression-1","name":"regression","papers":1}],"tasks_shown":7,"n_tasks":7,"usage_by_year":[{"year":"2022","papers":4},{"year":"2023","papers":3},{"year":"2024","papers":4},{"year":"2025","papers":1}],"row_source":"methods_table","archive":{"source":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","archive_url":"https://paperswithcode.com/method/forward-gradient"},"syntology_read_at":"2026-10-05T00:36:11+00:00","syntology":{"source":"Syntology's have check for this name (the free coverage lookup), read from Syntology's graph","have_url":"https://syntology.ai/api/graph/have?x=Forward%20gradient","read_at":"2026-10-05T00:56:07+00:00","query":"Forward gradient","kind":"method","have":"unknown_name","tier":null,"verified_implementation":null,"level":null,"level_meaning":"the served verification level, per answer; never summed across methods","resolved_to":null,"resolution":null,"resolved_name_differs":false,"absence_asserted":false,"absence_unchecked":null,"no_code_is_about_this_method":false,"subject":null,"archive_paper_arxiv_id":"2202.08587","repositories":null,"retrieve_with":null,"name_competition":{"verdict":"none","may_be_wrong_sense":false,"bearers_found":0,"served":null,"leading_other_bearer":null,"n_other_bearers_listed":0,"note":"Nothing in this corpus is named 'Forward gradient' -- no method node, no paper announcing it in its title, no expanded form declaring it as an acronym."},"name_competition_text":null,"near_matches":["Split Forward Gradient (Split-FG)","Forward-DP","gradient EM","Forward DEER","Forward Flow","Fast Forward","Gradient Cuff","Forward Replay"],"code_nearby":[],"code_nearby_caption":null,"origin_paper":null,"line":"name not resolved (unknown_name). The lookup matched no method, paper or venue by this name; that asserts nothing about whether code exists.","level_legend":null},"syntology_have_state":"loaded","record_sha256":"d87a2175f2080fbacf71416740fdfeab3d3a3aef76e59eb2b92f7c3cd9e7b097","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}