{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:UBHEE65X3KK3BID63L6IT6YUNU","short_pith_number":"pith:UBHEE65X","schema_version":"1.0","canonical_sha256":"a04e427bb7da95b0a07edafc89fb146d1e93a0b0f58f62ccc7e9d01064950678","source":{"kind":"arxiv","id":"2106.12097","version":1},"attestation_state":"computed","paper":{"title":"Regret-optimal Estimation and Control","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.DS","math.OC"],"primary_cat":"cs.LG","authors_text":"Babak Hassibi, Gautam Goel","submitted_at":"2021-06-22T23:14:21Z","abstract_excerpt":"We consider estimation and control in linear time-varying dynamical systems from the perspective of regret minimization. Unlike most prior work in this area, we focus on the problem of designing causal estimators and controllers which compete against a clairvoyant noncausal policy, instead of the best policy selected in hindsight from some fixed parametric class. We show that the regret-optimal estimator and regret-optimal controller can be derived in state-space form using operator-theoretic techniques from robust control and present tight,data-dependent bounds on the regret incurred by our 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":"2106.12097","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-06-22T23:14:21Z","cross_cats_sorted":["math.DS","math.OC"],"title_canon_sha256":"1f20cbee521edc6d3e0cb32336ebba9a1b3a39c1a14a651059e2efa08a7ee26b","abstract_canon_sha256":"54e2c886b4d4c4d634f1ec4ce1c1302094b9249df24e41a32cf8ba93257eff5e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:51:42.559035Z","signature_b64":"Kd/mbyabZfl7ymNlygqMhh4uPVWOmbRHxf1DgZoeOLiz0nXNo1kFMuCXiTFq7VLiIn9uD9XbKz5O8cjSklLqAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a04e427bb7da95b0a07edafc89fb146d1e93a0b0f58f62ccc7e9d01064950678","last_reissued_at":"2026-07-05T02:51:42.558627Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:51:42.558627Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Regret-optimal Estimation and Control","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.DS","math.OC"],"primary_cat":"cs.LG","authors_text":"Babak Hassibi, Gautam Goel","submitted_at":"2021-06-22T23:14:21Z","abstract_excerpt":"We consider estimation and control in linear time-varying dynamical systems from the perspective of regret minimization. Unlike most prior work in this area, we focus on the problem of designing causal estimators and controllers which compete against a clairvoyant noncausal policy, instead of the best policy selected in hindsight from some fixed parametric class. We show that the regret-optimal estimator and regret-optimal controller can be derived in state-space form using operator-theoretic techniques from robust control and present tight,data-dependent bounds on the regret incurred by our a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2106.12097","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/2106.12097/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":"2106.12097","created_at":"2026-07-05T02:51:42.558681+00:00"},{"alias_kind":"arxiv_version","alias_value":"2106.12097v1","created_at":"2026-07-05T02:51:42.558681+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2106.12097","created_at":"2026-07-05T02:51:42.558681+00:00"},{"alias_kind":"pith_short_12","alias_value":"UBHEE65X3KK3","created_at":"2026-07-05T02:51:42.558681+00:00"},{"alias_kind":"pith_short_16","alias_value":"UBHEE65X3KK3BID6","created_at":"2026-07-05T02:51:42.558681+00:00"},{"alias_kind":"pith_short_8","alias_value":"UBHEE65X","created_at":"2026-07-05T02:51:42.558681+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.07101","citing_title":"Constrained Online Decision-Making: A Unified Framework","ref_index":26,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UBHEE65X3KK3BID63L6IT6YUNU","json":"https://pith.science/pith/UBHEE65X3KK3BID63L6IT6YUNU.json","graph_json":"https://pith.science/api/pith-number/UBHEE65X3KK3BID63L6IT6YUNU/graph.json","events_json":"https://pith.science/api/pith-number/UBHEE65X3KK3BID63L6IT6YUNU/events.json","paper":"https://pith.science/paper/UBHEE65X"},"agent_actions":{"view_html":"https://pith.science/pith/UBHEE65X3KK3BID63L6IT6YUNU","download_json":"https://pith.science/pith/UBHEE65X3KK3BID63L6IT6YUNU.json","view_paper":"https://pith.science/paper/UBHEE65X","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2106.12097&json=true","fetch_graph":"https://pith.science/api/pith-number/UBHEE65X3KK3BID63L6IT6YUNU/graph.json","fetch_events":"https://pith.science/api/pith-number/UBHEE65X3KK3BID63L6IT6YUNU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UBHEE65X3KK3BID63L6IT6YUNU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UBHEE65X3KK3BID63L6IT6YUNU/action/storage_attestation","attest_author":"https://pith.science/pith/UBHEE65X3KK3BID63L6IT6YUNU/action/author_attestation","sign_citation":"https://pith.science/pith/UBHEE65X3KK3BID63L6IT6YUNU/action/citation_signature","submit_replication":"https://pith.science/pith/UBHEE65X3KK3BID63L6IT6YUNU/action/replication_record"}},"created_at":"2026-07-05T02:51:42.558681+00:00","updated_at":"2026-07-05T02:51:42.558681+00:00"}