{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:6JIC6CWRDA6GUIEAY7677B6PXW","short_pith_number":"pith:6JIC6CWR","schema_version":"1.0","canonical_sha256":"f2502f0ad1183c6a2080c7fdff87cfbdb6ec6ac492b015020e9427e6573c4cbc","source":{"kind":"arxiv","id":"2312.03218","version":1},"attestation_state":"computed","paper":{"title":"Accelerated Gradient Algorithms with Adaptive Subspace Search for Instance-Faster Optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Cong Fang, Hanzhen Zhao, Pengyun Yue, Yang Xu, Yuanshi Liu","submitted_at":"2023-12-06T01:16:10Z","abstract_excerpt":"Gradient-based minimax optimal algorithms have greatly promoted the development of continuous optimization and machine learning. One seminal work due to Yurii Nesterov [Nes83a] established $\\tilde{\\mathcal{O}}(\\sqrt{L/\\mu})$ gradient complexity for minimizing an $L$-smooth $\\mu$-strongly convex objective. However, an ideal algorithm would adapt to the explicit complexity of a particular objective function and incur faster rates for simpler problems, triggering our reconsideration of two defeats of existing optimization modeling and analysis. (i) The worst-case optimality is neither the instanc"},"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":"2312.03218","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-12-06T01:16:10Z","cross_cats_sorted":["cs.CC","stat.ML"],"title_canon_sha256":"b81f081590f320da146b2767b7d56e60201d44a610852cc5e98a5fd15a4870c1","abstract_canon_sha256":"028878ea6fe364b90eb5547b442708a78c6de343d0f123204e31a51d364314b7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:21:00.167778Z","signature_b64":"Ds0ndbk3fG6yJC5PkDHtWATy9vktuZpBEm2OgEvQWJ9VlkUdKspxwW7gASKVmPNMge+2hSaPqwV9c34sEcdyCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f2502f0ad1183c6a2080c7fdff87cfbdb6ec6ac492b015020e9427e6573c4cbc","last_reissued_at":"2026-07-05T07:21:00.167197Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:21:00.167197Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Accelerated Gradient Algorithms with Adaptive Subspace Search for Instance-Faster Optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Cong Fang, Hanzhen Zhao, Pengyun Yue, Yang Xu, Yuanshi Liu","submitted_at":"2023-12-06T01:16:10Z","abstract_excerpt":"Gradient-based minimax optimal algorithms have greatly promoted the development of continuous optimization and machine learning. One seminal work due to Yurii Nesterov [Nes83a] established $\\tilde{\\mathcal{O}}(\\sqrt{L/\\mu})$ gradient complexity for minimizing an $L$-smooth $\\mu$-strongly convex objective. However, an ideal algorithm would adapt to the explicit complexity of a particular objective function and incur faster rates for simpler problems, triggering our reconsideration of two defeats of existing optimization modeling and analysis. (i) The worst-case optimality is neither the instanc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2312.03218","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/2312.03218/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":"2312.03218","created_at":"2026-07-05T07:21:00.167253+00:00"},{"alias_kind":"arxiv_version","alias_value":"2312.03218v1","created_at":"2026-07-05T07:21:00.167253+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2312.03218","created_at":"2026-07-05T07:21:00.167253+00:00"},{"alias_kind":"pith_short_12","alias_value":"6JIC6CWRDA6G","created_at":"2026-07-05T07:21:00.167253+00:00"},{"alias_kind":"pith_short_16","alias_value":"6JIC6CWRDA6GUIEA","created_at":"2026-07-05T07:21:00.167253+00:00"},{"alias_kind":"pith_short_8","alias_value":"6JIC6CWR","created_at":"2026-07-05T07:21:00.167253+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/6JIC6CWRDA6GUIEAY7677B6PXW","json":"https://pith.science/pith/6JIC6CWRDA6GUIEAY7677B6PXW.json","graph_json":"https://pith.science/api/pith-number/6JIC6CWRDA6GUIEAY7677B6PXW/graph.json","events_json":"https://pith.science/api/pith-number/6JIC6CWRDA6GUIEAY7677B6PXW/events.json","paper":"https://pith.science/paper/6JIC6CWR"},"agent_actions":{"view_html":"https://pith.science/pith/6JIC6CWRDA6GUIEAY7677B6PXW","download_json":"https://pith.science/pith/6JIC6CWRDA6GUIEAY7677B6PXW.json","view_paper":"https://pith.science/paper/6JIC6CWR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2312.03218&json=true","fetch_graph":"https://pith.science/api/pith-number/6JIC6CWRDA6GUIEAY7677B6PXW/graph.json","fetch_events":"https://pith.science/api/pith-number/6JIC6CWRDA6GUIEAY7677B6PXW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6JIC6CWRDA6GUIEAY7677B6PXW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6JIC6CWRDA6GUIEAY7677B6PXW/action/storage_attestation","attest_author":"https://pith.science/pith/6JIC6CWRDA6GUIEAY7677B6PXW/action/author_attestation","sign_citation":"https://pith.science/pith/6JIC6CWRDA6GUIEAY7677B6PXW/action/citation_signature","submit_replication":"https://pith.science/pith/6JIC6CWRDA6GUIEAY7677B6PXW/action/replication_record"}},"created_at":"2026-07-05T07:21:00.167253+00:00","updated_at":"2026-07-05T07:21:00.167253+00:00"}