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. 1702.07834
  4. Cited By
Efficient coordinate-wise leading eigenvector computation

Efficient coordinate-wise leading eigenvector computation

25 February 2017
Jialei Wang
Weiran Wang
Dan Garber
Nathan Srebro
ArXivPDFHTML

Papers citing "Efficient coordinate-wise leading eigenvector computation"

12 / 12 papers shown
Title
LazySVD: Even Faster SVD Decomposition Yet Without Agonizing Pain
LazySVD: Even Faster SVD Decomposition Yet Without Agonizing Pain
Zeyuan Allen-Zhu
Yuanzhi Li
53
129
0
12 Jul 2016
Efficient Estimation of Partially Linear Models for Spatial Data over
  Complex Domain
Efficient Estimation of Partially Linear Models for Spatial Data over Complex Domain
Elad Hazan
Chi Jin
Cameron Musco
Praneeth Netrapalli
48
78
0
27 May 2016
Efficient Algorithms for Large-scale Generalized Eigenvector Computation
  and Canonical Correlation Analysis
Efficient Algorithms for Large-scale Generalized Eigenvector Computation and Canonical Correlation Analysis
Rong Ge
Chi Jin
Sham Kakade
Praneeth Netrapalli
Aaron Sidford
42
78
0
13 Apr 2016
Even Faster Accelerated Coordinate Descent Using Non-Uniform Sampling
Even Faster Accelerated Coordinate Descent Using Non-Uniform Sampling
Zeyuan Allen-Zhu
Zheng Qu
Peter Richtárik
Yang Yuan
64
171
0
30 Dec 2015
Fast and Simple PCA via Convex Optimization
Fast and Simple PCA via Convex Optimization
Dan Garber
Elad Hazan
20
90
0
18 Sep 2015
Coordinate Descent Converges Faster with the Gauss-Southwell Rule Than
  Random Selection
Coordinate Descent Converges Faster with the Gauss-Southwell Rule Than Random Selection
J. Nutini
Mark Schmidt
I. Laradji
M. Friedlander
H. Koepke
43
222
0
01 Jun 2015
The Noisy Power Method: A Meta Algorithm with Applications
The Noisy Power Method: A Meta Algorithm with Applications
Moritz Hardt
Eric Price
53
203
0
11 Nov 2013
On the Complexity Analysis of Randomized Block-Coordinate Descent
  Methods
On the Complexity Analysis of Randomized Block-Coordinate Descent Methods
Zhaosong Lu
Lin Xiao
49
254
0
21 May 2013
Revisiting the Nystrom Method for Improved Large-Scale Machine Learning
Revisiting the Nystrom Method for Improved Large-Scale Machine Learning
Alex Gittens
Michael W. Mahoney
88
414
0
07 Mar 2013
Parallel Coordinate Descent Methods for Big Data Optimization
Parallel Coordinate Descent Methods for Big Data Optimization
Peter Richtárik
Martin Takáč
85
487
0
04 Dec 2012
Parallel Coordinate Descent for L1-Regularized Loss Minimization
Parallel Coordinate Descent for L1-Regularized Loss Minimization
Joseph K. Bradley
Aapo Kyrola
Danny Bickson
Carlos Guestrin
66
309
0
26 May 2011
A Tutorial on Spectral Clustering
A Tutorial on Spectral Clustering
U. V. Luxburg
181
10,497
0
01 Nov 2007
1