{"about":{"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.","site":"https://codewithpapers.app","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","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/sampling-from-a-k-dpp-without-looking-at-all-1","title":"Sampling from a k-DPP without looking at all items","arxiv_id":null,"date":"2020-12-01","proceeding":"NeurIPS 2020 12","authors":["Daniele Calandriello","Michal Derezinski","Michal Valko"],"abstract":"Determinantal point processes (DPPs) are a useful probabilistic model for selecting\na small diverse subset out of a large collection of items, with applications in\nsummarization, recommendation, stochastic optimization, experimental design and\nmore. Given a kernel function and a subset size k, our goal is to sample k out\nof n items with probability proportional to the determinant of the kernel matrix\ninduced by the subset (a.k.a. k-DPP). Existing k-DPP sampling algorithms require\nan expensive preprocessing step which involves multiple passes over all n items,\nmaking it infeasible for large datasets. A naïve heuristic addressing this problem is\nto uniformly subsample a fraction of the data and perform k-DPP sampling only on\nthose items, however this method offers no guarantee that the produced sample will\neven approximately resemble the target distribution over the original dataset. In this\npaper, we develop alpha-DPP, an algorithm which adaptively builds a sufficiently large uniform\nsample of data that is then used to efficiently generate a smaller set of k items,\nwhile ensuring that this set is drawn exactly from the target distribution defined\non all n items. We show empirically that our\nalgorithm produces a k-DPP sample after observing only a small fraction of all\nelements, leading to several orders of magnitude faster performance compared to\nthe state-of-the-art. Our implementation of alpha-DPP is provided at https://github.com/guilgautier/DPPy/.","url_abs":"http://proceedings.neurips.cc/paper/2020/hash/4d410063822cd9be28f86701c0bc3a31-Abstract.html","url_pdf":"http://proceedings.neurips.cc/paper/2020/file/4d410063822cd9be28f86701c0bc3a31-Paper.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":"sampling-from-a-k-dpp-without-looking-at-all-1","repo_url":"https://github.com/guilgautier/DPPy","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[{"task_slug":"all","task_name":"All"},{"task_slug":"experimental-design","task_name":"Experimental Design"},{"task_slug":"point-processes","task_name":"Point Processes"},{"task_slug":"stochastic-optimization","task_name":"Stochastic Optimization"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"no_arxiv_id","checked_against":null,"by_repo":[{"repo":"guilgautier/DPPy","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2201.13357"],"harvested_for_calls":[{"arxiv_id":"2201.13357","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2201.13357"},"call":"get_harvested_code_for_paper(arxiv_id=\"2201.13357\")"}]}],"by_repo_harvested_for_is":"harvested_for: the arXiv ids (as Syntology's graph holds them) of every paper whose samples Syntology's graph links to this repository, in arXiv-id order, complete; the page names the first 3 and says how many more. A link only: it does not say the papers are the same work, that one copied the other, or that the code implements this paper's method; harvested_for_calls gives the get_harvested_code_for_paper call for each arXiv-shaped id among them","by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"fb0f1ac01803da2b9b4adef24d53ed1b945544ad6f878c1ef558d6ec5b6ab996","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}