Piecewise Constant and Linear Regression Trees: An Optimal Dynamic Programming Approach

Mim van den Bos, J. G. M. van der Linden, Emir Demirovic
2/12/2026

No confident code implementation found for this paper. 2 possible matches can be shown below.

Semantic Scholar

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 2 weaker matches are hidden by default — verify before relying on them.

No code implementations found yet.

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

Similar Papers

TestGenEval: A Real World Unit Test Generation and Test Completion Benchmark

99% match1 repo362026

Temporal Difference Learning: Why It Can Be Fast and How It Will Be Faster

99% match2026

UniIR: Training and Benchmarking Universal Multimodal Information Retrievers

98% match1 repo1852026

Estimating Heterogeneous Treatment Effects: Mutual Information Bounds and Learning Algorithms

98% match1 repo62026

Conformalized Interactive Imitation Learning: Handling Expert Shift and Intermittent Feedback

98% match2026

Differential Privacy Under Class Imbalance: Methods and Empirical Insights

97% match2026

Cite this paper

@article{bos2026piecewise,
  title  = {Piecewise Constant and Linear Regression Trees: An Optimal Dynamic Programming Approach},
  author = {Mim van den Bos and J. G. M. van der Linden and Emir Demirovic},
  year   = {2026},
  url    = {https://api.semanticscholar.org/CorpusID:623da148d9a582a268ab97fa708ba509f248cf54},
  journal = {ICML 2024 2024}
}

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/623da148d9a582a268ab97fa708ba509f248cf54.svg)](https://codeofpaper.com/paper/623da148d9a582a268ab97fa708ba509f248cf54)

Discussion