Learning single-index models with shallow neural networks

A Bietti, J Bruna, C Sanford… - Advances in Neural …, 2022 - proceedings.neurips.cc
Single-index models are a class of functions given by an unknown univariate``link''function
applied to an unknown one-dimensional projection of the input. These models are …

Breaking the curse of dimensionality with convex neural networks

F Bach - Journal of Machine Learning Research, 2017 - jmlr.org
We consider neural networks with a single hidden layer and non-decreasing positively
homogeneous activation functions like the rectified linear units. By letting the number of …

Sequential sufficient dimension reduction for large p, small n problems

X Yin, H Hilafu - Journal of the Royal Statistical Society Series B …, 2015 - academic.oup.com
We propose a new and simple framework for dimension reduction in the large p, small n
setting. The framework decomposes the data into pieces, thereby enabling existing …

The computational complexity of learning gaussian single-index models

A Damian, L Pillaud-Vivien, JD Lee, J Bruna - arXiv preprint arXiv …, 2024 - arxiv.org
Single-Index Models are high-dimensional regression problems with planted structure,
whereby labels depend on an unknown one-dimensional projection of the input via a …

[PDF][PDF] Sparse single-index model.

P Alquier, G Biau - Journal of Machine Learning Research, 2013 - jmlr.org
Let (X, Y) be a random pair taking values in Rp× R. In the so-called single-index model, one
has Y= f⋆(θ⋆ TX)+ W, where f⋆ is an unknown univariate measurable function, θ⋆ is an …

Agnostic active learning of single index models with linear sample complexity

A Gajjar, WM Tai, X Xingyu, C Hegde… - The Thirty Seventh …, 2024 - proceedings.mlr.press
We study active learning methods for single index models of the form $ F ({\bm x})= f (⟨{\bm
w},{\bm x}⟩) $, where $ f:\mathbb {R}\to\mathbb {R} $ and ${\bx,\bm w}\in\mathbb {R}^ d $. In …

Learning polynomials in few relevant dimensions

S Chen, R Meka - Conference on Learning Theory, 2020 - proceedings.mlr.press
Polynomial regression is a basic primitive in learning and statistics. In its most basic form the
goal is to fit a degree $ d $ polynomial to a response variable $ y $ in terms of an $ n …

Learning single-index models in gaussian space

R Dudeja, D Hsu - Conference On Learning Theory, 2018 - proceedings.mlr.press
We consider regression problems where the response is a smooth but non-linear function of
a $ k $-dimensional projection of $ p $ normally-distributed covariates, contaminated with …

Distributional Extension and Invertibility of the -Plane Transform and Its Dual

R Parhi, M Unser - SIAM Journal on Mathematical Analysis, 2024 - SIAM
We investigate the distributional extension of the-plane transform in and of related operators.
We parameterize the-plane domain as the Cartesian product of the Stiefel manifold of …

Agnostically Learning Multi-index Models with Queries

I Diakonikolas, DM Kane, V Kontonis, C Tzamos… - arXiv preprint arXiv …, 2023 - arxiv.org
We study the power of query access for the task of agnostic learning under the Gaussian
distribution. In the agnostic model, no assumptions are made on the labels and the goal is to …