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.
Abstract
We present path_boost, a Python package for interpretable supervised learning on graph-structured input data. The package implements PathBoost, a gradient boosting algorithm that automatically discovers predictive labeled paths within graphs during the learning process. Unlike graph neural networks, which are generally difficult to interpret, PathBoost produces an additive prediction model over path-based features that explicitly reveals which substructures drive predictions. To avoid an exhaustive enumeration of all possible paths, the algorithm iteratively selects and extends paths during learning based on their predictive power, using boosting to combine weak learners into a strong ensemble. The package supports both regression and binary classification. Key features include compatibility with scikit-learn workflows, support for custom base learners and selectors, automatic starting node selection, parallel training across anchor nodes, and built-in variable importance computation. We demonstrate PathBoost on molecular property prediction of transition metal compounds, where atoms serve as nodes and bonds as edges, and further benchmark PathBoost against an established graph neural network and a graph kernel method across six molecular datasets. The package is available on PyPI and GitHub under an open-source license.
A modular Context-Augmented Prompting framework that enables agentic tool use at inference time: a trained GNN expert model provides a predictive hint with confidence, and a GNN extracts an instance-specific explanatory subgraph via a necessity-based edge-drop intervention.
K. Bougiatiotis, Dimitrios Kelesis, Georgios Paliouras· 1 citation
This study offers a practical recipe for node-level JEPA-style latent prediction on graphs, and clarifies when structural conditioning helps representation learning.
Ting-He Zhang, Jian Xu, Jia-Heng Chen et al.· 0 citations
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.
Minseok Jeon, Seunghyun Park, Jun-Gi Jang· Proceedings of the 32nd ACM...· 0 citations
This work-in-progress paper proposes graph edit paths as a controlled tool for probing how GNN predictions respond to structural and attribute-level edits, and develops heuristics for generating edit paths and evaluates standard GNNs along these paths, quantifying their sensitivity to different types of edits.
This study shows that accurate performance prediction for classical machine learning workflows can be achieved through meta-learning using readily available OpenML meta-data, and indicates that careful selection of regression models is more critical than increased representational complexity.
Roman Neruda, Juan Carlos Figueroa–García, Carlos Franco· SN Computer Science· 0 citations
VitaGraph is presented, a comprehensive multi-purpose biological knowledge graph built by integrating and refining multiple public datasets and enabling benchmarking of graph-based models and offering the opportunity to tackle tasks such as drug repurposing, PPI prediction, and side-effect prediction, among others.
Francesco Madeddu, Lucia Testa, Gianluca De Carlo et al.· Scientific Data· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.