no code implementations • 27 Dec 2022 • Oscar Leong, Eliza O'Reilly, Yong Sheng Soh, Venkat Chandrasekaran
In this paper, we seek a systematic understanding of the power and the limitations of convex regularization by investigating the following questions: Given a distribution, what is the optimal regularizer for data drawn from the distribution?
no code implementations • 27 Oct 2021 • Eliza O'Reilly, Venkat Chandrasekaran
Convex regression is the problem of fitting a convex function to a data set consisting of input-output pairs.
no code implementations • 22 Sep 2021 • Eliza O'Reilly, Ngoc Mai Tran
In this work, we show that a large class of random forests with general split directions also achieve minimax optimal convergence rates in arbitrary dimension.
no code implementations • 3 Feb 2020 • Eliza O'Reilly, Ngoc Tran
This allows for precise comparisons between the Mondrian forest, the Mondrian kernel and the Laplace kernel in density estimation.