{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:YGUYRTOEYFLDEWOJQZPZJCMSV5","short_pith_number":"pith:YGUYRTOE","schema_version":"1.0","canonical_sha256":"c1a988cdc4c1563259c9865f948992af76f3435cc29cb5b9354c6032efb2a592","source":{"kind":"arxiv","id":"2505.08982","version":1},"attestation_state":"computed","paper":{"title":"Model-free Online Learning for the Kalman Filter: Forgetting Factor and Logarithmic Regret","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.SY","eess.SP","eess.SY"],"primary_cat":"cs.LG","authors_text":"Jiachen Qian, Yang Zheng","submitted_at":"2025-05-13T21:49:56Z","abstract_excerpt":"We consider the problem of online prediction for an unknown, non-explosive linear stochastic system. With a known system model, the optimal predictor is the celebrated Kalman filter. In the case of unknown systems, existing approaches based on recursive least squares and its variants may suffer from degraded performance due to the highly imbalanced nature of the regression model. This imbalance can easily lead to overfitting and thus degrade prediction accuracy. We tackle this problem by injecting an inductive bias into the regression model via {exponential forgetting}. While exponential forge"},"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":"2505.08982","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LG","submitted_at":"2025-05-13T21:49:56Z","cross_cats_sorted":["cs.SY","eess.SP","eess.SY"],"title_canon_sha256":"ba82981a13f895c40cafe303846d5969f24380be4853d1b7b27033ba53a4185d","abstract_canon_sha256":"6e690d89f1719938af2bda1a3917612618c32eb209c490c4bac593fffc533f2f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:02:48.250203Z","signature_b64":"SXZuonl4vC9E4iQVBsVWUN9uB+CPokWKOGjvPlac2zxPqI0CbCU+Wt+qDdpRUbaswZoI44R4h4VQmlV0p/ZVAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c1a988cdc4c1563259c9865f948992af76f3435cc29cb5b9354c6032efb2a592","last_reissued_at":"2026-07-05T11:02:48.249758Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:02:48.249758Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Model-free Online Learning for the Kalman Filter: Forgetting Factor and Logarithmic Regret","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.SY","eess.SP","eess.SY"],"primary_cat":"cs.LG","authors_text":"Jiachen Qian, Yang Zheng","submitted_at":"2025-05-13T21:49:56Z","abstract_excerpt":"We consider the problem of online prediction for an unknown, non-explosive linear stochastic system. With a known system model, the optimal predictor is the celebrated Kalman filter. In the case of unknown systems, existing approaches based on recursive least squares and its variants may suffer from degraded performance due to the highly imbalanced nature of the regression model. This imbalance can easily lead to overfitting and thus degrade prediction accuracy. We tackle this problem by injecting an inductive bias into the regression model via {exponential forgetting}. While exponential forge"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.08982","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/2505.08982/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":"2505.08982","created_at":"2026-07-05T11:02:48.249820+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.08982v1","created_at":"2026-07-05T11:02:48.249820+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.08982","created_at":"2026-07-05T11:02:48.249820+00:00"},{"alias_kind":"pith_short_12","alias_value":"YGUYRTOEYFLD","created_at":"2026-07-05T11:02:48.249820+00:00"},{"alias_kind":"pith_short_16","alias_value":"YGUYRTOEYFLDEWOJ","created_at":"2026-07-05T11:02:48.249820+00:00"},{"alias_kind":"pith_short_8","alias_value":"YGUYRTOE","created_at":"2026-07-05T11:02:48.249820+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":13,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YGUYRTOEYFLDEWOJQZPZJCMSV5","json":"https://pith.science/pith/YGUYRTOEYFLDEWOJQZPZJCMSV5.json","graph_json":"https://pith.science/api/pith-number/YGUYRTOEYFLDEWOJQZPZJCMSV5/graph.json","events_json":"https://pith.science/api/pith-number/YGUYRTOEYFLDEWOJQZPZJCMSV5/events.json","paper":"https://pith.science/paper/YGUYRTOE"},"agent_actions":{"view_html":"https://pith.science/pith/YGUYRTOEYFLDEWOJQZPZJCMSV5","download_json":"https://pith.science/pith/YGUYRTOEYFLDEWOJQZPZJCMSV5.json","view_paper":"https://pith.science/paper/YGUYRTOE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.08982&json=true","fetch_graph":"https://pith.science/api/pith-number/YGUYRTOEYFLDEWOJQZPZJCMSV5/graph.json","fetch_events":"https://pith.science/api/pith-number/YGUYRTOEYFLDEWOJQZPZJCMSV5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YGUYRTOEYFLDEWOJQZPZJCMSV5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YGUYRTOEYFLDEWOJQZPZJCMSV5/action/storage_attestation","attest_author":"https://pith.science/pith/YGUYRTOEYFLDEWOJQZPZJCMSV5/action/author_attestation","sign_citation":"https://pith.science/pith/YGUYRTOEYFLDEWOJQZPZJCMSV5/action/citation_signature","submit_replication":"https://pith.science/pith/YGUYRTOEYFLDEWOJQZPZJCMSV5/action/replication_record"}},"created_at":"2026-07-05T11:02:48.249820+00:00","updated_at":"2026-07-05T11:02:48.249820+00:00"}