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.
Decision Trees (DTs) are commonly used for many machine learning tasks due to their high degree of interpretability. However, learning a DT from data is a difficult optimization problem, as it is non-convex and non-differentiable. Therefore, common approaches learn DTs using a greedy growth algorithm that minimizes the impurity locally at each internal node. Unfortunately, this greedy procedure can lead to inaccurate trees. In this paper, we present a novel approach for learning hard, axis-aligned DTs with gradient descent. The proposed method uses backpropagation with a straight-through operator on a dense DT representation, to jointly optimize all tree parameters. Our approach outperforms existing methods on binary classification benchmarks and achieves competitive results for multi-class tasks. The method is available under: https://github.com/s-marton/GradTree
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2305.03515")
get_code_for_paper("2305.03515")
have("2305.03515")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2305.03515.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2305.03515)
Connect an agent — have() is free.