← Search

Jason Klusowski

7 accepted papers

2026

Statistical-Computational Trade-offs for Recursive Adaptive Partitioning Estimators

ICML 2026poster

Models based on recursive adaptive partitioning such as decision trees and their ensembles are popular for high-dimensional regression as they can potentially avoid the curse of dimensionality. Because empirical risk minimization (ERM) is computationally infeasible, these models are typically traine…

Cited by 0SourceScholar
2020

Sparse Learning with CART

NeurIPS 2020poster

Decision trees with binary splits are popularly constructed using Classification and Regression Trees (CART) methodology. For regression models, this approach recursively divides the data into two near-homogenous daughter nodes according to a split point that maximizes the reduction in sum of square…

Cited by 26SourcePDFScholar
2019

Algorithmic Analysis and Statistical Estimation of SLOPE via Approximate Message Passing

NeurIPS 2019poster

SLOPE is a relatively new convex optimization procedure for high-dimensional linear regression via the sorted $\ell_1$ penalty: the larger the rank of the fitted coefficient, the larger the penalty. This non-separable penalty renders many existing techniques invalid or inconclusive in analyzing the…