{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:NQRML5KOQIVPB6KM36FRWAFRQA","short_pith_number":"pith:NQRML5KO","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"},"canonical_sha256":"6c22c5f54e822af0f94cdf8b1b00b18014f004bdd28204cf11e1634f35521063","source":{"kind":"arxiv","id":"1906.01621","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.01621","created_at":"2026-05-17T23:44:15Z"},{"alias_kind":"arxiv_version","alias_value":"1906.01621v1","created_at":"2026-05-17T23:44:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.01621","created_at":"2026-05-17T23:44:15Z"},{"alias_kind":"pith_short_12","alias_value":"NQRML5KOQIVP","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"NQRML5KOQIVPB6KM","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"NQRML5KO","created_at":"2026-05-18T12:33:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:NQRML5KOQIVPB6KM36FRWAFRQA","target":"record","payload":{"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"},"canonical_sha256":"6c22c5f54e822af0f94cdf8b1b00b18014f004bdd28204cf11e1634f35521063","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"},"source_kind":"arxiv","source_id":"1906.01621","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:44:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YBucWeRL2JKbskxDWT1HRfjc+mF35Gsh5W2uW1cDxml0wtBYdmuFISDAtRrje2pS0RJiW7BaQnzJxnD47N+KBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T04:59:11.863991Z"},"content_sha256":"2feb886c3568dc3a75580d4a57b6014fb10672713893f80be249951053f20b87","schema_version":"1.0","event_id":"sha256:2feb886c3568dc3a75580d4a57b6014fb10672713893f80be249951053f20b87"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:NQRML5KOQIVPB6KM36FRWAFRQA","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:44:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/XXufDUSaRLQSG1obxpEfIgr/pSc5lFQI4RuzEDy4OXPVePFIQkKnJPRvq1QMMzcHC6JWOK1MamtiJ5A0kxtCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T04:59:11.864725Z"},"content_sha256":"487082785d9e4a5754137d3e87c7313980d76ed46b6e306e3732edc30ca2a1b0","schema_version":"1.0","event_id":"sha256:487082785d9e4a5754137d3e87c7313980d76ed46b6e306e3732edc30ca2a1b0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NQRML5KOQIVPB6KM36FRWAFRQA/bundle.json","state_url":"https://pith.science/pith/NQRML5KOQIVPB6KM36FRWAFRQA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NQRML5KOQIVPB6KM36FRWAFRQA/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-09T04:59:11Z","links":{"resolver":"https://pith.science/pith/NQRML5KOQIVPB6KM36FRWAFRQA","bundle":"https://pith.science/pith/NQRML5KOQIVPB6KM36FRWAFRQA/bundle.json","state":"https://pith.science/pith/NQRML5KOQIVPB6KM36FRWAFRQA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NQRML5KOQIVPB6KM36FRWAFRQA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:NQRML5KOQIVPB6KM36FRWAFRQA","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"e8f82477c8869f50484fdcaa4a1b02c413c036b450b0a1e1ba20ac8590bbe8f1","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-06-04T17:54:44Z","title_canon_sha256":"0cc394ee091c83fa2ec1179b416124639810f159798a395af277eb49a9cd2275"},"schema_version":"1.0","source":{"id":"1906.01621","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.01621","created_at":"2026-05-17T23:44:15Z"},{"alias_kind":"arxiv_version","alias_value":"1906.01621v1","created_at":"2026-05-17T23:44:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.01621","created_at":"2026-05-17T23:44:15Z"},{"alias_kind":"pith_short_12","alias_value":"NQRML5KOQIVP","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"NQRML5KOQIVPB6KM","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"NQRML5KO","created_at":"2026-05-18T12:33:24Z"}],"graph_snapshots":[{"event_id":"sha256:487082785d9e4a5754137d3e87c7313980d76ed46b6e306e3732edc30ca2a1b0","target":"graph","created_at":"2026-05-17T23:44:15Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Brian Bullins, Richard Peng","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-06-04T17:54:44Z","title":"Higher-Order Accelerated Methods for Faster Non-Smooth Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.01621","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:2feb886c3568dc3a75580d4a57b6014fb10672713893f80be249951053f20b87","target":"record","created_at":"2026-05-17T23:44:15Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"e8f82477c8869f50484fdcaa4a1b02c413c036b450b0a1e1ba20ac8590bbe8f1","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-06-04T17:54:44Z","title_canon_sha256":"0cc394ee091c83fa2ec1179b416124639810f159798a395af277eb49a9cd2275"},"schema_version":"1.0","source":{"id":"1906.01621","kind":"arxiv","version":1}},"canonical_sha256":"6c22c5f54e822af0f94cdf8b1b00b18014f004bdd28204cf11e1634f35521063","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6c22c5f54e822af0f94cdf8b1b00b18014f004bdd28204cf11e1634f35521063","first_computed_at":"2026-05-17T23:44:15.940661Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:44:15.940661Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Ld97aNCMEyjCREjF5NK2oWebZPWidgZJcnz465zhUdUdJCR4fML3u7lAZ3Z27+U9BYjnhM5eA65rbFNkY9A1DA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:44:15.941147Z","signed_message":"canonical_sha256_bytes"},"source_id":"1906.01621","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2feb886c3568dc3a75580d4a57b6014fb10672713893f80be249951053f20b87","sha256:487082785d9e4a5754137d3e87c7313980d76ed46b6e306e3732edc30ca2a1b0"],"state_sha256":"d6b7c484d0a0cfe12b6ba544057cc973991afe0d6d526ac8e421ef9805e6ab5f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8bj25xd/kTgX3RbhRFw6LoSttq5J0nMAMdnjNKF90ltKVLMUjmajtAm+MKldGUHrqSowMp+ntBZmU7a96+tQAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T04:59:11.868677Z","bundle_sha256":"a4e5d52f44fd0427f7c6d489f8fa76d25d10bf48e0bc3e8d13cce093f1b3a138"}}