Learning Auditable Classifier Models: Source-Disjoint Tree Ensembles

• URL: http://arxiv.org/abs/2608.15725v1
• Date: Sun, 16 Aug 2026 12:56:49 GMT
• Title: Learning Auditable Classifier Models: Source-Disjoint Tree Ensembles
• Abstract summary: Predictive models in clinical and regulated settings must be accurate and fully auditable.<n>We introduce Residual Pattern Tree Ensemble (RPTE), a three-stage learning approach.<n>RPTE builds on three key principles: bounded feature budget, source disjointness, and separate coefficient estimation.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Predictive models in clinical and regulated settings must be accurate and fully auditable. Tree ensembles deliver strong accuracy on tabular data, but their sequential boosting couples structure discovery with coefficient estimation, making compact per-prediction auditing difficult. Interpretable alternatives impose structural constraints that limit expressiveness: generalized additive models typically restrict interactions to pairwise terms and post-hoc rule extractors produce overlapping rules that hinder compact interpretation. We introduce Residual Pattern Tree Ensemble (RPTE), a three-stage learning approach, that is built on three key principles: bounded feature budget, source disjointness, and separate coefficient estimation. Stage~1 builds a supervised symbolic feature vocabulary. Stage~2 grows shallow trees under a source-disjointness constraint, where each raw variable is allocated to at most one tree, and retains only the discovered tree structures. Stage~3 solves a single $\ell_1$-regularized logistic regression over leaf-region indicators, yielding jointly optimal sparse coefficients. This learning approach ensures that every prediction decomposes into an algebraic sum of named, non-overlapping rule contributions, enabling full auditability by design. Empirical evaluation on twelve clinical-domain binary classification benchmarks using repeated stratified 5-fold cross-validation shows that RPTE performs competitively against tuned opaque ensembles and interpretable baselines. RPTE reduces model inspection units by 9$\times$ to 87$\times$ relative to XGBoost and maintains lower audit complexity than EBM on all 12 datasets. RuleFit requires comparable or fewer inspection units on three datasets where its rule count is small, but without source-disjointness guarantees. The source code is available at \href{https://github.com/srikumar2050/hugiml-core}{this https URL}.

Related papers

• Modeling Normal Is All You Need: Joint Latent Clustering for Anomaly Detection in Multimodal Cyber-Physical Systems [47.027290803102666]
  Normal behaviour is the union of many imbalanced, curved, thin-fringed operating regimes.<n>We model the normal law with a jointly learned latent representation plus explicit Gaussian-mixture mode clustering.<n>We evaluate under a deliberately fair protocol: raw point-wise metrics with no point adjustment, a trivial-detector difficulty split, prevalence-matched F1, and train-normal-only calibration.
  arXiv  Detail & Related papers  (2026-07-07T10:10:00Z)
• Significance-First Splitting: Aligning Treatment Heterogeneity Detection with Honest Estimation [0.0]
  Estimating heterogeneous treatment effects (CATE) requires simultaneously detecting effect modification and quantifying estimation uncertainty.<n>Existing tree-based methods make an uneasy trade-off: significance-based approaches identify subgroup interactions directly but lack valid inference.<n>We introduce a hybrid algorithm that fuses significance-based splitting with honest sample-splitting and cross-validation.
  arXiv  Detail & Related papers  (2026-07-04T19:50:35Z)
• C$^{2}$R: Cross-sample Consistency Regularization Mitigates Feature Splitting and Absorption in Sparse Autoencoders [56.67585330425431]
  Sparse Autoencoders (SAEs) are widely used to interpret large language models by decomposing activations into sparse, human-understandable features.<n>These issues stem from inconsistent latent assignment across samples.<n>We introduce C$2$R, which penalizes the co-activation of directionally similar latents.
  arXiv  Detail & Related papers  (2026-06-29T17:45:31Z)
• Beyond Triplet Plausibility: Relation Set Completion in Knowledge Graphs [48.16012222834734]
  We introduce a relation set completion task (RSC) and a relation set Embedding model (RelSetE)<n>RSC aims to reason about missing relations that are semantically compatible with a given entity.<n>RelSetE models latent patterns among the observed relations of entities to infer missing ones.
  arXiv  Detail & Related papers  (2026-06-29T06:54:40Z)
• Evolutional Math: Cross-Validated Island-Model Genetic Programming for Interpretable Symbolic Regression on Small, Wide Datasets [0.0]
  Symbolic regression via genetic programming routinely fails on small, wide datasets.<n>We present Evolutional Math, an open-source genetic programming system that combines four design choices to yield compact, interpretable formulas.
  arXiv  Detail & Related papers  (2026-06-20T10:31:14Z)
• Tree-Based Formalization of Multi-Agent Complementarity in Human-AI Interactions [0.3384279376065155]
  Complementarity is the case in which a human--AI interaction outperforms the best prediction benchmark available among its members.<n>Existing frameworks do not model how agents' predictions compose into workflow-sensitive multi-agent protocols.<n>We close this gap by introducing a tree-based formalization of complementarity in multi-agent HAI.
  arXiv  Detail & Related papers  (2026-06-03T12:02:19Z)
• Learn from your own latents and not from tokens: A sample-complexity theory [53.5821824211418]
  We study networks trained to predict their emphown latent representations of related views or masked regions.<n>We show that latent prediction achieves this with a number of samples emphconstant in $L$, up to logarithmic factors.<n>This suggests that explicit stacking such as H-JEPA is largely redundant.
  arXiv  Detail & Related papers  (2026-05-26T22:16:42Z)
• TabSCM: A practical Framework for Generating Realistic Tabular Data [22.41489215805826]
  We present TabSCM, a mixed-type generator that preserves causal dependencies.<n>On seven public datasets, TabSCM matches or surpasses state-of-the-art GAN, diffusion, and LLM baselines in statistical fidelity.<n>Because generation is decomposed into explicit equations, it runs up to 583$times$ faster than diffusion-only models.
  arXiv  Detail & Related papers  (2026-04-24T08:10:01Z)
• HCRE: LLM-based Hierarchical Classification for Cross-Document Relation Extraction with a Prediction-then-Verification Strategy [54.91468501159335]
  Cross-document relation extraction (RE) aims to identify relations between the head tail entities located in different documents.<n>We propose an inference strategy that improves reliability through multi-view verification at each level.
  arXiv  Detail & Related papers  (2026-04-09T07:55:27Z)
• Decision Tree Embedding by Leaf-Means [11.318593165494724]
  Decision Tree Embedding (DTE) is a fast and effective method that leverages the leaf partitions of a trained classification tree to construct an interpretable feature representation.<n>By using the sample means within each leaf region as anchor points, DTE maps inputs into an embedding space defined by the tree's partition structure.<n>We establish several population-level theoretical properties of DTE, including its preservation of conditional density under mild conditions.
  arXiv  Detail & Related papers  (2025-12-01T15:57:33Z)
• Fast Interpretable Greedy-Tree Sums [8.268938983372452]
  Fast Interpretable Greedy-Tree Sums (FIGS) generalizes the CART algorithm to grow a flexible number of trees in summation. G-FIGS derives CDIs that reflect domain knowledge and enjoy improved specificity (by up to 20% over CART) without sacrificing sensitivity or interpretability. Bagging-FIGS enjoys competitive performance with random forests and XGBoost on real-world datasets.
  arXiv  Detail & Related papers  (2022-01-28T04:50:37Z)
• Neuro-Symbolic Entropy Regularization [78.16196949641079]
  In structured prediction, the goal is to jointly predict many output variables that together encode a structured object. One approach -- entropy regularization -- posits that decision boundaries should lie in low-probability regions. We propose a loss, neuro-symbolic entropy regularization, that encourages the model to confidently predict a valid object.
  arXiv  Detail & Related papers  (2022-01-25T06:23:10Z)

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.