Metraipolis › archive › dc_49e4973008b8

Learning Auditable Classifier Models: Source-Disjoint Tree Ensembles — arXiv:2608.15725

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.15725
License (as archived)
CC0-1.0
Archived
2026-10-18T19:40:50.786Z
SHA-256 of the archived text
76ba1b950a94f874b4fc37a38bd8f5fdedc461af40d81c3aae9ecb41f594979c
Stable URL of this page
https://metraipolis.com/documento/dc_49e4973008b8

How to cite

Learning Auditable Classifier Models: Source-Disjoint Tree Ensembles — arXiv:2608.15725 — arXiv (en), https://arxiv.org/abs/2608.15725 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_49e4973008b8 (Metraipolis archive dc_49e4973008b8, sha256 76ba1b950a94f874b4fc37a38bd8f5fdedc461af40d81c3aae9ecb41f594979c)
BibTeX
@misc{dc49e4973008b8,
  title = {Learning Auditable Classifier Models: Source-Disjoint Tree Ensembles — arXiv:2608.15725},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.15725},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_49e4973008b8; sha256 76ba1b950a94f874b4fc37a38bd8f5fdedc461af40d81c3aae9ecb41f594979c},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.15725. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

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{ this https URL }{this https URL}.

Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-08-18 in cs.LG).
Categorie arXiv: Machine Learning (cs.LG).
Pagina del lavoro: https://arxiv.org/abs/2608.15725 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-18T19:02:44.117Z dalla pagina https://arxiv.org/catchup/cs.LG/2026-08-18?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).