{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:KBXGW2U5KJIN7KZ6V42NJ4FPIX","short_pith_number":"pith:KBXGW2U5","schema_version":"1.0","canonical_sha256":"506e6b6a9d5250dfab3eaf34d4f0af45cf1ed47a206e67667d592334f4de0d78","source":{"kind":"arxiv","id":"1710.10551","version":2},"attestation_state":"computed","paper":{"title":"Stochastic Zeroth-order Optimization in High Dimensions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Aarti Singh, Simon Du, Sivaraman Balakrishnan, Yining Wang","submitted_at":"2017-10-29T02:11:48Z","abstract_excerpt":"We consider the problem of optimizing a high-dimensional convex function using stochastic zeroth-order queries. Under sparsity assumptions on the gradients or function values, we present two algorithms: a successive component/feature selection algorithm and a noisy mirror descent algorithm using Lasso gradient estimates, and show that both algorithms have convergence rates that de- pend only logarithmically on the ambient dimension of the problem. Empirical results confirm our theoretical findings and show that the algorithms we design outperform classical zeroth-order optimization methods in "},"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":"1710.10551","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-10-29T02:11:48Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"519ed5a1bf9b0e9d8bc18ae7098e87a62efb9c8efb3a7ce580190642d87ccdfe","abstract_canon_sha256":"e64892e4790467c28d49e04bb62573aeec22937184e5fb3a9808ee1cc2739cde"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:39.337296Z","signature_b64":"p2M6AxK12GV+z61SEZY9nEh/CJUG5eoIM/2IQhkMdRA+Bd+VLtvLwvCzeJcyFwDpyiJh+h6PbzMETL2M4g0+Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"506e6b6a9d5250dfab3eaf34d4f0af45cf1ed47a206e67667d592334f4de0d78","last_reissued_at":"2026-05-18T00:22:39.336817Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:39.336817Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Stochastic Zeroth-order Optimization in High Dimensions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Aarti Singh, Simon Du, Sivaraman Balakrishnan, Yining Wang","submitted_at":"2017-10-29T02:11:48Z","abstract_excerpt":"We consider the problem of optimizing a high-dimensional convex function using stochastic zeroth-order queries. Under sparsity assumptions on the gradients or function values, we present two algorithms: a successive component/feature selection algorithm and a noisy mirror descent algorithm using Lasso gradient estimates, and show that both algorithms have convergence rates that de- pend only logarithmically on the ambient dimension of the problem. Empirical results confirm our theoretical findings and show that the algorithms we design outperform classical zeroth-order optimization methods in "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.10551","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":"1710.10551","created_at":"2026-05-18T00:22:39.336896+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.10551v2","created_at":"2026-05-18T00:22:39.336896+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.10551","created_at":"2026-05-18T00:22:39.336896+00:00"},{"alias_kind":"pith_short_12","alias_value":"KBXGW2U5KJIN","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_16","alias_value":"KBXGW2U5KJIN7KZ6","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_8","alias_value":"KBXGW2U5","created_at":"2026-05-18T12:31:24.725408+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.16520","citing_title":"Global Convergence of Sampling-Based Nonconvex Optimization through Diffusion-Style Smoothing","ref_index":213,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KBXGW2U5KJIN7KZ6V42NJ4FPIX","json":"https://pith.science/pith/KBXGW2U5KJIN7KZ6V42NJ4FPIX.json","graph_json":"https://pith.science/api/pith-number/KBXGW2U5KJIN7KZ6V42NJ4FPIX/graph.json","events_json":"https://pith.science/api/pith-number/KBXGW2U5KJIN7KZ6V42NJ4FPIX/events.json","paper":"https://pith.science/paper/KBXGW2U5"},"agent_actions":{"view_html":"https://pith.science/pith/KBXGW2U5KJIN7KZ6V42NJ4FPIX","download_json":"https://pith.science/pith/KBXGW2U5KJIN7KZ6V42NJ4FPIX.json","view_paper":"https://pith.science/paper/KBXGW2U5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.10551&json=true","fetch_graph":"https://pith.science/api/pith-number/KBXGW2U5KJIN7KZ6V42NJ4FPIX/graph.json","fetch_events":"https://pith.science/api/pith-number/KBXGW2U5KJIN7KZ6V42NJ4FPIX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KBXGW2U5KJIN7KZ6V42NJ4FPIX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KBXGW2U5KJIN7KZ6V42NJ4FPIX/action/storage_attestation","attest_author":"https://pith.science/pith/KBXGW2U5KJIN7KZ6V42NJ4FPIX/action/author_attestation","sign_citation":"https://pith.science/pith/KBXGW2U5KJIN7KZ6V42NJ4FPIX/action/citation_signature","submit_replication":"https://pith.science/pith/KBXGW2U5KJIN7KZ6V42NJ4FPIX/action/replication_record"}},"created_at":"2026-05-18T00:22:39.336896+00:00","updated_at":"2026-05-18T00:22:39.336896+00:00"}