AI helps you reading Science

AI generates interpretation videos

AI extracts and analyses the key points of the paper to generate videos automatically


pub
Go Generating

AI Traceability

AI parses the academic lineage of this thesis


Master Reading Tree
Generate MRT

Algorithms and SQ Lower Bounds for PAC Learning One-Hidden-Layer ReLU Networks

COLT, pp.1514-1539, (2020)

Cited by: 15|Views78
EI

Abstract

We study the problem of PAC learning one-hidden-layer ReLU networks with $k$ hidden units on $\mathbb{R}^d$ under Gaussian marginals in the presence of additive label noise. For the case of positive coefficients, we give the first polynomial-time algorithm for this learning problem for $k$ up to $\tilde{O}(\sqrt{\log d})$. Previously, n...More

Code:

Data:

Your rating :
0

 

Tags
Comments
小科