Large-scale RLSC learning without agony

ACM International Conference Proceeding Series

Volumn 227, Issue , 2007, Pages 529-536

  Li, Wenye ^a   Lee, Kin Hong ^a   Leung, Kwong Sak ^a  

^a CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

CONJUGATE GRADIENT METHOD; CONVERGENCE OF NUMERICAL METHODS; LEARNING SYSTEMS; LINEAR SYSTEMS; MATRIX ALGEBRA; VECTOR QUANTIZATION;

CONVERGENCE PROPERTY; DOMAIN DECOMPOSITION METHOD; MATRIX VECTOR MULTIPLICATION TECHNIQUES;

LEARNING ALGORITHMS;

EID: 34547973344     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1273496.1273563     Document Type: Conference Paper

References (27)

1. Barrett, R., Berry, M., Chan, T. F., Demmel, J., Donato, J., Dongarra, J., Eijkhout, V., Pozo, R., Romine, C., & van der Vorst, H. (1994). Templates for the solution of linear systems: Building blocks for iterative methods. Philadelphia, PA, USA: Society for Industrial and Applied Mathematics.
2. Beatson, R., Light, W., & Billings, S. (2000). Fast solution of the radial basis function interpolation equations: Domain decomposition methods. SIAM J. Sci. Comput, 22, 1717-1740.
3. Faul, A., & Powell, M. (1999). Proof of convergence of an iterative technique for thin plate spline interpolation in two dimensions. Advances in Computational Mathematics, 11, 183-192.
4. Fine, S., & Scheinberg, K. (2001). Efficient svm training using low-rank kernel representations. Journal of Machine Learning Research, 2, 243-264.
5. Freitas, N. D., Wang, Y., Mahdaviani, M., & Lang, D. (2006). Fast Krylov methods for n-body learning. In Y. Weiss, B. Scholkopf and J. Platt (Eds.), Advances in neural information processing systems 18, 251-258. Cambridge, MA: MIT Press.
6. Fung, G., & Mangasarian, O. (2001). Proximal support vector machine classifiers. Proceedings of the Seventh ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD-01) (pp. 77-86). New York: ACM Press.
7. Golub, G. H., & van Loan, C. F. (1996). Matrix computations. John Hopkins Studies in the Mathematical Sciences. Baltimore, Maryland: Johns Hopkins University Press. Third edition.
8. Hastie, T., & Tibshirani, R. (1986). Generalized additive models. Statistical Science, 1, 297-318.
9. Kimeldorf, G., & Wahba, G. (1971). Some results on Tchebycheffian spline functions. J. Math. Anal. Appl., 33, 82-95.
10. Lee, Y.-J., & Mangasarian, O. (2001). Rsvm: Reduced support vector machines. First SIAM International Conference on Data Mining. Chicago.
11. Li, W., Lee, K.-H., & Leung, K.-S. (2007). Generalized regularized least-squares learning with predefined features in a Hubert space. In B. Scholkopf, J. Piatt and T. Hoffman (Eds.), Advances in neural information processing systems 19. Cambridge, MA: MIT Press.
12. Poggio, T., & Girosi, F. (1990). Regularization algorithms for learning that are equivalent to multilayer networks. Science, 247, 978-982.
13. Poggio, T., & Smale, S. (2003). The mathematics of learning: Dealing with data. Not. Am. Math. Soc, 50, 537-544.
14. Preparata, F. P., & Shamos, M. I. (1985). Computational geometry: An introduction. Springer.
15. Ratliff, N. D., & Bagnell, J. A. (2007). Kernel conjugate gradient for fast kernel machines. IJCAI 2007, Proceedings of the 20th International Joint Conference on Artificial Intelligence, Hyderabad, India, January 6-12, 2007 (pp. 1017-1022).
16. Rifkin, R. (2002). Everything old is new again: A fresh look at historical approaches in machine learning. Doctoral dissertation, Massachusetts Institute of Technology.
17. Saad, Y., & van der Vorst, H. A. (2000). Iterative solution of linear systems in the 20th century. Journal of Computational and Applied Mathematics, 123, 1-33. Numerical analysis 2000, Vol. III. Linear algebra.
18. Schaback, R., & Wendland, H. (2000). Numerical techniques based on radial basis functions. Curve and Surface Fitting (pp. 359-374). Nashville, TN: Vanderbilt University Press.
19. Shen, Y., Ng, A., & Seeger, M. (2006). Fast Gaussian process regression using kd-trees. In Y. Weiss, B. Scholkopf and J. Piatt (Eds.), Advances in neural information processing systems 18, 1227-1234. Cambridge, MA: MIT Press.
20. Smith, K., Solomon, D., & Wagner, S. (1977). Practical and mathematical aspects of the problem of reconstructing objects from radiographs. Bulletin of the American Mathematical Society, 1227-1270.
21. Smola, A. J., & Scholkopf, B. (2000). Sparse greedy matrix approximation for machine learning. Proceedings of the Seventeenth International Conference on Machine Learning (pp. 911-918). Morgan Kaufmann.
22. Sun, X., & Pitsianis, N. P. (2001). A matrix version of the fast multipole method. SIAM Review, 43, 289-300.
23. Tikhonov, A., & Arsenin, V. (1977). Solutions of illposed problems. Winston and Sons.
24. von Neumann, J. (1955). Mathematical foundations of quantum mechanics. Princeton University Press.
25. Williams, C K. I., & Rasmussen, C. E. (1996). Gaussian processes for regression. In D. S. Touretzky, M. C. Mozer and M. E. Hasselmo (Eds.), Advances in neural information processing systems, vol. 8. Cambridge, MA: MIT Press.
26. Williams, C. K. I., & Seeger, M. (2001). Using the Nyström method to speed up kernel machines. In T. K. Leen, T. G. Dietterieh and V. Tresp (Eds.), Advances in neural information processing systems 13, 682-688. MIT Press.
27. Yang, C., Duraiswami, R., & Davis, L. (2005). Efficient kernel machines using the improved fast Gauss transform. In L. K. Saul, Y. Weiss and L. Bottou (Eds.), Advances in neural information processing systems 17, 1561-1568. Cambridge, MA: MIT Press.