{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:O7IAO2LRAL3VC376AN7TXTLBLR","short_pith_number":"pith:O7IAO2LR","schema_version":"1.0","canonical_sha256":"77d007697102f7516ffe037f3bcd615c54b22ba21498200ee83c2e34eb96c8fd","source":{"kind":"arxiv","id":"2405.19175","version":1},"attestation_state":"computed","paper":{"title":"Online Linear Regression in Dynamic Environments via Discounting","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Andrew Jacobsen, Ashok Cutkosky","submitted_at":"2024-05-29T15:17:53Z","abstract_excerpt":"We develop algorithms for online linear regression which achieve optimal static and dynamic regret guarantees \\emph{even in the complete absence of prior knowledge}. We present a novel analysis showing that a discounted variant of the Vovk-Azoury-Warmuth forecaster achieves dynamic regret of the form $R_{T}(\\vec{u})\\le O\\left(d\\log(T)\\vee \\sqrt{dP_{T}^{\\gamma}(\\vec{u})T}\\right)$, where $P_{T}^{\\gamma}(\\vec{u})$ is a measure of variability of the comparator sequence, and show that the discount factor achieving this result can be learned on-the-fly. We show that this result is optimal by providi"},"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":"2405.19175","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-05-29T15:17:53Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"417131fbe7f89f5b60fe49e0a773218357855e2fa472fc4bf0ebfb9edbd1f108","abstract_canon_sha256":"29262771bbc93276722fe0352743aa621a063663c2cc974a0b37031a8583bdf7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:24:48.967837Z","signature_b64":"wAnnjcWs3/CFxhCJ0GVWVImdhXXaehHljnOgp4G6u2g9NMTL4q5z63NAiVihJ7gUfLNEgje82wUAQN5zsPs4BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"77d007697102f7516ffe037f3bcd615c54b22ba21498200ee83c2e34eb96c8fd","last_reissued_at":"2026-07-05T08:24:48.967433Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:24:48.967433Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Online Linear Regression in Dynamic Environments via Discounting","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Andrew Jacobsen, Ashok Cutkosky","submitted_at":"2024-05-29T15:17:53Z","abstract_excerpt":"We develop algorithms for online linear regression which achieve optimal static and dynamic regret guarantees \\emph{even in the complete absence of prior knowledge}. We present a novel analysis showing that a discounted variant of the Vovk-Azoury-Warmuth forecaster achieves dynamic regret of the form $R_{T}(\\vec{u})\\le O\\left(d\\log(T)\\vee \\sqrt{dP_{T}^{\\gamma}(\\vec{u})T}\\right)$, where $P_{T}^{\\gamma}(\\vec{u})$ is a measure of variability of the comparator sequence, and show that the discount factor achieving this result can be learned on-the-fly. We show that this result is optimal by providi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.19175","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/2405.19175/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":"2405.19175","created_at":"2026-07-05T08:24:48.967488+00:00"},{"alias_kind":"arxiv_version","alias_value":"2405.19175v1","created_at":"2026-07-05T08:24:48.967488+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.19175","created_at":"2026-07-05T08:24:48.967488+00:00"},{"alias_kind":"pith_short_12","alias_value":"O7IAO2LRAL3V","created_at":"2026-07-05T08:24:48.967488+00:00"},{"alias_kind":"pith_short_16","alias_value":"O7IAO2LRAL3VC376","created_at":"2026-07-05T08:24:48.967488+00:00"},{"alias_kind":"pith_short_8","alias_value":"O7IAO2LR","created_at":"2026-07-05T08:24:48.967488+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.04364","citing_title":"Online Nonstochastic Prediction: Logarithmic Regret via Predictive Online Least Squares","ref_index":28,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/O7IAO2LRAL3VC376AN7TXTLBLR","json":"https://pith.science/pith/O7IAO2LRAL3VC376AN7TXTLBLR.json","graph_json":"https://pith.science/api/pith-number/O7IAO2LRAL3VC376AN7TXTLBLR/graph.json","events_json":"https://pith.science/api/pith-number/O7IAO2LRAL3VC376AN7TXTLBLR/events.json","paper":"https://pith.science/paper/O7IAO2LR"},"agent_actions":{"view_html":"https://pith.science/pith/O7IAO2LRAL3VC376AN7TXTLBLR","download_json":"https://pith.science/pith/O7IAO2LRAL3VC376AN7TXTLBLR.json","view_paper":"https://pith.science/paper/O7IAO2LR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2405.19175&json=true","fetch_graph":"https://pith.science/api/pith-number/O7IAO2LRAL3VC376AN7TXTLBLR/graph.json","fetch_events":"https://pith.science/api/pith-number/O7IAO2LRAL3VC376AN7TXTLBLR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/O7IAO2LRAL3VC376AN7TXTLBLR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/O7IAO2LRAL3VC376AN7TXTLBLR/action/storage_attestation","attest_author":"https://pith.science/pith/O7IAO2LRAL3VC376AN7TXTLBLR/action/author_attestation","sign_citation":"https://pith.science/pith/O7IAO2LRAL3VC376AN7TXTLBLR/action/citation_signature","submit_replication":"https://pith.science/pith/O7IAO2LRAL3VC376AN7TXTLBLR/action/replication_record"}},"created_at":"2026-07-05T08:24:48.967488+00:00","updated_at":"2026-07-05T08:24:48.967488+00:00"}