1. Agarwal, A., Dekel, O., & Xiao, L. (2010). Optimal algorithms for online convex optimization with multi-point bandit feedback. In Conference on learning theory (pp. 28–40).
2. Bernstein, J., Wang, Y.-X., Azizzadenesheli, K., & Anandkumar, A. (2018). signSGD: Compressed optimisation for non-convex problems. In International conference on machine learning (pp. 560–569).
3. Non-stationary stochastic optimization;Besbes;Operations Research,2015
4. Decentralized online convex optimization with compressed communications;Cao;Automatica,2023
5. Online convex optimization with time-varying constraints and bandit feedback;Cao;IEEE Transactions on Automatic Control,2019