1. Agarwal, A., Dekel, O., & Xiao, L. (2010). Optimal algorithms for online convex optimization with multi-point bandit feedback. In Proc. 23rd annu. conf. learn. theory (pp. 28–40).
2. Distributed online convex optimization on time-varying directed graphs;Akbari;IEEE Transactions on Control of Network Systems,2017
3. Alistarh, D., Grubic, D., Li, J., Tomioka, R., & Vojnovic, M. (2017). QSGD: Communication-efficient SGD via gradient quantization and encoding. In Proc. adv. neural inf. process. syst. (pp. 1709–1720).
4. The convergence of sparsified gradient methods;Alistarh;Advances in Neural Information Processing Systems,2018
5. Studies in linear and non-linear programming;Arrow,1958