{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:2KCUWDC6SEIH7VAABWLI66LS4W","short_pith_number":"pith:2KCUWDC6","schema_version":"1.0","canonical_sha256":"d2854b0c5e91107fd4000d968f7972e59b976350efcd3e8b83de9c432fdbd25e","source":{"kind":"arxiv","id":"2506.07595","version":1},"attestation_state":"computed","paper":{"title":"Exploiting Curvature in Online Convex Optimization with Delayed Feedback","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Emmanuel Esposito, Hao Qiu, Mengxiao Zhang","submitted_at":"2025-06-09T09:49:54Z","abstract_excerpt":"In this work, we study the online convex optimization problem with curved losses and delayed feedback. When losses are strongly convex, existing approaches obtain regret bounds of order $d_{\\max} \\ln T$, where $d_{\\max}$ is the maximum delay and $T$ is the time horizon. However, in many cases, this guarantee can be much worse than $\\sqrt{d_{\\mathrm{tot}}}$ as obtained by a delayed version of online gradient descent, where $d_{\\mathrm{tot}}$ is the total delay. We bridge this gap by proposing a variant of follow-the-regularized-leader that obtains regret of order $\\min\\{\\sigma_{\\max}\\ln T, \\sqr"},"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":"2506.07595","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-06-09T09:49:54Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"9736050d333d253055781c80e6e32172e715d9be4f340801ea8851cc7286aefd","abstract_canon_sha256":"3965598cc75bbe120b5d2748ca3adbaea99e52bf1db00b618a0912c8bfb00677"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:18:30.079996Z","signature_b64":"18E4XgPz3JlLgwyAi6AasP1kndYhHb3YXTJUez1v2a6URQ7u/F5UNhkaQ4uv0EISBscD5Jp7xufukqTVRZY6Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d2854b0c5e91107fd4000d968f7972e59b976350efcd3e8b83de9c432fdbd25e","last_reissued_at":"2026-07-05T11:18:30.079481Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:18:30.079481Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Exploiting Curvature in Online Convex Optimization with Delayed Feedback","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Emmanuel Esposito, Hao Qiu, Mengxiao Zhang","submitted_at":"2025-06-09T09:49:54Z","abstract_excerpt":"In this work, we study the online convex optimization problem with curved losses and delayed feedback. When losses are strongly convex, existing approaches obtain regret bounds of order $d_{\\max} \\ln T$, where $d_{\\max}$ is the maximum delay and $T$ is the time horizon. However, in many cases, this guarantee can be much worse than $\\sqrt{d_{\\mathrm{tot}}}$ as obtained by a delayed version of online gradient descent, where $d_{\\mathrm{tot}}$ is the total delay. We bridge this gap by proposing a variant of follow-the-regularized-leader that obtains regret of order $\\min\\{\\sigma_{\\max}\\ln T, \\sqr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.07595","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2506.07595/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2506.07595","created_at":"2026-07-05T11:18:30.079554+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.07595v1","created_at":"2026-07-05T11:18:30.079554+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.07595","created_at":"2026-07-05T11:18:30.079554+00:00"},{"alias_kind":"pith_short_12","alias_value":"2KCUWDC6SEIH","created_at":"2026-07-05T11:18:30.079554+00:00"},{"alias_kind":"pith_short_16","alias_value":"2KCUWDC6SEIH7VAA","created_at":"2026-07-05T11:18:30.079554+00:00"},{"alias_kind":"pith_short_8","alias_value":"2KCUWDC6","created_at":"2026-07-05T11:18:30.079554+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/2KCUWDC6SEIH7VAABWLI66LS4W","json":"https://pith.science/pith/2KCUWDC6SEIH7VAABWLI66LS4W.json","graph_json":"https://pith.science/api/pith-number/2KCUWDC6SEIH7VAABWLI66LS4W/graph.json","events_json":"https://pith.science/api/pith-number/2KCUWDC6SEIH7VAABWLI66LS4W/events.json","paper":"https://pith.science/paper/2KCUWDC6"},"agent_actions":{"view_html":"https://pith.science/pith/2KCUWDC6SEIH7VAABWLI66LS4W","download_json":"https://pith.science/pith/2KCUWDC6SEIH7VAABWLI66LS4W.json","view_paper":"https://pith.science/paper/2KCUWDC6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.07595&json=true","fetch_graph":"https://pith.science/api/pith-number/2KCUWDC6SEIH7VAABWLI66LS4W/graph.json","fetch_events":"https://pith.science/api/pith-number/2KCUWDC6SEIH7VAABWLI66LS4W/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2KCUWDC6SEIH7VAABWLI66LS4W/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2KCUWDC6SEIH7VAABWLI66LS4W/action/storage_attestation","attest_author":"https://pith.science/pith/2KCUWDC6SEIH7VAABWLI66LS4W/action/author_attestation","sign_citation":"https://pith.science/pith/2KCUWDC6SEIH7VAABWLI66LS4W/action/citation_signature","submit_replication":"https://pith.science/pith/2KCUWDC6SEIH7VAABWLI66LS4W/action/replication_record"}},"created_at":"2026-07-05T11:18:30.079554+00:00","updated_at":"2026-07-05T11:18:30.079554+00:00"}