{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:Y4DQSWIQIAKMGA7TB3K6V46TNN","short_pith_number":"pith:Y4DQSWIQ","schema_version":"1.0","canonical_sha256":"c7070959104014c303f30ed5eaf3d36b792a3c1aeb7bbd6c721bf134068538b6","source":{"kind":"arxiv","id":"2505.22509","version":1},"attestation_state":"computed","paper":{"title":"Accelerating Optimization via Differentiable Stopping Time","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.LG","authors_text":"Haoran Yuan, Yiman Fong, Zaiwen Wen, Zhonglin Xie","submitted_at":"2025-05-28T15:59:13Z","abstract_excerpt":"Optimization is an important module of modern machine learning applications. Tremendous efforts have been made to accelerate optimization algorithms. A common formulation is achieving a lower loss at a given time. This enables a differentiable framework with respect to the algorithm hyperparameters. In contrast, its dual, minimizing the time to reach a target loss, is believed to be non-differentiable, as the time is not differentiable. As a result, it usually serves as a conceptual framework or is optimized using zeroth-order methods. To address this limitation, we propose a differentiable st"},"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":"2505.22509","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-05-28T15:59:13Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"481020564feb961e08fe4388df35862cc97fd2947aece24cf816113ad2b80646","abstract_canon_sha256":"1d5ae654681420773bcbf4c996c0135ccfaac71ef22ae545c957dd33c6b5aa48"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:11:25.546482Z","signature_b64":"aGCKO2d6KTYHu5x+exhpcNAJKYxDl5qn9pBnWTd17weyXdM3Y6IJ9/ha0QQuI41S3V2SfVzR82Svmvmgr7mxAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c7070959104014c303f30ed5eaf3d36b792a3c1aeb7bbd6c721bf134068538b6","last_reissued_at":"2026-07-05T11:11:25.545851Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:11:25.545851Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Accelerating Optimization via Differentiable Stopping Time","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.LG","authors_text":"Haoran Yuan, Yiman Fong, Zaiwen Wen, Zhonglin Xie","submitted_at":"2025-05-28T15:59:13Z","abstract_excerpt":"Optimization is an important module of modern machine learning applications. Tremendous efforts have been made to accelerate optimization algorithms. A common formulation is achieving a lower loss at a given time. This enables a differentiable framework with respect to the algorithm hyperparameters. In contrast, its dual, minimizing the time to reach a target loss, is believed to be non-differentiable, as the time is not differentiable. As a result, it usually serves as a conceptual framework or is optimized using zeroth-order methods. To address this limitation, we propose a differentiable st"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.22509","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/2505.22509/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":"2505.22509","created_at":"2026-07-05T11:11:25.545919+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.22509v1","created_at":"2026-07-05T11:11:25.545919+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.22509","created_at":"2026-07-05T11:11:25.545919+00:00"},{"alias_kind":"pith_short_12","alias_value":"Y4DQSWIQIAKM","created_at":"2026-07-05T11:11:25.545919+00:00"},{"alias_kind":"pith_short_16","alias_value":"Y4DQSWIQIAKMGA7T","created_at":"2026-07-05T11:11:25.545919+00:00"},{"alias_kind":"pith_short_8","alias_value":"Y4DQSWIQ","created_at":"2026-07-05T11:11:25.545919+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.12491","citing_title":"Elastic Attention Cores for Scalable Vision Transformers","ref_index":42,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/Y4DQSWIQIAKMGA7TB3K6V46TNN","json":"https://pith.science/pith/Y4DQSWIQIAKMGA7TB3K6V46TNN.json","graph_json":"https://pith.science/api/pith-number/Y4DQSWIQIAKMGA7TB3K6V46TNN/graph.json","events_json":"https://pith.science/api/pith-number/Y4DQSWIQIAKMGA7TB3K6V46TNN/events.json","paper":"https://pith.science/paper/Y4DQSWIQ"},"agent_actions":{"view_html":"https://pith.science/pith/Y4DQSWIQIAKMGA7TB3K6V46TNN","download_json":"https://pith.science/pith/Y4DQSWIQIAKMGA7TB3K6V46TNN.json","view_paper":"https://pith.science/paper/Y4DQSWIQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.22509&json=true","fetch_graph":"https://pith.science/api/pith-number/Y4DQSWIQIAKMGA7TB3K6V46TNN/graph.json","fetch_events":"https://pith.science/api/pith-number/Y4DQSWIQIAKMGA7TB3K6V46TNN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Y4DQSWIQIAKMGA7TB3K6V46TNN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Y4DQSWIQIAKMGA7TB3K6V46TNN/action/storage_attestation","attest_author":"https://pith.science/pith/Y4DQSWIQIAKMGA7TB3K6V46TNN/action/author_attestation","sign_citation":"https://pith.science/pith/Y4DQSWIQIAKMGA7TB3K6V46TNN/action/citation_signature","submit_replication":"https://pith.science/pith/Y4DQSWIQIAKMGA7TB3K6V46TNN/action/replication_record"}},"created_at":"2026-07-05T11:11:25.545919+00:00","updated_at":"2026-07-05T11:11:25.545919+00:00"}