University of Cambridge > > Isaac Newton Institute Seminar Series > Bayesian quadrature, energy minimization and kernel herding for space filling design

Bayesian quadrature, energy minimization and kernel herding for space filling design

Add to your list(s) Download to your calendar using vCal

  • UserLuc Pronzato (Universit√© de Nice Sophia Antipolis; CNRS (Centre national de la recherche scientifique))
  • ClockFriday 13 April 2018, 09:00-10:00
  • HouseSeminar Room 1, Newton Institute.

If you have a question about this talk, please contact INI IT.

UNQW04 - UQ for inverse problems in complex systems

A standard objective in computer experiments is to predict the behaviour of an unknown function on a compact domain from a few evaluations inside the domain. When little is known about the function, space-filling design is advisable: typically, points of evaluation spread out across the available space are obtained by minimizing a geometrical (for instance, minimax-distance) or a discrepancy criterion measuring distance to uniformity. We shall make a survey of some recent results on energy functionals, and investigate connections between design for integration (quadrature design), construction of the (continuous) BLUE for the location model, and minimization of energy (kernel discrepancy) for signed measures. Integrally strictly positive definite kernels define strictly convex energy functionals, with an equivalence between the notions of potential and directional derivative for smooth kernels, showing the strong relation between discrepancy minimization and more traditional design of optimal experiments. In particular, kernel herding algorithms are special instances of vertex-direction methods used in optimal design, and can be applied to the construction of point sequences with suitable space-filling properties. The presentation is based on recent work with A.A. Zhigljavsky (Cardiff University).

This talk is part of the Isaac Newton Institute Seminar Series series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


© 2006-2024, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity