Approximate maximum a posteriori with Gaussian process priors

Constructive Approximation

Volumn 26, Issue 2, 2007, Pages 205-224

  Hegland, Markus ^a  

^a AUSTRALIAN NATIONAL UNIVERSITY   (Australia)

Author keywords

Exponential families; Galerkin method; Gaussian process priors; Martin Cameron spaces; Maximum a posteriori method; Representer theorem

Indexed keywords

EID: 34547489602     PISSN: 01764276     EISSN: 14320940     Source Type: Journal    
DOI: 10.1007/s00365-006-0661-4     Document Type: Article

References (34)

1. R. J. ADLER (1981): The Geometry of Random Fields. Wiley Series in Probability and Mathematical Statistics. Chichester: Wiley.
2. Y. ALTUN, A. J. SMOLA, T. HOFMANN (2004): Exponential families for conditional random fields. In: AUAI '04: Proceedings of the 20th Conference on Uncertainty in Artificial Intelligence (Banff, 2004), pp. 2-9. Arlington, VA: AUAI Press.
3. M. ANTHONY, P. BARTLETT (1999): Neural Network Learning: Theoretical Foundations. Cambridge: Cambridge University Press.
4. V. I. BOGACHEV (1998): Gaussian Measures, Mathematical Surveys and Monographs, Vol. 62. Providence, RI: American Mathematical Society.
5. H.-J. BUNGARTZ, M. GRIEBEL (2004): Sparse Grids. Acta Numerica, Vol. 13, pp. 1-123. Cambridge: Cambridge University Press.
6. F. CUCKER, S. SMALE (2002): On the mathematical foundations of learning. Bull. Amer. Math. Soc. (N.S.), 39(1): 1-49 (electronic).
7. L. DEVROYE, L. GYÖRFI, G. LUGOSI (1996): A Probabilistic Theory of Pattern Recognition. Applications of Mathematics, Vol. 31. New York: Springer-Verlag.
8. J. GARCKE, M. GRIEBEL, M. THESS (2001): Data mining with sparse grids. Computing, 67(3):225-253.
9. M. GRIEBEL, S. KNAPEK (2000): Optimized tensor-product approximation spaces. Constr. Approx., 16(4):525-540.
10. M. GRIEBEL, P. OSWALD, T. SCHIEKOFER (1999): Sparse grids for boundary integral equations. Numer. Math., 83(2):279-312.
11. M. GRIEBEL, M. SCHNEIDER, C. ZENGER (1992): A combination technique for the solution of sparse grid problems. In: Iterative Methods in Linear Algebra (Brussels, 1991), pp. 263-281. Amsterdam: North-Holland.
12. M. HEGLAND (2003): Adaptive sparse grids. In: (K. Burrage, R. B. Sidje, eds.), Proceedings of the 10th Computational Techniques and Applications Conference CTAC-2001 (Brisbane, 2001), ANZIAM J., 44:C335-C353.
13. M. HEGLAND (1995): Variable Hilbert scales and their interpolation inequalities with applications to Tikhonov regularization. Appl. Anal., 59(1-4):207-223.
14. M. HEGLAND (2003): Additive sparse grid fitting. In: Curve and Surface Fitting (Saint-Malo, 2002). Modern Methods in Mathematics, pp. 209-218. Brentwood, TN: Nashboro Press.
15. M. HEGLAND, O. M. NIELSEN, Z. SHEN (2004): Multidimensional smoothing using hyperbolic interpolator wavelets. Electron. Trans. Numer. Anal., 17:168-180 (electronic).
16. H. JARCHOW (1981): Locally Convex Spaces. Mathematische Leitfäden. [Mathematical Textbooks.] Stuttgart: B. G. Teubner.
17. S. S. KEERTHI, W. CHU (2005): A matching pursuit approach to sparse Gaussian process regression. In: (Y. Weiss, B. Scholkopf, J. Platt, eds.), Advances in Neural Information Processing Systems, Vol. 18, pp. 643-650. Cambridge, MA: MIT Press.
18. G. KIMELDORF, G. WAHBA (1971): Some results on Tchebycheffian spline functions. J. Math. Anal. Appl., 33:82-95.
19. S. KNAPEK, F. KOSTER (2001/02): Integral operators on sparse grids. SIAM J. Numer. Anal., 39(5):1794-1809 (electronic).
20. F. M. LARKIN (1972): Gaussian measure in Hilbert space and applications in numerical analysis. Rocky Mountain J. Math., 2(3):379-421.
21. T. POGGIO, S. SMALE (2003): The mathematics of learning: Dealing with data. Notices Amer. Math. Soc., 50(5):537-544.
22. J. QUIÑONERO-CANDELA, C. E. RASMUSSEN (2005): A unifying view of sparse approximate Gaussian process regression. J. Mach. Learn. Res., 6:1939-1959.
23. B. D. RIPLEY (1996): Pattern Recognition and Neural Networks. Cambridge: Cambridge University Press.
24. S. ROBERTS, M. HEGLAND, I. ALTAS (2003): Approximation of a thin plate spline smoother using continuous piecewise polynomial functions. SIAM J. Numer. Anal., 41(1):208-234 (electronic).
25. A. SARD (1963): Linear Approximation. Providence, RI: American Mathematical Society.
26. H. H. SCHAEFER, M. P. WOLFF (1999): Topological Vector Spaces, 2nd ed. Graduate Texts in Mathematics, Vol. 3. New York: Springer-Verlag.
27. B. SCHÖLKOPF, A. SMOLA (2002): Learning with Kernels, Support Vector Machines, Regularization, Optimization and Beyond. Cambridge, MA: MIT Press.
28. M. SEEGER (2004): Gaussian processes for machine learning. Internat. J. Neural Syst., 14(2):69-106.
29. A. J. SMOLA, P. L. BARTLETT (2001): Sparse greedy Gaussian process regression. In: (T. K. Leen, T. G. Dietterich, V. Tresp, eds.), Advances in Neural Information Processing Systems, Vol. 13, pp. 619-625. Cambridge, MA: MIT Press.
30. V. VAPNIK (1995): The Nature of Statistical Learning Theory. New York: Springer-Verlag.
31. G. WAHBA (1990): Spline Models for Observational Data. CBMS-NSF Regional Conference Series in Applied Mathematics, Vol. 59. Philadelphia, PA: SIAM.
32. C. K. I. WILLIAMS, D. BARBER (1998): Bayesian classification with Gaussian processes. IEEE Trans. Pattern Anal. Mach. Intell., 20(12):1342-1351.
33. Y. YAMASAKI (1985): Measures on Infinite-Dimensional Spaces. Series in Pure Mathematics, Vol. 5. Singapore: World Scientific.
34. C. ZENGER (1990): Sparse grids. In: Parallel Algorithms for Partial Differential Equations (Kiel, 1990). Notes Numer. Fluid Mech., Vol. 31, pp. 241-251. Braunschweig: Vieweg.