{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:NQRML5KOQIVPB6KM36FRWAFRQA","short_pith_number":"pith:NQRML5KO","schema_version":"1.0","canonical_sha256":"6c22c5f54e822af0f94cdf8b1b00b18014f004bdd28204cf11e1634f35521063","source":{"kind":"arxiv","id":"1906.01621","version":1},"attestation_state":"computed","paper":{"title":"Higher-Order Accelerated Methods for Faster Non-Smooth Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"math.OC","authors_text":"Brian Bullins, Richard Peng","submitted_at":"2019-06-04T17:54:44Z","abstract_excerpt":"We provide improved convergence rates for various \\emph{non-smooth} optimization problems via higher-order accelerated methods. In the case of $\\ell_\\infty$ regression, we achieves an $O(\\epsilon^{-4/5})$ iteration complexity, breaking the $O(\\epsilon^{-1})$ barrier so far present for previous methods. We arrive at a similar rate for the problem of $\\ell_1$-SVM, going beyond what is attainable by first-order methods with prox-oracle access for non-smooth non-strongly convex problems. We further show how to achieve even faster rates by introducing higher-order regularization.\n  Our results rely"},"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":"1906.01621","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-06-04T17:54:44Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"0cc394ee091c83fa2ec1179b416124639810f159798a395af277eb49a9cd2275","abstract_canon_sha256":"e8f82477c8869f50484fdcaa4a1b02c413c036b450b0a1e1ba20ac8590bbe8f1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:15.941147Z","signature_b64":"Ld97aNCMEyjCREjF5NK2oWebZPWidgZJcnz465zhUdUdJCR4fML3u7lAZ3Z27+U9BYjnhM5eA65rbFNkY9A1DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6c22c5f54e822af0f94cdf8b1b00b18014f004bdd28204cf11e1634f35521063","last_reissued_at":"2026-05-17T23:44:15.940661Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:15.940661Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Higher-Order Accelerated Methods for Faster Non-Smooth Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"math.OC","authors_text":"Brian Bullins, Richard Peng","submitted_at":"2019-06-04T17:54:44Z","abstract_excerpt":"We provide improved convergence rates for various \\emph{non-smooth} optimization problems via higher-order accelerated methods. In the case of $\\ell_\\infty$ regression, we achieves an $O(\\epsilon^{-4/5})$ iteration complexity, breaking the $O(\\epsilon^{-1})$ barrier so far present for previous methods. We arrive at a similar rate for the problem of $\\ell_1$-SVM, going beyond what is attainable by first-order methods with prox-oracle access for non-smooth non-strongly convex problems. We further show how to achieve even faster rates by introducing higher-order regularization.\n  Our results rely"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.01621","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":""},"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":"1906.01621","created_at":"2026-05-17T23:44:15.940733+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.01621v1","created_at":"2026-05-17T23:44:15.940733+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.01621","created_at":"2026-05-17T23:44:15.940733+00:00"},{"alias_kind":"pith_short_12","alias_value":"NQRML5KOQIVP","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_16","alias_value":"NQRML5KOQIVPB6KM","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_8","alias_value":"NQRML5KO","created_at":"2026-05-18T12:33:24.271573+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/NQRML5KOQIVPB6KM36FRWAFRQA","json":"https://pith.science/pith/NQRML5KOQIVPB6KM36FRWAFRQA.json","graph_json":"https://pith.science/api/pith-number/NQRML5KOQIVPB6KM36FRWAFRQA/graph.json","events_json":"https://pith.science/api/pith-number/NQRML5KOQIVPB6KM36FRWAFRQA/events.json","paper":"https://pith.science/paper/NQRML5KO"},"agent_actions":{"view_html":"https://pith.science/pith/NQRML5KOQIVPB6KM36FRWAFRQA","download_json":"https://pith.science/pith/NQRML5KOQIVPB6KM36FRWAFRQA.json","view_paper":"https://pith.science/paper/NQRML5KO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.01621&json=true","fetch_graph":"https://pith.science/api/pith-number/NQRML5KOQIVPB6KM36FRWAFRQA/graph.json","fetch_events":"https://pith.science/api/pith-number/NQRML5KOQIVPB6KM36FRWAFRQA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NQRML5KOQIVPB6KM36FRWAFRQA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NQRML5KOQIVPB6KM36FRWAFRQA/action/storage_attestation","attest_author":"https://pith.science/pith/NQRML5KOQIVPB6KM36FRWAFRQA/action/author_attestation","sign_citation":"https://pith.science/pith/NQRML5KOQIVPB6KM36FRWAFRQA/action/citation_signature","submit_replication":"https://pith.science/pith/NQRML5KOQIVPB6KM36FRWAFRQA/action/replication_record"}},"created_at":"2026-05-17T23:44:15.940733+00:00","updated_at":"2026-05-17T23:44:15.940733+00:00"}