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

• URL: http://arxiv.org/abs/2607.07935v1
• Date: Wed, 08 Jul 2026 21:31:48 GMT
• Title: path_boost: A Python Package for Interpretable Graph-Level Prediction using Path-Based Gradient Boosting
• Abstract summary: Path_boost is a Python package for interpretable supervised learning on graph-structured input data.<n>PathBoost produces an additive prediction model over path-based features.<n>It supports both regression and binary classification.
• Score: 0.6181093777643575
• License: http://creativecommons.org/licenses/by/4.0/
• 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.

Related papers

• Columnar-Embedder: A Biologically Inspired Cortical Architecture for Binary Sparse Distributed Graph Representations [0.0]
  We present the Columnar-Embedder architecture for learning binary Sparse Distributed Representations of graph nodes.<n>The architecture exhibits portability, resilience to noise, and robustness to data corruption.<n>Across five graph benchmarks, the performance of SDRs is competitive with that of real-valued dense embeddings.
  arXiv  Detail & Related papers  (2026-08-12T03:31:39Z)
• Path-Based Gradient Boosting for Graph-Level Prediction [0.6181093777643575]
  PathBoost learns discriminative path-based features directly from the input graph structure.<n>We compared PathBoost to graph neural networks and graph kernel approaches on several benchmark datasets.<n>Overall, the results demonstrate that path-based boosting methods can be competitive with more complex black-box approaches.
  arXiv  Detail & Related papers  (2026-04-26T07:59:33Z)
• STAR: Semantic-Tuned and Tail-Adaptive Retriever for Graph-Augmented Generation [69.66045538889777]
  We propose STAR, a semantic-tuned and tail-adaptive retriever for GraphRAG.<n> STAR consistently outperforms baselines, achieving average retrieval performance gains of 1.8%.
  arXiv  Detail & Related papers  (2026-04-11T10:16:51Z)
• SWING: Unlocking Implicit Graph Representations for Graph Random Features [57.956136773668476]
  We propose SWING: Space Walks for Implicit Network Graphs, a new class of algorithms for computations involving Graph Random Features on graphs.<n>We provide detailed analysis of SWING and complement it with thorough experiments on different classes of i-graphs.
  arXiv  Detail & Related papers  (2026-02-13T08:12:38Z)
• Semi-supervised Instruction Tuning for Large Language Models on Text-Attributed Graphs [62.544129365882014]
  We propose a novel Semi-supervised Instruction Tuning pipeline for Graph Learning, named SIT-Graph.<n> SIT-Graph is model-agnostic and can be seamlessly integrated into any graph instruction tuning method that utilizes LLMs as the predictor.<n>Extensive experiments demonstrate that when incorporated into state-of-the-art graph instruction tuning methods, SIT-Graph significantly enhances their performance on text-attributed graph benchmarks.
  arXiv  Detail & Related papers  (2026-01-19T08:10:53Z)
• OGBoost: A Python Package for Ordinal Gradient Boosting [0.0]
  We introduce OGBoost, a scikit-learn-compatible Python package for ordinal regression using gradient boosting.<n>The package is available on PyPI and can be installed via "pip install ogboost"
  arXiv  Detail & Related papers  (2025-02-19T06:06:12Z)
• Generating and Imputing Tabular Data via Diffusion and Flow-based Gradient-Boosted Trees [11.732842929815401]
  Tabular data is hard to acquire and is subject to missing values. This paper introduces a novel approach for generating and imputing mixed-type (continuous and categorical) data. In contrast to prior methods that rely on neural networks to learn the score function or the vector field, we adopt XGBoost.
  arXiv  Detail & Related papers  (2023-09-18T17:49:09Z)
• NodeFormer: A Scalable Graph Structure Learning Transformer for Node Classification [70.51126383984555]
  We introduce a novel all-pair message passing scheme for efficiently propagating node signals between arbitrary nodes. The efficient computation is enabled by a kernerlized Gumbel-Softmax operator. Experiments demonstrate the promising efficacy of the method in various tasks including node classification on graphs.
  arXiv  Detail & Related papers  (2023-06-14T09:21:15Z)
• A Simple yet Effective Method for Graph Classification [7.397201068210497]
  We investigate the feasibility of improving graph classification performance while simplifying the learning process. Inspired by structural entropy on graphs, we transform the data sample from graphs to coding trees. We present a tree kernel and a convolutional network to implement our scheme for graph classification.
  arXiv  Detail & Related papers  (2022-06-06T07:24:44Z)
• Neural Graph Matching for Pre-training Graph Neural Networks [72.32801428070749]
  Graph neural networks (GNNs) have been shown powerful capacity at modeling structural data. We present a novel Graph Matching based GNN Pre-Training framework, called GMPT. The proposed method can be applied to fully self-supervised pre-training and coarse-grained supervised pre-training.
  arXiv  Detail & Related papers  (2022-03-03T09:53:53Z)
• Graph Kernel Neural Networks [53.91024360329517]
  We propose to use graph kernels, i.e. kernel functions that compute an inner product on graphs, to extend the standard convolution operator to the graph domain. This allows us to define an entirely structural model that does not require computing the embedding of the input graph. Our architecture allows to plug-in any type of graph kernels and has the added benefit of providing some interpretability.
  arXiv  Detail & Related papers  (2021-12-14T14:48:08Z)
• Transformation of Node to Knowledge Graph Embeddings for Faster Link Prediction in Social Networks [2.458658951393896]
  Recent advances in neural networks have solved common graph problems such as link prediction, node classification, node clustering, node recommendation. In this work, we investigate a transformation model which converts node embeddings obtained from random walk based methods to embeddings obtained from knowledge graph methods directly without an increase in the computational cost.
  arXiv  Detail & Related papers  (2021-11-17T04:57:41Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.