{"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/convex-density-constraints-for-computing","title":"Convex Density Constraints for Computing Plausible Counterfactual Explanations","arxiv_id":"2002.04862","date":"2020-02-12","proceeding":null,"authors":["André Artelt","Barbara Hammer"],"abstract":"The increasing deployment of machine learning as well as legal regulations such as EU's GDPR cause a need for user-friendly explanations of decisions proposed by machine learning models. Counterfactual explanations are considered as one of the most popular techniques to explain a specific decision of a model. While the computation of \"arbitrary\" counterfactual explanations is well studied, it is still an open research problem how to efficiently compute plausible and feasible counterfactual explanations. We build upon recent work and propose and study a formal definition of plausible counterfactual explanations. In particular, we investigate how to use density estimators for enforcing plausibility and feasibility of counterfactual explanations. For the purpose of efficient computations, we propose convex density constraints that ensure that the resulting counterfactual is located in a region of the data space of high density.","url_abs":"https://arxiv.org/abs/2002.04862v2","url_pdf":"https://arxiv.org/pdf/2002.04862v2.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":"convex-density-constraints-for-computing","repo_url":"https://github.com/andreArtelt/ConvexDensityConstraintsForPlausibleCounterfactuals","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[{"task_slug":"machine-learning","task_name":"BIG-bench Machine Learning"},{"task_slug":null,"task_name":"counterfactual"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=2002.04862","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.04862"}},"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":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/andreArtelt/ConvexDensityConstraintsForPlausibleCounterfactuals","reach":{"status":"ok","spdx":"MIT"}}],"summary":{"unverified":3},"by_repo_kind":{"official":{"samples":3,"ran":0,"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":"0cf7dd681c738e06","entry":"compute_overlap_of_path","repo":"andreArtelt/ConvexDensityConstraintsForPlausibleCounterfactuals","repo_kind":"official","path":"tree.py","file_url":"https://github.com/andreArtelt/ConvexDensityConstraintsForPlausibleCounterfactuals/blob/HEAD/tree.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"0cf7dd681c738e06"}},{"code_sha256_prefix":"78b431f68dc3205e","entry":"get_leafs_from_tree","repo":"andreArtelt/ConvexDensityConstraintsForPlausibleCounterfactuals","repo_kind":"official","path":"tree.py","file_url":"https://github.com/andreArtelt/ConvexDensityConstraintsForPlausibleCounterfactuals/blob/HEAD/tree.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"78b431f68dc3205e"}},{"code_sha256_prefix":"2e8314711b078c0a","entry":"leaf_to_path","repo":"andreArtelt/ConvexDensityConstraintsForPlausibleCounterfactuals","repo_kind":"official","path":"tree.py","file_url":"https://github.com/andreArtelt/ConvexDensityConstraintsForPlausibleCounterfactuals/blob/HEAD/tree.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"2e8314711b078c0a"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}