Kernel of Partition Paths: A Unified Representation for Tree Ensembles

• URL: http://arxiv.org/abs/2606.18853v2
• Date: Sun, 21 Jun 2026 07:43:39 GMT
• Title: Kernel of Partition Paths: A Unified Representation for Tree Ensembles
• Abstract summary: The present paper studies what unified geometric object a forest induces when one indexes its feature map by nodes rather than by splits.<n>KPP indexes the feature map by the nodes of the forest, weighted by a path metric that turns each coordinate into a component of a squared-Euclidean path-isometric embedding.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: A recent line of work has reframed individual decision trees as linear models on engineered features associated with their splits, opening routes for oracle inequalities and feature-importance reinterpretation, but leaving open the question of what unified geometric object a forest induces when one indexes its feature map by nodes rather than by splits. The present paper studies that object. KPP indexes the feature map by the nodes of the forest, weighted by a path metric that turns each coordinate into a component of a squared-Euclidean path-isometric embedding. KPP unifies four pillars under a single non-diagonal Gram that carries a metric: prediction, exact additive attribution, deterministic Lipschitz robust radius in the KPP metric, and uniform Rademacher risk bounds for regression and classification under fixed, honest, or cross-fit conditioning. All probabilistic guarantees are conditional on the representation and are stated under three explicit conditioning regimes; the robust-radius guarantee is deterministic in the KPP metric rather than in a norm on the raw input. Conjectured fast-rate refinements for both regression and classification are stated as open problems and are not claimed as theorems.

Related papers

• PriorPose: Reference-Guided Joint Deformation and Alignment for Category-Level Object Pose Estimation [65.40341394642324]
  Category-level object pose estimation seeks to recover a similarity transform $(R,t,s)$ for unseen instances without instance-specific CAD models.<n>Most competitive methods are correspondence-based.<n>We propose PriorPose, a reference-guided correspondence framework that keeps the category prior explicit.
  arXiv  Detail & Related papers  (2026-09-15T06:57:34Z)
• Tree-Based Formalization of Multi-Agent Complementarity in Human-AI Interactions [0.3384279376065155]
  Complementarity is the case in which a human--AI interaction outperforms the best prediction benchmark available among its members.<n>Existing frameworks do not model how agents' predictions compose into workflow-sensitive multi-agent protocols.<n>We close this gap by introducing a tree-based formalization of complementarity in multi-agent HAI.
  arXiv  Detail & Related papers  (2026-06-03T12:02:19Z)
• MIST: Reliable Streaming Decision Trees for Online Class-Incremental Learning via McDiarmid Bound [6.276425555068115]
  Streaming decision trees are natural candidates for open-world continual learning.<n>They still fail in online class-incremental learning due to two coupled miscalibrations.<n>We present MIST (McDiarmid Incremental Streaming Tree), which resolves both failures through three integrated components.
  arXiv  Detail & Related papers  (2026-05-12T06:45:00Z)
• Order-Sensitive Sequential Interventions on Ideal Lattices [0.0]
  We study sequential interventions under prerequisite constraints.<n>In this setting, admissible intervention sequences are paths in the ideal lattice of a finite prerequisite poset.<n>We give an exact local-to-global theory of order sensitivity on this state space.
  arXiv  Detail & Related papers  (2026-04-29T09:29:10Z)
• A Mathematical Theory of Ranking [0.0]
  Ranking systems produce ordered lists from scalar scores, yet the ranking itself depends only on pairwise comparisons.<n>We develop a mathematical theory that takes this observation seriously, centering the analysis on pairwise margins rather than absolute scores.
  arXiv  Detail & Related papers  (2026-04-09T17:00:49Z)
• Regularized Online RLHF with Generalized Bilinear Preferences [68.44113000390544]
  We consider the problem of contextual online RLHF with general preferences.<n>We adopt the Generalized Bilinear Preference Model to capture preferences via low-rank, skew-symmetric matrices.<n>We prove that the dual gap of the greedy policy is bounded by the square of the estimation error.
  arXiv  Detail & Related papers  (2026-02-26T15:27:53Z)
• Convexity-Driven Projection for Point Cloud Dimensionality Reduction [0.0]
  We propose Convexity-Driven detourile (CDP) for dimensionality reduction of point clouds.<n>CDP is a boundary-free linear method for dimensionality reduction of point clouds.
  arXiv  Detail & Related papers  (2025-09-26T08:25:12Z)
• CP$^2$: Leveraging Geometry for Conformal Prediction via Canonicalization [51.716834831684004]
  We study the problem of conformal prediction (CP) under geometric data shifts.<n>We propose integrating geometric information--such as geometric pose--into the conformal procedure to reinstate its guarantees.
  arXiv  Detail & Related papers  (2025-06-19T10:12:02Z)
• Intrinsic Bayesian Cramér-Rao Bound with an Application to Covariance Matrix Estimation [49.67011673289242]
  This paper presents a new performance bound for estimation problems where the parameter to estimate lies in a smooth manifold. It induces a geometry for the parameter manifold, as well as an intrinsic notion of the estimation error measure.
  arXiv  Detail & Related papers  (2023-11-08T15:17:13Z)
• Random Forest Weighted Local Fréchet Regression with Random Objects [18.128663071848923]
  We propose a novel random forest weighted local Fr'echet regression paradigm.<n>Our first method uses these weights as the local average to solve the conditional Fr'echet mean.<n>Second method performs local linear Fr'echet regression, both significantly improving existing Fr'echet regression methods.
  arXiv  Detail & Related papers  (2022-02-10T09:10:59Z)
• Exact Recovery in the General Hypergraph Stochastic Block Model [92.28929858529679]
  This paper investigates fundamental limits of exact recovery in the general d-uniform hypergraph block model (d-HSBM) We show that there exists a sharp threshold such that exact recovery is achievable above the threshold and impossible below it.
  arXiv  Detail & Related papers  (2021-05-11T03:39:08Z)
• Convex Polytope Trees [57.56078843831244]
  convex polytope trees (CPT) are proposed to expand the family of decision trees by an interpretable generalization of their decision boundary. We develop a greedy method to efficiently construct CPT and scalable end-to-end training algorithms for the tree parameters when the tree structure is given.
  arXiv  Detail & Related papers  (2020-10-21T19:38:57Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.