Unsupervised slow subspace-learning from stationary processes

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4264 LNAI, Issue , 2006, Pages 363-377

  Maurer, Andreas ^a  

^a NONE   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ERROR ANALYSIS; PATTERN RECOGNITION; VECTORS;

ERROR BOUNDS; IMAGE RECOGNITION; VELOCITY VECTORS;

LEARNING SYSTEMS;

EID: 33750687902     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11894841_29     Document Type: Conference Paper

References (19)

1. A. Benveniste, M. Métevier, Pierre Priouret. Adaptive Algorithms and Stochastic Approximations. Springer, 1987.
2. P. Földiák. Learning invariance from transformation sequences. Neural Computation, 3: 194-200, 1991.
3. A. C. Lozano, S. R. Kulkarni, R. E. Shapire. Convergence and consistency of regularized boosting algorithms with stationary, β-mixing observations. Advances in Neural Information Processing Systems 18, 2006.
4. J.H. Manton, U. Helmke, I.M.Y. Mareels. A dual purpose principal and minor component flow. Systems & Control Letters 54: 759-769, 2005.
5. A. Maurer, Bounds for linear multi-task learning. JMLR, 7:117-139, 2006.
6. A. Maurer, Generalization Bounds for Subspace Selection and Hyperbolic PCA. Subspace, Latent Structure and Feature Selection. LNCS 3940: 185-197, Springer, 2006.
7. Colin McDiarmid, Concentration, in Probabilistic Methods of Algorithmic Discrete Mathematics, p. 195-248. Springer, Berlin, 1998.
8. R. Meir. Nonparametric time series prediction through adaptive model selection. Machine Learning, 39, 5-34, 2000.
9. E. Oja. Principal component analysis. The Handbook of Brain Theory and Neural Networks. M. A. Arbib ed. MIT Press, 910-913, 2002.
10. S.Mika, B.Schölkopf, A.Smola, K.-R.Müller, M.Scholz and G.Rätsch. Kernel PCA and De-noising in Feature Spaces, in Advances in Neural Information Processing Systems 11, 1998.
11. J. Shawe-Taylor, N. Christianini, Estimating the moments of a random vector, Proceedings of GRETSI 2003 Conference, I: 47-52, 2003.
12. M. Reed, B. Simon. Functional Analysis, part I of Methods of Mathematical Physics, Academic Press, 1980.
13. E. Rio. Theorie asymptotique des processus aléatoires faiblement dépendants. Springer 2000.
14. B. Simon. Trace Ideals and Their Applications. Cambridge University Press, London, 1979
15. J. Shawe-Taylor, C.K.I. Williams, N. Cristianini, J.S. Kandola: On the eigenspectrum of the Gram matrix and the generalization error of kernel-PCA. IEEE Transactions on Information Theory 51(7): 2510-2522, 2005.
16. M. Vidyasagar, Learning and generalization with applications to neural networks. Springer, London, 2003.
17. L. Wiskott, T. Sejnowski. Slow feature analysis: Unsupervised learning of invariances. Neural Computation, 14: 715-770, 2003.
18. W. Yan, U. Helmke, J.B. Moore. Global analysis of Oja's flow for neural networks. IEEE Trans. on Neural Networks 5,5: 674-683, 1994.
19. B. Yu. Rate of convergence for empirical processes of stationary mixing sequences. Annals of Probability 22, 94-116, 1994.