A combinatorial, primal-dual approach to semidefinite programs
Logarithmic regret algorithms for online convex optimization
A Fast Random Sampling Algorithm for Sparsifying Matrices
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing - STOC ’07
Lecture Notes in Computer Science
Machine Learning
Sanjeev Arora
Elad Hazan
Amit Agarwal
Toward a Unified Theory of Sparse Dimensionality Reduction in Euclidean Space
Online kernel PCA with entropic matrix updates
Distance metric learning using dropout