REVIEW 1 cited by
The Mondrian Kernel
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
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 can be re-used efficiently for all kernel widths. The features are constructed by sampling trees via a Mondrian process [Roy and Teh, 2009], and we highlight the connection to Mondrian forests [Lakshminarayanan et al., 2014], where trees are also sampled via a Mondrian process, but fit independently. This link provides a new insight into the relationship between kernel methods and random forests.
Forward citations
Cited by 1 Pith paper
-
Seeing the Forest for the Trees: The Gaussian Process Limit of BART
In the infinite-tree limit, BART converges to a Gaussian process whose RKHS is a tensor-product Sobolev space, and ridge regression on random tree features achieves the resulting minimax rate with only logarithmic dep...
Discussion (0). Continue with ORCID to comment.