Publisher
Springer International Publishing
Reference29 articles.
1. Agarwal, A., Bartlett, P.L., Ravikumar, P., Wainwright, M.J.: Information-theoretic lower bounds on the oracle complexity of stochastic convex optimization. IEEE Trans. Inf. Theor. 58(5), 3235–3249 (2012)
2. Agarwal, A., Duchi, J.C.: Distributed delayed stochastic optimization. In: Advances in Neural Information Processing Systems (2011)
3. Alistarh, D., Allen-Zhu, Z., Li, J.: Byzantine stochastic gradient descent. In: Advances in Neural Information Processing Systems (2018)
4. Alistarh, D., De Sa, C., Konstantinov, N.: The convergence of stochastic gradient descent in asynchronous shared memory. In: Proceedings of the 37th Symposium on Principles of Distributed Computing, pp. 169–178 (2018)
5. Attiya, H., Kumari, S., Schiller, N.: Optimal resilience in systems that mix shared memory and message passing. In: 24th International Conference on Principles of Distributed Systems, pp. 16:1–16:16 (2020)