{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:MH2KVVAMOTB3YJMDV2JMM7FCT2","short_pith_number":"pith:MH2KVVAM","schema_version":"1.0","canonical_sha256":"61f4aad40c74c3bc2583ae92c67ca29eb2f1e0ac1808e7f42d619b7e6214d7f3","source":{"kind":"arxiv","id":"1802.04623","version":2},"attestation_state":"computed","paper":{"title":"Logarithmic Regret for Online Gradient Descent Beyond Strong Convexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.LG","authors_text":"Dan Garber","submitted_at":"2018-02-13T13:54:33Z","abstract_excerpt":"Hoffman's classical result gives a bound on the distance of a point from a convex and compact polytope in terms of the magnitude of violation of the constraints. Recently, several results showed that Hoffman's bound can be used to derive strongly-convex-like rates for first-order methods for \\textit{offline} convex optimization of curved, though not strongly convex, functions, over polyhedral sets. In this work, we use this classical result for the first time to obtain faster rates for \\textit{online convex optimization} over polyhedral sets with curved convex, though not strongly convex, loss"},"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":"1802.04623","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-02-13T13:54:33Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"5f5c86caaecd5e4c4a0430528f3d97250e0a79d8260bf59ef9fd85c5ad10c439","abstract_canon_sha256":"9d98c995ad8cf06c02a6257cd9f8cfebf72c26bfbe8a12e8714f04e23923ce7f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:53:51.692518Z","signature_b64":"lj8UOydlWzy7YpMbCGXFBUGzvn+c34sUbak0PzY0qHEaY8pO4NMoEALP4Qzww+o2Kp0lWmQUZ6TwGPtWK23WCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"61f4aad40c74c3bc2583ae92c67ca29eb2f1e0ac1808e7f42d619b7e6214d7f3","last_reissued_at":"2026-05-17T23:53:51.691851Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:53:51.691851Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Logarithmic Regret for Online Gradient Descent Beyond Strong Convexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.LG","authors_text":"Dan Garber","submitted_at":"2018-02-13T13:54:33Z","abstract_excerpt":"Hoffman's classical result gives a bound on the distance of a point from a convex and compact polytope in terms of the magnitude of violation of the constraints. Recently, several results showed that Hoffman's bound can be used to derive strongly-convex-like rates for first-order methods for \\textit{offline} convex optimization of curved, though not strongly convex, functions, over polyhedral sets. In this work, we use this classical result for the first time to obtain faster rates for \\textit{online convex optimization} over polyhedral sets with curved convex, though not strongly convex, loss"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.04623","kind":"arxiv","version":2},"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":"1802.04623","created_at":"2026-05-17T23:53:51.691990+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.04623v2","created_at":"2026-05-17T23:53:51.691990+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.04623","created_at":"2026-05-17T23:53:51.691990+00:00"},{"alias_kind":"pith_short_12","alias_value":"MH2KVVAMOTB3","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_16","alias_value":"MH2KVVAMOTB3YJMD","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_8","alias_value":"MH2KVVAM","created_at":"2026-05-18T12:32:37.024351+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/MH2KVVAMOTB3YJMDV2JMM7FCT2","json":"https://pith.science/pith/MH2KVVAMOTB3YJMDV2JMM7FCT2.json","graph_json":"https://pith.science/api/pith-number/MH2KVVAMOTB3YJMDV2JMM7FCT2/graph.json","events_json":"https://pith.science/api/pith-number/MH2KVVAMOTB3YJMDV2JMM7FCT2/events.json","paper":"https://pith.science/paper/MH2KVVAM"},"agent_actions":{"view_html":"https://pith.science/pith/MH2KVVAMOTB3YJMDV2JMM7FCT2","download_json":"https://pith.science/pith/MH2KVVAMOTB3YJMDV2JMM7FCT2.json","view_paper":"https://pith.science/paper/MH2KVVAM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.04623&json=true","fetch_graph":"https://pith.science/api/pith-number/MH2KVVAMOTB3YJMDV2JMM7FCT2/graph.json","fetch_events":"https://pith.science/api/pith-number/MH2KVVAMOTB3YJMDV2JMM7FCT2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MH2KVVAMOTB3YJMDV2JMM7FCT2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MH2KVVAMOTB3YJMDV2JMM7FCT2/action/storage_attestation","attest_author":"https://pith.science/pith/MH2KVVAMOTB3YJMDV2JMM7FCT2/action/author_attestation","sign_citation":"https://pith.science/pith/MH2KVVAMOTB3YJMDV2JMM7FCT2/action/citation_signature","submit_replication":"https://pith.science/pith/MH2KVVAMOTB3YJMDV2JMM7FCT2/action/replication_record"}},"created_at":"2026-05-17T23:53:51.691990+00:00","updated_at":"2026-05-17T23:53:51.691990+00:00"}