To refer to this page use:
|Abstract:||Stochastic optimization naturally arises in machine learning. Efficient algorithms with provable guarantees, however, are still largely missing, when the objective function is nonconvex and the data points are dependent. This paper studies this fundamental challenge through a streaming PCA problem for stationary time series data. Specifically, our goal is to estimate the principle component of time series data with respect to the covariance matrix of the stationary distribution. Computationally, we propose a variant of Oja's algorithm combined with downsampling to control the bias of the stochastic gradient caused by the data dependency. Theoretically, we quantify the uncertainty of our proposed stochastic algorithm based on diffusion approximations. This allows us to prove the asymptotic rate of convergence and further implies near optimal asymptotic sample complexity. Numerical experiments are provided to support our analysis.|
|Citation:||Chen, Minshuo, Lin Yang, Mengdi Wang, and Tuo Zhao. "Dimensionality reduction for stationary time series via stochastic nonconvex optimization." In Advances in Neural Information Processing Systems, (2018): 3496-3506. https://papers.nips.cc/paper/7609-dimensionality-reduction-for-stationary-time-series-via-stochastic-nonconvex-optimization.pdf|
|Pages:||3496 - 3506|
|Type of Material:||Conference Article|
|Journal/Proceeding Title:||Advances in Neural Information Processing Systems|
Items in OAR@Princeton are protected by copyright, with all rights reserved, unless otherwise indicated.