Skip to content

Expanding Data-Agnostic Pivotal Instances Selection Models with Proximity Trees and Ensemble Learning

Jul 2026 · arXiv.org · Vol abs/2607.27522 · 0 citations
Computer Science

TL;DR

This work proposes a hierarchical, interpretable-by-design pivot selection model based on the similarity between pivots and input instances based on the similarity between pivots and input instances, which functions both as a pivot selection technique and a standalone predictive model.

Abstract

As decision-making processes grow more complex, machine learning tools have become essential for tackling business and societal challenges. However, many existing methods rely on decision-making procedures that are difficult to interpret. Since humans naturally make decisions by comparing new cases with a few representative examples, we aim to design an approach that selects such pivots to construct an interpretable predictive model. Inspired by decision trees, we propose a hierarchical, interpretable-by-design pivot selection model based on the similarity between pivots and input instances. Our method functions both as a pivot selection technique and a standalone predictive model. Extending beyond single pivots, we incorporate pairs of pivots that are used by proximity and oblique trees, as well as ensembles, which enhance the versatility and effectiveness of our proposal. Additionally, our approach is data modality-agnostic, leveraging pre-trained networks for data transformation. Experiments across diverse datasets, including tabular data, text, images, and time series, demonstrate the effectiveness of our approach, outperforming alternative instance selection strategies and achieving competitive results against state-of-the-art interpretable models while maintaining a minimal number of pivots.

View source

Similar papers

Book Open access Aug 2026

NiWo: An Augmentation Framework to Enhance ML Performance and Interpretability for Tabular Data with Class Imbalance

NiWo optimizes the weights of influential neighborhood instances within an augmentation budget, thus preserving computational efficiency and offering interpretability, and outperforms other augmentation methods at enhancing ML performance, especially over datasets with class imbalance and scarce instances.

Asif Ahmed, Sakhawat Hossain Saimon, Jianhua Ruan et al. · 0 citations
Preprint Aug 2026

DICS: Data-Informed Centroid Splitting for Decision Tree Classifiers

Data-Informed Centroid Splitting (DICS), a clustering-based framework that constructs a compact and informative set of candidate splits using data-driven priors, significantly reduces the split search space for classification tasks while preserving predictive performance.

Saifur Rahman Mazumder, Feng Yu · 0 citations
Preprint Aug 2026

Learning the Pareto Frontier of Predictive Models under Distribution Shift

Modern machine learning pipelines increasingly rely on reusing pretrained and foundation models across downstream tasks. These pretrained models can differ not only in performance but also in how they can be used: some only provide black-box predictions, while others may permit white-box access to internal representati...

Yiming Dong, Jiwei Zhao, Yang Lu · 0 citations
Conference Jul 2026

DECODE: Decision Tree Capturing Opaque Decisions via Coverage-Driven Synthetic Sampling

In the context of smart manufacturing, Explainable AI has emerged as an essential solution to ensure trust in complex Machine Learning model decisions. However, most employed methods are limited to feature relevance scoring, lacking in providing a human-interpretable description of model behaviour. Surrogate models, ho...

José Cação, José Santos, Mário Antunes · 0 citations
Preprint Aug 2026

A Heterogeneous Mixture of Experts Framework for Interpretable Machine Learning

The proposed approach combines interpretability, adaptive inductive bias selection, and probabilistic coherence within a unified mixture-of-experts framework to achieve interpretable expert assignments while achieving predictive performance competitive with homogeneous MoDT and Random Forests.

Soham Chatterjee, Rwitobroto Dey, Smarajit Bose · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.