Sparse High-Dimensional Isotonic Regression

07/03/2019
by   David Gamarnik, et al.
0

We consider the problem of estimating an unknown coordinate-wise monotone function given noisy measurements, known as the isotonic regression problem. Often, only a small subset of the features affects the output. This motivates the sparse isotonic regression setting, which we consider here. We provide an upper bound on the expected VC entropy of the space of sparse coordinate-wise monotone functions, and identify the regime of statistical consistency of our estimator. We also propose a linear program to recover the active coordinates, and provide theoretical recovery guarantees. We close with experiments on cancer classification, and show that our method significantly outperforms standard methods.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/04/2020

Estimation of Monotone Multi-Index Models

In a multi-index model with k index vectors, the input variables are tra...
research
07/02/2020

Unlinked monotone regression

We consider so-called univariate unlinked (sometimes "decoupled," or "sh...
research
12/23/2014

Pathwise Coordinate Optimization for Sparse Learning: Algorithm and Theory

The pathwise coordinate optimization is one of the most important comput...
research
02/25/2017

Efficient coordinate-wise leading eigenvector computation

We develop and analyze efficient "coordinate-wise" methods for finding t...
research
10/16/2017

Sparse Linear Isotonic Models

In machine learning and data mining, linear models have been widely used...
research
06/29/2011

A Dirty Model for Multiple Sparse Regression

Sparse linear regression -- finding an unknown vector from linear measur...
research
07/02/2020

Coordinate-wise Median: Not Bad, Not Bad, Pretty Good

We consider the facility location problem in two dimensions. In particul...

Please sign up or login with your details

Forgot password? Click here to reset