Convex optimization: Algorithms and complexity
Bubeck, S. et al. (2015) · 2015
Cited alongside, same era.
Escaping from saddle points – online stochastic gradient for tensor decomposition
Ge, R., Huang, F., Jin, C., & Yuan, Y. (2015) · 2015
Cited alongside, same era.
Beyond convexity: Stochastic quasi-convex optimization
Hazan, E., Levy, K., & Shalev-Shwartz, S. (2015) · 2015
Cited alongside, same era.
Variance reduction for faster non-convex optimization
Allen-Zhu, Z. & Hazan, E. (2016) · 2016
Cited alongside, same era.
Accelerated methods for non-convex optimization
Carmon, Y., Duchi, J. C., Hinder, O., & Sidford, A. (2016) · 2016
Cited alongside, same era.
Deep Learning
Goodfellow, I., Bengio, Y., & Courville, A. (2016) · 2016
Cited alongside, same era.
Matching matrix Bernstein and near-optimal finite sample guarantees for Oja’s algorithm
Jain, P., Jin, C., Kakade, S. M., Netrapalli, P., & Sidford, A. (2016) · 2016
Cited alongside, same era.
Gradient descent only converges to minimizers
Lee, J. D., Simchowitz, M., Jordan, M. I., & Recht, B. (2016) · 2016
Cited alongside, same era.
The power of normalization: Faster evasion of saddle points
Original
Levy, K. Y. (2016) · 2016
Cited alongside, same era.
Stochastic variance reduction for nonconvex optimization
Reddi, S. J., Hefny, A., Sra, S., Poczos, B., & Smola, A. (2016) · 2016
Cited alongside, same era.
Accelerated proximal stochastic dual coordinate ascent for regularized loss minimization
Shalev-Shwartz, S. & Zhang, T. (2016) · 2016
Cited alongside, same era.
Tight complexity bounds for optimizing composite objectives
Woodworth, B. E. & Srebro, N. (2016) · 2016
Cited alongside, same era.