mlsanityData to 14 Oct 2026

Medoid splits for efficient random forests in metric spaces

arXiv 2306.17031 ↗First posted 29 Jun 2023stat.ME stat.MLcited by 7

Not on the map. Why?

Abstract (arXiv)

This paper revisits an adaptation of the random forest algorithm for Fr'echet regression, addressing the challenge of regression in the context of random objects in metric spaces. Recognizing the limitations of previous approaches, we introduce a new splitting rule that circumvents the computationally expensive operation of Fr'echet means by substituting with a medoid-based approach. We validate this approach by demonstrating its asymptotic equivalence to Fr'echet mean-based procedures and establish the consistency of the associated regression estimator. The paper provides a sound theoretical framework and a more efficient computational approach to Fr'echet regression, broadening its application to non-standard data types and complex use cases.

Key facts. Cited by 7 papers in the map (data through 14 Oct 2026). Builds on 9 of its 38 references that are in the map. First posted on arXiv 29 Jun 2023.

Builds on

9 of 38 references.

References · 9

  1. 2015Estimation and Inference of Heterogeneous Treatment Effects using Random Forestscited by 600
  2. 2016Generalized Random Forestscited by 312
  3. 2016Pymanopt: A Python Toolbox for Optimization on Manifolds using Automatic Differentiationcited by 94
  4. 2018Hyperparameters and Tuning Strategies for Random Forestcited by 84
  5. 2016Fr'echet Regression for Random Objects with Euclidean Predictorscited by 57
  6. 2013Confidence Intervals for Random Forests: The Jackknife and the Infinitesimal Jackknifecited by 44
  7. 2021Distribution-on-Distribution Regression via Optimal Transport Mapscited by 16
  8. 2019Fr'echet random forests for metric space valued regression with non euclidean predictorscited by 13
  9. 2022MABSplit: Faster Forest Training Using Multi-Armed Banditscited by 4

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2024: 2; 2025: 3; 2026: 2.

7 papers.