{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:VRM24WPZXF4W7MZUASZLSZKC5B","short_pith_number":"pith:VRM24WPZ","schema_version":"1.0","canonical_sha256":"ac59ae59f9b9796fb33404b2b96542e87968de1bf57430f66fc4687982de7275","source":{"kind":"arxiv","id":"2105.14709","version":2},"attestation_state":"computed","paper":{"title":"Joint Stabilization and Regret Minimization through Switching in Over-Actuated Systems (extended version)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"eess.SY","authors_text":"Cedric Langbort, Jafar Abbaszadeh Chekan, Kamyar Azizzadenesheli","submitted_at":"2021-05-31T05:18:34Z","abstract_excerpt":"Adaptively controlling and minimizing regret in unknown dynamical systems while controlling the growth of the system state is crucial in real-world applications. In this work, we study the problem of stabilization and regret minimization of linear over-actuated dynamical systems. We propose an optimism-based algorithm that leverages possibility of switching between actuating modes in order to alleviate state explosion during initial time steps. We theoretically study the rate at which our algorithm learns a stabilizing controller and prove that it achieves a regret upper bound of $\\mathcal{O}("},"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":"2105.14709","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2021-05-31T05:18:34Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"d5446b900ed5fdfec794bae30221dc7a3a36bf48444650831d125a3dd367902e","abstract_canon_sha256":"0bd33a20bf02234297e5d9b05893943d57b02458e16fc605a76ec19857ea39b5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:55:27.339156Z","signature_b64":"nkmaoCnfsdKwm2DQDhWx1lqrJ33Ir4+N+dtydB5b7fqpfyZwDKM2NfhN/guj86QHo6FuySYdsUrU1nHAZ47mAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ac59ae59f9b9796fb33404b2b96542e87968de1bf57430f66fc4687982de7275","last_reissued_at":"2026-07-05T03:55:27.338626Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:55:27.338626Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Joint Stabilization and Regret Minimization through Switching in Over-Actuated Systems (extended version)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"eess.SY","authors_text":"Cedric Langbort, Jafar Abbaszadeh Chekan, Kamyar Azizzadenesheli","submitted_at":"2021-05-31T05:18:34Z","abstract_excerpt":"Adaptively controlling and minimizing regret in unknown dynamical systems while controlling the growth of the system state is crucial in real-world applications. In this work, we study the problem of stabilization and regret minimization of linear over-actuated dynamical systems. We propose an optimism-based algorithm that leverages possibility of switching between actuating modes in order to alleviate state explosion during initial time steps. We theoretically study the rate at which our algorithm learns a stabilizing controller and prove that it achieves a regret upper bound of $\\mathcal{O}("},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2105.14709","kind":"arxiv","version":2},"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/2105.14709/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":"2105.14709","created_at":"2026-07-05T03:55:27.338686+00:00"},{"alias_kind":"arxiv_version","alias_value":"2105.14709v2","created_at":"2026-07-05T03:55:27.338686+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2105.14709","created_at":"2026-07-05T03:55:27.338686+00:00"},{"alias_kind":"pith_short_12","alias_value":"VRM24WPZXF4W","created_at":"2026-07-05T03:55:27.338686+00:00"},{"alias_kind":"pith_short_16","alias_value":"VRM24WPZXF4W7MZU","created_at":"2026-07-05T03:55:27.338686+00:00"},{"alias_kind":"pith_short_8","alias_value":"VRM24WPZ","created_at":"2026-07-05T03:55:27.338686+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.22223","citing_title":"Regret-Guaranteed Safe Switching: LQR Setting with Unknown Dynamics","ref_index":54,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VRM24WPZXF4W7MZUASZLSZKC5B","json":"https://pith.science/pith/VRM24WPZXF4W7MZUASZLSZKC5B.json","graph_json":"https://pith.science/api/pith-number/VRM24WPZXF4W7MZUASZLSZKC5B/graph.json","events_json":"https://pith.science/api/pith-number/VRM24WPZXF4W7MZUASZLSZKC5B/events.json","paper":"https://pith.science/paper/VRM24WPZ"},"agent_actions":{"view_html":"https://pith.science/pith/VRM24WPZXF4W7MZUASZLSZKC5B","download_json":"https://pith.science/pith/VRM24WPZXF4W7MZUASZLSZKC5B.json","view_paper":"https://pith.science/paper/VRM24WPZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2105.14709&json=true","fetch_graph":"https://pith.science/api/pith-number/VRM24WPZXF4W7MZUASZLSZKC5B/graph.json","fetch_events":"https://pith.science/api/pith-number/VRM24WPZXF4W7MZUASZLSZKC5B/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VRM24WPZXF4W7MZUASZLSZKC5B/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VRM24WPZXF4W7MZUASZLSZKC5B/action/storage_attestation","attest_author":"https://pith.science/pith/VRM24WPZXF4W7MZUASZLSZKC5B/action/author_attestation","sign_citation":"https://pith.science/pith/VRM24WPZXF4W7MZUASZLSZKC5B/action/citation_signature","submit_replication":"https://pith.science/pith/VRM24WPZXF4W7MZUASZLSZKC5B/action/replication_record"}},"created_at":"2026-07-05T03:55:27.338686+00:00","updated_at":"2026-07-05T03:55:27.338686+00:00"}