mlsanityData to 7 Oct 2026

Probability Distribution on Full Rooted Trees

arXiv 2109.12825 ↗First posted 27 Sep 2021stat.ML cs.DM cs.LGcited by 9

Not on the map. Why?

Abstract (arXiv)

The recursive and hierarchical structure of full rooted trees is applicable to represent statistical models in various areas, such as data compression, image processing, and machine learning. In most of these cases, the full rooted tree is not a random variable; as such, model selection to avoid overfitting becomes problematic. A method to solve this problem is to assume a prior distribution on the full rooted trees. This enables the optimal model selection based on the Bayes decision theory. For example, by assigning a low prior probability to a complex model, the maximum a posteriori estimator prevents the selection of the complex one. Furthermore, we can average all the models weighted by their posteriors. In this paper, we propose a probability distribution on a set of full rooted trees. Its parametric representation is suitable for calculating the properties of our distribution using recursive functions, such as the mode, expectation, and posterior distribution. Although such distributions have been proposed in previous studies, they are only applicable to specific applications. Therefore, we extract their mathematically essential components and derive new generalized methods to calculate the expectation, posterior distribution, etc.

Key facts. Cited by 9 papers in the map (data through 7 Oct 2026). Builds on 2 of its 18 references that are in the map. First posted on arXiv 27 Sep 2021.

Builds on

2 of 18 references.

References · 2

  1. 2016XGBoost: A Scalable Tree Boosting Systemcited by 5,120
  2. 2020Bayesian Context Trees: Modelling and exact inference for discrete time seriescited by 12

Built on by

Cited by year (2026 to 7 Oct)

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

9 papers.