References
- Khetan, A., & Oh, S. (2018). Generalized rank-breaking: Computational and statistical tradeoffs. Journal of Machine Learning Research, 19, 1–42. https://jmlr.org/papers/volume19/16-412/16-412.pdf
- Lian, H., Liu, J., & Fan, Z. (2021). Distributed learning for sketched kernel regression. Neural Networks, 143, 368–376. https://doi.org/https://doi.org/10.1016/j.neunet.2021.06.020
- Ram, S. S., Nedić, A., & Veeravalli, V. V. (2010). Asynchronous gossip algorithm for stochastic optimization: Constant stepsize analysis. In Recent Advances in Optimization and Its Applications in Engineering (pp. 51–60). Springer.
- Wang, L., Yang, Z., & Wang, Z. (2019). Statistical-computational tradeoffs in high-dimensional single index models. In Advances in Neural Information Processing Systems (pp. 10419–10426). The MIT Press.
- Wang, T., Berthet, Q., & Samworth, R. J. (2016). Statistical and computational trade-offs in estimation of sparse principal components. Annals of Statistics, 44(5), 1896–1930. https://doi.org/https://doi.org/10.1214/15-AOS1369
- Yuan, K., Ling, Q., & Yin, W. (2016). On the convergence of decentralized gradient descent. SIAM Journal on Optimization, 26(3), 1835–1854. https://doi.org/https://doi.org/10.1137/130943170