skip to main content

LA Probability Forum

Thursday, June 2, 2022
5:00pm to 6:00pm
Add to Cal
Linde Hall 310
Random Tessellation Features and Forests
Eliza O'Reilly, Computing & Mathematical Sciences, Caltech,

The Mondrian process in machine learning is a recursive partition of space with random axis-aligned cuts used to build random forests and Laplace kernel approximations. The construction allows for efficient online algorithms, but the restriction to axis-aligned cuts does not capture dependencies between features. By viewing the Mondrian as a special case of the stable under iterated (STIT) process in stochastic geometry, we resolve open questions about the generalization of cut directions. We utilize the theory of stationary random tessellations to show that STIT random forests achieve minimax rates for Lipschitz and C^2 functions and STIT random features approximate a large class of stationary kernels. This work opens many new questions at the intersection of stochastic geometry and machine learning. Based on joint work with Ngoc Mai Tran.

For more information, please contact Math Dept by phone at 626-395-4335 or by email at [email protected].