{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:5JNQNGJ6AZWIV622PYECVYSK2X","short_pith_number":"pith:5JNQNGJ6","schema_version":"1.0","canonical_sha256":"ea5b06993e066c8afb5a7e082ae24ad5c4d14e030b445e70fad29b532fb67275","source":{"kind":"arxiv","id":"1902.03591","version":3},"attestation_state":"computed","paper":{"title":"Stochastic Three Points Method for Unconstrained Smooth Minimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Eduard Gorbunov, El houcine Bergou, Peter Richt\\'arik","submitted_at":"2019-02-10T13:00:40Z","abstract_excerpt":"In this paper we consider the unconstrained minimization problem of a smooth function in ${\\mathbb{R}}^n$ in a setting where only function evaluations are possible. We design a novel randomized derivative-free algorithm --- the stochastic three points (STP) method --- and analyze its iteration complexity. At each iteration, STP generates a random search direction according to a certain fixed probability law. Our assumptions on this law are very mild: roughly speaking, all laws which do not concentrate all measure on any halfspace passing through the origin will work. For instance, we allow for"},"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":"1902.03591","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-02-10T13:00:40Z","cross_cats_sorted":[],"title_canon_sha256":"0641065d3d6144e6bb1e18508a135b21c30cc68ccfd2437fcaaa0378104c783b","abstract_canon_sha256":"f524f836343a466b9edf613fbc1a99f1acc9e1d6ef7ce33ab9b8d02fda72b432"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:46:52.906131Z","signature_b64":"+cCwqk4VfoROo3gS9ecBFuAB77EQ7hVM0wsCSC1+jt9IVh63ZDa/lkxkzuD3WNZC0wNJZJx0VBDFe54H3AzzCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ea5b06993e066c8afb5a7e082ae24ad5c4d14e030b445e70fad29b532fb67275","last_reissued_at":"2026-05-17T23:46:52.905676Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:46:52.905676Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Stochastic Three Points Method for Unconstrained Smooth Minimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Eduard Gorbunov, El houcine Bergou, Peter Richt\\'arik","submitted_at":"2019-02-10T13:00:40Z","abstract_excerpt":"In this paper we consider the unconstrained minimization problem of a smooth function in ${\\mathbb{R}}^n$ in a setting where only function evaluations are possible. We design a novel randomized derivative-free algorithm --- the stochastic three points (STP) method --- and analyze its iteration complexity. At each iteration, STP generates a random search direction according to a certain fixed probability law. Our assumptions on this law are very mild: roughly speaking, all laws which do not concentrate all measure on any halfspace passing through the origin will work. For instance, we allow for"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.03591","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1902.03591","created_at":"2026-05-17T23:46:52.905749+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.03591v3","created_at":"2026-05-17T23:46:52.905749+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.03591","created_at":"2026-05-17T23:46:52.905749+00:00"},{"alias_kind":"pith_short_12","alias_value":"5JNQNGJ6AZWI","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_16","alias_value":"5JNQNGJ6AZWIV622","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_8","alias_value":"5JNQNGJ6","created_at":"2026-05-18T12:33:10.108867+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/5JNQNGJ6AZWIV622PYECVYSK2X","json":"https://pith.science/pith/5JNQNGJ6AZWIV622PYECVYSK2X.json","graph_json":"https://pith.science/api/pith-number/5JNQNGJ6AZWIV622PYECVYSK2X/graph.json","events_json":"https://pith.science/api/pith-number/5JNQNGJ6AZWIV622PYECVYSK2X/events.json","paper":"https://pith.science/paper/5JNQNGJ6"},"agent_actions":{"view_html":"https://pith.science/pith/5JNQNGJ6AZWIV622PYECVYSK2X","download_json":"https://pith.science/pith/5JNQNGJ6AZWIV622PYECVYSK2X.json","view_paper":"https://pith.science/paper/5JNQNGJ6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.03591&json=true","fetch_graph":"https://pith.science/api/pith-number/5JNQNGJ6AZWIV622PYECVYSK2X/graph.json","fetch_events":"https://pith.science/api/pith-number/5JNQNGJ6AZWIV622PYECVYSK2X/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5JNQNGJ6AZWIV622PYECVYSK2X/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5JNQNGJ6AZWIV622PYECVYSK2X/action/storage_attestation","attest_author":"https://pith.science/pith/5JNQNGJ6AZWIV622PYECVYSK2X/action/author_attestation","sign_citation":"https://pith.science/pith/5JNQNGJ6AZWIV622PYECVYSK2X/action/citation_signature","submit_replication":"https://pith.science/pith/5JNQNGJ6AZWIV622PYECVYSK2X/action/replication_record"}},"created_at":"2026-05-17T23:46:52.905749+00:00","updated_at":"2026-05-17T23:46:52.905749+00:00"}