• Coordinate Sampling for Sublinear Optimization and Nearest Neighbor Search 

      Clarkson, Kenneth L. (Georgia Institute of Technology, 2011-04-22)
      I will describe randomized approximation algorithms for some classical problems of machine learning, where the algorithms have provable bounds that hold with high probability. Some of our algorithms are sublinear, that is, ...