{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:RQA2VZUVE4W4456VCHC5Q4RGDE","short_pith_number":"pith:RQA2VZUV","schema_version":"1.0","canonical_sha256":"8c01aae695272dce77d511c5d872261927693904e00113b8d898a247151e4ac4","source":{"kind":"arxiv","id":"2306.07903","version":1},"attestation_state":"computed","paper":{"title":"Tight Memory-Regret Lower Bounds for Streaming Bandits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Junhao Wang, Lan Zhang, Shaoang Li, Xiang-Yang Li","submitted_at":"2023-06-13T16:54:13Z","abstract_excerpt":"In this paper, we investigate the streaming bandits problem, wherein the learner aims to minimize regret by dealing with online arriving arms and sublinear arm memory. We establish the tight worst-case regret lower bound of $\\Omega \\left( (TB)^{\\alpha} K^{1-\\alpha}\\right), \\alpha = 2^{B} / (2^{B+1}-1)$ for any algorithm with a time horizon $T$, number of arms $K$, and number of passes $B$. The result reveals a separation between the stochastic bandits problem in the classical centralized setting and the streaming setting with bounded arm memory. Notably, in comparison to the well-known $\\Omega"},"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":"2306.07903","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-06-13T16:54:13Z","cross_cats_sorted":[],"title_canon_sha256":"53e4e8dc215d8649ca70e39347e5698db40faee8a76283e43844f0a1c576dccc","abstract_canon_sha256":"97a87a4c6641c91d388c692478b08e588e9f1afd8e1d97fc8a5f6d13cf0223cb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:20:10.481169Z","signature_b64":"973duVJPHdfGx6TD8rcAXQ1Zw+IAtF+aNpxOPeoCE8HR6Wh34PGHpc2Mnmk2MJJ8jQbvJAO5q5McmkYfJbPyAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8c01aae695272dce77d511c5d872261927693904e00113b8d898a247151e4ac4","last_reissued_at":"2026-07-05T06:20:10.480702Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:20:10.480702Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tight Memory-Regret Lower Bounds for Streaming Bandits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Junhao Wang, Lan Zhang, Shaoang Li, Xiang-Yang Li","submitted_at":"2023-06-13T16:54:13Z","abstract_excerpt":"In this paper, we investigate the streaming bandits problem, wherein the learner aims to minimize regret by dealing with online arriving arms and sublinear arm memory. We establish the tight worst-case regret lower bound of $\\Omega \\left( (TB)^{\\alpha} K^{1-\\alpha}\\right), \\alpha = 2^{B} / (2^{B+1}-1)$ for any algorithm with a time horizon $T$, number of arms $K$, and number of passes $B$. The result reveals a separation between the stochastic bandits problem in the classical centralized setting and the streaming setting with bounded arm memory. Notably, in comparison to the well-known $\\Omega"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.07903","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/2306.07903/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":"2306.07903","created_at":"2026-07-05T06:20:10.480759+00:00"},{"alias_kind":"arxiv_version","alias_value":"2306.07903v1","created_at":"2026-07-05T06:20:10.480759+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.07903","created_at":"2026-07-05T06:20:10.480759+00:00"},{"alias_kind":"pith_short_12","alias_value":"RQA2VZUVE4W4","created_at":"2026-07-05T06:20:10.480759+00:00"},{"alias_kind":"pith_short_16","alias_value":"RQA2VZUVE4W4456V","created_at":"2026-07-05T06:20:10.480759+00:00"},{"alias_kind":"pith_short_8","alias_value":"RQA2VZUV","created_at":"2026-07-05T06:20:10.480759+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.01067","citing_title":"Nearly Tight Bounds for Exploration in Streaming Multi-armed Bandits with Known Optimality Gap","ref_index":24,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RQA2VZUVE4W4456VCHC5Q4RGDE","json":"https://pith.science/pith/RQA2VZUVE4W4456VCHC5Q4RGDE.json","graph_json":"https://pith.science/api/pith-number/RQA2VZUVE4W4456VCHC5Q4RGDE/graph.json","events_json":"https://pith.science/api/pith-number/RQA2VZUVE4W4456VCHC5Q4RGDE/events.json","paper":"https://pith.science/paper/RQA2VZUV"},"agent_actions":{"view_html":"https://pith.science/pith/RQA2VZUVE4W4456VCHC5Q4RGDE","download_json":"https://pith.science/pith/RQA2VZUVE4W4456VCHC5Q4RGDE.json","view_paper":"https://pith.science/paper/RQA2VZUV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2306.07903&json=true","fetch_graph":"https://pith.science/api/pith-number/RQA2VZUVE4W4456VCHC5Q4RGDE/graph.json","fetch_events":"https://pith.science/api/pith-number/RQA2VZUVE4W4456VCHC5Q4RGDE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RQA2VZUVE4W4456VCHC5Q4RGDE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RQA2VZUVE4W4456VCHC5Q4RGDE/action/storage_attestation","attest_author":"https://pith.science/pith/RQA2VZUVE4W4456VCHC5Q4RGDE/action/author_attestation","sign_citation":"https://pith.science/pith/RQA2VZUVE4W4456VCHC5Q4RGDE/action/citation_signature","submit_replication":"https://pith.science/pith/RQA2VZUVE4W4456VCHC5Q4RGDE/action/replication_record"}},"created_at":"2026-07-05T06:20:10.480759+00:00","updated_at":"2026-07-05T06:20:10.480759+00:00"}