Learning a function from noisy samples at a finite sparse set of points

Journal of Approximation Theory

Volumn 161, Issue 2, 2009, Pages 448-463

  Hofinger, Andreas ^a   Pillichshammer, Friedrich ^b  

^a JOHANN RADON INSTITUTE FOR COMPUTATIONAL AND APPLIED MATHEMATICS   (Austria)

^b JOHANNES KEPLER UNIVERSITY LINZ   (Austria)

Author keywords

Learning theory; Quasi Monte Carlo methods; Regularization; Sampling theory

Indexed keywords

EID: 70449518406     PISSN: 00219045     EISSN: 10960430     Source Type: Journal    
DOI: 10.1016/j.jat.2008.11.003     Document Type: Article

References (34)

1. Adams R.A. Sobolev Spaces (1975), Academic Press
2. Aronszajn N. Theory of reproducing kernels. Trans. Amer. Math. Soc. 68 (1950) 337-404
3. Barron A.R. Universal approximation bounds for superpositions of a sigmoidal function. IEEE Trans. Inform. Theory 39 3 (1993) 930-945
4. Bissantz N., Hohage T., and Munk A. Consistency and rates of convergence of nonlinear Tikhonov regularization with random noise. Inverse Problems 20 6 (2004) 1773-1789
5. Bodenhofer U., Burger M., Engl H.W., and Haslinger J. Regularized data-driven construction of fuzzy controllers. J. Inverse Ill-Posed Probl. 10 (2002) 319-344
6. n. Proc. London Math. Soc. 56 3 (1988) 261-280
7. Burger M., and Hofinger A. Regularized greedy algorithms for network training with data noise. Computing 74 (2005) 1-22
8. Burger M., and Neubauer A. Error bounds for approximation with neural networks. J. Approx. Theory 112 (2001) 235-250
9. Chua S.-K. Weighted Sobolev interpolation inequalities on product spaces. Forum Math. 11 6 (1999) 647-658
10. Cucker F., and Smale S. On the mathematical foundations of learning. Bull. Amer. Math. Soc. N.S. 39 1 (2002) 1-49
11. DeVore R., Kerkyacharian G., Picard D., and Temlyakov V. Approximation methods for supervised learning. Found. Comput. Math. 6 (2006) 3-58
12. Dingankar A.T., and Sandberg I.W. A note on error bounds for approximation in inner product spaces. Circuits Syst. Signal Process. 15 4 (1996) 519-522
13. Donahue M.J., Gurvits L., Darken C., and Sontag E. Rates of convex approximation in non-Hilbert spaces. Constr. Approx. 13 2 (1997) 187-220
14. Engl H.W., Hanke M., and Neubauer A. Regularization of Inverse Problems (1996), Kluwer, Dordrecht
15. Evgeniou Th., Pontil M., and Poggio T. Regularization networks and support vector machines. Adv. Comput. Math. 13 1 (2000) 1-50
16. Girosi F., Jones M., and Poggio T. Regularization theory and neural networks architectures. Neural Comput. 7 (1995) 219-269
17. Groetsch C.W., and Vogel C.R. Asymptotic theory of filtering for linear operator equations with discrete noisy data. Math. Comp. 49 (1987) 499-506
18. s. Math. Comp. 73 (2004) 1885-1901
19. Hlawka E. Über die Diskrepanz mehrdimensionaler Folgen mod. 1. Math. Zeitschr. 77 (1961) 273-284
20. A. Hofinger, Iterative regularization and training of neural networks, Diplomarbeit, University of Linz, 2003
21. Hofinger A. Nonlinear function approximation: Computing smooth solutions with an adaptive greedy algorithm. J. Approx. Theory 143 2 (2006) 159-175
22. Jones L.K. A simple lemma on greedy approximation in Hilbert space and convergence rates for projection pursuit regression and neural network training. Ann. Statist. 20 1 (1992) 608-613
23. p discrepancy and tractability of integration. J. Complexity 19 (2003) 529-547
24. Lions J.L., and Magenes E. Non-homogeneous Boundary Value Problems and Applications vol. 1 (1972), Springer, Berlin, Heidelberg
25. Lukas M.A. Comparison of parameter choice methods for regularization with discrete noisy data. Inverse Probl. 14 (1998) 161-184
26. Nashed M.Z., and Wahba G. Convergence rates of approximate least squares solutions of linear integral and operator equations of the first kind. Math. Comp. 28 (1974) 69-80
27. Niederreiter H. Random Number Generation and Quasi-Monte Carlo Methods (1992), SIAM
28. Niyogi P., and Girosi F. Generalization bounds for function approximation from scattered noisy data. Adv. Comput. Math. 10 (1999) 51-80
29. Sloan I.H., and Woźniakowski H. When are quasi-Monte Carlo algorithms efficient for high dimensional integration?. J. Complexity 14 (1998) 1-33
30. Smale S., and Zhou D.-X. Shannon sampling and function reconstruction from point values. Bull. Amer. Math. Soc. N.S. 41 3 (2004) 279-305
31. Temlyakov V.N. Approximation of Periodic Functions (1993), Nova Science Publishers, Inc.
32. Temlyakov V.N. Approximation in learning theory. Constr. Approx. 27 1 (2008) 33-74
33. Temlyakov V.N. Nonlinear methods of approximation. Found. Comput. Math. 3 1 (2003) 33-107
34. Zaremba S.K. Some applications of multivariate integration by parts. Ann. Polon. Math. 21 (1968) 85-96