cs.LGNov 14, 2026

Random Cut Forests, Games and Diffusion over Approximately Nested Anisotropic Local Geometry

Authors: Sudipto Guha

Abstract

Just as the data in a dynamic stream changes, questions asked of the stream also change in intent: what to hold constant, which counterfactuals to consider, and so forth. Energy-based learning has been celebrated for its uniform approach to losses and estimation, but interpretability remains challenging. Tree-based methods, on the other hand, offer high interpretability but often rely on bespoke, disjointed estimators. Neither paradigm readily supports changing questions on streaming data. In this paper we take a step towards combining energy, interpretability, and streaming. Random cut forests retain an evolving geometry of the data. We study this geometry as the basis for diffusion dynamics, prediction, explanation, and games. We show that several existing scores are escape probabilities of random walks on the trees. The induced affinity is realized exactly by a sparse electrical network on each tree, giving a single energy calculus, a Hamiltonian, maintained along one path per update. This connects an estimate, its supporting evidence, and the response to intervention through the same boxes, gaps, masses, and paths. Different questions correspond to different clamp decisions on the energy. Fixing observed values gives harmonic prediction with Gaussian uncertainty. Fixing a partition gives normalized cuts whose cost is attributed exactly to oriented faces. Releasing clamps gives coalition games, in which collusive displacement measures the field response. With noise, the same energy gives diffusion dynamics whose relaxation rates are read from the boxes. Axis-parallel cuts localize at a rate set by affine rather than ambient dimension, and this control passes to the averaged energy. Across a forest the boxes are only approximately nested; common reference observations align the trees. A rotating star with added noise illustrates the measurements.

Figures & tables

Explore similar work

CardsList
  1. Trees to Flows and Back: Unifying Decision Trees and Diffusion Models

    May 1, 2026Sai Niranjan Ramachandran, Suvrit SraDecision Tree LearningDiffusion Models

  2. Correcting Split Selection in Online Decision Trees via Anytime-Valid Inference

    May 29, 2026Salim I. Amoukou, Saumitra Mishra, Manuela VelosoAnytime-Valid InferenceDecision Tree Learning

  3. Reasoning with Sampling: Cutting at Decision Points

    May 28, 2026Felix Zhou, Anay Mehrotra, Quanquan C. LiuMarkov Chain Monte CarloEfficient Language Model Reasoning