{"about":{"site":"https://codewithpapers.app","non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page"},"url":"/paper/near-optimal-collaborative-learning-in","title":"Near-Optimal Collaborative Learning in Bandits","arxiv_id":"2206.00121","date":"2022-05-31","proceeding":null,"authors":["Clémence Réda","Sattar Vakili","Emilie Kaufmann"],"abstract":"This paper introduces a general multi-agent bandit model in which each agent is facing a finite set of arms and may communicate with other agents through a central controller in order to identify, in pure exploration, or play, in regret minimization, its optimal arm. The twist is that the optimal arm for each agent is the arm with largest expected mixed reward, where the mixed reward of an arm is a weighted sum of the rewards of this arm for all agents. This makes communication between agents often necessary. This general setting allows to recover and extend several recent models for collaborative bandit learning, including the recently proposed federated learning with personalization (Shi et al., 2021). In this paper, we provide new lower bounds on the sample complexity of pure exploration and on the regret. We then propose a near-optimal algorithm for pure exploration. This algorithm is based on phased elimination with two novel ingredients: a data-dependent sampling scheme within each phase, aimed at matching a relaxation of the lower bound.","url_abs":"https://arxiv.org/abs/2206.00121v2","url_pdf":"https://arxiv.org/pdf/2206.00121v2.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"near-optimal-collaborative-learning-in","repo_url":"https://github.com/clreda/near-optimal-federated","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[{"task_slug":"federated-learning","task_name":"Federated Learning"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=2206.00121","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.00121"}},"developers":"https://syntology.ai/developers","read_at":"2026-09-24T18:15:14+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/clreda/near-optimal-federated","reach":{"status":"ok","spdx":"MIT"}}],"summary":{"unverified":9},"by_repo_kind":{"official":{"samples":9,"ran":0,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":0,"samples":[{"code_sha256_prefix":"5fffb0e7d511975c","entry":"argmax_m","repo":"clreda/near-optimal-federated","repo_kind":"official","path":"utils.py","file_url":"https://github.com/clreda/near-optimal-federated/blob/HEAD/utils.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"5fffb0e7d511975c"}},{"code_sha256_prefix":"1d3ac5e0714e6843","entry":"argmax_m_ls","repo":"clreda/near-optimal-federated","repo_kind":"official","path":"utils.py","file_url":"https://github.com/clreda/near-optimal-federated/blob/HEAD/utils.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"1d3ac5e0714e6843"}},{"code_sha256_prefix":"bb43ed36296f2fb1","entry":"expExploration","repo":"clreda/near-optimal-federated","repo_kind":"official","path":"betas.py","file_url":"https://github.com/clreda/near-optimal-federated/blob/HEAD/betas.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"bb43ed36296f2fb1"}},{"code_sha256_prefix":"a94455fe719472c7","entry":"explogExploration","repo":"clreda/near-optimal-federated","repo_kind":"official","path":"betas.py","file_url":"https://github.com/clreda/near-optimal-federated/blob/HEAD/betas.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"a94455fe719472c7"}},{"code_sha256_prefix":"a43a3db7a9995fd7","entry":"logExploration","repo":"clreda/near-optimal-federated","repo_kind":"official","path":"betas.py","file_url":"https://github.com/clreda/near-optimal-federated/blob/HEAD/betas.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"a43a3db7a9995fd7"}},{"code_sha256_prefix":"2def288ba76c63b9","entry":"problem_solution_util","repo":"clreda/near-optimal-federated","repo_kind":"official","path":"solving.py","file_url":"https://github.com/clreda/near-optimal-federated/blob/HEAD/solving.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"2def288ba76c63b9"}},{"code_sha256_prefix":"8429496c71df1f6e","entry":"randf","repo":"clreda/near-optimal-federated","repo_kind":"official","path":"utils.py","file_url":"https://github.com/clreda/near-optimal-federated/blob/HEAD/utils.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"8429496c71df1f6e"}},{"code_sha256_prefix":"9b7071ed1d4b052c","entry":"solve_decoupled","repo":"clreda/near-optimal-federated","repo_kind":"official","path":"solving.py","file_url":"https://github.com/clreda/near-optimal-federated/blob/HEAD/solving.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"9b7071ed1d4b052c"}},{"code_sha256_prefix":"7cd860031cd67cf2","entry":"solve_oracle","repo":"clreda/near-optimal-federated","repo_kind":"official","path":"solving.py","file_url":"https://github.com/clreda/near-optimal-federated/blob/HEAD/solving.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"7cd860031cd67cf2"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}