Generalized Random Forests Using Fixed-Point Trees

David Fleischer, D. Stephens, Archer Y. Yang
2/12/2026

No official code found. Best implementation: dfleis/grf (2 stars, GPL-3.0, last commit 2024-12-22).

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 gradient-free 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

View on arXivView PDF

Code Implementations(1)

dfleis/grfCommunity100%
GPL-3.0

Generalized Random Forests

21R, C++Jun 23, 20231 years agoGPL-3.0

Similar Papers

Cite this paper

@article{fleischer2026generalized,
  title  = {Generalized Random Forests Using Fixed-Point Trees},
  author = {David Fleischer and D. Stephens and Archer Y. Yang},
  year   = {2026},
  eprint = {2306.11908},
  archivePrefix = {arXiv},
  url    = {https://arxiv.org/abs/2306.11908},
  journal = {ICML 2023 2023}
}

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

Discussion