"Provable Efficient Online Matrix Completion via Non-convex Stochastic ..."

Chi Jin, Sham M. Kakade, Praneeth Netrapalli (2016)

> Home

Details and statistics

DOI: —

access: open

type: Conference or Workshop Paper

metadata version: 2022-12-07

- view
  - electronic edition @ neurips.cc (open access)
  - electronic edition @ nips.cc (open access)
- export record
  dblp key:
  - conf/nips/JinKN16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/nips/JinKN16
Chi Jin, Sham M. Kakade, Praneeth Netrapalli:
Provable Efficient Online Matrix Completion via Non-convex Stochastic Gradient Descent. NIPS 2016: 4520-4528

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.