Fetching the paper…
Reading the bibliography…
Distributed statistical learning problems arise commonly when dealing with large datasets.
All convex invariant functions of hermitian matrices
C. Davis · 1957
Earlier work this paper cites.
Distribution of eigenvalues for some sets of random matrices
V. A. Marchenko and L. A. Pastur · 1967
Earlier work this paper cites.
Multivariate analysis
K. Mardia, J. T. Kent, and J. M. Bibby · 1979
Earlier work this paper cites.
On minimum error probability in discriminant analysis
V. I. Serdobolskii · 1983
Earlier work this paper cites.
Distributed asynchronous deterministic and stochastic gradient optimization algorithms
J. Tsitsiklis, D. Bertsekas, and M. Athans · 1986
Earlier work this paper cites.
Parallel and distributed computation: numerical methods , volume 23
D. P. Bertsekas and J. N. Tsitsiklis · 1989
Earlier work this paper cites.
Convex analysis on the hermitian matrices
A. S. Lewis · 1996
Earlier work this paper cites.
Convex optimization
S. Boyd and L. Vandenberghe · 2004
Earlier work this paper cites.
Random matrix theory and wireless communications
A. M. Tulino and S. Verdú · 2004
Earlier work this paper cites.
Map-reduce for machine learning on multicore
C.-T. Chu, S. K. Kim, Y.-A. Lin, Y. Yu, G. Bradski, K. Olukotun, and A. Y. Ng · 2007
Earlier work this paper cites.
Deterministic equivalents for certain functionals of large random matrices
W. Hachem, P. Loubaton, and J. Najim · 2007
Earlier work this paper cites.
Multiparametric Statistics
V. I. Serdobolskii · 2007
Earlier work this paper cites.
On early stopping in gradient descent learning
Y. Yao, L. Rosasco, and A. Caponnetto · 2007
Earlier work this paper cites.
Mapreduce: simplified data processing on large clusters
J. Dean and S. Ghemawat · 2008
Earlier work this paper cites.
Eigenvalue distributions of sums and products of large random matrices via incremental matrix expansions
M. J. Peacock, I. B. Collings, and M. L. Honig · 2008
Earlier work this paper cites.
Spectral analysis of large dimensional random matrices
Z. Bai and J. W. Silverstein · 2009
Earlier work this paper cites.
Efficient large-scale distributed training of conditional maximum entropy models
R. Mcdonald, M. Mohri, N. Silberman, D. Walker, and G. S. Mann · 2009
Earlier work this paper cites.
Distributed subgradient methods for multi-agent optimization
A. Nedic and A. Ozdaglar · 2009
Earlier work this paper cites.
Primal-dual subgradient methods for convex problems
Y. Nesterov · 2009
Earlier work this paper cites.
No eigenvalues outside the support of the limiting empirical spectral distribution of a separable covariance matrix
D. Paul and J. W. Silverstein · 2009
Earlier work this paper cites.
Slow learners are fast
M. Zinkevich, J. Langford, and A. J. Smola · 2009
Earlier work this paper cites.
Spark: Cluster computing with working sets
M. Zaharia, M. Chowdhury, M. J. Franklin, S. Shenker, and I. Stoica · 2010
Earlier work this paper cites.
Parallelized stochastic gradient descent
M. Zinkevich, M. Weimer, L. Li, and A. J. Smola · 2010
Earlier work this paper cites.
Scaling up machine learning: Parallel and distributed approaches
R. Bekkerman, M. Bilenko, and J. Langford · 2011
Cited alongside, same era.
Distributed optimization and statistical learning via the alternating direction method of multipliers
S. Boyd, N. Parikh, E. Chu, B. Peleato, and J. Eckstein · 2011
Cited alongside, same era.
Random Matrix Methods for Wireless Communications
R. Couillet and M. Debbah · 2011
Cited alongside, same era.
A deterministic equivalent for the analysis of correlated mimo multiple access channels
R. Couillet, M. Debbah, and J. W. Silverstein · 2011
Cited alongside, same era.
Dual averaging for distributed optimization: Convergence analysis and network scaling
J. C. Duchi, A. Agarwal, and M. J. Wainwright · 2011
Cited alongside, same era.
Spectral convergence for a general class of random matrices
Optimal prediction in the linearly transformed spiked model
E. Dobriban, W. Leeb, and A. Singer · 2017
Later among the works it cites.
Distributed estimation of principal eigenspaces
J. Fan, D. Wang, K. Wang, and Z. Zhu · 2017
Later among the works it cites.
Communication-efficient sparse regression
J. D. Lee, Q. Liu, Y. Sun, and J. E. Taylor · 2017
Later among the works it cites.
Distributed learning with regularized least squares
S.-B. Lin, X. Guo, and D.-X. Zhou · 2017
Later among the works it cites.
Gradient coding: Avoiding stragglers in distributed learning
R. Tandon, Q. Lei, A. G. Dimakis, and N. Karampatziakis · 2017
Later among the works it cites.
Efficient distributed learning with sparsity
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
F. Rubio and X. Mestre · 2011
Cited alongside, same era.
Communication-efficient algorithms for statistical optimization
Y. Zhang, M. J. Wainwright, and J. C. Duchi · 2012
Cited alongside, same era.
High dimensional robust M-estimation: Asymptotic variance via approximate message passing
D. L. Donoho and A. Montanari · 2013
Cited alongside, same era.
On robust regression with high-dimensional predictors
N. El Karoui, D. Bean, P. J. Bickel, C. Lim, and B. Yu · 2013
Cited alongside, same era.
A reliable effective terascale linear learning system
A. Agarwal, O. Chapelle, M. Dudik, and J. Langford · 2014
Cited alongside, same era.
A split-and-conquer approach for analysis of extraordinarily large data
X. Chen and M.-g. Xie · 2014
Cited alongside, same era.
Analysis of the limiting spectral measure of large random matrices of the separable covariance type
R. Couillet and W. Hachem · 2014
Cited alongside, same era.
J. Wang, M. Kolar, N. Srebro, and T. Zhang · 2017
Later among the works it cites.
M. Banerjee and C. Durot · 2018
Closest in time.
Distributed testing and estimation under sparse high dimensional models
H. Battey, J. Fan, H. Liu, J. Lu, and Z. Zhu · 2018
Closest in time.
High-dimensional asymptotics of prediction: Ridge regression and classification
E. Dobriban and S. Wager · 2018
Closest in time.
Aggregated inference
X. Huo and S. Cao · 2018
Closest in time.
e e pca: High dimensional exponential family pca
L. T. Liu, E. Dobriban, A. Singer, et al · 2018
Closest in time.
A massive data framework for m-estimators with cubic-rate
C. Shi, W. Lu, and R. Song · 2018
Closest in time.
Adaptive distributed methods under communication constraints
B. Szabo and H. van Zanten · 2018
Closest in time.
nycflights13: Flights that Departed NYC in 2013 , 2018
H. Wickham · 2018
Closest in time.
Distributed nonparametric regression under communication constraints
Y. Zhu and J. Lafferty · 2018
Closest in time.
A continuous-time view of early stopping for least squares regression
A. Ali, J. Z. Kolter, and R. J. Tibshirani · 2019
Closest in time.
Divide and conquer in nonstandard problems and the super-efficiency phenomenon
M. Banerjee, C. Durot, and B. Sen · 2019
Closest in time.
One-shot distributed ridge regression in high dimensions
E. Dobriban and Y. Sheng · 2019
Closest in time.
Theoretical justification for exponential family pca
E. Dobriban, W. Leeb, and A. Singer · 2019
Closest in time.
Surprises in high-dimensional ridgeless least squares interpolation
T. Hastie, A. Montanari, S. Rosset, and R. J. Tibshirani · 2019
Closest in time.
Ridge regression: Structure, cross-validation, and sketching
S. Liu and E. Dobriban · 2019
Closest in time.
Distributed inference for quantile regression processes
S. Volgushev, S.-K. Chao, and G. Cheng · 2019
Closest in time.