In our work: 

arxiv.org/abs/2411.04394

we show that If the true regression function satisfies MSP, greedy training works well with 𝑂(log 𝑑) samples. 

Otherwise, it struggles. 

This settles the question of learnability for greedy recursive partitioning algorithms like CART.