{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:DTYCVSXIQRJZZLPVIKQP5MCMPW","short_pith_number":"pith:DTYCVSXI","schema_version":"1.0","canonical_sha256":"1cf02acae884539cadf542a0feb04c7d9b3d4ba9baf2422c4aa6e315f395f975","source":{"kind":"arxiv","id":"2003.02684","version":2},"attestation_state":"computed","paper":{"title":"A stochastic subspace approach to gradient-free optimization in high dimensions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Alireza Doostan, David Kozak, Luis Tenorio, Stephen Becker","submitted_at":"2020-03-04T18:04:48Z","abstract_excerpt":"We present a stochastic descent algorithm for unconstrained optimization that is particularly efficient when the objective function is slow to evaluate and gradients are not easily obtained, as in some PDE-constrained optimization and machine learning problems. The algorithm maps the gradient onto a low-dimensional random subspace of dimension $\\ell$ at each iteration, similar to coordinate descent but without restricting directional derivatives to be along the axes. Without requiring a full gradient, this mapping can be performed by computing $\\ell$ directional derivatives (e.g., via forward-"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2003.02684","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-03-04T18:04:48Z","cross_cats_sorted":[],"title_canon_sha256":"d9ff3793d676e8da23cb434fef81c767ac53dc50185bdc0ce327770d841eeca5","abstract_canon_sha256":"f1b0abba8a7f2d2078e6dd22bf083e8e60ec9495d5a5cf6ad066b1d12c66a678"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:40:02.458824Z","signature_b64":"oAGxkO3v+MHMdOJ6tkbyp8xamUD0zy9/5RLp6Kj1J9Ry4iaDlpnqFx0BaBDApyQff18hqPXhs1KHGZewPYj8BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1cf02acae884539cadf542a0feb04c7d9b3d4ba9baf2422c4aa6e315f395f975","last_reissued_at":"2026-07-05T08:40:02.458328Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:40:02.458328Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A stochastic subspace approach to gradient-free optimization in high dimensions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Alireza Doostan, David Kozak, Luis Tenorio, Stephen Becker","submitted_at":"2020-03-04T18:04:48Z","abstract_excerpt":"We present a stochastic descent algorithm for unconstrained optimization that is particularly efficient when the objective function is slow to evaluate and gradients are not easily obtained, as in some PDE-constrained optimization and machine learning problems. The algorithm maps the gradient onto a low-dimensional random subspace of dimension $\\ell$ at each iteration, similar to coordinate descent but without restricting directional derivatives to be along the axes. Without requiring a full gradient, this mapping can be performed by computing $\\ell$ directional derivatives (e.g., via forward-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2003.02684","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2003.02684/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2003.02684","created_at":"2026-07-05T08:40:02.458390+00:00"},{"alias_kind":"arxiv_version","alias_value":"2003.02684v2","created_at":"2026-07-05T08:40:02.458390+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2003.02684","created_at":"2026-07-05T08:40:02.458390+00:00"},{"alias_kind":"pith_short_12","alias_value":"DTYCVSXIQRJZ","created_at":"2026-07-05T08:40:02.458390+00:00"},{"alias_kind":"pith_short_16","alias_value":"DTYCVSXIQRJZZLPV","created_at":"2026-07-05T08:40:02.458390+00:00"},{"alias_kind":"pith_short_8","alias_value":"DTYCVSXI","created_at":"2026-07-05T08:40:02.458390+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DTYCVSXIQRJZZLPVIKQP5MCMPW","json":"https://pith.science/pith/DTYCVSXIQRJZZLPVIKQP5MCMPW.json","graph_json":"https://pith.science/api/pith-number/DTYCVSXIQRJZZLPVIKQP5MCMPW/graph.json","events_json":"https://pith.science/api/pith-number/DTYCVSXIQRJZZLPVIKQP5MCMPW/events.json","paper":"https://pith.science/paper/DTYCVSXI"},"agent_actions":{"view_html":"https://pith.science/pith/DTYCVSXIQRJZZLPVIKQP5MCMPW","download_json":"https://pith.science/pith/DTYCVSXIQRJZZLPVIKQP5MCMPW.json","view_paper":"https://pith.science/paper/DTYCVSXI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2003.02684&json=true","fetch_graph":"https://pith.science/api/pith-number/DTYCVSXIQRJZZLPVIKQP5MCMPW/graph.json","fetch_events":"https://pith.science/api/pith-number/DTYCVSXIQRJZZLPVIKQP5MCMPW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DTYCVSXIQRJZZLPVIKQP5MCMPW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DTYCVSXIQRJZZLPVIKQP5MCMPW/action/storage_attestation","attest_author":"https://pith.science/pith/DTYCVSXIQRJZZLPVIKQP5MCMPW/action/author_attestation","sign_citation":"https://pith.science/pith/DTYCVSXIQRJZZLPVIKQP5MCMPW/action/citation_signature","submit_replication":"https://pith.science/pith/DTYCVSXIQRJZZLPVIKQP5MCMPW/action/replication_record"}},"created_at":"2026-07-05T08:40:02.458390+00:00","updated_at":"2026-07-05T08:40:02.458390+00:00"}