{"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/ranking-deep-learning-generalization-using","title":"Ranking Deep Learning Generalization using Label Variation in Latent Geometry Graphs","arxiv_id":"2011.12737","date":"2020-11-25","proceeding":null,"authors":["Carlos Lassance","Louis Béthune","Myriam Bontonou","Mounia Hamidouche","Vincent Gripon"],"abstract":"Measuring the generalization performance of a Deep Neural Network (DNN) without relying on a validation set is a difficult task. In this work, we propose exploiting Latent Geometry Graphs (LGGs) to represent the latent spaces of trained DNN architectures. Such graphs are obtained by connecting samples that yield similar latent representations at a given layer of the considered DNN. We then obtain a generalization score by looking at how strongly connected are samples of distinct classes in LGGs. This score allowed us to rank 3rd on the NeurIPS 2020 Predicting Generalization in Deep Learning (PGDL) competition.","url_abs":"https://arxiv.org/abs/2011.12737v1","url_pdf":"https://arxiv.org/pdf/2011.12737v1.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":"ranking-deep-learning-generalization-using","repo_url":"https://github.com/cadurosar/pgdl","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"tf","reach":null}],"tasks":[{"task_slug":"deep-learning","task_name":"Deep Learning"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=2011.12737","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2011.12737"}},"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":"deterministic:regex_extraction","url":"https://github.com/cadurosar/pgdl","reach":null}],"summary":{"ran_honours":2,"ran_fixture":2},"by_repo_kind":{"official":{"samples":4,"ran":4,"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":4,"samples":[{"code_sha256_prefix":"f14764962227ea38","entry":"RBF","repo":"cadurosar/pgdl","repo_kind":"official","path":"VPM_1/complexity.py","file_url":"https://github.com/cadurosar/pgdl/blob/HEAD/VPM_1/complexity.py","link_basis":"first_harvest_node","language":"python","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NOASSERTION","inline_ok":false,"mcp_get_code":{"code_sha256":"f14764962227ea38"}},{"code_sha256_prefix":"a51ddc44784470aa","entry":"generate_laplacian","repo":"cadurosar/pgdl","repo_kind":"official","path":"VPM_1/complexity.py","file_url":"https://github.com/cadurosar/pgdl/blob/HEAD/VPM_1/complexity.py","link_basis":"first_harvest_node","language":"python","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NOASSERTION","inline_ok":false,"mcp_get_code":{"code_sha256":"a51ddc44784470aa"}},{"code_sha256_prefix":"2a55ae733f97a45f","entry":"get_distances","repo":"cadurosar/pgdl","repo_kind":"official","path":"VPM_1/complexity.py","file_url":"https://github.com/cadurosar/pgdl/blob/HEAD/VPM_1/complexity.py","link_basis":"first_harvest_node","language":"python","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NOASSERTION","inline_ok":false,"mcp_get_code":{"code_sha256":"2a55ae733f97a45f"}},{"code_sha256_prefix":"ac888ac53f5c64ca","entry":"knn_tf","repo":"cadurosar/pgdl","repo_kind":"official","path":"VPM_1/complexity.py","file_url":"https://github.com/cadurosar/pgdl/blob/HEAD/VPM_1/complexity.py","link_basis":"first_harvest_node","language":"python","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NOASSERTION","inline_ok":false,"mcp_get_code":{"code_sha256":"ac888ac53f5c64ca"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}