{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:ZKSWBLSL4QKXU2DAWX2O2UTMMD","short_pith_number":"pith:ZKSWBLSL","schema_version":"1.0","canonical_sha256":"caa560ae4be4157a6860b5f4ed526c60fa3dc69e9f8a60d2e22e82b19fb8ab6e","source":{"kind":"arxiv","id":"2510.16468","version":4},"attestation_state":"computed","paper":{"title":"Frank-Wolfe Algorithms for (L0, L1)-smooth functions","license":"http://creativecommons.org/licenses/by/4.0/","headline":"A new Frank-Wolfe algorithm for (L0, L1)-smooth objectives achieves superior convergence rates.","cross_cats":[],"primary_cat":"math.OC","authors_text":"A.A. Vyguzov, F.S. Stonyakin","submitted_at":"2025-10-18T12:26:28Z","abstract_excerpt":"We propose a new version of the Frank-Wolfe method, called the (L0, L1)-Frank-Wolfe algorithm, developed for optimization problems with (L0, L1)-smooth objectives. We establish that this algorithm achieves superior theoretical convergence rates compared to the classical Frank-Wolfe method. In addition, we introduce a novel adaptive procedure, termed the Adaptive (L0, L1)-Frank-Wolfe algorithm, which dynamically adjusts the smoothness parameters to further improve performance and stability. Comprehensive numerical experiments confirm the theoretical results and demonstrate the clear practical a"},"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":true},"canonical_record":{"source":{"id":"2510.16468","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-10-18T12:26:28Z","cross_cats_sorted":[],"title_canon_sha256":"324819c9c870dcb17eba9ffc5dff056b33cbf1e04dac2eaeb1520025e6c1a4b4","abstract_canon_sha256":"68e4402496ee81ed2d3e59ae8b673502998b2970a0b4e6a88a6fefaa6c53a889"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-21T01:05:11.072293Z","signature_b64":"W7qRNRWKOQapr4lLwYGEuUpMhY13OqKeRSg/3bSgAEtTIoPNS4cgswu0hUL+ZvjsXiCr72IONWCrZglxy/qRBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"caa560ae4be4157a6860b5f4ed526c60fa3dc69e9f8a60d2e22e82b19fb8ab6e","last_reissued_at":"2026-05-21T01:05:11.071362Z","signature_status":"signed_v1","first_computed_at":"2026-05-21T01:05:11.071362Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Frank-Wolfe Algorithms for (L0, L1)-smooth functions","license":"http://creativecommons.org/licenses/by/4.0/","headline":"A new Frank-Wolfe algorithm for (L0, L1)-smooth objectives achieves superior convergence rates.","cross_cats":[],"primary_cat":"math.OC","authors_text":"A.A. Vyguzov, F.S. Stonyakin","submitted_at":"2025-10-18T12:26:28Z","abstract_excerpt":"We propose a new version of the Frank-Wolfe method, called the (L0, L1)-Frank-Wolfe algorithm, developed for optimization problems with (L0, L1)-smooth objectives. We establish that this algorithm achieves superior theoretical convergence rates compared to the classical Frank-Wolfe method. In addition, we introduce a novel adaptive procedure, termed the Adaptive (L0, L1)-Frank-Wolfe algorithm, which dynamically adjusts the smoothness parameters to further improve performance and stability. Comprehensive numerical experiments confirm the theoretical results and demonstrate the clear practical a"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"We establish that this algorithm achieves superior theoretical convergence rates compared to the classical Frank-Wolfe method.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The objective functions satisfy the (L0, L1)-smoothness condition that the new algorithm is designed to exploit for its improved rates (as stated in the abstract).","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"A new (L0, L1)-Frank-Wolfe algorithm and its adaptive version are proposed for (L0, L1)-smooth optimization, with claims of better theoretical convergence rates and practical advantages over standard Frank-Wolfe methods.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"A new Frank-Wolfe algorithm for (L0, L1)-smooth objectives achieves superior convergence rates.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"f69488c153b3381d1262d104e41cb24dd5f3c7a03104f40775dde4e564f9e371"},"source":{"id":"2510.16468","kind":"arxiv","version":4},"verdict":{"id":"cfd172e3-73aa-42bf-a8b3-266c147a7798","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-18T06:15:35.242813Z","strongest_claim":"We establish that this algorithm achieves superior theoretical convergence rates compared to the classical Frank-Wolfe method.","one_line_summary":"A new (L0, L1)-Frank-Wolfe algorithm and its adaptive version are proposed for (L0, L1)-smooth optimization, with claims of better theoretical convergence rates and practical advantages over standard Frank-Wolfe methods.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The objective functions satisfy the (L0, L1)-smoothness condition that the new algorithm is designed to exploit for its improved rates (as stated in the abstract).","pith_extraction_headline":"A new Frank-Wolfe algorithm for (L0, L1)-smooth objectives achieves superior convergence rates."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2510.16468/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":2,"snapshot_sha256":"f6aae87b4addc9041ad5739415c2be3cd33ab177968fcf0a87322f24fdeb2c43"},"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":"2510.16468","created_at":"2026-05-21T01:05:11.071481+00:00"},{"alias_kind":"arxiv_version","alias_value":"2510.16468v4","created_at":"2026-05-21T01:05:11.071481+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2510.16468","created_at":"2026-05-21T01:05:11.071481+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZKSWBLSL4QKX","created_at":"2026-05-21T01:05:11.071481+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZKSWBLSL4QKXU2DA","created_at":"2026-05-21T01:05:11.071481+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZKSWBLSL","created_at":"2026-05-21T01:05:11.071481+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":2,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZKSWBLSL4QKXU2DAWX2O2UTMMD","json":"https://pith.science/pith/ZKSWBLSL4QKXU2DAWX2O2UTMMD.json","graph_json":"https://pith.science/api/pith-number/ZKSWBLSL4QKXU2DAWX2O2UTMMD/graph.json","events_json":"https://pith.science/api/pith-number/ZKSWBLSL4QKXU2DAWX2O2UTMMD/events.json","paper":"https://pith.science/paper/ZKSWBLSL"},"agent_actions":{"view_html":"https://pith.science/pith/ZKSWBLSL4QKXU2DAWX2O2UTMMD","download_json":"https://pith.science/pith/ZKSWBLSL4QKXU2DAWX2O2UTMMD.json","view_paper":"https://pith.science/paper/ZKSWBLSL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2510.16468&json=true","fetch_graph":"https://pith.science/api/pith-number/ZKSWBLSL4QKXU2DAWX2O2UTMMD/graph.json","fetch_events":"https://pith.science/api/pith-number/ZKSWBLSL4QKXU2DAWX2O2UTMMD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZKSWBLSL4QKXU2DAWX2O2UTMMD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZKSWBLSL4QKXU2DAWX2O2UTMMD/action/storage_attestation","attest_author":"https://pith.science/pith/ZKSWBLSL4QKXU2DAWX2O2UTMMD/action/author_attestation","sign_citation":"https://pith.science/pith/ZKSWBLSL4QKXU2DAWX2O2UTMMD/action/citation_signature","submit_replication":"https://pith.science/pith/ZKSWBLSL4QKXU2DAWX2O2UTMMD/action/replication_record"}},"created_at":"2026-05-21T01:05:11.071481+00:00","updated_at":"2026-05-21T01:05:11.071481+00:00"}