{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:6AQZUDFJIBQ3RKK4VCAD2BSWU3","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"9ba7ea03eb4e92946cb25b179f9b714d78ca6bedcd46634032b0ad2458f99792","cross_cats_sorted":["cs.LG","cs.NE","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2024-11-26T16:28:16Z","title_canon_sha256":"2457f0c4056de7f1cf9883dc617d11e1d69040b63783a995e5712f3b4eebec68"},"schema_version":"1.0","source":{"id":"2411.17567","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.17567","created_at":"2026-07-05T09:40:49Z"},{"alias_kind":"arxiv_version","alias_value":"2411.17567v1","created_at":"2026-07-05T09:40:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.17567","created_at":"2026-07-05T09:40:49Z"},{"alias_kind":"pith_short_12","alias_value":"6AQZUDFJIBQ3","created_at":"2026-07-05T09:40:49Z"},{"alias_kind":"pith_short_16","alias_value":"6AQZUDFJIBQ3RKK4","created_at":"2026-07-05T09:40:49Z"},{"alias_kind":"pith_short_8","alias_value":"6AQZUDFJ","created_at":"2026-07-05T09:40:49Z"}],"graph_snapshots":[{"event_id":"sha256:518e20b9f664c82ea6386d9a37ffcdf91c25e7460708f4cd84ebb4acfdcc2b0c","target":"graph","created_at":"2026-07-05T09:40:49Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2411.17567/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Forward gradient descent (FGD) has been proposed as a biologically more plausible alternative of gradient descent as it can be computed without backward pass. Considering the linear model with $d$ parameters, previous work has found that the prediction error of FGD is, however, by a factor $d$ slower than the prediction error of stochastic gradient descent (SGD). In this paper we show that by computing $\\ell$ FGD steps based on each training sample, this suboptimality factor becomes $d/(\\ell \\wedge d)$ and thus the suboptimality of the rate disappears if $\\ell \\gtrsim d.$ We also show that FGD","authors_text":"Johannes Schmidt-Hieber, Niklas Dexheimer","cross_cats":["cs.LG","cs.NE","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2024-11-26T16:28:16Z","title":"Improving the Convergence Rates of Forward Gradient Descent with Repeated Sampling"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.17567","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:9c6bc1126c9d17d9d218605d9f7e4e6993941f28b224bcb7f0bd39d3a2b6f690","target":"record","created_at":"2026-07-05T09:40:49Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"9ba7ea03eb4e92946cb25b179f9b714d78ca6bedcd46634032b0ad2458f99792","cross_cats_sorted":["cs.LG","cs.NE","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2024-11-26T16:28:16Z","title_canon_sha256":"2457f0c4056de7f1cf9883dc617d11e1d69040b63783a995e5712f3b4eebec68"},"schema_version":"1.0","source":{"id":"2411.17567","kind":"arxiv","version":1}},"canonical_sha256":"f0219a0ca94061b8a95ca8803d0656a6fad9c1ebec2485b402b15f07b5cafd56","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f0219a0ca94061b8a95ca8803d0656a6fad9c1ebec2485b402b15f07b5cafd56","first_computed_at":"2026-07-05T09:40:49.095219Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:40:49.095219Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4wfhiZ9ya8It1Bw/X2pZg4ZST3El+nYUyahD32BaBPL86PUIWEu34pyfKiICn/iR1Bdg/PaQxcHHKhKtWoisBA==","signature_status":"signed_v1","signed_at":"2026-07-05T09:40:49.095772Z","signed_message":"canonical_sha256_bytes"},"source_id":"2411.17567","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9c6bc1126c9d17d9d218605d9f7e4e6993941f28b224bcb7f0bd39d3a2b6f690","sha256:518e20b9f664c82ea6386d9a37ffcdf91c25e7460708f4cd84ebb4acfdcc2b0c"],"state_sha256":"0e0396beddd503698d1b2e1b94a914d6e438f87704ff5e7dc48754deadf102c2"}