{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:A6BRQR6WARCZXDULUBFGMT4KPR","short_pith_number":"pith:A6BRQR6W","schema_version":"1.0","canonical_sha256":"07831847d604459b8e8ba04a664f8a7c423ce35911d4f9b7e27b454aba26c445","source":{"kind":"arxiv","id":"1704.04010","version":1},"attestation_state":"computed","paper":{"title":"ZigZag: A new approach to adaptive online learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Alexander Rakhlin, Dylan J. Foster, Karthik Sridharan","submitted_at":"2017-04-13T06:50:34Z","abstract_excerpt":"We develop a novel family of algorithms for the online learning setting with regret against any data sequence bounded by the empirical Rademacher complexity of that sequence. To develop a general theory of when this type of adaptive regret bound is achievable we establish a connection to the theory of decoupling inequalities for martingales in Banach spaces. When the hypothesis class is a set of linear functions bounded in some norm, such a regret bound is achievable if and only if the norm satisfies certain decoupling inequalities for martingales. Donald Burkholder's celebrated geometric char"},"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":"1704.04010","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-04-13T06:50:34Z","cross_cats_sorted":["math.OC","stat.ML"],"title_canon_sha256":"aa5715c5c35c97bfe1ea481586d66866e977d12ba0484985afc8df4573d36901","abstract_canon_sha256":"d72b3a120f986331fcaf6b884e4c10d4fd79e6a2560734d0a69cf536b375310e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:25.621022Z","signature_b64":"Bqn1WapGI3+3OenL1mDWCXC+Z9YvsjXyg46vNlT+Y2NFG7i7g5RCCI+sfoBipE6KA8FZ1rxqPr7ODBaB8zeMAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"07831847d604459b8e8ba04a664f8a7c423ce35911d4f9b7e27b454aba26c445","last_reissued_at":"2026-05-18T00:46:25.620510Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:25.620510Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"ZigZag: A new approach to adaptive online learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Alexander Rakhlin, Dylan J. Foster, Karthik Sridharan","submitted_at":"2017-04-13T06:50:34Z","abstract_excerpt":"We develop a novel family of algorithms for the online learning setting with regret against any data sequence bounded by the empirical Rademacher complexity of that sequence. To develop a general theory of when this type of adaptive regret bound is achievable we establish a connection to the theory of decoupling inequalities for martingales in Banach spaces. When the hypothesis class is a set of linear functions bounded in some norm, such a regret bound is achievable if and only if the norm satisfies certain decoupling inequalities for martingales. Donald Burkholder's celebrated geometric char"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.04010","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":"1704.04010","created_at":"2026-05-18T00:46:25.620599+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.04010v1","created_at":"2026-05-18T00:46:25.620599+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.04010","created_at":"2026-05-18T00:46:25.620599+00:00"},{"alias_kind":"pith_short_12","alias_value":"A6BRQR6WARCZ","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_16","alias_value":"A6BRQR6WARCZXDUL","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_8","alias_value":"A6BRQR6W","created_at":"2026-05-18T12:31:05.417338+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/A6BRQR6WARCZXDULUBFGMT4KPR","json":"https://pith.science/pith/A6BRQR6WARCZXDULUBFGMT4KPR.json","graph_json":"https://pith.science/api/pith-number/A6BRQR6WARCZXDULUBFGMT4KPR/graph.json","events_json":"https://pith.science/api/pith-number/A6BRQR6WARCZXDULUBFGMT4KPR/events.json","paper":"https://pith.science/paper/A6BRQR6W"},"agent_actions":{"view_html":"https://pith.science/pith/A6BRQR6WARCZXDULUBFGMT4KPR","download_json":"https://pith.science/pith/A6BRQR6WARCZXDULUBFGMT4KPR.json","view_paper":"https://pith.science/paper/A6BRQR6W","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.04010&json=true","fetch_graph":"https://pith.science/api/pith-number/A6BRQR6WARCZXDULUBFGMT4KPR/graph.json","fetch_events":"https://pith.science/api/pith-number/A6BRQR6WARCZXDULUBFGMT4KPR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/A6BRQR6WARCZXDULUBFGMT4KPR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/A6BRQR6WARCZXDULUBFGMT4KPR/action/storage_attestation","attest_author":"https://pith.science/pith/A6BRQR6WARCZXDULUBFGMT4KPR/action/author_attestation","sign_citation":"https://pith.science/pith/A6BRQR6WARCZXDULUBFGMT4KPR/action/citation_signature","submit_replication":"https://pith.science/pith/A6BRQR6WARCZXDULUBFGMT4KPR/action/replication_record"}},"created_at":"2026-05-18T00:46:25.620599+00:00","updated_at":"2026-05-18T00:46:25.620599+00:00"}