Fetching the paper…
Reading the bibliography…
In this work we study the problem of Subspace Tracking with missing data (ST-miss) and outliers (Robust ST-miss).
“Matrix computations,”
G. H. Golub and C. F. Van Loan, · 1989
Earlier work this paper cites.
“Projection approximation subspace tracking,”
B. Yang, · 1995
Earlier work this paper cites.
Fundamentals of wireless communication
D. Tse and P. Viswanath, · 2005
Earlier work this paper cites.
“Exact matrix completion via convex optimization,”
E. J. Candes and B. Recht, · 2008
Earlier work this paper cites.
“The restricted isometry property and its implications for compressed sensing,”
E. Candes, · 2008
Earlier work this paper cites.
“The littlewood–offord problem and invertibility of random matrices,”
M. Rudelson and R. Vershynin, · 2008
Earlier work this paper cites.
“Smallest singular value of a random rectangular matrix,”
M. Rudelson and R. Vershynin, · 2009
Earlier work this paper cites.
“Modified-cs: Modifying compressive sensing for problems with partially known support,”
N. Vaswani and W. Lu, · 2010
Earlier work this paper cites.
“Robust principal component analysis?,”
E. J. Candès, X. Li, Y. Ma, and J. Wright, · 2011
Earlier work this paper cites.
“Distributed matrix completion,”
C. Teflioudi, F. Makari, and R. Gemulla, · 2012
Earlier work this paper cites.
Matrix analysis
R. A. Horn and C. R. Johnson, · 2012
Earlier work this paper cites.
“Petrels: Parallel subspace estimation and tracking by recursive least squares from partial observations,”
Y. Chi, Y. C. Eldar, and R. Calderbank, · 2013
Earlier work this paper cites.
“Memory limited, streaming pca,”
I. Mitliagkas, C. Caramanis, and P. Jain, · 2013
Earlier work this paper cites.
“Recursive robust pca or recursive sparse recovery in large but structured noise,”
C. Qiu, N. Vaswani, B. Lois, and L. Hogben, · 2014
Earlier work this paper cites.
“Non-convex robust pca,”
P. Netrapalli, U N Niranjan, S. Sanghavi, A. Anandkumar, and P. Jain, · 2014
Earlier work this paper cites.
“The noisy power method: A meta algorithm with applications,”
M. Hardt and E. Price, · 2014
Earlier work this paper cites.
“Improved distributed principal component analysis,”
Y. Liang, M-F Balcan, V. Kanchanapally, and D. Woodruff, · 2014
Cited alongside, same era.
“Distributed robust subspace tracking,”
Y. Kopsinis, S. Chouvardas, and S. Theodoridis, · 2015
Cited alongside, same era.
“Distributed matrix completion and robust factorization,”
L. Mackey, A. Talwalkar, and M. I. Jordan, · 2015
Cited alongside, same era.
“Randomized block krylov methods for stronger and faster approximate singular value decomposition,”
C. Musco and C. Musco, · 2015
Cited alongside, same era.
“Global convergence of a grassmannian gradient descent algorithm for subspace estimation,”
D. Zhang and L. Balzano, · 2016
Cited alongside, same era.
“Federated optimization: Distributed machine learning for on-device intelligence,”
“Machine learning at the wireless edge: Distributed stochastic gradient descent over-the-air,”
M. M. Amiri and D. Gündüz, · 2019
Later among the works it cites.
“Advances and open problems in federated learning,”
P. Kairouz, H. B. McMahan, B. Avent, A. Bellet, M. Bennis, A. N. Bhagoji, K. Bonawitz, Z. Charles, G. Cormode, R. Cummings, et al., · 2019
Later among the works it cites.
“Federated machine learning: Concept and applications,”
Q. Yang, Y. Liu, T. Chen, and Y. Tong, · 2019
Later among the works it cites.
“Adaptive federated learning in resource constrained edge computing systems,”
S. Wang, T. Tuor, T. Salonidis, K. K. Leung, C. Makaya, T. He, and K. Chan, · 2019
Later among the works it cites.
“Towards federated learning at scale: System design,”
K. Bonawitz, H. Eichner, W. Grieskamp, D. Huba, A. Ingerman, V. Ivanov, C. Kiddon, J. Konecny, S. Mazzocchi, and H. B. McMahan, · 2019
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
J. Konecny, H. B. McMahan, D. Ramage, and P. Richtárik, · 2016
Cited alongside, same era.
“Subspace learning with partial information,”
A. Gonen, D. Rosenbaum, Y. C. Eldar, and S. Shalev-Shwartz, · 2016
Cited alongside, same era.
“An improved gap-dependency analysis of the noisy power method,”
M-F. Balcan, S. S. Du, Y. Wang, and A. W. Yu, · 2016
Cited alongside, same era.
“Federated learning: Strategies for improving communication efficiency,”
J. Konecny, H. N. McMahan, F. X. Yu, P. Richtárik, A. T. Suresh, and D. Bacon, · 2016
Cited alongside, same era.
“Streaming pca: Matching matrix bernstein and near-optimal finite sample guarantees for oja’s algorithm,”
P. Jain, C. Jin, S. M. Kakade, P. Netrapalli, and A. Sidford, · 2016
Cited alongside, same era.
“Nearly-optimal robust matrix completion,”
Y. Cherapanamjeri, K. Gupta, and P. Jain, · 2016
Cited alongside, same era.
“Subspace estimation from incomplete observations: A high-dimensional analysis,”
C. Wang, Y. C. Eldar, and Y. M. Lu, · 2018
Cited alongside, same era.
Later among the works it cites.
“Federated learning over wireless fading channels,”
M. M. Amiri and D. Gündüz, · 2019
Later among the works it cites.
“Provable dynamic robust pca or robust subspace tracking,”
P. Narayanamurthy and N. Vaswani, · 2019
Later among the works it cites.
“Provable subspace tracking from missing data and matrix completion,”
P. Narayanamurthy, V. Daneshpajooh, and N. Vaswani, · 2019
Later among the works it cites.
“Fall of empires: Breaking byzantine-tolerant sgd by inner product manipulation,”
C. Xie, S. Koyejo, and I. Gupta, · 2019
Later among the works it cites.
“Machine learning in the air,”
D. Gunduz, P. de Kerret, N. D. Sidiropoulos, D. Gesbert, C. R. Murthy, and M. van der Schaar, · 2019
Later among the works it cites.
“Federated pca with adaptive rank estimation,”
A. Grammenos, R. Mendoza-Smith, C. Mascolo, and J. Crowcroft, · 2019
Later among the works it cites.
“Federated learning: Challenges, methods, and future directions,”
T. Li, A. K. Sahu, A. Talwalkar, and V. Smith, · 2020
Closest in time.
“Federated learning via over-the-air computation,”
K. Yang, T. Jiang, Y. Shi, and Z. Ding, · 2020
Closest in time.
“Fast robust subspace tracking via pca in sparse data-dependent noise,”
P. Narayanamurthy and N. Vaswani, · 2020
Closest in time.
“Robust subspace tracking with missing data and outliers: Novel algorithm with convergence guarantee,”
Nguyen Viet Dung, Nguyen Linh Trung, Karim Abed-Meraim, et al., · 2021
Closest in time.
“Federated over-air robust subspace tracking from missing data,”
P. Narayanamurthy, N. Vaswani, and A. Ramamoorthy, · 2022
Closest in time.