{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:M4EZGSQIXVKG6KUT2BDDUJ57PZ","short_pith_number":"pith:M4EZGSQI","schema_version":"1.0","canonical_sha256":"6709934a08bd546f2a93d0463a27bf7e55aaada678a0ca240afa65f2815c5b0e","source":{"kind":"arxiv","id":"1512.09170","version":2},"attestation_state":"computed","paper":{"title":"Statistical Query Algorithms for Mean Vector Estimation and Stochastic Convex Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.LG","authors_text":"Cristobal Guzman, Santosh Vempala, Vitaly Feldman","submitted_at":"2015-12-30T22:29:23Z","abstract_excerpt":"Stochastic convex optimization, where the objective is the expectation of a random convex function, is an important and widely used method with numerous applications in machine learning, statistics, operations research and other areas. We study the complexity of stochastic convex optimization given only statistical query (SQ) access to the objective function. We show that well-known and popular first-order iterative methods can be implemented using only statistical queries. For many cases of interest we derive nearly matching upper and lower bounds on the estimation (sample) complexity includi"},"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":"1512.09170","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-12-30T22:29:23Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"e2a8fe1643b37fcb9445911003dac59986d305cd6f35b5e975f89b1dd1ca2638","abstract_canon_sha256":"ae7b692fbdc2d1154241ebfd2821fe2006e6c565702ab704ad3c63caf60c08dd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:57:31.614110Z","signature_b64":"0mlYZgcFmDXTsU5G8WTHn70vGdeTeoiNp/E41h6YCxAbpTnZzkzp+uEJ/juBwWT2FF2GcxaZ2nCY2Of3q10rBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6709934a08bd546f2a93d0463a27bf7e55aaada678a0ca240afa65f2815c5b0e","last_reissued_at":"2026-05-18T00:57:31.613630Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:57:31.613630Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Statistical Query Algorithms for Mean Vector Estimation and Stochastic Convex Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.LG","authors_text":"Cristobal Guzman, Santosh Vempala, Vitaly Feldman","submitted_at":"2015-12-30T22:29:23Z","abstract_excerpt":"Stochastic convex optimization, where the objective is the expectation of a random convex function, is an important and widely used method with numerous applications in machine learning, statistics, operations research and other areas. We study the complexity of stochastic convex optimization given only statistical query (SQ) access to the objective function. We show that well-known and popular first-order iterative methods can be implemented using only statistical queries. For many cases of interest we derive nearly matching upper and lower bounds on the estimation (sample) complexity includi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.09170","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":""},"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":"1512.09170","created_at":"2026-05-18T00:57:31.613706+00:00"},{"alias_kind":"arxiv_version","alias_value":"1512.09170v2","created_at":"2026-05-18T00:57:31.613706+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.09170","created_at":"2026-05-18T00:57:31.613706+00:00"},{"alias_kind":"pith_short_12","alias_value":"M4EZGSQIXVKG","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_16","alias_value":"M4EZGSQIXVKG6KUT","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_8","alias_value":"M4EZGSQI","created_at":"2026-05-18T12:29:32.376354+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2602.01682","citing_title":"Finite and Corruption-Robust Regret Bounds in Online Inverse Linear Optimization under M-Convex Action Sets","ref_index":14,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/M4EZGSQIXVKG6KUT2BDDUJ57PZ","json":"https://pith.science/pith/M4EZGSQIXVKG6KUT2BDDUJ57PZ.json","graph_json":"https://pith.science/api/pith-number/M4EZGSQIXVKG6KUT2BDDUJ57PZ/graph.json","events_json":"https://pith.science/api/pith-number/M4EZGSQIXVKG6KUT2BDDUJ57PZ/events.json","paper":"https://pith.science/paper/M4EZGSQI"},"agent_actions":{"view_html":"https://pith.science/pith/M4EZGSQIXVKG6KUT2BDDUJ57PZ","download_json":"https://pith.science/pith/M4EZGSQIXVKG6KUT2BDDUJ57PZ.json","view_paper":"https://pith.science/paper/M4EZGSQI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1512.09170&json=true","fetch_graph":"https://pith.science/api/pith-number/M4EZGSQIXVKG6KUT2BDDUJ57PZ/graph.json","fetch_events":"https://pith.science/api/pith-number/M4EZGSQIXVKG6KUT2BDDUJ57PZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/M4EZGSQIXVKG6KUT2BDDUJ57PZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/M4EZGSQIXVKG6KUT2BDDUJ57PZ/action/storage_attestation","attest_author":"https://pith.science/pith/M4EZGSQIXVKG6KUT2BDDUJ57PZ/action/author_attestation","sign_citation":"https://pith.science/pith/M4EZGSQIXVKG6KUT2BDDUJ57PZ/action/citation_signature","submit_replication":"https://pith.science/pith/M4EZGSQIXVKG6KUT2BDDUJ57PZ/action/replication_record"}},"created_at":"2026-05-18T00:57:31.613706+00:00","updated_at":"2026-05-18T00:57:31.613706+00:00"}