{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:6PHAPX54KKSRNUKBGJFTFBYN2W","short_pith_number":"pith:6PHAPX54","schema_version":"1.0","canonical_sha256":"f3ce07dfbc52a516d141324b32870dd5be5c1a0b20e6f67b10dca0e935b00546","source":{"kind":"arxiv","id":"2002.05318","version":3},"attestation_state":"computed","paper":{"title":"Online Optimization with Memory and Competitive Control","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","eess.SY","math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Adam Wierman, Guanya Shi, Soon-Jo Chung, Yiheng Lin, Yisong Yue","submitted_at":"2020-02-13T02:58:11Z","abstract_excerpt":"This paper presents competitive algorithms for a novel class of online optimization problems with memory. We consider a setting where the learner seeks to minimize the sum of a hitting cost and a switching cost that depends on the previous $p$ decisions. This setting generalizes Smoothed Online Convex Optimization. The proposed approach, Optimistic Regularized Online Balanced Descent, achieves a constant, dimension-free competitive ratio. Further, we show a connection between online optimization with memory and online control with adversarial disturbances. This connection, in turn, leads to a "},"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":"2002.05318","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-02-13T02:58:11Z","cross_cats_sorted":["cs.SY","eess.SY","math.OC","stat.ML"],"title_canon_sha256":"49a736162c8c5fa5e0c840781d1df808aec480080f56bc746d243f9c36701445","abstract_canon_sha256":"a3491591a68aaa8e602edda2fdee71104de873a4126be4d3259558b627a791da"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:05:23.152928Z","signature_b64":"nEZXsCFcq8J8UJyh7deSS1Mz93omaJnVOBbJ0cWNyDFfMLEnn1CbHui+oDdz1adiuRZ8xgGkxrGA6QS3bVxFDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f3ce07dfbc52a516d141324b32870dd5be5c1a0b20e6f67b10dca0e935b00546","last_reissued_at":"2026-07-05T02:05:23.152370Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:05:23.152370Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Online Optimization with Memory and Competitive Control","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","eess.SY","math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Adam Wierman, Guanya Shi, Soon-Jo Chung, Yiheng Lin, Yisong Yue","submitted_at":"2020-02-13T02:58:11Z","abstract_excerpt":"This paper presents competitive algorithms for a novel class of online optimization problems with memory. We consider a setting where the learner seeks to minimize the sum of a hitting cost and a switching cost that depends on the previous $p$ decisions. This setting generalizes Smoothed Online Convex Optimization. The proposed approach, Optimistic Regularized Online Balanced Descent, achieves a constant, dimension-free competitive ratio. Further, we show a connection between online optimization with memory and online control with adversarial disturbances. This connection, in turn, leads to a "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2002.05318","kind":"arxiv","version":3},"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/2002.05318/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":"2002.05318","created_at":"2026-07-05T02:05:23.152432+00:00"},{"alias_kind":"arxiv_version","alias_value":"2002.05318v3","created_at":"2026-07-05T02:05:23.152432+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2002.05318","created_at":"2026-07-05T02:05:23.152432+00:00"},{"alias_kind":"pith_short_12","alias_value":"6PHAPX54KKSR","created_at":"2026-07-05T02:05:23.152432+00:00"},{"alias_kind":"pith_short_16","alias_value":"6PHAPX54KKSRNUKB","created_at":"2026-07-05T02:05:23.152432+00:00"},{"alias_kind":"pith_short_8","alias_value":"6PHAPX54","created_at":"2026-07-05T02:05:23.152432+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/6PHAPX54KKSRNUKBGJFTFBYN2W","json":"https://pith.science/pith/6PHAPX54KKSRNUKBGJFTFBYN2W.json","graph_json":"https://pith.science/api/pith-number/6PHAPX54KKSRNUKBGJFTFBYN2W/graph.json","events_json":"https://pith.science/api/pith-number/6PHAPX54KKSRNUKBGJFTFBYN2W/events.json","paper":"https://pith.science/paper/6PHAPX54"},"agent_actions":{"view_html":"https://pith.science/pith/6PHAPX54KKSRNUKBGJFTFBYN2W","download_json":"https://pith.science/pith/6PHAPX54KKSRNUKBGJFTFBYN2W.json","view_paper":"https://pith.science/paper/6PHAPX54","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2002.05318&json=true","fetch_graph":"https://pith.science/api/pith-number/6PHAPX54KKSRNUKBGJFTFBYN2W/graph.json","fetch_events":"https://pith.science/api/pith-number/6PHAPX54KKSRNUKBGJFTFBYN2W/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6PHAPX54KKSRNUKBGJFTFBYN2W/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6PHAPX54KKSRNUKBGJFTFBYN2W/action/storage_attestation","attest_author":"https://pith.science/pith/6PHAPX54KKSRNUKBGJFTFBYN2W/action/author_attestation","sign_citation":"https://pith.science/pith/6PHAPX54KKSRNUKBGJFTFBYN2W/action/citation_signature","submit_replication":"https://pith.science/pith/6PHAPX54KKSRNUKBGJFTFBYN2W/action/replication_record"}},"created_at":"2026-07-05T02:05:23.152432+00:00","updated_at":"2026-07-05T02:05:23.152432+00:00"}