Born-again tree ensembles. Vidal, T. & Schiffer, M. In III, H. D. & Singh, A., editors, Proceedings of the 37th International Conference on Machine Learning, volume 119, of Proceedings of Machine Learning Research, pages 9743–9753, Virtual, 2020. PMLR. ![Born-again tree ensembles [link]](https://bibbase.org/img/filetypes/link.svg "link")
Paper abstract bibtex 2 downloads The use of machine learning algorithms in finance, medicine, and criminal justice can deeply impact human lives. As a consequence, research into interpretable machine learning has rapidly grown in an attempt to better control and fix possible sources of mistakes and biases. Tree ensembles, in particular, offer a good prediction quality in various domains, but the concurrent use of multiple trees reduces the interpretability of the ensemble. Against this background, we study born-again tree ensembles, i.e., the process of constructing a single decision tree of minimum size that reproduces the exact same behavior as a given tree ensemble in its entire feature space. To find such a tree, we develop a dynamic-programming based algorithm that exploits sophisticated pruning and bounding rules to reduce the number of recursive calls. This algorithm generates optimal born-again trees for many datasets of practical interest, leading to classifiers which are typically simpler and more interpretable without any other form of compromise.
@inproceedings{Vidal2020a,
abstract = {The use of machine learning algorithms in finance, medicine, and criminal justice can deeply impact human lives. As a consequence, research into interpretable machine learning has rapidly grown in an attempt to better control and fix possible sources of mistakes and biases. Tree ensembles, in particular, offer a good prediction quality in various domains, but the concurrent use of multiple trees reduces the interpretability of the ensemble. Against this background, we study born-again tree ensembles, i.e., the process of constructing a single decision tree of minimum size that reproduces the exact same behavior as a given tree ensemble in its entire feature space. To find such a tree, we develop a dynamic-programming based algorithm that exploits sophisticated pruning and bounding rules to reduce the number of recursive calls. This algorithm generates optimal born-again trees for many datasets of practical interest, leading to classifiers which are typically simpler and more interpretable without any other form of compromise.},
address = {Virtual},
author = {Vidal, T. and Schiffer, M.},
booktitle = {Proceedings of the 37th International Conference on Machine Learning},
editor = {III, Hal Daum{\'{e}} and Singh, Aarti},
file = {:C$\backslash$:/Users/Thibaut/Documents/Mendeley-Articles/Vidal, Schiffer/Vidal, Schiffer - 2020 - Born-again tree ensembles.pdf:pdf},
mendeley-groups = {Machine Learning/Decision Trees/Misc},
pages = {9743--9753},
publisher = {PMLR},
series = {Proceedings of Machine Learning Research},
title = {{Born-again tree ensembles}},
url = {http://proceedings.mlr.press/v119/vidal20a.html},
volume = {119},
year = {2020}
}
Downloads: 2
{"_id":"vu7b5h4HKCsQ8RcG5","bibbaseid":"vidal-schiffer-bornagaintreeensembles-2020","authorIDs":["awoTsndRPACdYbwLY"],"author_short":["Vidal, T.","Schiffer, M."],"bibdata":{"bibtype":"inproceedings","type":"inproceedings","abstract":"The use of machine learning algorithms in finance, medicine, and criminal justice can deeply impact human lives. As a consequence, research into interpretable machine learning has rapidly grown in an attempt to better control and fix possible sources of mistakes and biases. Tree ensembles, in particular, offer a good prediction quality in various domains, but the concurrent use of multiple trees reduces the interpretability of the ensemble. Against this background, we study born-again tree ensembles, i.e., the process of constructing a single decision tree of minimum size that reproduces the exact same behavior as a given tree ensemble in its entire feature space. To find such a tree, we develop a dynamic-programming based algorithm that exploits sophisticated pruning and bounding rules to reduce the number of recursive calls. This algorithm generates optimal born-again trees for many datasets of practical interest, leading to classifiers which are typically simpler and more interpretable without any other form of compromise.","address":"Virtual","author":[{"propositions":[],"lastnames":["Vidal"],"firstnames":["T."],"suffixes":[]},{"propositions":[],"lastnames":["Schiffer"],"firstnames":["M."],"suffixes":[]}],"booktitle":"Proceedings of the 37th International Conference on Machine Learning","editor":[{"propositions":[],"lastnames":["III"],"firstnames":["Hal","Daumé"],"suffixes":[]},{"propositions":[],"lastnames":["Singh"],"firstnames":["Aarti"],"suffixes":[]}],"file":":C$\\$:/Users/Thibaut/Documents/Mendeley-Articles/Vidal, Schiffer/Vidal, Schiffer - 2020 - Born-again tree ensembles.pdf:pdf","mendeley-groups":"Machine Learning/Decision Trees/Misc","pages":"9743–9753","publisher":"PMLR","series":"Proceedings of Machine Learning Research","title":"Born-again tree ensembles","url":"http://proceedings.mlr.press/v119/vidal20a.html","volume":"119","year":"2020","bibtex":"@inproceedings{Vidal2020a,\nabstract = {The use of machine learning algorithms in finance, medicine, and criminal justice can deeply impact human lives. As a consequence, research into interpretable machine learning has rapidly grown in an attempt to better control and fix possible sources of mistakes and biases. Tree ensembles, in particular, offer a good prediction quality in various domains, but the concurrent use of multiple trees reduces the interpretability of the ensemble. Against this background, we study born-again tree ensembles, i.e., the process of constructing a single decision tree of minimum size that reproduces the exact same behavior as a given tree ensemble in its entire feature space. To find such a tree, we develop a dynamic-programming based algorithm that exploits sophisticated pruning and bounding rules to reduce the number of recursive calls. This algorithm generates optimal born-again trees for many datasets of practical interest, leading to classifiers which are typically simpler and more interpretable without any other form of compromise.},\naddress = {Virtual},\nauthor = {Vidal, T. and Schiffer, M.},\nbooktitle = {Proceedings of the 37th International Conference on Machine Learning},\neditor = {III, Hal Daum{\\'{e}} and Singh, Aarti},\nfile = {:C$\\backslash$:/Users/Thibaut/Documents/Mendeley-Articles/Vidal, Schiffer/Vidal, Schiffer - 2020 - Born-again tree ensembles.pdf:pdf},\nmendeley-groups = {Machine Learning/Decision Trees/Misc},\npages = {9743--9753},\npublisher = {PMLR},\nseries = {Proceedings of Machine Learning Research},\ntitle = {{Born-again tree ensembles}},\nurl = {http://proceedings.mlr.press/v119/vidal20a.html},\nvolume = {119},\nyear = {2020}\n}\n","author_short":["Vidal, T.","Schiffer, M."],"editor_short":["III, H. D.","Singh, A."],"key":"Vidal2020a","id":"Vidal2020a","bibbaseid":"vidal-schiffer-bornagaintreeensembles-2020","role":"author","urls":{"Paper":"http://proceedings.mlr.press/v119/vidal20a.html"},"metadata":{"authorlinks":{"vidal, t":"https://bibbase.org/show?bib=https%3A%2F%2Fw1.cirrelt.ca%2F%7Evidalt%2Fresources%2FMy%2520Collection.bib"}},"downloads":2,"html":""},"bibtype":"inproceedings","biburl":"https://w1.cirrelt.ca/~vidalt/resources/My Collection.bib","creationDate":"2021-02-18T20:21:05.663Z","downloads":2,"keywords":[],"search_terms":["born","again","tree","ensembles","vidal","schiffer"],"title":"Born-again tree ensembles","year":2020,"dataSources":["yinfondEAJRbDM9sJ","sempRA6PhmAdGk3yG"]}