Distributed Estimation of Generalized Matrix Rank: Efficient Algorithms and Lower Bounds thumbnail
Pause
Mute
Subtitles not available
Playback speed
0.25
0.5
0.75
1
1.25
1.5
1.75
2
Full screen

Distributed Estimation of Generalized Matrix Rank: Efficient Algorithms and Lower Bounds

Published on Sep 27, 20151729 Views

We study the following generalized matrix rank estimation problem: given an n-by-n matrix and a constant c>0, estimate the number of eigenvalues that are greater than c. In the distributed setting, th

Related categories