{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:JZRTAIINI2UBR6RK3AUDQFUBYP","short_pith_number":"pith:JZRTAIIN","schema_version":"1.0","canonical_sha256":"4e6330210d46a818fa2ad828381681c3eb9d9cc0298322bc46d6abdaed58b3b5","source":{"kind":"arxiv","id":"2007.08561","version":1},"attestation_state":"computed","paper":{"title":"A Smoothed Analysis of Online Lasso for the Sparse Linear Contextual Bandit Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Bo Waggoner, Huazheng Wang, Lijun Chen, Youjian (Eugene) Liu, Zhiyuan Liu","submitted_at":"2020-07-16T18:48:45Z","abstract_excerpt":"We investigate the sparse linear contextual bandit problem where the parameter $\\theta$ is sparse. To relieve the sampling inefficiency, we utilize the \"perturbed adversary\" where the context is generated adversarilly but with small random non-adaptive perturbations. We prove that the simple online Lasso supports sparse linear contextual bandit with regret bound $\\mathcal{O}(\\sqrt{kT\\log d})$ even when $d \\gg T$ where $k$ and $d$ are the number of effective and ambient dimension, respectively. Compared to the recent work from Sivakumar et al. (2020), our analysis does not rely on the precondit"},"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":"2007.08561","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-07-16T18:48:45Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"55da76790e31f280a1cc97423bbba2e294e2c7af6a379ea017242fa726ab2966","abstract_canon_sha256":"5dc1531d8155e066869844571f74b1d4852e3a1ade137182e5bfe371610818c9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:19:54.280575Z","signature_b64":"H1dQl13zquqk02eU8eZG+1WNFeKBeuGVJJUEUJiJWS6hCkR1y72fFEe9j4aBOWAPI3Nd/wSKDuXKB+GgP0GDDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4e6330210d46a818fa2ad828381681c3eb9d9cc0298322bc46d6abdaed58b3b5","last_reissued_at":"2026-07-05T01:19:54.280155Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:19:54.280155Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Smoothed Analysis of Online Lasso for the Sparse Linear Contextual Bandit Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Bo Waggoner, Huazheng Wang, Lijun Chen, Youjian (Eugene) Liu, Zhiyuan Liu","submitted_at":"2020-07-16T18:48:45Z","abstract_excerpt":"We investigate the sparse linear contextual bandit problem where the parameter $\\theta$ is sparse. To relieve the sampling inefficiency, we utilize the \"perturbed adversary\" where the context is generated adversarilly but with small random non-adaptive perturbations. We prove that the simple online Lasso supports sparse linear contextual bandit with regret bound $\\mathcal{O}(\\sqrt{kT\\log d})$ even when $d \\gg T$ where $k$ and $d$ are the number of effective and ambient dimension, respectively. Compared to the recent work from Sivakumar et al. (2020), our analysis does not rely on the precondit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2007.08561","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/2007.08561/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":"2007.08561","created_at":"2026-07-05T01:19:54.280212+00:00"},{"alias_kind":"arxiv_version","alias_value":"2007.08561v1","created_at":"2026-07-05T01:19:54.280212+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.08561","created_at":"2026-07-05T01:19:54.280212+00:00"},{"alias_kind":"pith_short_12","alias_value":"JZRTAIINI2UB","created_at":"2026-07-05T01:19:54.280212+00:00"},{"alias_kind":"pith_short_16","alias_value":"JZRTAIINI2UBR6RK","created_at":"2026-07-05T01:19:54.280212+00:00"},{"alias_kind":"pith_short_8","alias_value":"JZRTAIIN","created_at":"2026-07-05T01:19:54.280212+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JZRTAIINI2UBR6RK3AUDQFUBYP","json":"https://pith.science/pith/JZRTAIINI2UBR6RK3AUDQFUBYP.json","graph_json":"https://pith.science/api/pith-number/JZRTAIINI2UBR6RK3AUDQFUBYP/graph.json","events_json":"https://pith.science/api/pith-number/JZRTAIINI2UBR6RK3AUDQFUBYP/events.json","paper":"https://pith.science/paper/JZRTAIIN"},"agent_actions":{"view_html":"https://pith.science/pith/JZRTAIINI2UBR6RK3AUDQFUBYP","download_json":"https://pith.science/pith/JZRTAIINI2UBR6RK3AUDQFUBYP.json","view_paper":"https://pith.science/paper/JZRTAIIN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2007.08561&json=true","fetch_graph":"https://pith.science/api/pith-number/JZRTAIINI2UBR6RK3AUDQFUBYP/graph.json","fetch_events":"https://pith.science/api/pith-number/JZRTAIINI2UBR6RK3AUDQFUBYP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JZRTAIINI2UBR6RK3AUDQFUBYP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JZRTAIINI2UBR6RK3AUDQFUBYP/action/storage_attestation","attest_author":"https://pith.science/pith/JZRTAIINI2UBR6RK3AUDQFUBYP/action/author_attestation","sign_citation":"https://pith.science/pith/JZRTAIINI2UBR6RK3AUDQFUBYP/action/citation_signature","submit_replication":"https://pith.science/pith/JZRTAIINI2UBR6RK3AUDQFUBYP/action/replication_record"}},"created_at":"2026-07-05T01:19:54.280212+00:00","updated_at":"2026-07-05T01:19:54.280212+00:00"}