{"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/flexible-modeling-of-diversity-with-strongly","title":"Flexible Modeling of Diversity with Strongly Log-Concave Distributions","arxiv_id":"1906.05413","date":"2019-06-12","proceeding":"NeurIPS 2019 12","authors":["Joshua Robinson","Suvrit Sra","Stefanie Jegelka"],"abstract":"Strongly log-concave (SLC) distributions are a rich class of discrete probability distributions over subsets of some ground set. They are strictly more general than strongly Rayleigh (SR) distributions such as the well-known determinantal point process. While SR distributions offer elegant models of diversity, they lack an easy control over how they express diversity. We propose SLC as the right extension of SR that enables easier, more intuitive control over diversity, illustrating this via examples of practical importance. We develop two fundamental tools needed to apply SLC distributions to learning and inference: sampling and mode finding. For sampling we develop an MCMC sampler and give theoretical mixing time bounds. For mode finding, we establish a weak log-submodularity property for SLC functions and derive optimization guarantees for a distorted greedy algorithm.","url_abs":"https://arxiv.org/abs/1906.05413v1","url_pdf":"https://arxiv.org/pdf/1906.05413v1.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":"flexible-modeling-of-diversity-with-strongly","repo_url":"https://github.com/joshr17/slc_sampling","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[{"task_slug":"diversity","task_name":"Diversity"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":"https://app.syntology.ai/?focus=1906.05413","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.05413"}},"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/joshr17/slc_sampling","reach":null}],"summary":{"ran_violates":1,"ran_draft_wrong":1,"unverified":1},"by_repo_kind":{"official":{"samples":3,"ran":2,"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":3,"samples":[{"code_sha256_prefix":"a4efe574e4d1a66e","entry":"compute_PSRF","repo":"joshr17/slc_sampling","repo_kind":"official","path":"mcSLCscaled.py","file_url":"https://github.com/joshr17/slc_sampling/blob/HEAD/mcSLCscaled.py","link_basis":"first_harvest_node","language":"python","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"a4efe574e4d1a66e"}},{"code_sha256_prefix":"f55ea3b545c6163b","entry":"dpp","repo":"joshr17/slc_sampling","repo_kind":"official","path":"mcSLCscaled.py","file_url":"https://github.com/joshr17/slc_sampling/blob/HEAD/mcSLCscaled.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"f55ea3b545c6163b"}},{"code_sha256_prefix":"0450b132e8e84b6e","entry":"compute_multivariate_PSRF","repo":"joshr17/slc_sampling","repo_kind":"official","path":"mcSLCscaled.py","file_url":"https://github.com/joshr17/slc_sampling/blob/HEAD/mcSLCscaled.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"0450b132e8e84b6e"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}