Export Reviews, Discussions, Author Feedback and Meta-Reviews

This paper proposes a computationally efficient way of scaling kernel non-linear component analysis. Each of these methods works effectively in certain settings but the number of samples/features may be prohibitively large in some settings. This paper proposes a doubley-stochastic gradient algorithm for solving kernel eigenvalue problems encompassing kernel PCA, CCA, and SVD. It is called doubly-stochastic because sampling is performed in the data samples and the random features (for this paper, limited to stationary kernels whose Fourier transform is well-defined). The paper claims convergence rate of \tilde{O}(1/t) to the global optimum for the recovered eigensubspace (in terms of principal angle), but with a caveat being that the step sizes are chosen properly and the mini-batch size is sufficiently large.