{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:3Z7RJB2HPK4S5KOBQV5HFQE6L2","short_pith_number":"pith:3Z7RJB2H","schema_version":"1.0","canonical_sha256":"de7f1487477ab92ea9c1857a72c09e5ea33b4da4e6eb74c62a191228673ebaef","source":{"kind":"arxiv","id":"2407.05781","version":2},"attestation_state":"computed","paper":{"title":"Regret Analysis of Multi-task Representation Learning for Linear-Quadratic Adaptive Control","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.SY","eess.SY"],"primary_cat":"cs.LG","authors_text":"Bruce D. Lee, James Anderson, Leonardo F. Toso, Nikolai Matni, Thomas T. Zhang","submitted_at":"2024-07-08T09:41:42Z","abstract_excerpt":"Representation learning is a powerful tool that enables learning over large multitudes of agents or domains by enforcing that all agents operate on a shared set of learned features. However, many robotics or controls applications that would benefit from collaboration operate in settings with changing environments and goals, whereas most guarantees for representation learning are stated for static settings. Toward rigorously establishing the benefit of representation learning in dynamic settings, we analyze the regret of multi-task representation learning for linear-quadratic control. This sett"},"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":"2407.05781","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-07-08T09:41:42Z","cross_cats_sorted":["cs.SY","eess.SY"],"title_canon_sha256":"5fa17d4bda1057042b27af011f829f58a5734d4cd763e2b321e6e23e9d9f9bfc","abstract_canon_sha256":"4ca60d14c32a110b475adca06b52ea70dd41fdde8300aa29e252f889ad4b156e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:49:10.570586Z","signature_b64":"tNoGLTSbjmnpK71QAkhHGrLQJ4ITnERrNsfTxr1+MO+HsLb9I9LH9RyznnNFuLShAbh+2/85ujJwI0LePJ6ICg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"de7f1487477ab92ea9c1857a72c09e5ea33b4da4e6eb74c62a191228673ebaef","last_reissued_at":"2026-07-05T08:49:10.570028Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:49:10.570028Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Regret Analysis of Multi-task Representation Learning for Linear-Quadratic Adaptive Control","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.SY","eess.SY"],"primary_cat":"cs.LG","authors_text":"Bruce D. Lee, James Anderson, Leonardo F. Toso, Nikolai Matni, Thomas T. Zhang","submitted_at":"2024-07-08T09:41:42Z","abstract_excerpt":"Representation learning is a powerful tool that enables learning over large multitudes of agents or domains by enforcing that all agents operate on a shared set of learned features. However, many robotics or controls applications that would benefit from collaboration operate in settings with changing environments and goals, whereas most guarantees for representation learning are stated for static settings. Toward rigorously establishing the benefit of representation learning in dynamic settings, we analyze the regret of multi-task representation learning for linear-quadratic control. This sett"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.05781","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/2407.05781/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":"2407.05781","created_at":"2026-07-05T08:49:10.570092+00:00"},{"alias_kind":"arxiv_version","alias_value":"2407.05781v2","created_at":"2026-07-05T08:49:10.570092+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.05781","created_at":"2026-07-05T08:49:10.570092+00:00"},{"alias_kind":"pith_short_12","alias_value":"3Z7RJB2HPK4S","created_at":"2026-07-05T08:49:10.570092+00:00"},{"alias_kind":"pith_short_16","alias_value":"3Z7RJB2HPK4S5KOB","created_at":"2026-07-05T08:49:10.570092+00:00"},{"alias_kind":"pith_short_8","alias_value":"3Z7RJB2H","created_at":"2026-07-05T08:49:10.570092+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.02332","citing_title":"Coreset-Based Task Selection for Sample-Efficient Meta-Reinforcement Learning","ref_index":2021,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3Z7RJB2HPK4S5KOBQV5HFQE6L2","json":"https://pith.science/pith/3Z7RJB2HPK4S5KOBQV5HFQE6L2.json","graph_json":"https://pith.science/api/pith-number/3Z7RJB2HPK4S5KOBQV5HFQE6L2/graph.json","events_json":"https://pith.science/api/pith-number/3Z7RJB2HPK4S5KOBQV5HFQE6L2/events.json","paper":"https://pith.science/paper/3Z7RJB2H"},"agent_actions":{"view_html":"https://pith.science/pith/3Z7RJB2HPK4S5KOBQV5HFQE6L2","download_json":"https://pith.science/pith/3Z7RJB2HPK4S5KOBQV5HFQE6L2.json","view_paper":"https://pith.science/paper/3Z7RJB2H","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2407.05781&json=true","fetch_graph":"https://pith.science/api/pith-number/3Z7RJB2HPK4S5KOBQV5HFQE6L2/graph.json","fetch_events":"https://pith.science/api/pith-number/3Z7RJB2HPK4S5KOBQV5HFQE6L2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3Z7RJB2HPK4S5KOBQV5HFQE6L2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3Z7RJB2HPK4S5KOBQV5HFQE6L2/action/storage_attestation","attest_author":"https://pith.science/pith/3Z7RJB2HPK4S5KOBQV5HFQE6L2/action/author_attestation","sign_citation":"https://pith.science/pith/3Z7RJB2HPK4S5KOBQV5HFQE6L2/action/citation_signature","submit_replication":"https://pith.science/pith/3Z7RJB2HPK4S5KOBQV5HFQE6L2/action/replication_record"}},"created_at":"2026-07-05T08:49:10.570092+00:00","updated_at":"2026-07-05T08:49:10.570092+00:00"}