{"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/delaunay-component-analysis-for-evaluation-of-1","title":"Delaunay Component Analysis for Evaluation of Data Representations","arxiv_id":"2202.06866","date":"2022-02-14","proceeding":"ICLR 2022 4","authors":["Petra Poklukar","Vladislav Polianskii","Anastasia Varava","Florian Pokorny","Danica Kragic"],"abstract":"Advanced representation learning techniques require reliable and general evaluation methods. Recently, several algorithms based on the common idea of geometric and topological analysis of a manifold approximated from the learned data representations have been proposed. In this work, we introduce Delaunay Component Analysis (DCA) - an evaluation algorithm which approximates the data manifold using a more suitable neighbourhood graph called Delaunay graph. This provides a reliable manifold estimation even for challenging geometric arrangements of representations such as clusters with varying shape and density as well as outliers, which is where existing methods often fail. Furthermore, we exploit the nature of Delaunay graphs and introduce a framework for assessing the quality of individual novel data representations. We experimentally validate the proposed DCA method on representations obtained from neural networks trained with contrastive objective, supervised and generative models, and demonstrate various use cases of our extended single point evaluation framework.","url_abs":"https://arxiv.org/abs/2202.06866v1","url_pdf":"https://arxiv.org/pdf/2202.06866v1.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":"delaunay-component-analysis-for-evaluation-of-1","repo_url":"https://github.com/petrapoklukar/dca","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[{"task_slug":"representation-learning","task_name":"Representation Learning"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/2202.06866","atlas_url":"https://app.syntology.ai/?focus=2202.06866","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2202.06866"}},"developers":"https://syntology.ai/developers","read_at":"2026-09-25T09:33:49+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":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/petrapoklukar/dca","reach":{"status":"ok","spdx":"MIT"}}],"summary":{"ran":7},"by_repo_kind":{"official":{"samples":7,"ran":7,"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":0,"samples":[{"code_sha256_prefix":"30b6fc26960f032b","entry":"get_color","repo":"petrapoklukar/dca","repo_kind":"official","path":"dca/visualization.py","file_url":"https://github.com/petrapoklukar/dca/blob/HEAD/dca/visualization.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"30b6fc26960f032b"}},{"code_sha256_prefix":"84664625dedeb394","entry":"get_parameters","repo":"petrapoklukar/dca","repo_kind":"official","path":"dca/loggers.py","file_url":"https://github.com/petrapoklukar/dca/blob/HEAD/dca/loggers.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"84664625dedeb394"}},{"code_sha256_prefix":"5ab465dfd8afcea8","entry":"get_pruned_representation_idxs_by_class","repo":"petrapoklukar/dca","repo_kind":"official","path":"experiments/contrastive_learning/CL_utils.py","file_url":"https://github.com/petrapoklukar/dca/blob/HEAD/experiments/contrastive_learning/CL_utils.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"5ab465dfd8afcea8"}},{"code_sha256_prefix":"b8a9dd388787d96a","entry":"get_representation_idxs_by_class","repo":"petrapoklukar/dca","repo_kind":"official","path":"experiments/contrastive_learning/CL_utils.py","file_url":"https://github.com/petrapoklukar/dca/blob/HEAD/experiments/contrastive_learning/CL_utils.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"b8a9dd388787d96a"}},{"code_sha256_prefix":"d5900b018d972545","entry":"get_representations_by_class","repo":"petrapoklukar/dca","repo_kind":"official","path":"experiments/contrastive_learning/CL_utils.py","file_url":"https://github.com/petrapoklukar/dca/blob/HEAD/experiments/contrastive_learning/CL_utils.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"d5900b018d972545"}},{"code_sha256_prefix":"24f72f380835031d","entry":"logger_time","repo":"petrapoklukar/dca","repo_kind":"official","path":"dca/delaunay_graph.py","file_url":"https://github.com/petrapoklukar/dca/blob/HEAD/dca/delaunay_graph.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"24f72f380835031d"}},{"code_sha256_prefix":"7bac25afd5656c90","entry":"logger_time","repo":"petrapoklukar/dca","repo_kind":"official","path":"dca/loggers.py","file_url":"https://github.com/petrapoklukar/dca/blob/HEAD/dca/loggers.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"7bac25afd5656c90"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}