LGAIJul 8

path_boost: A Python Package for Interpretable Graph-Level Prediction using Path-Based Gradient Boosting

arXiv:2607.079355.7h-index: 10Has Code
Predicted impact top 58% in LG · last 90 daysOriginality Incremental advance
AI Analysis

For researchers needing interpretable graph predictions, PathBoost offers a transparent alternative to black-box graph neural networks.

PathBoost is a gradient boosting algorithm for interpretable graph-level prediction that discovers predictive paths in graphs. It achieves competitive performance against graph neural networks and kernel methods on molecular property prediction tasks, with the advantage of interpretability.

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.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes