Interpretable Quantile Regression by Optimal Decision Trees

Valentin Lemaire, Gaël Aglin, Siegfried Nijssen
4/22/2026
cs.LG

No confident code implementation found for this paper.

Abstract

The field of machine learning is subject to an increasing interest in models that are not only accurate but also interpretable and robust, thus allowing their end users to understand and trust AI systems. This paper presents a novel method for learning a set of optimal quantile regression trees. The advantages of this method are that (1) it provides predictions about the complete conditional distribution of a target variable without prior assumptions on this distribution; (2) it provides predictions that are interpretable; (3) it learns a set of optimal quantile regression trees without compromising algorithmic efficiency compared to learning a single tree.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{lemaire2026interpretable,
  title  = {Interpretable Quantile Regression by Optimal Decision Trees},
  author = {Valentin Lemaire and Gaël Aglin and Siegfried Nijssen},
  year   = {2026},
  eprint = {2604.21042},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2604.21042v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2604.21042.svg)](https://codeofpaper.com/paper/2604.21042)

Discussion