Related papers: Forests, cumulants, martingales
We develop a finite-sample, design-based theory for random forests in which each tree is a randomized conditional predictor acting on fixed covariates and the forest is their Monte Carlo average. An exact variance identity separates Monte…
We study the virial expansion of mixtures of countably many different types of particles. The main tool is the Lagrange-Good inversion formula, which has other applications such as counting coloured trees or studying probability generating…
In this note, we consider general growth-fragmentation equations from a probabilistic point of view. Using Foster-Lyapunov techniques, we study the recurrence of the associated Markov process depending on the growth and fragmentation rates.…
Random forests are widely used in regression. However, the decision trees used as base learners are poor approximators of linear relationships. To address this limitation we propose RaFFLE (Random Forest Featuring Linear Extensions), a…
Regression trees and random forests are popular and effective non-parametric estimators in practical applications. A recent paper by Athey and Wager shows that the random forest estimate at any point is asymptotically Gaussian; in this…
Intractable distributions present a common difficulty in inference within the probabilistic knowledge representation framework and variational methods have recently been popular in providing an approximate solution. In this article, we…
We extend some sharp inequalities for martingale-differences to general multiplicative systems of random variables. The key ingredient in the proofs is a technique reducing the general case to the case of Rademacher random variables without…
We consider the spatially homogeneous Boltzmann equation for hard potentials with angular cutoff. This equation has a unique conservative weak solution $(f_t)_{t\geq 0}$, once the initial condition $f_0$ with finite mass and energy is…
Random forests is a state-of-the-art supervised machine learning method which behaves well in high-dimensional settings although some limitations may happen when $p$, the number of predictors, is much larger than the number of observations…
The generalized Poisson distribution is well known to be a compound Poisson distribution with Borel summands. As a generalization we present closed formulas for compound Bartlett and Delaporte distributions with Borel summands and a…
Exponential distributions appear in a wide range of applications including chemistry, nuclear physics, time series analyses, and stock market trends. There are conceivable circumstances in which one would be interested in the cumulative…
The classical matrix-tree theorem relates the determinant of the combinatorial Laplacian on a graph to the number of spanning trees. We generalize this result to Laplacians on one- and two-dimensional vector bundles, giving a combinatorial…
Random forests are a learning algorithm proposed by Breiman [Mach. Learn. 45 (2001) 5--32] that combines several randomized decision trees and aggregates their predictions by averaging. Despite its wide usage and outstanding practical…
Focusing on the discrete probabilistic setting we generalize the combinatorial definition of cumulants to L-cumulants. This generalization keeps all the desired properties of the classical cumulants like semi-invariance and vanishing for…
Hash codes are a very efficient data representation needed to be able to cope with the ever growing amounts of data. We introduce a random forest semantic hashing scheme with information-theoretic code aggregation, showing for the first…
Random Forest (Breiman, 2001) is a successful and widely used regression and classification algorithm. Part of its appeal and reason for its versatility is its (implicit) construction of a kernel-type weighting function on training data,…
We provide a categorical proof of convergence for martingales and backward martingales in mean, using enriched category theory. The enrichment we use is in topological spaces, with their canonical closed monoidal structure, which encodes a…
The Exponential Formula allows one to enumerate any class of combinatorial objects built by choosing a set of connected components and placing a structure on each connected component which depends only on its size. There are multiple…
Forward-time models of diversification (i.e., speciation and extinction) produce phylogenetic trees that grow "vertically" as time goes by. Pruning the extinct lineages out of such trees leads to natural models for reconstructed trees…
Various topics in stochastic processes have been considered in the abstract setting of Riesz spaces, for example martingales, martingale convergence, ergodic theory, AMARTS, Markov processes and mixingales. Here we continue the relaxation…