{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:CQQRNELFQD5F7CVFEIZ5H6DPMY","short_pith_number":"pith:CQQRNELF","schema_version":"1.0","canonical_sha256":"142116916580fa5f8aa52233d3f86f6639c21daa391e5c558802e692eea29ad2","source":{"kind":"arxiv","id":"2502.12529","version":2},"attestation_state":"computed","paper":{"title":"Alternating Regret for Online Convex Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Haipeng Luo, Mengxiao Zhang, Ping Li, Soumita Hait","submitted_at":"2025-02-18T04:32:52Z","abstract_excerpt":"Motivated by alternating learning dynamics in two-player games, a recent work by Cevher et al.(2024) shows that $o(\\sqrt{T})$ alternating regret is possible for any $T$-round adversarial Online Linear Optimization (OLO) problem, and left as an open question whether the same is true for general Online Convex Optimization (OCO). We answer this question in the affirmative by showing that the continuous Hedge algorithm achieves $\\tilde{\\mathcal{O}}(d^{\\frac{2}{3}}T^{\\frac{1}{3}})$ alternating regret for any adversarial $d$-dimensional OCO problems. We show that this implies an alternating learning"},"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":"2502.12529","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-02-18T04:32:52Z","cross_cats_sorted":[],"title_canon_sha256":"3174171d3e46d70e35cb184448a61203b5936ae5671a7a5d0728b0d4f21ccdcc","abstract_canon_sha256":"a6c5934b3a2e1bd4d488b1566d4ee8a8258962b9a032badd5dec759076b4157c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:23:23.458639Z","signature_b64":"5fQhFU3I1uhhDvjTbOce6X34s+woBfctj/9ux0/QqZiyt4d0Ym8zeNFZKY1hkX0nlzCy6/xkCMRgLMoYcvd6Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"142116916580fa5f8aa52233d3f86f6639c21daa391e5c558802e692eea29ad2","last_reissued_at":"2026-07-05T11:23:23.458126Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:23:23.458126Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Alternating Regret for Online Convex Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Haipeng Luo, Mengxiao Zhang, Ping Li, Soumita Hait","submitted_at":"2025-02-18T04:32:52Z","abstract_excerpt":"Motivated by alternating learning dynamics in two-player games, a recent work by Cevher et al.(2024) shows that $o(\\sqrt{T})$ alternating regret is possible for any $T$-round adversarial Online Linear Optimization (OLO) problem, and left as an open question whether the same is true for general Online Convex Optimization (OCO). We answer this question in the affirmative by showing that the continuous Hedge algorithm achieves $\\tilde{\\mathcal{O}}(d^{\\frac{2}{3}}T^{\\frac{1}{3}})$ alternating regret for any adversarial $d$-dimensional OCO problems. We show that this implies an alternating learning"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.12529","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2502.12529/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":"2502.12529","created_at":"2026-07-05T11:23:23.458179+00:00"},{"alias_kind":"arxiv_version","alias_value":"2502.12529v2","created_at":"2026-07-05T11:23:23.458179+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.12529","created_at":"2026-07-05T11:23:23.458179+00:00"},{"alias_kind":"pith_short_12","alias_value":"CQQRNELFQD5F","created_at":"2026-07-05T11:23:23.458179+00:00"},{"alias_kind":"pith_short_16","alias_value":"CQQRNELFQD5F7CVF","created_at":"2026-07-05T11:23:23.458179+00:00"},{"alias_kind":"pith_short_8","alias_value":"CQQRNELF","created_at":"2026-07-05T11:23:23.458179+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.19392","citing_title":"Understanding Dynamics of Adam in Zero-Sum Games: An ODE Approach","ref_index":201,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CQQRNELFQD5F7CVFEIZ5H6DPMY","json":"https://pith.science/pith/CQQRNELFQD5F7CVFEIZ5H6DPMY.json","graph_json":"https://pith.science/api/pith-number/CQQRNELFQD5F7CVFEIZ5H6DPMY/graph.json","events_json":"https://pith.science/api/pith-number/CQQRNELFQD5F7CVFEIZ5H6DPMY/events.json","paper":"https://pith.science/paper/CQQRNELF"},"agent_actions":{"view_html":"https://pith.science/pith/CQQRNELFQD5F7CVFEIZ5H6DPMY","download_json":"https://pith.science/pith/CQQRNELFQD5F7CVFEIZ5H6DPMY.json","view_paper":"https://pith.science/paper/CQQRNELF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2502.12529&json=true","fetch_graph":"https://pith.science/api/pith-number/CQQRNELFQD5F7CVFEIZ5H6DPMY/graph.json","fetch_events":"https://pith.science/api/pith-number/CQQRNELFQD5F7CVFEIZ5H6DPMY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CQQRNELFQD5F7CVFEIZ5H6DPMY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CQQRNELFQD5F7CVFEIZ5H6DPMY/action/storage_attestation","attest_author":"https://pith.science/pith/CQQRNELFQD5F7CVFEIZ5H6DPMY/action/author_attestation","sign_citation":"https://pith.science/pith/CQQRNELFQD5F7CVFEIZ5H6DPMY/action/citation_signature","submit_replication":"https://pith.science/pith/CQQRNELFQD5F7CVFEIZ5H6DPMY/action/replication_record"}},"created_at":"2026-07-05T11:23:23.458179+00:00","updated_at":"2026-07-05T11:23:23.458179+00:00"}