Skip to content
aiqbench takeAI Research

aiqbench analysis

RCProb introduces a significant improvement in post-hoc interpretability for tree ensemble models by addressing the unreliability of probability estimates inherent in existing rule extraction methods. By integrating smoothed atomic evidence and support-adaptive mixtures, this approach achieves substantial reductions in log-loss while maintaining classification accuracy comparable to state-of-the-art baselines. The study underscores that accurate probability calibration is a critical component of extracting rules from black-box models rather than merely an optional post-processing step.
Source coveringarXiv
What this isA model's reading of the article and related coverage, written for aiqbench. Not the publisher's words.

RCProb: Probabilistic rule extraction from classification tree ensembles

arXiv3 min read

arXiv:2604.25304v2 Announce Type: replace Abstract: Tree ensembles provide strong classification performance but usually behave as black-box models. Post-hoc interpretability techniques such as RuleCOSI+ extract a small ruleset that approximates the ensemble, but this simplification can leave the probabilities attached to the extracted rules unreliable. In particular, RuleCOSI+ assigns empirical class probabilities to the extracted rules and repeatedly uses those rule statistics during its greedy combination and simplification procedure. We present RCProb, a probabilistic extension that uses smoothed atomic class-conditional evidence for the expensive search stages and a support-adaptive mixture with an ensemble-informed m-estimate for the final rule probabilities. The method is evaluated on 18 binary and 5 multiclass datasets using random forest (RF) and gradient boosting machine (GBM) ensembles. Relative to RuleCOSI+, the median paired log-loss reduction is 71.9\% for RF and 62.5\% for GBM, with both differences remaining significant after Holm correction. The number of rules decreases by 38.7\% for RF and 38.5\% for GBM, while the primary tests do not detect a macro-F1 difference. Confidence-ECE also decreases for both ensembles, with statistical support for RF after correction. A separate controlled experiment with dedicated calibration data shows that native RCProb probabilities are competitive with RuleCOSI+ followed by temperature scaling, although additional post-hoc calibration can still improve RCProb. The results show that probability estimation is an important part of rule extraction and not only a post-processing step.

Abstract:Tree ensembles provide strong classification performance but usually behave as black-box models. Post-hoc interpretability techniques such as RuleCOSI+ extract a small ruleset that approximates the ensemble, but this simplification can leave the probabilities attached to the extracted rules unreliable. In particular, RuleCOSI+ assigns empirical class probabilities to the extracted rules and repeatedly uses those rule statistics during its greedy combination and simplification procedure. We present RCProb, a probabilistic extension that uses smoothed atomic class-conditional evidence for the expensive search stages and a support-adaptive mixture with an ensemble-informed m-estimate for the final rule probabilities. The method is evaluated on 18 binary and 5 multiclass datasets using random forest (RF) and gradient boosting machine (GBM) ensembles. Relative to RuleCOSI+, the median paired log-loss reduction is 71.9\% for RF and 62.5\% for GBM, with both differences remaining significant after Holm correction. The number of rules decreases by 38.7\% for RF and 38.5\% for GBM, while the primary tests do not detect a macro-F1 difference. Confidence-ECE also decreases for both ensembles, with statistical support for RF after correction. A separate controlled experiment with dedicated calibration data shows that native RCProb probabilities are competitive with RuleCOSI+ followed by temperature scaling, although additional post-hoc calibration can still improve RCProb. The results show that probability estimation is an important part of rule extraction and not only a post-processing step.

Substantially revised and extended; supersedes v1. 52 pages, 4 figures. Submitted to ESWA, currently under review

Machine Learning (cs.LG)

I.2.6; I.2.1; H.4.2

arXiv:2604.25304 [cs.LG]

(or arXiv:2604.25304v2 [cs.LG] for this version)

https://doi.org/10.48550/arXiv.2604.25304 Focus to learn more arXiv-issued DOI via DataCite

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Full text under the publisher's open licence · 333 words

Related coverage