Least square regression with lp-coefficient regularization

Neural Computation

Volumn 22, Issue 12, 2010, Pages 3221-3235

  Tong, Hongzhi ^a   Chen, Di Rong ^b   Yang, Fenghong ^c  

^a UNIVERSITY OF INTERNATIONAL BUSINESS AND ECONOMICS   (China)

^b BEIHANG UNIVERSITY   (China)

^c CENTRAL UNIVERSITY OF FINANCE AND ECONOMICS   (China)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 78649659487     PISSN: 08997667     EISSN: 1530888X     Source Type: Journal    
DOI: 10.1162/NECO_a_00044     Document Type: Letter

References (26)

1. Aronszajn, N. (1950). Theory of reproducing kernels. Trans. Amer. Math. Soc., 68, 337-404.
2. Bartlett, P. L. (1998). The sample complexity of pattern classification with neural networks: The size of the weights is more import than the size of the network. IEEE Trans. Inform. Theory, 44, 525-536.
3. Bradley, P. S., & Mangasarian, O. L. (2000). Massive data discrimination via linear support vector machines. Optimization Methods and Software, 13, 1-10.
4. Caponnetto, A., & De Vito, E. (2007). Optimal rates for regularized least-squares algorithm. Found. Comput. Math., 7, 331-368.
5. Cucker, F., & Smale, S. (2001). On the mathematical foundations of learning theory. Bull. Amer. Math. Soc., 39, 1-49.
6. Cucker, F., & Smale, S. (2002). Best choices for regularization parameters in learning theory: On the bias-variance problem. Found. Comput. Math., 2, 413-428.
7. Daubechies, I., Defrise, M., & Demol, C. (2004). An iterative thresholding algorithm for linear inverse problems with sparsity constraint. Comm. Pure Appl. Math., 57, 1413-1541.
8. Evgeniou, T., Pontil, M., & Poggio, T. (2000). Regularization networks and support vector machines. Adv. Comput. Math., 13, 1-50.
9. Girosi, F., Jones, M., & Poggio, T. (1995). Regularization theory and neural network architectures. Neural Comput., 7, 219-269.
10. Györfi, L., Kohler, M., Krzyzak, A., & Walk, H. (2002). A distribution-free theory of nonparametric regression. Berlin: Springer.
11. Kecman, V., & Hadzic, I. (2000). Support vector selection by linear programming. In Proceedings of the International Joint Conference on Neural Networks (Vol. 5, pp. 193-198). Washington, DC: IEEE Computer Society Press.
12. Niyogi, N., & Girosi, F. (1996). On the relationship between generalization error, hypothesis complexity, and sample complexity for radical basis functions. Neural Comput., 8, 819-842.
13. Scholköpf, B., Herbrich, R. & Smola, A. J. (2001). A generalized representer theorem. In Proceedings of the 14th Annual Conference on Computational Learning Theory and and 5th European Conference on Computational Learning Theory (pp. 416-426). Berlin: Springer-Verlag.
14. Scholköpf, B., & Smola, A. J. (2002). Learning with kernels. Cambridge, MA: MIT Press.
15. Shawe-Taylor, J., & Cristianini, N. (2004). Kernel methods for pattern analysis. Cambridge: Cambridge University Press.
16. Smale, S., & Zhou, D. X. (2003). Estimating the approximation error in learning theory. Anal. Appl., 1, 17-41.
17. Smale, S., & Zhou, D. X. (2005). Shannon sampling II: Connections to learning theory. Appl. Comput. Harmonic Anal., 19, 285-302.
18. Smale, S., & Zhou, D. X. (2007). Learning theory estimates via integral operators and their applications. Constr. Approx., 26, 153-172.
19. 1 complexity regularization. Bernoulli, 12(6), 1045-1076.
20. Vapnik, V. (1998). Statistical learning theory. New York: Wiley.
21. Wahba, G. (1990). Spline models for observation data. Philadelphia: SIAM.
22. Wu, Q., Ying, Y., & Zhou, D. X. (2006). Learning rates of least-square regularized regression. Found. Comput. Math., 6, 171-192.
23. Wu, Q., & Zhou, D. X. (2005). SVM soft margin classifiers: Linear programming versus quadratic programming. Neural Comput., 17, 1160-1187.
24. Wu, Q., & Zhou, D. X. (2008). Learning with sample dependent hypothesis spaces. Comput. Math. Appl., 56, 2896-2907.
25. 1-regularizer. Taiwanese J. Math.
26. Zhou, D. X. (2003). Capacity of reproducing kernel spaces in learning theory. IEEE Trans. Inform. Theory, 49, 1743-1752.