{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:GI4GPCV3RXE54UIT6NYVIAGK7G","short_pith_number":"pith:GI4GPCV3","schema_version":"1.0","canonical_sha256":"3238678abb8dc9de5113f3715400caf99bb6c1356275d7468b83215f4d7e46f5","source":{"kind":"arxiv","id":"2605.25255","version":1},"attestation_state":"computed","paper":{"title":"Boosted Stochastic Frank-Wolfe for Constrained Nonconvex Optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"math.OC","authors_text":"Abbas Khademi, Antonio Silveti-Falls, Navil Nandhan","submitted_at":"2026-05-24T21:04:26Z","abstract_excerpt":"The boosted Frank-Wolfe algorithm accelerates the classical Frank-Wolfe algorithm by better aligning the update direction with the negative gradient. Its analysis, however, has been limited to deterministic convex problems, with step sizes that require either line search or knowledge of the Lipschitz constant of the gradient. We develop a novel step size strategy that does not depend on the Lipschitz constant of the gradient, which allows us to extend the boosted Frank-Wolfe algorithm to the stochastic setting. We prove that boosting with this step size strategy can be combined with many moder"},"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":"2605.25255","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-05-24T21:04:26Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"393fec1fc7ec1d15e50155676db307f594cdea2cb140a11f0a98e17b52506094","abstract_canon_sha256":"7eb29678e73cc4e36bd559954b2287c110d3d120e954bda5836e640342a19ebc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-26T02:04:25.755966Z","signature_b64":"4B3SCjIF8p0nY8tjk0tAbRvojlsmTgs7JfWQE8C+Ii9WdWrwMLKuuH2kTpESpsv17V4j/D67ZCwypyKsUVezAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3238678abb8dc9de5113f3715400caf99bb6c1356275d7468b83215f4d7e46f5","last_reissued_at":"2026-05-26T02:04:25.755090Z","signature_status":"signed_v1","first_computed_at":"2026-05-26T02:04:25.755090Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Boosted Stochastic Frank-Wolfe for Constrained Nonconvex Optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"math.OC","authors_text":"Abbas Khademi, Antonio Silveti-Falls, Navil Nandhan","submitted_at":"2026-05-24T21:04:26Z","abstract_excerpt":"The boosted Frank-Wolfe algorithm accelerates the classical Frank-Wolfe algorithm by better aligning the update direction with the negative gradient. Its analysis, however, has been limited to deterministic convex problems, with step sizes that require either line search or knowledge of the Lipschitz constant of the gradient. We develop a novel step size strategy that does not depend on the Lipschitz constant of the gradient, which allows us to extend the boosted Frank-Wolfe algorithm to the stochastic setting. We prove that boosting with this step size strategy can be combined with many moder"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.25255","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/2605.25255/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":"2605.25255","created_at":"2026-05-26T02:04:25.755235+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.25255v1","created_at":"2026-05-26T02:04:25.755235+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.25255","created_at":"2026-05-26T02:04:25.755235+00:00"},{"alias_kind":"pith_short_12","alias_value":"GI4GPCV3RXE5","created_at":"2026-05-26T02:04:25.755235+00:00"},{"alias_kind":"pith_short_16","alias_value":"GI4GPCV3RXE54UIT","created_at":"2026-05-26T02:04:25.755235+00:00"},{"alias_kind":"pith_short_8","alias_value":"GI4GPCV3","created_at":"2026-05-26T02:04:25.755235+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/GI4GPCV3RXE54UIT6NYVIAGK7G","json":"https://pith.science/pith/GI4GPCV3RXE54UIT6NYVIAGK7G.json","graph_json":"https://pith.science/api/pith-number/GI4GPCV3RXE54UIT6NYVIAGK7G/graph.json","events_json":"https://pith.science/api/pith-number/GI4GPCV3RXE54UIT6NYVIAGK7G/events.json","paper":"https://pith.science/paper/GI4GPCV3"},"agent_actions":{"view_html":"https://pith.science/pith/GI4GPCV3RXE54UIT6NYVIAGK7G","download_json":"https://pith.science/pith/GI4GPCV3RXE54UIT6NYVIAGK7G.json","view_paper":"https://pith.science/paper/GI4GPCV3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.25255&json=true","fetch_graph":"https://pith.science/api/pith-number/GI4GPCV3RXE54UIT6NYVIAGK7G/graph.json","fetch_events":"https://pith.science/api/pith-number/GI4GPCV3RXE54UIT6NYVIAGK7G/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GI4GPCV3RXE54UIT6NYVIAGK7G/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GI4GPCV3RXE54UIT6NYVIAGK7G/action/storage_attestation","attest_author":"https://pith.science/pith/GI4GPCV3RXE54UIT6NYVIAGK7G/action/author_attestation","sign_citation":"https://pith.science/pith/GI4GPCV3RXE54UIT6NYVIAGK7G/action/citation_signature","submit_replication":"https://pith.science/pith/GI4GPCV3RXE54UIT6NYVIAGK7G/action/replication_record"}},"created_at":"2026-05-26T02:04:25.755235+00:00","updated_at":"2026-05-26T02:04:25.755235+00:00"}