{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:CCQJM2GJXMENZMWSFD5FGZLFKR","short_pith_number":"pith:CCQJM2GJ","schema_version":"1.0","canonical_sha256":"10a09668c9bb08dcb2d228fa5365655457acbec1c30e5258e3202eedd31a194e","source":{"kind":"arxiv","id":"2508.12228","version":1},"attestation_state":"computed","paper":{"title":"Can a One-Point Feedback Zeroth-order Algorithm Achieve Linear Dimension Dependent Sample Complexity?","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Haishan Ye, Xiangyu Chang","submitted_at":"2025-08-17T04:01:51Z","abstract_excerpt":"We revisit the one-point feedback zeroth-order (ZO) optimization problem, a classical setting in derivative-free optimization where only a single noisy function evaluation is available per query. Compared to their two-point counterparts, existing one-point feedback ZO algorithms typically suffer from poor dimension dependence in their sample complexities -- often quadratic or worse -- even for convex problems. This gap has led to the open question of whether one-point feedback ZO algorithms can match the optimal \\emph{linear} dimension dependence achieved by two-point methods. In this work, we"},"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":"2508.12228","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-08-17T04:01:51Z","cross_cats_sorted":[],"title_canon_sha256":"193c04871daca4dccba4106e2183afa2c18735928004a3707dd84d88843a88e9","abstract_canon_sha256":"d7f5f67f11aec11e256a74a248ae2179eed5ea6aebb71c9d5a0c1a69d60b0673"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:55:02.011482Z","signature_b64":"Q5u7fgfJl6I5AlnH87/51pbxf/3EwpDdm+sjFcQBKgmhPVfBUVl1m8WRrNbgqucUV7IBND5HY8C5ZyHvFLgNAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"10a09668c9bb08dcb2d228fa5365655457acbec1c30e5258e3202eedd31a194e","last_reissued_at":"2026-07-05T11:55:02.011054Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:55:02.011054Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Can a One-Point Feedback Zeroth-order Algorithm Achieve Linear Dimension Dependent Sample Complexity?","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Haishan Ye, Xiangyu Chang","submitted_at":"2025-08-17T04:01:51Z","abstract_excerpt":"We revisit the one-point feedback zeroth-order (ZO) optimization problem, a classical setting in derivative-free optimization where only a single noisy function evaluation is available per query. Compared to their two-point counterparts, existing one-point feedback ZO algorithms typically suffer from poor dimension dependence in their sample complexities -- often quadratic or worse -- even for convex problems. This gap has led to the open question of whether one-point feedback ZO algorithms can match the optimal \\emph{linear} dimension dependence achieved by two-point methods. In this work, we"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.12228","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2508.12228/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":"2508.12228","created_at":"2026-07-05T11:55:02.011112+00:00"},{"alias_kind":"arxiv_version","alias_value":"2508.12228v1","created_at":"2026-07-05T11:55:02.011112+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.12228","created_at":"2026-07-05T11:55:02.011112+00:00"},{"alias_kind":"pith_short_12","alias_value":"CCQJM2GJXMEN","created_at":"2026-07-05T11:55:02.011112+00:00"},{"alias_kind":"pith_short_16","alias_value":"CCQJM2GJXMENZMWS","created_at":"2026-07-05T11:55:02.011112+00:00"},{"alias_kind":"pith_short_8","alias_value":"CCQJM2GJ","created_at":"2026-07-05T11:55:02.011112+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.06549","citing_title":"Stochastic Non-Smooth Non-Convex Optimization with Decision-Dependent Distributions","ref_index":31,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CCQJM2GJXMENZMWSFD5FGZLFKR","json":"https://pith.science/pith/CCQJM2GJXMENZMWSFD5FGZLFKR.json","graph_json":"https://pith.science/api/pith-number/CCQJM2GJXMENZMWSFD5FGZLFKR/graph.json","events_json":"https://pith.science/api/pith-number/CCQJM2GJXMENZMWSFD5FGZLFKR/events.json","paper":"https://pith.science/paper/CCQJM2GJ"},"agent_actions":{"view_html":"https://pith.science/pith/CCQJM2GJXMENZMWSFD5FGZLFKR","download_json":"https://pith.science/pith/CCQJM2GJXMENZMWSFD5FGZLFKR.json","view_paper":"https://pith.science/paper/CCQJM2GJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2508.12228&json=true","fetch_graph":"https://pith.science/api/pith-number/CCQJM2GJXMENZMWSFD5FGZLFKR/graph.json","fetch_events":"https://pith.science/api/pith-number/CCQJM2GJXMENZMWSFD5FGZLFKR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CCQJM2GJXMENZMWSFD5FGZLFKR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CCQJM2GJXMENZMWSFD5FGZLFKR/action/storage_attestation","attest_author":"https://pith.science/pith/CCQJM2GJXMENZMWSFD5FGZLFKR/action/author_attestation","sign_citation":"https://pith.science/pith/CCQJM2GJXMENZMWSFD5FGZLFKR/action/citation_signature","submit_replication":"https://pith.science/pith/CCQJM2GJXMENZMWSFD5FGZLFKR/action/replication_record"}},"created_at":"2026-07-05T11:55:02.011112+00:00","updated_at":"2026-07-05T11:55:02.011112+00:00"}