"Polylogarithmic width suffices for gradient descent to achieve arbitrarily ..."

Ziwei Ji, Matus Telgarsky (2020)

> Home

Details and statistics

DOI: —

access: open

type: Conference or Workshop Paper

metadata version: 2020-05-07

- view
  - electronic edition @ openreview.net (open access)
- export record
  dblp key:
  - conf/iclr/JiT20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/iclr/JiT20
Ziwei Ji, Matus Telgarsky:
Polylogarithmic width suffices for gradient descent to achieve arbitrarily small test error with shallow ReLU networks. ICLR 2020

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.