The Mondrian Process
We describe a novel stochastic process that can be used to construct a multidimensional generalization of the stick-breaking process and which is related to the classic stick breaking process described by Sethuraman1994 in one dimension. We describe how the process can be applied to relational data modeling using the de Finetti representation for infinitely and partially exchangeable arrays.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
The Mondrian Process for Machine Learning
This report is concerned with the Mondrian process and its applications in machine learning. The Mondrian process is a guillotine-partition-valued stochastic process that possesses an elegant self-consistency property. T…
BIG-bench Machine LearningregressionThe Mondrian Kernel
We introduce the Mondrian kernel, a fast random feature approximation to the Laplace kernel. It is suitable for both batch and online learning, and admits a fast kernel-width-selection procedure as the random features ca…
Stochastic geometry to generalize the Mondrian Process
The stable under iterated tessellation (STIT) process is a stochastic process that produces a recursive partition of space with cut directions drawn independently from a distribution over the sphere. The case of random a…
Bayesian OptimizationBIG-bench Machine LearningDensity EstimationThe Uniformly Rotated Mondrian Kernel
Random feature maps are used to decrease the computational cost of kernel machines in large-scale problems. The Mondrian kernel is one such example of a fast random feature approximation of the Laplace kernel, generated …
Minimax optimal rates for Mondrian trees and forests
Introduced by Breiman, Random Forests are widely used classification and regression algorithms. While being initially designed as batch algorithms, several variants have been proposed to handle online learning. One parti…