On Learning High Dimensional Structured Single Index Models

03/13/2016
by   Nikhil Rao, et al.
0

Single Index Models (SIMs) are simple yet flexible semi-parametric models for machine learning, where the response variable is modeled as a monotonic function of a linear combination of features. Estimation in this context requires learning both the feature weights and the nonlinear function that relates features to observations. While methods have been described to learn SIMs in the low dimensional regime, a method that can efficiently learn SIMs in high dimensions, and under general structural assumptions, has not been forthcoming. In this paper, we propose computationally efficient algorithms for SIM inference in high dimensions with structural constraints. Our general approach specializes to sparsity, group sparsity, and low-rank assumptions among others. Experiments show that the proposed method enjoys superior predictive performance when compared to generalized linear models, and achieves results comparable to or better than single layer feedforward neural networks with significantly less computational cost.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/30/2015

Learning Single Index Models in High Dimensions

Single Index Models (SIMs) are simple yet flexible semi-parametric model...
research
04/11/2011

Efficient Learning of Generalized Linear and Single Index Models with Isotonic Regression

Generalized Linear Models (GLMs) and Single Index Models (SIMs) provide ...
research
01/20/2022

Kernel Methods and Multi-layer Perceptrons Learn Linear Models in High Dimensions

Empirical observation of high dimensional phenomena, such as the double ...
research
11/06/2018

Debiased Inference of Average Partial Effects in Single-Index Models

We propose a method for average partial effect estimation in high-dimens...
research
01/23/2017

Iterative Thresholding for Demixing Structured Superpositions in High Dimensions

We consider the demixing problem of two (or more) high-dimensional vecto...
research
12/11/2016

Technical Report: A Generalized Matching Pursuit Approach for Graph-Structured Sparsity

Sparsity-constrained optimization is an important and challenging proble...
research
02/15/2021

High-Dimensional Gaussian Process Inference with Derivatives

Although it is widely known that Gaussian processes can be conditioned o...

Please sign up or login with your details

Forgot password? Click here to reset