Kernels and learning curves for Gaussian process regression on random graphs

Advances in Neural Information Processing Systems 22 - Proceedings of the 2009 Conference

Volumn , Issue , 2009, Pages 1723-1731

  Sollich, Peter ^a   Urry, Matthew J ^a   Coti, Camille ^b  

^a KING'S COLLEGE LONDON   (United Kingdom)

^b INRIA SACLAY   (France)

Author keywords

[No Author keywords available]

Indexed keywords

FORESTRY; GAUSSIAN DISTRIBUTION; GAUSSIAN NOISE (ELECTRONIC);

GAUSSIAN PROCESS REGRESSION; GRAPH STRUCTURES; LEARN+; LEARNING CURVES; LENGTH SCALE; NEIGHBOURING FUNCTION; NON-TRIVIAL; PROPERTY; RANDOM GRAPHS; RANDOM WALK;

TREES (MATHEMATICS);

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

References (18)

1. C E Rasmussen and C K I Williams. Gaussian processes for regression. In D S Touretzky, M C Mozer, and M E Hasselmo, editors, Advances in Neural Information Processing Systems 8, pages 514-520, Cambridge, MA, 1996. MIT Press.
2. M Opper. Regression with Gaussian processes: Average case performance. In I K Kwok-Yee, M Wong, I King, and Dit-Yun Yeung, editors, Theoretical Aspects of Neural Computation: A Multidisciplinary Perspective, pages 17-23. Springer, 1997.
3. P Sollich. Learning curves for Gaussian processes. In M S Kearns, S A Solla, and D A Cohn, editors, Advances in Neural Information Processing Systems 11, pages 344-350, Cambridge, MA, 1999. MIT Press.
4. M Opper and F Vivarelli. General bounds on Bayes errors for regression with Gaussian processes. In M Kearns, S A Solla, and D Cohn, editors, Advances in Neural Information Processing Systems 11, pages 302-308, Cambridge, MA, 1999. MIT Press.
5. C K I Williams and F Vivarelli. Upper and lower bounds on the learning curve for Gaussian processes. Mach. Learn., 40(1):77-102, 2000.
6. D Malzahn and M Opper. Learning curves for Gaussian processes regression: A framework for good approximations. In T K Leen, T G Dietterich, and V Tresp, editors, Advances in Neural Information Processing Systems 13, pages 273-279, Cambridge, MA, 2001. MIT Press.
7. D Malzahn and M Opper. A variational approach to learning curves. In T G Dietterich, S Becker, and Z Ghahramani, editors, Advances in Neural Information Processing Systems 14, pages 463-469, Cambridge, MA, 2002. MIT Press.
8. P Sollich and A Halees. Learning curves for Gaussian process regression: approximations and bounds. Neural Comput., 14(6):1393-1428, 2002.
9. P Sollich. Gaussian process regression with mismatched models. In T G Dietterich, S Becker, and Z Ghahramani, editors, Advances in Neural Information Processing Systems 14, pages 519-526, Cambridge, MA, 2002. MIT Press.
10. P Sollich. Can Gaussian process regression be made robust against model mismatch? In Deterministic and Statistical Methods in Machine Learning, volume 3635 of Lecture Notes in Artificial Intelligence, pages 199-210. 2005.
11. M Herbster, M Pontil, and L Wainer. Online learning over graphs. In ICML '05: Proceedings of the 22nd international conference on Machine learning, pages 305-312, New York, NY, USA, 2005. ACM.
12. A J Smola and R Kondor. Kernels and regularization on graphs. In M Warmuth and B Schölkopf, editors, Proc. Conference on Learning Theory (COLT), Lect. Notes Comp. Sci., pages 144-158. Springer, Heidelberg, 2003.
13. R I Kondor and J D Lafferty. Diffusion kernels on graphs and other discrete input spaces. In ICML '02: Proceedings of the Nineteenth International Conference on Machine Learning, pages 315-322, San Francisco, CA, USA, 2002. Morgan Kaufmann.
14. F R K Chung. Spectral graph theory. Number 92 in Regional Conference Series in Mathematics. Americal Mathematical Society, 1997.
15. A Steger and N C Wormald. Generating random regular graphs quickly. Combinator. Probab. Comput., 8(4):377-396, 1999.
16. F Chung and S-T Yau. Coverings, heat kernels and spanning trees. The Electronic Journal of Combinatorics, 6(1):R12, 1999.
17. C Monthus and C Texier. Random walk on the Bethe lattice and hyperbolic brownian motion. J. Phys. A, 29(10):2399-2409, 1996.
18. T Rogers, I Perez Castillo, R Kuehn, and K Takeda. Cavity approach to the spectral density of sparse symmetric random matrices. Phys. Rev. E, 78(3):031116, 2008.