{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:PLNVEA7M7JV7KKNACUYS6KQGE7","short_pith_number":"pith:PLNVEA7M","schema_version":"1.0","canonical_sha256":"7adb5203ecfa6bf529a015312f2a0627f83ab2b9cf14134a26bdcb27d9bbac43","source":{"kind":"arxiv","id":"1206.4657","version":1},"attestation_state":"computed","paper":{"title":"Projection-free Online Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.LG","authors_text":"Elad Hazan (Technion), Satyen Kale (IBM T.J. Watson Research Center)","submitted_at":"2012-06-18T15:26:34Z","abstract_excerpt":"The computational bottleneck in applying online learning to massive data sets is usually the projection step. We present efficient online learning algorithms that eschew projections in favor of much more efficient linear optimization steps using the Frank-Wolfe technique. We obtain a range of regret bounds for online convex optimization, with better bounds for specific cases such as stochastic online smooth convex optimization.\n  Besides the computational advantage, other desirable features of our algorithms are that they are parameter-free in the stochastic case and produce sparse decisions. "},"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":"1206.4657","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-06-18T15:26:34Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"fdb7c8d55fa9cab84adb40518c728703a1190d23c36a3771f2483b84328890de","abstract_canon_sha256":"5ebf4cbd8a20dd8a360ffa2f0b09a7b2cda3e64d718297fc2d85e2ce07d3b531"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:53:04.243922Z","signature_b64":"2BObCqQdPuPmaUdhfK0p70QyBAyB+TujeJIfTuEG+HajjyZXsOub7WOFQut2btn2bM1iqfOFsUdVcBKEvlrcCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7adb5203ecfa6bf529a015312f2a0627f83ab2b9cf14134a26bdcb27d9bbac43","last_reissued_at":"2026-05-18T03:53:04.243087Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:53:04.243087Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Projection-free Online Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.LG","authors_text":"Elad Hazan (Technion), Satyen Kale (IBM T.J. Watson Research Center)","submitted_at":"2012-06-18T15:26:34Z","abstract_excerpt":"The computational bottleneck in applying online learning to massive data sets is usually the projection step. We present efficient online learning algorithms that eschew projections in favor of much more efficient linear optimization steps using the Frank-Wolfe technique. We obtain a range of regret bounds for online convex optimization, with better bounds for specific cases such as stochastic online smooth convex optimization.\n  Besides the computational advantage, other desirable features of our algorithms are that they are parameter-free in the stochastic case and produce sparse decisions. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.4657","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":"1206.4657","created_at":"2026-05-18T03:53:04.243210+00:00"},{"alias_kind":"arxiv_version","alias_value":"1206.4657v1","created_at":"2026-05-18T03:53:04.243210+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.4657","created_at":"2026-05-18T03:53:04.243210+00:00"},{"alias_kind":"pith_short_12","alias_value":"PLNVEA7M7JV7","created_at":"2026-05-18T12:27:18.751474+00:00"},{"alias_kind":"pith_short_16","alias_value":"PLNVEA7M7JV7KKNA","created_at":"2026-05-18T12:27:18.751474+00:00"},{"alias_kind":"pith_short_8","alias_value":"PLNVEA7M","created_at":"2026-05-18T12:27:18.751474+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.07529","citing_title":"Training Deep Learning Models with Norm-Constrained LMOs","ref_index":180,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PLNVEA7M7JV7KKNACUYS6KQGE7","json":"https://pith.science/pith/PLNVEA7M7JV7KKNACUYS6KQGE7.json","graph_json":"https://pith.science/api/pith-number/PLNVEA7M7JV7KKNACUYS6KQGE7/graph.json","events_json":"https://pith.science/api/pith-number/PLNVEA7M7JV7KKNACUYS6KQGE7/events.json","paper":"https://pith.science/paper/PLNVEA7M"},"agent_actions":{"view_html":"https://pith.science/pith/PLNVEA7M7JV7KKNACUYS6KQGE7","download_json":"https://pith.science/pith/PLNVEA7M7JV7KKNACUYS6KQGE7.json","view_paper":"https://pith.science/paper/PLNVEA7M","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1206.4657&json=true","fetch_graph":"https://pith.science/api/pith-number/PLNVEA7M7JV7KKNACUYS6KQGE7/graph.json","fetch_events":"https://pith.science/api/pith-number/PLNVEA7M7JV7KKNACUYS6KQGE7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PLNVEA7M7JV7KKNACUYS6KQGE7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PLNVEA7M7JV7KKNACUYS6KQGE7/action/storage_attestation","attest_author":"https://pith.science/pith/PLNVEA7M7JV7KKNACUYS6KQGE7/action/author_attestation","sign_citation":"https://pith.science/pith/PLNVEA7M7JV7KKNACUYS6KQGE7/action/citation_signature","submit_replication":"https://pith.science/pith/PLNVEA7M7JV7KKNACUYS6KQGE7/action/replication_record"}},"created_at":"2026-05-18T03:53:04.243210+00:00","updated_at":"2026-05-18T03:53:04.243210+00:00"}