Stochastic Approximation for Online Tensorial Independent Component Analysis

Abstract

Independent component analysis (ICA) has been a popular dimension reduction tool in statistical machine learning and signal processing. In this paper, we present a convergence analysis for an online tensorial ICA algorithm, by viewing the problem as a nonconvex stochastic approximation problem. For estimating one component, we provide a dynamics-based analysis to prove that our online tensorial ICA algorithm with a specific choice of stepsize achieves a sharp finite-sample error bound. In particular, under a mild assumption on the data-generating distribution and a scaling condition such that $d^4/T$ is sufficiently small up to a polylogarithmic factor of data dimension $d$ and sample size $T$, a sharp finite-sample error bound of $\tilde{O}(\sqrt{d/T})$ can be obtained.

Cite

Text

Li and Jordan. "Stochastic Approximation for Online Tensorial Independent Component Analysis." Conference on Learning Theory, 2021.

Markdown

[Li and Jordan. "Stochastic Approximation for Online Tensorial Independent Component Analysis." Conference on Learning Theory, 2021.](https://mlanthology.org/colt/2021/li2021colt-stochastic/)

BibTeX

@inproceedings{li2021colt-stochastic,
  title     = {{Stochastic Approximation for Online Tensorial Independent Component Analysis}},
  author    = {Li, Chris Junchi and Jordan, Michael},
  booktitle = {Conference on Learning Theory},
  year      = {2021},
  pages     = {3051-3106},
  volume    = {134},
  url       = {https://mlanthology.org/colt/2021/li2021colt-stochastic/}
}