{"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/discrete-neural-processes","title":"Neural Clustering Processes","arxiv_id":"1901.00409","date":"2018-12-28","proceeding":"ICML 2020 1","authors":["Ari Pakman","Yueqi Wang","Catalin Mitelut","JinHyung Lee","Liam Paninski"],"abstract":"Probabilistic clustering models (or equivalently, mixture models) are basic building blocks in countless statistical models and involve latent random variables over discrete spaces. For these models, posterior inference methods can be inaccurate and/or very slow. In this work we introduce deep network architectures trained with labeled samples from any generative model of clustered datasets. At test time, the networks generate approximate posterior samples of cluster labels for any new dataset of arbitrary size. We develop two complementary approaches to this task, requiring either O(N) or O(K) network forward passes per dataset, where N is the dataset size and K the number of clusters. Unlike previous approaches, our methods sample the labels of all the data points from a well-defined posterior, and can learn nonparametric Bayesian posteriors since they do not limit the number of mixture components. As a scientific application, we present a novel approach to neural spike sorting for high-density multielectrode arrays.","url_abs":"https://arxiv.org/abs/1901.00409v4","url_pdf":"https://arxiv.org/pdf/1901.00409v4.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":"discrete-neural-processes","repo_url":"https://github.com/aripakman/neural_clustering_process","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"discrete-neural-processes","repo_url":"https://github.com/tensorflow/neural-structured-learning/tree/master/research/neural_clustering","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"tf","reach":null},{"paper_slug":"discrete-neural-processes","repo_url":"https://github.com/aripakman/amortized_community_detection","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"discrete-neural-processes","repo_url":"https://github.com/aripakman/attentive_clustering_processes","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"discrete-neural-processes","repo_url":"https://github.com/yueqiw/ncp-sort","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"bayesian-inference","task_name":"Bayesian Inference"},{"task_slug":"clustering","task_name":"Clustering"},{"task_slug":"spike-sorting","task_name":"Spike Sorting"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1901.00409","atlas_url":"https://app.syntology.ai/?focus=1901.00409","mcp":null,"developers":"https://syntology.ai/developers","held":true,"reason":"arxiv_id_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"agent_calls":[{"tool":"get_citation_path","arguments":{"paper_1":"1901.00409"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1901.00409\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1901.00409"},"call":"get_concepts_for_paper(arxiv_id=\"1901.00409\")"}],"by_repo":[{"repo":"aripakman/neural_clustering_process","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"tensorflow/neural-structured-learning","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":2,"harvested_for":["1704.03976","2005.00545"],"harvested_for_calls":[{"arxiv_id":"1704.03976","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1704.03976"},"call":"get_harvested_code_for_paper(arxiv_id=\"1704.03976\")"},{"arxiv_id":"2005.00545","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2005.00545"},"call":"get_harvested_code_for_paper(arxiv_id=\"2005.00545\")"}]},{"repo":"aripakman/amortized_community_detection","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2010.15727"],"harvested_for_calls":[{"arxiv_id":"2010.15727","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2010.15727"},"call":"get_harvested_code_for_paper(arxiv_id=\"2010.15727\")"}]},{"repo":"aripakman/attentive_clustering_processes","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2010.15727"],"harvested_for_calls":[{"arxiv_id":"2010.15727","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2010.15727"},"call":"get_harvested_code_for_paper(arxiv_id=\"2010.15727\")"}]},{"repo":"yueqiw/ncp-sort","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0}],"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":"b5a068b0ee0eb6b53d0f7ad310062a761642fbd3bcf62b89a5ba36ffc83d768a","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}