Generalized Random Forests Using Fixed-Point Trees
David Fleischer, David A. Stephens, Archer Y. Yang
Abstract
We propose a computationally efficient alternative to generalized random forests (GRFs) for estimating heterogeneous effects in large dimensions. While GRFs rely on a gradient-based splitting criterion, which in large dimensions is computationally expensive and unstable, our method introduces a fixed-point approximation that eliminates the need for Jacobian estimation. This gradientfree approach preserves GRF's theoretical guarantees of consistency and asymptotic normality while significantly improving computational efficiency. We demonstrate that our method achieves a speedup of multiple times over standard GRFs without compromising statistical accuracy. Experiments on both simulated and real-world data validate our approach. Our findings suggest that the proposed method is a scalable alternative for localized effect estimation in machine learning and causal inference applications.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Related papers
- Jacobian Aligned Random ForestsSarwesh RauniyarICLR 2026
- Gradient-Based Causal Tree Ensembles: A Backbone Architecture for Heterogeneous Treatment EffectsYusuke Kano, Jeremy P Voisey, Mihaela van der SchaarICML 2026
- Local Covariate Selection for Average Causal Effect Estimation without Pretreatment and Causal Sufficiency AssumptionsZeyu Liu, Zheng Li, Feng Xie, Yan Zeng et al.ICML 2026 · 1 citation
- Taming graph kernels with random featuresKrzysztof Marcin ChoromanskiICML 2023 · 21 citations
- Decentralised Learning with Random Features and Distributed Gradient DescentDominic Richards, Patrick Rebeschini, Lorenzo RosascoICML 2020 · 20 citations
