Aug 2026· Proceedings of the 32nd ACM SIGKDD Conference on Knowledge Discovery and Data Mining V.2· 0 citations· 11 references
TL;DR
ProgNet, a graph learning framework for interpretable graph classification that treats explanatory structures as first-class, reusable components of the prediction mechanism, introduces a paradigm where reasoning is grounded in a shared vocabulary of reusable structural programs.
Abstract
We present ProgNet, a graph learning framework for interpretable graph classification that treats explanatory structures as first-class, reusable components of the prediction mechanism. Departing from existing methods that generate isolated, instance-specific explanations, ProgNet introduces a paradigm where reasoning is grounded in a shared vocabulary of reusable structural programs. Specifically, ProgNet represents each graph using a shared vocabulary of human-interpretable programs written in a graph pattern description language, grounding predictions in explicit structural evidence rather than latent embeddings alone. The vocabulary is constructed to promote both coverage and diversity, yielding compact and reusable structural primitives that generalize across instances. Classification is performed via an inherently decomposable evidence composition network that scores and aggregates program-level evidence, resulting in predictions whose logits admit additive, signed attributions. Extensive experiments on eight graph classification benchmarks demonstrate that ProgNet achieves competitive predictive accuracy while providing more faithful explanations.
Results support IAIML as a compact, interaction-aware framework appropriate for settings where bounded explanation size and controlled treatment of feature interactions are design requirements.
The package implements PathBoost, a gradient boosting algorithm that automatically discovers predictive labeled paths within graphs during the learning process, which produces an additive prediction model over path-based features that explicitly reveals which substructures drive predictions.
Claudio Meggio, Johan Pensar, R. D. Bin· 0 citations
GraphIR, an architecture-aware intermediate representation that supplements executable programs with a mutation-aligned candidate state, achieves the best overall search performance while maintaining comparable model size and favorable end-to-end NAS efficiency when integrated into OpenEvolve.
Zhen Liu, Wanqi Zhou, Shuanghao Bai et al.· 1 citation
ClosureBench is introduced, a constructive benchmark for compositional graph-relational reasoning with programmatically verified ground truth with programmatically verified ground truth: each task's reference answer is computed by executing a program in the Ein tensor-logic language, ensuring machine-verified correctne...
This work proposes a framework that ensembles the reasoning structure, not just the answers, of multiple LLMs by weighted merging of Directed Acyclic Graphs (DAGs) extracted from reasoning chains by weighted merging of Directed Acyclic Graphs (DAGs) extracted from reasoning chains.
Amruta Parulekar, Jinu Lee, Dilek Z. Hakkani-Tür et al.· arXiv.org· 1 citation
A nonasymptotic risk bound is established that disentangles pretraining representation error from labeled-sample complexity, formally quantifying the benefit of large-scale unlabeled data for downstream knowledge prediction.
Jifan Zhang, Mikl'os Z. R'acz, Suqi Liu· arXiv.org· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.