{"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/exchangeable-modelling-of-relational-data","title":"Exchangeable modelling of relational data: checking sparsity, train-test splitting, and sparse exchangeable Poisson matrix factorization","arxiv_id":"1712.02311","date":"2017-12-06","proceeding":null,"authors":["Victor Veitch","Ekansh Sharma","Zacharie Naulet","Daniel M. Roy"],"abstract":"A variety of machine learning tasks---e.g., matrix factorization, topic\nmodelling, and feature allocation---can be viewed as learning the parameters of\na probability distribution over bipartite graphs. Recently, a new class of\nmodels for networks, the sparse exchangeable graphs, have been introduced to\nresolve some important pathologies of traditional approaches to statistical\nnetwork modelling; most notably, the inability to model sparsity (in the\nasymptotic sense). The present paper explains some practical insights arising\nfrom this work. We first show how to check if sparsity is relevant for\nmodelling a given (fixed size) dataset by using network subsampling to identify\na simple signature of sparsity. We discuss the implications of the (sparse)\nexchangeable subsampling theory for test-train dataset splitting; we argue\ncommon approaches can lead to biased results, and we propose a principled\nalternative. Finally, we study sparse exchangeable Poisson matrix factorization\nas a worked example. In particular, we show how to adapt mean field variational\ninference to the sparse exchangeable setting, allowing us to scale inference to\nhuge datasets.","url_abs":"http://arxiv.org/abs/1712.02311v1","url_pdf":"http://arxiv.org/pdf/1712.02311v1.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":"exchangeable-modelling-of-relational-data","repo_url":"https://github.com/ekanshs/graphex-nnmf","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"tf","reach":null}],"tasks":[{"task_slug":"variational-inference","task_name":"Variational Inference"}],"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":"ekanshs/graphex-nnmf","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":"0ddf007b38e81b9c9019458906d54406c7fac735ff8c87f0216538f091dd3a13","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}