Unsupervised slow subspace-learning from stationary processes
From MaRDI portal
Publication:950200
DOI10.1016/j.tcs.2008.06.054zbMath1158.68037OpenAlexW2169501730MaRDI QIDQ950200
Publication date: 22 October 2008
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2008.06.054
Stationary stochastic processes (60G10) Learning and adaptive systems in artificial intelligence (68T05)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Basic properties of strong mixing conditions. A survey and some open questions
- Rates of convergence for empirical processes of stationary mixing sequences
- Nonparametric time series prediction through adaptive model selection
- A note on uniform laws of averages for dependent processes
- Learning and generalisation. With applications to neural networks.
- Asymptotic theory of weakly dependent stochastic processes
- A dual purpose principal and minor component flow
- Unsupervised Slow Subspace-Learning from Stationary Processes
- On the Eigenspectrum of the Gram Matrix and the Generalization Error of Kernel-PCA
- Slow Feature Analysis: Unsupervised Learning of Invariances
- Learning Theory
- Measure and integration theory. Transl. from the German by Robert B. Burckel
This page was built for publication: Unsupervised slow subspace-learning from stationary processes