{"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/zonotope-hit-and-run-for-efficient-sampling","title":"Zonotope hit-and-run for efficient sampling from projection DPPs","arxiv_id":"1705.10498","date":"2017-05-30","proceeding":"ICML 2017 8","authors":["Guillaume Gautier","Rémi Bardenet","Michal Valko"],"abstract":"Determinantal point processes (DPPs) are distributions over sets of items\nthat model diversity using kernels. Their applications in machine learning\ninclude summary extraction and recommendation systems. Yet, the cost of\nsampling from a DPP is prohibitive in large-scale applications, which has\ntriggered an effort towards efficient approximate samplers. We build a novel\nMCMC sampler that combines ideas from combinatorial geometry, linear\nprogramming, and Monte Carlo methods to sample from DPPs with a fixed sample\ncardinality, also called projection DPPs. Our sampler leverages the ability of\nthe hit-and-run MCMC kernel to efficiently move across convex bodies. Previous\ntheoretical results yield a fast mixing time of our chain when targeting a\ndistribution that is close to a projection DPP, but not a DPP in general. Our\nempirical results demonstrate that this extends to sampling projection DPPs,\ni.e., our sampler is more sample-efficient than previous approaches which in\nturn translates to faster convergence when dealing with costly-to-evaluate\nfunctions, such as summary extraction in our experiments.","url_abs":"http://arxiv.org/abs/1705.10498v2","url_pdf":"http://arxiv.org/pdf/1705.10498v2.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":"zonotope-hit-and-run-for-efficient-sampling","repo_url":"https://github.com/guilgautier/DPPy","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[{"task_slug":"diversity","task_name":"Diversity"},{"task_slug":"point-processes","task_name":"Point Processes"},{"task_slug":"recommendation-systems","task_name":"Recommendation Systems"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"arxiv_id_not_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"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":"33acbe80c7255a1d59968cbd7440b77b876cc21b760c37a6c1cd3ae1d2348426","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}