{"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/190600547","title":"MaxGap Bandit: Adaptive Algorithms for Approximate Ranking","arxiv_id":"1906.00547","date":"2019-06-03","proceeding":"NeurIPS 2019 12","authors":["Sumeet Katariya","Ardhendu Tripathy","Robert Nowak"],"abstract":"This paper studies the problem of adaptively sampling from K distributions (arms) in order to identify the largest gap between any two adjacent means. We call this the MaxGap-bandit problem. This problem arises naturally in approximate ranking, noisy sorting, outlier detection, and top-arm identification in bandits. The key novelty of the MaxGap-bandit problem is that it aims to adaptively determine the natural partitioning of the distributions into a subset with larger means and a subset with smaller means, where the split is determined by the largest gap rather than a pre-specified rank or threshold. Estimating an arm's gap requires sampling its neighboring arms in addition to itself, and this dependence results in a novel hardness parameter that characterizes the sample complexity of the problem. We propose elimination and UCB-style algorithms and show that they are minimax optimal. Our experiments show that the UCB-style algorithms require 6-8x fewer samples than non-adaptive sampling to achieve the same error.","url_abs":"https://arxiv.org/abs/1906.00547v1","url_pdf":"https://arxiv.org/pdf/1906.00547v1.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":"190600547","repo_url":"https://github.com/sumeetsk/maxgap_bandit","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[{"task_slug":"outlier-detection","task_name":"Outlier Detection"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=1906.00547","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.00547"}},"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/sumeetsk/maxgap_bandit","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":"6d2915f14974e9f5","entry":"alg_stop_gap","repo":"sumeetsk/maxgap_bandit","repo_kind":"official","path":"stopping_times/stopping_times_plot.py","file_url":"https://github.com/sumeetsk/maxgap_bandit/blob/HEAD/stopping_times/stopping_times_plot.py","link_basis":"first_harvest_node","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":"6d2915f14974e9f5"}},{"code_sha256_prefix":"349deae2840730b9","entry":"calculate_ci","repo":"sumeetsk/maxgap_bandit","repo_kind":"official","path":"simulated_data/generate_data.py","file_url":"https://github.com/sumeetsk/maxgap_bandit/blob/HEAD/simulated_data/generate_data.py","link_basis":"first_harvest_node","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":"349deae2840730b9"}},{"code_sha256_prefix":"1cdf5e8762149dce","entry":"calculate_ci","repo":"sumeetsk/maxgap_bandit","repo_kind":"official","path":"streetview_data/generate_data.py","file_url":"https://github.com/sumeetsk/maxgap_bandit/blob/HEAD/streetview_data/generate_data.py","link_basis":"first_harvest_node","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":"1cdf5e8762149dce"}},{"code_sha256_prefix":"df110628f5dabffd","entry":"calculate_ci","repo":"sumeetsk/maxgap_bandit","repo_kind":"official","path":"stopping_times/utils/utils.py","file_url":"https://github.com/sumeetsk/maxgap_bandit/blob/HEAD/stopping_times/utils/utils.py","link_basis":"first_harvest_node","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":"df110628f5dabffd"}},{"code_sha256_prefix":"347fbbf0ecd16389","entry":"compute_hardness","repo":"sumeetsk/maxgap_bandit","repo_kind":"official","path":"stopping_times/stopping_times_plot.py","file_url":"https://github.com/sumeetsk/maxgap_bandit/blob/HEAD/stopping_times/stopping_times_plot.py","link_basis":"first_harvest_node","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":"347fbbf0ecd16389"}},{"code_sha256_prefix":"9dde95fb2ab4f0ef","entry":"get_best_lower_bound","repo":"sumeetsk/maxgap_bandit","repo_kind":"official","path":"simulated_data/generate_data.py","file_url":"https://github.com/sumeetsk/maxgap_bandit/blob/HEAD/simulated_data/generate_data.py","link_basis":"first_harvest_node","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":"9dde95fb2ab4f0ef"}},{"code_sha256_prefix":"09dcd23db9a22d77","entry":"left_gap_ub_fixedpos","repo":"sumeetsk/maxgap_bandit","repo_kind":"official","path":"simulated_data/generate_data.py","file_url":"https://github.com/sumeetsk/maxgap_bandit/blob/HEAD/simulated_data/generate_data.py","link_basis":"first_harvest_node","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":"09dcd23db9a22d77"}},{"code_sha256_prefix":"bd144fb49355868d","entry":"single_sim","repo":"sumeetsk/maxgap_bandit","repo_kind":"official","path":"stopping_times/generate_data.py","file_url":"https://github.com/sumeetsk/maxgap_bandit/blob/HEAD/stopping_times/generate_data.py","link_basis":"first_harvest_node","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":"bd144fb49355868d"}},{"code_sha256_prefix":"0fc0646337ae1d38","entry":"testrun","repo":"sumeetsk/maxgap_bandit","repo_kind":"official","path":"stopping_times/generate_data.py","file_url":"https://github.com/sumeetsk/maxgap_bandit/blob/HEAD/stopping_times/generate_data.py","link_basis":"first_harvest_node","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":"0fc0646337ae1d38"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}