Learning with non-positive kernels

Proceedings, Twenty-First International Conference on Machine Learning, ICML 2004

Volumn , Issue , 2004, Pages 639-646

  Ong, Cheng Soon ^a   Mary, Xavier ^b   Canu, Stéphane ^c   Smola, Alexander J ^a  

^a AUSTRALIAN NATIONAL UNIVERSITY   (Australia)

^b CREST   (France)

^c UNIVERSITÉ ET INSA DE ROUEN   (France)

Author keywords

Ill posed Problems; Indefinite Kernels; Non convex Optimization; Rademacher Average; Representer Theorem; Reproducing Kernel Kre n Space

Indexed keywords

APPROXIMATION THEORY; COSTS; EIGENVALUES AND EIGENFUNCTIONS; ITERATIVE METHODS; MATRIX ALGEBRA; PROBLEM SOLVING; SET THEORY; SPURIOUS SIGNAL NOISE;

HILBERT SPACES; MATRIX-VECTOR PRODUCTS; REPRODUCING KERNEL HILBERT SPACES; REPRODUCING KERNEL KREIN SPACES (RKKS);

LEARNING SYSTEMS;

EID: 14344254996     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (18)

1. Alpay, D. (2001). The schur algorithm, reproducing kernel spaces and system theory, vol. 5 of SMF/AMS Texts and Monographs. SMF.
2. Azizov, T. Y., & Iokhvidov, I. S. (1989). Linear operators in spaces with an indefinite metric. John Wiley & Sons. Translated by E. R. Dawson.
3. Bognár, J. (1974). Indefinite inner product spaces. Springer Verlag.
4. Engl, H. W., & Kügler, P. (2003). Nonlinear inverse problems: Theoretical aspects and some industrial applications. Inverse Problems: Computational Methods and Emerging Applications Tutorials, UCLA.
5. Haasdonk, B. (2003). Feature space interpretation of SVMs with non positive definite kernels. Unpublished.
6. Hanke, M. (1995). Conjugate gradient type methods for ill-posed problems. Pitman Research Notes in Mathematics Series. Longman Scientific & Technical.
7. Hanke, M., & Hansen, P. (1993). Regularisation methods for large-scale problems. Surveys Math. Ind., 3, 253-315.
8. ∞ theories. SIAM.
9. Lin, H.-T., & Lin, C.-J. (2003). A study on sigmoid kernels for svm and the training of non-psd kernels by smo-type methods. March.
10. Mary, X. (2003). Hilbertian subspaces, subdualities and applications. Doctoral dissertation, Institut National des Sciences Appliquees Rouen.
11. Mendelson, S. (2003). A few notes on statistical learning theory. Advanced Lectures in Machine Learning (pp. 1-40). Springer Verlag.
12. Ong, C. S., & Smola, A. J. (2003). Machine learning with hyperkernels. International Conference of Machine Learning (pp. 568-575).
13. Rockafellar, R. T. (1996). Convex analysis. Princeton Univ. Pr. Reprint edition.
14. Schölkopf, B., Herbrich, R., Smola, A., & Williamson, R. (2001). A generalized representer theorem. Proceedings of Computational Learning Theory.
15. Schölkopf, B., & Smola, A. J. (2002). Learning with kernels. MIT Press.
16. Smola, A. J., Ovari, Z. L., & Williamson, R. C. (2000). Regularization with dot-product kernels. NIPS (pp. 308-314).
17. Vapnik, V. N. (1998). Statistical learning theory. John Wiley & Sons.
18. Wahba, G. (1990). Spline models for observational data. SIAM.