{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:WUR3S4J4YYN3FN2AVUZ5L5EBH4","short_pith_number":"pith:WUR3S4J4","schema_version":"1.0","canonical_sha256":"b523b9713cc61bb2b740ad33d5f4813f241443fc72838d3752597a21c7282e13","source":{"kind":"arxiv","id":"2203.15664","version":1},"attestation_state":"computed","paper":{"title":"Nearly Minimax Algorithms for Linear Bandits with Shared Representation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Jason D. Lee, Jiaqi Yang, Qi Lei, Simon S. Du","submitted_at":"2022-03-29T15:27:13Z","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"},"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":"2203.15664","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-03-29T15:27:13Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"335a4eaa5e810c11414493444cc480a6982c78068e1f26c4533ea49ba6ac2afa","abstract_canon_sha256":"7dfc87a46dfaf9d85505214bfc6c8813198fc1f77f5cab01f68f678c23505657"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:09:28.958737Z","signature_b64":"JxIOKPUpjW9NQsKRmDrU57dfZJrCWJdwaUT9WHh3UX5hXDylubmVzc3xaW8Yn36wxcAeR3RgeQASrZ6w18KcCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b523b9713cc61bb2b740ad33d5f4813f241443fc72838d3752597a21c7282e13","last_reissued_at":"2026-07-05T04:09:28.958353Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:09:28.958353Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Nearly Minimax Algorithms for Linear Bandits with Shared Representation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Jason D. Lee, Jiaqi Yang, Qi Lei, Simon S. Du","submitted_at":"2022-03-29T15:27:13Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2203.15664","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/2203.15664/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":"2203.15664","created_at":"2026-07-05T04:09:28.958426+00:00"},{"alias_kind":"arxiv_version","alias_value":"2203.15664v1","created_at":"2026-07-05T04:09:28.958426+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2203.15664","created_at":"2026-07-05T04:09:28.958426+00:00"},{"alias_kind":"pith_short_12","alias_value":"WUR3S4J4YYN3","created_at":"2026-07-05T04:09:28.958426+00:00"},{"alias_kind":"pith_short_16","alias_value":"WUR3S4J4YYN3FN2A","created_at":"2026-07-05T04:09:28.958426+00:00"},{"alias_kind":"pith_short_8","alias_value":"WUR3S4J4","created_at":"2026-07-05T04:09:28.958426+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2501.13390","citing_title":"Beyond Task Diversity: Provable Representation Transfer for Sequential Multi-Task Linear Bandits","ref_index":21,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WUR3S4J4YYN3FN2AVUZ5L5EBH4","json":"https://pith.science/pith/WUR3S4J4YYN3FN2AVUZ5L5EBH4.json","graph_json":"https://pith.science/api/pith-number/WUR3S4J4YYN3FN2AVUZ5L5EBH4/graph.json","events_json":"https://pith.science/api/pith-number/WUR3S4J4YYN3FN2AVUZ5L5EBH4/events.json","paper":"https://pith.science/paper/WUR3S4J4"},"agent_actions":{"view_html":"https://pith.science/pith/WUR3S4J4YYN3FN2AVUZ5L5EBH4","download_json":"https://pith.science/pith/WUR3S4J4YYN3FN2AVUZ5L5EBH4.json","view_paper":"https://pith.science/paper/WUR3S4J4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2203.15664&json=true","fetch_graph":"https://pith.science/api/pith-number/WUR3S4J4YYN3FN2AVUZ5L5EBH4/graph.json","fetch_events":"https://pith.science/api/pith-number/WUR3S4J4YYN3FN2AVUZ5L5EBH4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WUR3S4J4YYN3FN2AVUZ5L5EBH4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WUR3S4J4YYN3FN2AVUZ5L5EBH4/action/storage_attestation","attest_author":"https://pith.science/pith/WUR3S4J4YYN3FN2AVUZ5L5EBH4/action/author_attestation","sign_citation":"https://pith.science/pith/WUR3S4J4YYN3FN2AVUZ5L5EBH4/action/citation_signature","submit_replication":"https://pith.science/pith/WUR3S4J4YYN3FN2AVUZ5L5EBH4/action/replication_record"}},"created_at":"2026-07-05T04:09:28.958426+00:00","updated_at":"2026-07-05T04:09:28.958426+00:00"}