We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
Regression trees are one of the oldest forms of AI models, and their predictions can be made without a calculator, which makes them broadly useful, particularly for high-stakes applications. Within the large literature on regression trees, there has been little effort towards full provable optimization, mainly due to the computational hardness of the problem. This work proposes a dynamic-programming-with-bounds approach to the construction of provably-optimal sparse regression trees. We leverage a novel lower bound based on an optimal solution to the k-Means clustering algorithm in 1-dimension over the set of labels. We are often able to find optimal sparse trees in seconds, even for challenging datasets that involve large numbers of samples and highly-correlated features.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2211.14980")
get_code_for_paper("2211.14980")
have("2211.14980")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2211.14980.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2211.14980)
Connect an agent — have() is free.