资源分类
》 资源 》论文》Gen-Oja: A Simple and Efficient Algorithm for Streaming Generalized Eigenvector Computation

Gen-Oja: A Simple and Efficient Algorithm for Streaming Generalized Eigenvector Computation

2020-02-14 | |  43 |   32 |   0

Abstract 

In this paper, we study the problems of principal Generalized Eigenvector computation and Canonical Correlation Analysis in the stochastic setting. We propose a simple and efficient algorithm, Gen-Oja, for these problems. We prove the global convergence of our algorithm, borrowing ideas from the theory of fastmixing Markov chains and two-time-scale stochastic approximation, showing that it achieves the optimal rate of convergence. In the process, we develop tools for understanding stochastic processes with Markovian noise which might be of independent interest.

上一篇：The Limits of Post-Selection Generalization

下一篇：How Does Batch Normalization Help Optimization?

用户评价
全部评价

热门资源

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • The Variational S...

    Unlike traditional images which do not offer in...

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...

  • Rating-Boosted La...

    The performance of a recommendation system reli...