Papers
Topics
Authors
Recent
Search
2000 character limit reached

Efficient Algorithms for Learning Depth-2 Neural Networks with General ReLU Activations

Published 21 Jul 2021 in cs.LG, cs.DS, and stat.ML | (2107.10209v2)

Abstract: We present polynomial time and sample efficient algorithms for learning an unknown depth-2 feedforward neural network with general ReLU activations, under mild non-degeneracy assumptions. In particular, we consider learning an unknown network of the form f(x)=a<sup>Tσ(W<sup>Tx+b)f(x) = {a}<sup>{\mathsf{T}}\sigma({W}<sup>\mathsf{T}x+b), where xx is drawn from the Gaussian distribution, and σ(t):=max⁡(t,0)\sigma(t) := \max(t,0) is the ReLU activation. Prior works for learning networks with ReLU activations assume that the bias bb is zero. In order to deal with the presence of the bias terms, our proposed algorithm consists of robustly decomposing multiple higher order tensors arising from the Hermite expansion of the function f(x)f(x). Using these ideas we also establish identifiability of the network parameters under minimal assumptions.

Citations (19)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.