{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:PMR3IR3RGWXCTGDTI3KNDAJTBR","short_pith_number":"pith:PMR3IR3R","schema_version":"1.0","canonical_sha256":"7b23b4477135ae29987346d4d181330c6eb5b20d2de04eb8797d0f4e5d0b3aa1","source":{"kind":"arxiv","id":"1603.04954","version":1},"attestation_state":"computed","paper":{"title":"Online Optimization in Dynamic Environments: Improved Regret Rates for Strongly Convex Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.LG","authors_text":"Alejandro Ribeiro, Ali Jadbabaie, Aryan Mokhtari, Shahin Shahrampour","submitted_at":"2016-03-16T04:12:32Z","abstract_excerpt":"In this paper, we address tracking of a time-varying parameter with unknown dynamics. We formalize the problem as an instance of online optimization in a dynamic setting. Using online gradient descent, we propose a method that sequentially predicts the value of the parameter and in turn suffers a loss. The objective is to minimize the accumulation of losses over the time horizon, a notion that is termed dynamic regret. While existing methods focus on convex loss functions, we consider strongly convex functions so as to provide better guarantees of performance. We derive a regret bound that cap"},"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":"1603.04954","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-03-16T04:12:32Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"e8bc21853169fd0a5ea78a49604896aa29abf9fdeb70736bd5974970a414664e","abstract_canon_sha256":"7b67680f4d9f85a11ef406ab0821e72fd0538acd19a350ffd385644c93124ae8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:18:59.556589Z","signature_b64":"I32cj1vhvpAsbglB51/SJLphW+zz/t6XwJjzbmOtiJG+EJQxW5AZUnJTXO6gyKOFpUQaNRR2cJLXxRHxu5Z/Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7b23b4477135ae29987346d4d181330c6eb5b20d2de04eb8797d0f4e5d0b3aa1","last_reissued_at":"2026-05-18T01:18:59.556111Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:18:59.556111Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Online Optimization in Dynamic Environments: Improved Regret Rates for Strongly Convex Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.LG","authors_text":"Alejandro Ribeiro, Ali Jadbabaie, Aryan Mokhtari, Shahin Shahrampour","submitted_at":"2016-03-16T04:12:32Z","abstract_excerpt":"In this paper, we address tracking of a time-varying parameter with unknown dynamics. We formalize the problem as an instance of online optimization in a dynamic setting. Using online gradient descent, we propose a method that sequentially predicts the value of the parameter and in turn suffers a loss. The objective is to minimize the accumulation of losses over the time horizon, a notion that is termed dynamic regret. While existing methods focus on convex loss functions, we consider strongly convex functions so as to provide better guarantees of performance. We derive a regret bound that cap"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.04954","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":"1603.04954","created_at":"2026-05-18T01:18:59.556180+00:00"},{"alias_kind":"arxiv_version","alias_value":"1603.04954v1","created_at":"2026-05-18T01:18:59.556180+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.04954","created_at":"2026-05-18T01:18:59.556180+00:00"},{"alias_kind":"pith_short_12","alias_value":"PMR3IR3RGWXC","created_at":"2026-05-18T12:30:39.010887+00:00"},{"alias_kind":"pith_short_16","alias_value":"PMR3IR3RGWXCTGDT","created_at":"2026-05-18T12:30:39.010887+00:00"},{"alias_kind":"pith_short_8","alias_value":"PMR3IR3R","created_at":"2026-05-18T12:30:39.010887+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/PMR3IR3RGWXCTGDTI3KNDAJTBR","json":"https://pith.science/pith/PMR3IR3RGWXCTGDTI3KNDAJTBR.json","graph_json":"https://pith.science/api/pith-number/PMR3IR3RGWXCTGDTI3KNDAJTBR/graph.json","events_json":"https://pith.science/api/pith-number/PMR3IR3RGWXCTGDTI3KNDAJTBR/events.json","paper":"https://pith.science/paper/PMR3IR3R"},"agent_actions":{"view_html":"https://pith.science/pith/PMR3IR3RGWXCTGDTI3KNDAJTBR","download_json":"https://pith.science/pith/PMR3IR3RGWXCTGDTI3KNDAJTBR.json","view_paper":"https://pith.science/paper/PMR3IR3R","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1603.04954&json=true","fetch_graph":"https://pith.science/api/pith-number/PMR3IR3RGWXCTGDTI3KNDAJTBR/graph.json","fetch_events":"https://pith.science/api/pith-number/PMR3IR3RGWXCTGDTI3KNDAJTBR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PMR3IR3RGWXCTGDTI3KNDAJTBR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PMR3IR3RGWXCTGDTI3KNDAJTBR/action/storage_attestation","attest_author":"https://pith.science/pith/PMR3IR3RGWXCTGDTI3KNDAJTBR/action/author_attestation","sign_citation":"https://pith.science/pith/PMR3IR3RGWXCTGDTI3KNDAJTBR/action/citation_signature","submit_replication":"https://pith.science/pith/PMR3IR3RGWXCTGDTI3KNDAJTBR/action/replication_record"}},"created_at":"2026-05-18T01:18:59.556180+00:00","updated_at":"2026-05-18T01:18:59.556180+00:00"}