Papers › Structure Your Data: Towards Semantic Graph Counterfactuals

Structure Your Data: Towards Semantic Graph Counterfactuals

11 Mar 2024arXiv:2403.06514archive 2025-07-28

Angeliki Dimitriou, Maria Lymperaiou, Giorgos Filandrianos, Konstantinos Thomas, Giorgos Stamou

Counterfactual explanations (CEs) based on concepts are explanations that consider alternative scenarios to understand which high-level semantic features contributed to particular model predictions. In this work, we propose CEs based on the semantic graphs accompanying input data to achieve more descriptive, accurate, and human-aligned explanations. Building upon state-of-the-art (SoTA) conceptual attempts, we adopt a model-agnostic edit-based approach and introduce leveraging GNNs for efficient Graph Edit Distance (GED) computation. With a focus on the visual domain, we represent images as scene graphs and obtain their GNN embeddings to bypass solving the NP-hard graph similarity problem for all input pairs, an integral part of the CE computation process. We apply our method to benchmark and real-world datasets with varying difficulty and availability of semantic annotations. Testing on diverse classifiers, we find that our CEs outperform previous SoTA explanation models based on semantics, including both white and black-box as well as conceptual and pixel-level approaches. Their superiority is proven quantitatively and qualitatively, as validated by human subjects, highlighting the significance of leveraging semantic edges in the presence of intricate relationships. Our model-agnostic graph-based approach is widely applicable and easily extensible, producing actionable explanations across different contexts.

PaperPDFCodeCode Syntology ran

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="2403.06514")

Code

Syntology Ran 8 of 11 code samples harvested from 1 repository linked to this paper; 3 have no recorded run. Of those that ran: 8 ran with no contract checked.

By repository: official repository: 11 samples from 1 repository, 8 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

aggeliki-dimitriou/sgce officialmentioned in papermentioned on GitHubpytorch report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

11 samples harvested; 8 ran; 0 honoured the contract we drafted; 3 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

8ran
3unverified

Licence: 11 of the 11 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from aggeliki-dimitriou/sgce. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: 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. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

construct_cost_functions aggeliki-dimitriou/sgce/ground_truth/ged.py official repository ran no licence file found · pointer only · b9611fe09cb76b85 · report
find_embedding_glove aggeliki-dimitriou/sgce/graph_kernels/kernels.py official repository ran no licence file found · pointer only · c3eb45be69b99e18 · report
find_embedding_glove aggeliki-dimitriou/sgce/gnns/approach_1/trainer.py official repository ran no licence file found · pointer only · 0a3c63bd9a108f5c · report
get_edges_to_match aggeliki-dimitriou/sgce/ground_truth/ged.py official repository ran no licence file found · pointer only · 6ea8206cb6594b57 · report
prepare_graph_kernel aggeliki-dimitriou/sgce/graph_kernels/kernels.py official repository ran no licence file found · pointer only · 7aa2d4c90b0d59ba · report
print_image aggeliki-dimitriou/sgce/graph_kernels/kernels.py official repository ran no licence file found · pointer only · 29b4daf42860e1ab · report
to_triples aggeliki-dimitriou/sgce/graph-extraction/driver-pedestrian-extract-graphs.py official repository ran no licence file found · pointer only · 77c4beee9e3fb82e · report
validate_cost_functions aggeliki-dimitriou/sgce/ground_truth/ged.py official repository ran no licence file found · pointer only · 2508671dc1937415 · report
convert_to_graph aggeliki-dimitriou/sgce/graph-extraction/driver-pedestrian-extract-graphs.py official repository unverified no licence file found · pointer only · 085d40d72ee3c03c · report
extract_scene_graph aggeliki-dimitriou/sgce/graph-extraction/ag-extract-graphs.py official repository unverified no licence file found · pointer only · 69fd0b4af3b7eab3 · report
make_graph_from_json aggeliki-dimitriou/sgce/graph-extraction/driver-pedestrian-extract-graphs.py official repository unverified no licence file found · pointer only · 7b9c1e0b99400e51 · report

Tasks

DescriptiveGraph Similarity

1 archive task tag without a task page not shown.

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Methods

Focus

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections