Preprint · 2020 · Open access
Smooth And Consistent Probabilistic Regression Trees
HAL (Le Centre pour la Communication Scientifique Directe), 1–11 · Published 6 December 2020
In brief
“Smooth And Consistent Probabilistic Regression Trees” is a 2020 preprint by Sami Alkhoury and 5 co-authors, published in HAL (Le Centre pour la Communication Scientifique Directe). OpenAlex counts 3 citations as of 16 November 2026. It is open access: the full text is free to read.
- Citations
- 3
- Most cited in
- 2022 (2)
- References
- 24
- Authors
- 6
Abstract
We propose here a generalization of regression trees, referred to as Probabilistic Regression (PR) trees, that adapt to the smoothness of the prediction function relating input and output variables while preserving the interpretability of the prediction and being robust to noise. In PR trees, an observation is associated to all regions of a tree through a probability distribution that reflects how far the observation is to a region. We show that such trees are consistent, meaning that their error tends to 0 when the sample size tends to infinity, a property that has not been established for similar, previous proposals as Soft trees and Smooth Transition Regression trees. We further explain how PR trees can be used in different ensemble methods, namely Random Forests and Gradient Boosted Trees. Lastly, we assess their performance through extensive experiments that illustrate their benefits in terms of performance, interpretability and robustness to noise.
Cite this paper
Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.
APA 7
Alkhoury, S., Devijver, É., Clausel, M., Tami, M., Gaussier, É., & Oppenheim, G. (2020). Smooth And Consistent Probabilistic Regression Trees. HAL (Le Centre pour la Communication Scientifique Directe), 1–11. https://hal.archives-ouvertes.fr/hal-03050168
MLA 9
Alkhoury, Sami, et al. “Smooth And Consistent Probabilistic Regression Trees.” HAL (Le Centre pour la Communication Scientifique Directe), 2020, pp. 1–11. https://hal.archives-ouvertes.fr/hal-03050168.
Chicago
Alkhoury, Sami, Émilie Devijver, Marianne Clausel, Myriam Tami, Éric Gaussier, and Georges Oppenheim. 2020. “Smooth And Consistent Probabilistic Regression Trees.” HAL (Le Centre pour la Communication Scientifique Directe): 1–11. https://hal.archives-ouvertes.fr/hal-03050168.
Harvard
Alkhoury, S. et al. (2020) ‘Smooth And Consistent Probabilistic Regression Trees’, HAL (Le Centre pour la Communication Scientifique Directe), pp. 1–11. Available at: https://hal.archives-ouvertes.fr/hal-03050168.
IEEE
S. Alkhoury, É. Devijver, M. Clausel, M. Tami, É. Gaussier, and G. Oppenheim, “Smooth And Consistent Probabilistic Regression Trees,” HAL (Le Centre pour la Communication Scientifique Directe), pp. 1–11, 2020.
BibTeX
@misc{alkhoury2020smooth,
title = {{Smooth And Consistent Probabilistic Regression Trees}},
author = {Alkhoury, Sami and Devijver, Émilie and Clausel, Marianne and Tami, Myriam and Gaussier, Éric and Oppenheim, Georges},
howpublished = {HAL (Le Centre pour la Communication Scientifique Directe)},
year = {2020},
pages = {1--11},
url = {https://hal.archives-ouvertes.fr/hal-03050168}
}
Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)
Topic and keywords
Physical Sciences › Computer Science › Information Systems › Data Mining Algorithms and Applications
- regression trees
- consistency
- tree-based ensemble methods
- random forest
- gradient boosting decision tree
- interpretability
- noise robustness
Work with this paper
Most-cited papers in Computer Science
- ImageNet classification with deep convolutional neural networksAlex Krizhevsky, Ilya Sutskever, Geoffrey E. Hinton · Communications of the ACM · 2017 · 114,726 citations
- Long Short-Term MemorySepp Hochreiter, Jürgen Schmidhuber · Neural Computation · 1997 · 109,097 citations
- A Mathematical Theory of CommunicationClaude E. Shannon · Bell System Technical Journal · 1948 · 91,736 citations
- Deep learningYann LeCun, Yoshua Bengio, Geoffrey E. Hinton · Nature · 2015 · 90,226 citations
- Faster R-CNN: Towards Real-Time Object Detection with Region Proposal NetworksShaoqing Ren, Kaiming He, Ross Girshick and 1 more · IEEE Transactions on Pattern Analysis and Machine Intelligence · 2016 · 74,143 citations
Questions about this paper
How do I cite this paper in APA style?
Alkhoury, S., Devijver, É., Clausel, M., Tami, M., Gaussier, É., & Oppenheim, G. (2020). Smooth And Consistent Probabilistic Regression Trees. HAL (Le Centre pour la Communication Scientifique Directe), 1–11. https://hal.archives-ouvertes.fr/hal-03050168
How many times has this paper been cited?
3 times, according to OpenAlex on 16 November 2026. Google Scholar and Scopus count different sets of sources, so their numbers differ.
Is this paper free to read?
Yes. It is open access: read the free full text.
Who wrote this paper?
Sami Alkhoury, Émilie Devijver, Marianne Clausel, Myriam Tami, Éric Gaussier, Georges Oppenheim.
Bibliographic data from OpenAlex (CC0), last checked 16 November 2026. ResearchGuru does not host this paper; the links go to the publisher or the repository that does.