Generalization bounds for subspace selection and hyperbolic PCA

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

Volumn 3940 LNCS, Issue , 2006, Pages 185-197

  Maurer, Andreas ^a  

^a NONE   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CONFORMAL MAPPING; DATA STORAGE EQUIPMENT; DATA TRANSFER; EIGENVALUES AND EIGENFUNCTIONS; FUNCTION EVALUATION; LEARNING SYSTEMS; LINEAR CONTROL SYSTEMS; METADATA;

FINITE DIMENSIONAL PROJECTIONS; HUBERT SPACE; HYPERBOLIC; SUBSPACE SELECTION;

OPTIMAL CONTROL SYSTEMS;

EID: 33745836716     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11752790_13     Document Type: Conference Paper

References (16)

1. P. L. Bartlett and S. Mendelson. Rademacher and Gaussian Complexities: Risk Bounds and Structural Results. Journal of Machine Learning Research, 2002.
2. P.Bartlett, O.Bousquet and S.Mendelson. Local Rademacher complexities. Available online: http://www.stat.berkeley.edu/~bartlett/papers/bbm-lrc-02b.pdf.
3. A. Bar-Hillel, T. Hertz, N. Shental, D. Weinshall. Learning a Mahalanobis Metric from Equivalence Constraints. Journal of Machine Learning Research 6: 937-965, 2005.
4. J.Baxter, A Model of Inductive Bias Learning, Journal of Artificial Intelligence Research 12: 149-198, 2000
5. Nello Cristianini and John Shawe-Taylor, Support Vector Machines, Cambridge University Press, 2000.
6. R. Hammer, T. Hertz, S. Hochstein, D. Weinshall. Category learning from equivalence constraints. XXVII Conference of Cognitive Science Society (CogSci2005), available online.
7. V. Koltchinskii and D. Panchenko, Empirical margin distributions and bounding the generalization error of combined classifiers, The Annals of Statistics, Vol. 30, No 1, 1-50.
8. M. Ledoux and M. Talagrand, Probability in Banach Spaces: isoperimetry and processes. Springer, 1991.
9. Colin McDiarmid, Concentration, in Probabilistic Methods of Algorithmic Discrete Mathematics, p. 195-248. Springer, Berlin, 1998.
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. Michael Reed and Barry Simon. Functional Analysis, part I of Methods of Mathematical Physics, Academic Press, 1980.
13. A. Robins, Transfer in Cognition, in Learning to Learn, S. Thrun, L. Pratt Eds. Springer 1998.
14. John Shawe-Taylor, Christopher K. I. Williams, Nello Cristianini, Jaz S. Kandola: On the eigenspectrum of the gram matrix and the generalization error of kernelPCA. IEEE Transactions on Information Theory 51(7): 2510-2522, 2005
15. S.Thrun, Lifelong Learning Algorithms, in Learning to Learn, S.Thrun, L.Pratt Eds. Springer 1998
16. E. P. Xing, A. Y. Ng, M. I. Jordan, S. Russel. Distance metric learning, with application to clustering with side information. In S. Decker, S. Thrun, K. Obermayer, eds, Advances in Neural Information Processing Systems 14, Cambridge, MA, 2002. MIT Press.