{"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/batch-active-learning-using-determinantal","title":"Batch Active Learning Using Determinantal Point Processes","arxiv_id":"1906.07975","date":"2019-06-19","proceeding":null,"authors":["Erdem Biyik","Kenneth Wang","Nima Anari","Dorsa Sadigh"],"abstract":"Data collection and labeling is one of the main challenges in employing machine learning algorithms in a variety of real-world applications with limited data. While active learning methods attempt to tackle this issue by labeling only the data samples that give high information, they generally suffer from large computational costs and are impractical in settings where data can be collected in parallel. Batch active learning methods attempt to overcome this computational burden by querying batches of samples at a time. To avoid redundancy between samples, previous works rely on some ad hoc combination of sample quality and diversity. In this paper, we present a new principled batch active learning method using Determinantal Point Processes, a repulsive point process that enables generating diverse batches of samples. We develop tractable algorithms to approximate the mode of a DPP distribution, and provide theoretical guarantees on the degree of approximation. We further demonstrate that an iterative greedy method for DPP maximization, which has lower computational costs but worse theoretical guarantees, still gives competitive results for batch active learning. Our experiments show the value of our methods on several datasets against state-of-the-art baselines.","url_abs":"https://arxiv.org/abs/1906.07975v1","url_pdf":"https://arxiv.org/pdf/1906.07975v1.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":"batch-active-learning-using-determinantal","repo_url":"https://github.com/Stanford-ILIAD/DPP-Batch-Active-Learning","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[{"task_slug":"active-learning","task_name":"Active Learning"},{"task_slug":"diversity","task_name":"Diversity"},{"task_slug":"point-processes","task_name":"Point Processes"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=1906.07975","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.07975"}},"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/Stanford-ILIAD/DPP-Batch-Active-Learning","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":"7b31c8b445431412","entry":"feature","repo":"Stanford-ILIAD/DPP-Batch-Active-Learning","repo_kind":"official","path":"reward_learning/feature.py","file_url":"https://github.com/Stanford-ILIAD/DPP-Batch-Active-Learning/blob/HEAD/reward_learning/feature.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":"7b31c8b445431412"}},{"code_sha256_prefix":"36a4e0da182e8207","entry":"func","repo":"Stanford-ILIAD/DPP-Batch-Active-Learning","repo_kind":"official","path":"reward_learning/algos.py","file_url":"https://github.com/Stanford-ILIAD/DPP-Batch-Active-Learning/blob/HEAD/reward_learning/algos.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":"36a4e0da182e8207"}},{"code_sha256_prefix":"0af2862e2f7720fc","entry":"func_psi","repo":"Stanford-ILIAD/DPP-Batch-Active-Learning","repo_kind":"official","path":"reward_learning/algos.py","file_url":"https://github.com/Stanford-ILIAD/DPP-Batch-Active-Learning/blob/HEAD/reward_learning/algos.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":"0af2862e2f7720fc"}},{"code_sha256_prefix":"4497f69d2c6da5f1","entry":"generate_psi","repo":"Stanford-ILIAD/DPP-Batch-Active-Learning","repo_kind":"official","path":"reward_learning/algos.py","file_url":"https://github.com/Stanford-ILIAD/DPP-Batch-Active-Learning/blob/HEAD/reward_learning/algos.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":"4497f69d2c6da5f1"}},{"code_sha256_prefix":"418285ba39c6240b","entry":"kMedoids","repo":"Stanford-ILIAD/DPP-Batch-Active-Learning","repo_kind":"official","path":"reward_learning/kmedoids.py","file_url":"https://github.com/Stanford-ILIAD/DPP-Batch-Active-Learning/blob/HEAD/reward_learning/kmedoids.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":"418285ba39c6240b"}},{"code_sha256_prefix":"ec75197c05a8280e","entry":"sample_ids_mc","repo":"Stanford-ILIAD/DPP-Batch-Active-Learning","repo_kind":"official","path":"reward_learning/dpp_sampler.py","file_url":"https://github.com/Stanford-ILIAD/DPP-Batch-Active-Learning/blob/HEAD/reward_learning/dpp_sampler.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":"ec75197c05a8280e"}},{"code_sha256_prefix":"ba6d8c4f3f2eae3d","entry":"sample_mc","repo":"Stanford-ILIAD/DPP-Batch-Active-Learning","repo_kind":"official","path":"reward_learning/dpp_sampler.py","file_url":"https://github.com/Stanford-ILIAD/DPP-Batch-Active-Learning/blob/HEAD/reward_learning/dpp_sampler.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":"ba6d8c4f3f2eae3d"}},{"code_sha256_prefix":"bfc97faec4a3b7cb","entry":"setup_sampler","repo":"Stanford-ILIAD/DPP-Batch-Active-Learning","repo_kind":"official","path":"reward_learning/dpp_sampler.py","file_url":"https://github.com/Stanford-ILIAD/DPP-Batch-Active-Learning/blob/HEAD/reward_learning/dpp_sampler.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":"bfc97faec4a3b7cb"}},{"code_sha256_prefix":"bbfd88d6d34e2002","entry":"speed","repo":"Stanford-ILIAD/DPP-Batch-Active-Learning","repo_kind":"official","path":"reward_learning/feature.py","file_url":"https://github.com/Stanford-ILIAD/DPP-Batch-Active-Learning/blob/HEAD/reward_learning/feature.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":"bbfd88d6d34e2002"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}