{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:WPLELGVPGZFU242NOZVNMAUQIU","short_pith_number":"pith:WPLELGVP","schema_version":"1.0","canonical_sha256":"b3d6459aaf364b4d734d766ad60290450d829369d96e1f0e90a383406a9e67d6","source":{"kind":"arxiv","id":"1902.09013","version":1},"attestation_state":"computed","paper":{"title":"Artificial Constraints and Lipschitz Hints for Unconstrained Online Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.OC"],"primary_cat":"stat.ML","authors_text":"Ashok Cutkosky","submitted_at":"2019-02-24T20:30:59Z","abstract_excerpt":"We provide algorithms that guarantee regret $R_T(u)\\le \\tilde O(G\\|u\\|^3 + G(\\|u\\|+1)\\sqrt{T})$ or $R_T(u)\\le \\tilde O(G\\|u\\|^3T^{1/3} + GT^{1/3}+ G\\|u\\|\\sqrt{T})$ for online convex optimization with $G$-Lipschitz losses for any comparison point $u$ without prior knowledge of either $G$ or $\\|u\\|$. Previous algorithms dispense with the $O(\\|u\\|^3)$ term at the expense of knowledge of one or both of these parameters, while a lower bound shows that some additional penalty term over $G\\|u\\|\\sqrt{T}$ is necessary. Previous penalties were exponential while our bounds are polynomial in all quantitie"},"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":"1902.09013","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-02-24T20:30:59Z","cross_cats_sorted":["cs.LG","math.OC"],"title_canon_sha256":"2b0607177b63cd331f32fe01f273c882aa077461e23dad52713505136deb933c","abstract_canon_sha256":"ce716c07cd22ad739daa0ac9849fd05472726f350cacb6ae2b6be2870b2754a8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:52:46.923237Z","signature_b64":"ej5a8+y7/jTQZZfSNSn3wec+nVa8YShIvGckJi69IqvqUWX2GBbLQqOgwacfWe0nZAWByQFubAtXR7D8NGUhCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b3d6459aaf364b4d734d766ad60290450d829369d96e1f0e90a383406a9e67d6","last_reissued_at":"2026-05-17T23:52:46.922620Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:52:46.922620Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Artificial Constraints and Lipschitz Hints for Unconstrained Online Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.OC"],"primary_cat":"stat.ML","authors_text":"Ashok Cutkosky","submitted_at":"2019-02-24T20:30:59Z","abstract_excerpt":"We provide algorithms that guarantee regret $R_T(u)\\le \\tilde O(G\\|u\\|^3 + G(\\|u\\|+1)\\sqrt{T})$ or $R_T(u)\\le \\tilde O(G\\|u\\|^3T^{1/3} + GT^{1/3}+ G\\|u\\|\\sqrt{T})$ for online convex optimization with $G$-Lipschitz losses for any comparison point $u$ without prior knowledge of either $G$ or $\\|u\\|$. Previous algorithms dispense with the $O(\\|u\\|^3)$ term at the expense of knowledge of one or both of these parameters, while a lower bound shows that some additional penalty term over $G\\|u\\|\\sqrt{T}$ is necessary. Previous penalties were exponential while our bounds are polynomial in all quantitie"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.09013","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":"1902.09013","created_at":"2026-05-17T23:52:46.922699+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.09013v1","created_at":"2026-05-17T23:52:46.922699+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.09013","created_at":"2026-05-17T23:52:46.922699+00:00"},{"alias_kind":"pith_short_12","alias_value":"WPLELGVPGZFU","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_16","alias_value":"WPLELGVPGZFU242N","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_8","alias_value":"WPLELGVP","created_at":"2026-05-18T12:33:30.264802+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/WPLELGVPGZFU242NOZVNMAUQIU","json":"https://pith.science/pith/WPLELGVPGZFU242NOZVNMAUQIU.json","graph_json":"https://pith.science/api/pith-number/WPLELGVPGZFU242NOZVNMAUQIU/graph.json","events_json":"https://pith.science/api/pith-number/WPLELGVPGZFU242NOZVNMAUQIU/events.json","paper":"https://pith.science/paper/WPLELGVP"},"agent_actions":{"view_html":"https://pith.science/pith/WPLELGVPGZFU242NOZVNMAUQIU","download_json":"https://pith.science/pith/WPLELGVPGZFU242NOZVNMAUQIU.json","view_paper":"https://pith.science/paper/WPLELGVP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.09013&json=true","fetch_graph":"https://pith.science/api/pith-number/WPLELGVPGZFU242NOZVNMAUQIU/graph.json","fetch_events":"https://pith.science/api/pith-number/WPLELGVPGZFU242NOZVNMAUQIU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WPLELGVPGZFU242NOZVNMAUQIU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WPLELGVPGZFU242NOZVNMAUQIU/action/storage_attestation","attest_author":"https://pith.science/pith/WPLELGVPGZFU242NOZVNMAUQIU/action/author_attestation","sign_citation":"https://pith.science/pith/WPLELGVPGZFU242NOZVNMAUQIU/action/citation_signature","submit_replication":"https://pith.science/pith/WPLELGVPGZFU242NOZVNMAUQIU/action/replication_record"}},"created_at":"2026-05-17T23:52:46.922699+00:00","updated_at":"2026-05-17T23:52:46.922699+00:00"}