{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:GAQ6JGGHULO2G4M7URHKWNWLVF","short_pith_number":"pith:GAQ6JGGH","schema_version":"1.0","canonical_sha256":"3021e498c7a2dda3719fa44eab36cba9561d9362c171b81c5484502f93bbac44","source":{"kind":"arxiv","id":"1612.01425","version":1},"attestation_state":"computed","paper":{"title":"Zeroth-order Asynchronous Doubly Stochastic Algorithm with Variance Reduction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Bin Gu, Heng Huang, Zhouyuan Huo","submitted_at":"2016-12-05T16:40:00Z","abstract_excerpt":"Zeroth-order (derivative-free) optimization attracts a lot of attention in machine learning, because explicit gradient calculations may be computationally expensive or infeasible. To handle large scale problems both in volume and dimension, recently asynchronous doubly stochastic zeroth-order algorithms were proposed. The convergence rate of existing asynchronous doubly stochastic zeroth order algorithms is $O(\\frac{1}{\\sqrt{T}})$ (also for the sequential stochastic zeroth-order optimization algorithms). In this paper, we focus on the finite sums of smooth but not necessarily convex functions,"},"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":"1612.01425","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-12-05T16:40:00Z","cross_cats_sorted":[],"title_canon_sha256":"1d77324fe499b5263fe731ceb382e42a1fb4d5667df6f10c55f4b8015c1dd0bb","abstract_canon_sha256":"5a147fc4e72b67db236eaafabf39ccdeb42c2507d2f56db85daefe81d6d1ae8f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:55:52.675144Z","signature_b64":"R77ZK7l2lm2cECSgiXlUZq+cQ8ijgexWJrgxy/ocjBoVZQ13MH+oR+oE5csC5nF/lJSY8nam34ZLLTWN9t99Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3021e498c7a2dda3719fa44eab36cba9561d9362c171b81c5484502f93bbac44","last_reissued_at":"2026-05-18T00:55:52.674645Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:55:52.674645Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Zeroth-order Asynchronous Doubly Stochastic Algorithm with Variance Reduction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Bin Gu, Heng Huang, Zhouyuan Huo","submitted_at":"2016-12-05T16:40:00Z","abstract_excerpt":"Zeroth-order (derivative-free) optimization attracts a lot of attention in machine learning, because explicit gradient calculations may be computationally expensive or infeasible. To handle large scale problems both in volume and dimension, recently asynchronous doubly stochastic zeroth-order algorithms were proposed. The convergence rate of existing asynchronous doubly stochastic zeroth order algorithms is $O(\\frac{1}{\\sqrt{T}})$ (also for the sequential stochastic zeroth-order optimization algorithms). In this paper, we focus on the finite sums of smooth but not necessarily convex functions,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.01425","kind":"arxiv","version":1},"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":"1612.01425","created_at":"2026-05-18T00:55:52.674721+00:00"},{"alias_kind":"arxiv_version","alias_value":"1612.01425v1","created_at":"2026-05-18T00:55:52.674721+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.01425","created_at":"2026-05-18T00:55:52.674721+00:00"},{"alias_kind":"pith_short_12","alias_value":"GAQ6JGGHULO2","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_16","alias_value":"GAQ6JGGHULO2G4M7","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_8","alias_value":"GAQ6JGGH","created_at":"2026-05-18T12:30:15.759754+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/GAQ6JGGHULO2G4M7URHKWNWLVF","json":"https://pith.science/pith/GAQ6JGGHULO2G4M7URHKWNWLVF.json","graph_json":"https://pith.science/api/pith-number/GAQ6JGGHULO2G4M7URHKWNWLVF/graph.json","events_json":"https://pith.science/api/pith-number/GAQ6JGGHULO2G4M7URHKWNWLVF/events.json","paper":"https://pith.science/paper/GAQ6JGGH"},"agent_actions":{"view_html":"https://pith.science/pith/GAQ6JGGHULO2G4M7URHKWNWLVF","download_json":"https://pith.science/pith/GAQ6JGGHULO2G4M7URHKWNWLVF.json","view_paper":"https://pith.science/paper/GAQ6JGGH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1612.01425&json=true","fetch_graph":"https://pith.science/api/pith-number/GAQ6JGGHULO2G4M7URHKWNWLVF/graph.json","fetch_events":"https://pith.science/api/pith-number/GAQ6JGGHULO2G4M7URHKWNWLVF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GAQ6JGGHULO2G4M7URHKWNWLVF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GAQ6JGGHULO2G4M7URHKWNWLVF/action/storage_attestation","attest_author":"https://pith.science/pith/GAQ6JGGHULO2G4M7URHKWNWLVF/action/author_attestation","sign_citation":"https://pith.science/pith/GAQ6JGGHULO2G4M7URHKWNWLVF/action/citation_signature","submit_replication":"https://pith.science/pith/GAQ6JGGHULO2G4M7URHKWNWLVF/action/replication_record"}},"created_at":"2026-05-18T00:55:52.674721+00:00","updated_at":"2026-05-18T00:55:52.674721+00:00"}