{"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/machine-learning-meets-stochastic-geometry","title":"Machine Learning meets Stochastic Geometry: Determinantal Subset Selection for Wireless Networks","arxiv_id":"1905.00504","date":"2019-05-01","proceeding":null,"authors":["Chiranjib Saha","Harpreet S. Dhillon"],"abstract":"In wireless networks, many problems can be formulated as subset selection\nproblems where the goal is to select a subset from the ground set with the\nobjective of maximizing some objective function. These problems are typically\nNP-hard and hence solved through carefully constructed heuristics, which are\nthemselves mostly NP-complete and thus not easily applicable to large networks.\nOn the other hand, subset selection problems occur in slightly different\ncontext in machine learning (ML) where the goal is to select a subset of high\nquality yet diverse items from a ground set. In this paper, we introduce a\nnovel DPP-based learning (DPPL) framework for efficiently solving subset\nselection problems in wireless networks. The DPPL is intended to replace the\ntraditional optimization algorithms for subset selection by learning the\nquality-diversity trade-off in the optimal subsets selected by an optimization\nroutine. As a case study, we apply DPPL to the wireless link scheduling\nproblem, where the goal is to determine the subset of simultaneously active\nlinks which maximizes the network-wide sum-rate. We demonstrate that the\nproposed DPPL approaches the optimal solution with significantly lower\ncomputational complexity than the popular optimization algorithms used for this\nproblem in the literature.","url_abs":"http://arxiv.org/abs/1905.00504v1","url_pdf":"http://arxiv.org/pdf/1905.00504v1.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":"machine-learning-meets-stochastic-geometry","repo_url":"https://github.com/stochastic-geometry/DPPL","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[{"task_slug":"machine-learning","task_name":"BIG-bench Machine Learning"},{"task_slug":"scheduling","task_name":"Scheduling"}],"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":"stochastic-geometry/DPPL","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0}],"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":"22d77faf3b31c50f94dbc758eaf185ca96f6365fc3c43fbd9101035be2601fc7","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}