{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:G33J6ACCTK4MJD6BNTGDDFU3XG","short_pith_number":"pith:G33J6ACC","schema_version":"1.0","canonical_sha256":"36f69f00429ab8c48fc16ccc31969bb9a29e40f34e35e951175c16c2d656a251","source":{"kind":"arxiv","id":"2102.10707","version":2},"attestation_state":"computed","paper":{"title":"A Zeroth-Order Block Coordinate Descent Algorithm for Huge-Scale Black-Box Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG","stat.ML"],"primary_cat":"math.OC","authors_text":"Daniel McKenzie, HanQin Cai, Wotao Yin, Yuchen Lou","submitted_at":"2021-02-21T23:06:35Z","abstract_excerpt":"We consider the zeroth-order optimization problem in the huge-scale setting, where the dimension of the problem is so large that performing even basic vector operations on the decision variables is infeasible. In this paper, we propose a novel algorithm, coined ZO-BCD, that exhibits favorable overall query complexity and has a much smaller per-iteration computational complexity. In addition, we discuss how the memory footprint of ZO-BCD can be reduced even further by the clever use of circulant measurement matrices. As an application of our new method, we propose the idea of crafting adversari"},"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":"2102.10707","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2021-02-21T23:06:35Z","cross_cats_sorted":["cs.AI","cs.LG","stat.ML"],"title_canon_sha256":"f5aefd8da125919c84f0dd79f78d7ff7ca27387f65a927afe8542d0dbfb3f5c2","abstract_canon_sha256":"d4dceaa887f908bc43fe47953b29e36e92aa8bb6e5c689e8aa9db511eed10e6a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:05:47.623056Z","signature_b64":"8EeNqITtL6UEDg9D6ihU9CrU3NZFwzSLFYSG+SISqWjCtHk0SvyZzj2m7ha2OcSg9aZf0TfjbfnDhp6WPAEYBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"36f69f00429ab8c48fc16ccc31969bb9a29e40f34e35e951175c16c2d656a251","last_reissued_at":"2026-07-05T03:05:47.622573Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:05:47.622573Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Zeroth-Order Block Coordinate Descent Algorithm for Huge-Scale Black-Box Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG","stat.ML"],"primary_cat":"math.OC","authors_text":"Daniel McKenzie, HanQin Cai, Wotao Yin, Yuchen Lou","submitted_at":"2021-02-21T23:06:35Z","abstract_excerpt":"We consider the zeroth-order optimization problem in the huge-scale setting, where the dimension of the problem is so large that performing even basic vector operations on the decision variables is infeasible. In this paper, we propose a novel algorithm, coined ZO-BCD, that exhibits favorable overall query complexity and has a much smaller per-iteration computational complexity. In addition, we discuss how the memory footprint of ZO-BCD can be reduced even further by the clever use of circulant measurement matrices. As an application of our new method, we propose the idea of crafting adversari"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2102.10707","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/2102.10707/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":"2102.10707","created_at":"2026-07-05T03:05:47.622627+00:00"},{"alias_kind":"arxiv_version","alias_value":"2102.10707v2","created_at":"2026-07-05T03:05:47.622627+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2102.10707","created_at":"2026-07-05T03:05:47.622627+00:00"},{"alias_kind":"pith_short_12","alias_value":"G33J6ACCTK4M","created_at":"2026-07-05T03:05:47.622627+00:00"},{"alias_kind":"pith_short_16","alias_value":"G33J6ACCTK4MJD6B","created_at":"2026-07-05T03:05:47.622627+00:00"},{"alias_kind":"pith_short_8","alias_value":"G33J6ACC","created_at":"2026-07-05T03:05:47.622627+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/G33J6ACCTK4MJD6BNTGDDFU3XG","json":"https://pith.science/pith/G33J6ACCTK4MJD6BNTGDDFU3XG.json","graph_json":"https://pith.science/api/pith-number/G33J6ACCTK4MJD6BNTGDDFU3XG/graph.json","events_json":"https://pith.science/api/pith-number/G33J6ACCTK4MJD6BNTGDDFU3XG/events.json","paper":"https://pith.science/paper/G33J6ACC"},"agent_actions":{"view_html":"https://pith.science/pith/G33J6ACCTK4MJD6BNTGDDFU3XG","download_json":"https://pith.science/pith/G33J6ACCTK4MJD6BNTGDDFU3XG.json","view_paper":"https://pith.science/paper/G33J6ACC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2102.10707&json=true","fetch_graph":"https://pith.science/api/pith-number/G33J6ACCTK4MJD6BNTGDDFU3XG/graph.json","fetch_events":"https://pith.science/api/pith-number/G33J6ACCTK4MJD6BNTGDDFU3XG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/G33J6ACCTK4MJD6BNTGDDFU3XG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/G33J6ACCTK4MJD6BNTGDDFU3XG/action/storage_attestation","attest_author":"https://pith.science/pith/G33J6ACCTK4MJD6BNTGDDFU3XG/action/author_attestation","sign_citation":"https://pith.science/pith/G33J6ACCTK4MJD6BNTGDDFU3XG/action/citation_signature","submit_replication":"https://pith.science/pith/G33J6ACCTK4MJD6BNTGDDFU3XG/action/replication_record"}},"created_at":"2026-07-05T03:05:47.622627+00:00","updated_at":"2026-07-05T03:05:47.622627+00:00"}