ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1809.10491
  4. Cited By
On the Regret Minimization of Nonconvex Online Gradient Ascent for
  Online PCA
v1v2 (latest)

On the Regret Minimization of Nonconvex Online Gradient Ascent for Online PCA

27 September 2018
Dan Garber
    ODL
ArXiv (abs)PDFHTML

Papers citing "On the Regret Minimization of Nonconvex Online Gradient Ascent for Online PCA"

2 / 2 papers shown
Title
Regret minimization in stochastic non-convex learning via a
  proximal-gradient approach
Regret minimization in stochastic non-convex learning via a proximal-gradient approach
Nadav Hallak
P. Mertikopoulos
Volkan Cevher
53
21
0
13 Oct 2020
Distributed Stochastic Algorithms for High-rate Streaming Principal
  Component Analysis
Distributed Stochastic Algorithms for High-rate Streaming Principal Component Analysis
Haroon Raja
W. Bajwa
74
11
0
04 Jan 2020
1