{"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/consistencies-and-inconsistencies-between","title":"Consistencies and inconsistencies between model selection and link prediction in networks","arxiv_id":"1705.07967","date":"2017-05-22","proceeding":null,"authors":["Toni Vallès-Català","Tiago P. Peixoto","Roger Guimerà","Marta Sales-Pardo"],"abstract":"A principled approach to understand network structures is to formulate\ngenerative models. Given a collection of models, however, an outstanding key\ntask is to determine which one provides a more accurate description of the\nnetwork at hand, discounting statistical fluctuations. This problem can be\napproached using two principled criteria that at first may seem equivalent:\nselecting the most plausible model in terms of its posterior probability; or\nselecting the model with the highest predictive performance in terms of\nidentifying missing links. Here we show that while these two approaches yield\nconsistent results in most of cases, there are also notable instances where\nthey do not, that is, where the most plausible model is not the most\npredictive. We show that in the latter case the improvement of predictive\nperformance can in fact lead to overfitting both in artificial and empirical\nsettings. Furthermore, we show that, in general, the predictive performance is\nhigher when we average over collections of models that are individually less\nplausible, than when we consider only the single most plausible model.","url_abs":"http://arxiv.org/abs/1705.07967v2","url_pdf":"http://arxiv.org/pdf/1705.07967v2.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":"consistencies-and-inconsistencies-between","repo_url":"https://git.skewed.de/count0/graph-tool","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[{"task_slug":"link-prediction","task_name":"Link Prediction"},{"task_slug":"model-selection","task_name":"Model Selection"}],"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":"git.skewed.de/count0/graph-tool","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":"8eb684334bc8b051232099b6f1b47381c6bddd66ef1c6ca877c9f58ac1f2cfab","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}