{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:WUR3S4J4YYN3FN2AVUZ5L5EBH4","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"7dfc87a46dfaf9d85505214bfc6c8813198fc1f77f5cab01f68f678c23505657","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-03-29T15:27:13Z","title_canon_sha256":"335a4eaa5e810c11414493444cc480a6982c78068e1f26c4533ea49ba6ac2afa"},"schema_version":"1.0","source":{"id":"2203.15664","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2203.15664","created_at":"2026-07-05T04:09:28Z"},{"alias_kind":"arxiv_version","alias_value":"2203.15664v1","created_at":"2026-07-05T04:09:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2203.15664","created_at":"2026-07-05T04:09:28Z"},{"alias_kind":"pith_short_12","alias_value":"WUR3S4J4YYN3","created_at":"2026-07-05T04:09:28Z"},{"alias_kind":"pith_short_16","alias_value":"WUR3S4J4YYN3FN2A","created_at":"2026-07-05T04:09:28Z"},{"alias_kind":"pith_short_8","alias_value":"WUR3S4J4","created_at":"2026-07-05T04:09:28Z"}],"graph_snapshots":[{"event_id":"sha256:5e0e99859808cc43b8ee8409ea148f0a88375ab7821f213a48e7e2e7aa2aa753","target":"graph","created_at":"2026-07-05T04:09:28Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2203.15664/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We give novel algorithms for multi-task and lifelong linear bandits with shared representation. Specifically, we consider the setting where we play $M$ linear bandits with dimension $d$, each for $T$ rounds, and these $M$ bandit tasks share a common $k(\\ll d)$ dimensional linear representation. For both the multi-task setting where we play the tasks concurrently, and the lifelong setting where we play tasks sequentially, we come up with novel algorithms that achieve $\\widetilde{O}\\left(d\\sqrt{kMT} + kM\\sqrt{T}\\right)$ regret bounds, which matches the known minimax regret lower bound up to loga","authors_text":"Jason D. Lee, Jiaqi Yang, Qi Lei, Simon S. Du","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-03-29T15:27:13Z","title":"Nearly Minimax Algorithms for Linear Bandits with Shared Representation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2203.15664","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:6a0a63fbc1a5a09000734468996851ac05f949e28028dfea33c38792b12a35fc","target":"record","created_at":"2026-07-05T04:09:28Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"7dfc87a46dfaf9d85505214bfc6c8813198fc1f77f5cab01f68f678c23505657","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-03-29T15:27:13Z","title_canon_sha256":"335a4eaa5e810c11414493444cc480a6982c78068e1f26c4533ea49ba6ac2afa"},"schema_version":"1.0","source":{"id":"2203.15664","kind":"arxiv","version":1}},"canonical_sha256":"b523b9713cc61bb2b740ad33d5f4813f241443fc72838d3752597a21c7282e13","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b523b9713cc61bb2b740ad33d5f4813f241443fc72838d3752597a21c7282e13","first_computed_at":"2026-07-05T04:09:28.958353Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:09:28.958353Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JxIOKPUpjW9NQsKRmDrU57dfZJrCWJdwaUT9WHh3UX5hXDylubmVzc3xaW8Yn36wxcAeR3RgeQASrZ6w18KcCw==","signature_status":"signed_v1","signed_at":"2026-07-05T04:09:28.958737Z","signed_message":"canonical_sha256_bytes"},"source_id":"2203.15664","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6a0a63fbc1a5a09000734468996851ac05f949e28028dfea33c38792b12a35fc","sha256:5e0e99859808cc43b8ee8409ea148f0a88375ab7821f213a48e7e2e7aa2aa753"],"state_sha256":"adfb68abcc49bc411e5634bb3a609095609c331bcd913eef0caeaab5d7a723b5"}