University of Cambridge > Talks.cam > Isaac Newton Institute Seminar Series > Consensus-Based Optimization and Sampling

Consensus-Based Optimization and Sampling

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

  • UserFranca Hoffmann (CALTECH (California Institute of Technology))
  • ClockMonday 15 July 2024, 11:00-12:00
  • HouseExternal.

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

DMLW01 - International workshop on diffusions in machine learning: foundations, generative models, and optimisation

Particle methods provide a powerful paradigm for solving complex global optimization problems leading to highly parallelizable algorithms. Despite widespread and growing adoption, theory underpinning their behavior has been mainly based on meta-heuristics. In application settings involving black-box procedures, or where gradients are too costly to obtain, one relies on derivative-free approaches instead. This talk will focus on two recent techniques, consensus-based optimization and consensus-based sampling. We explain how these methods can be used for the following two goals: (i) generating approximate samples from a given target distribution, and (ii) optimizing a given objective function. They circumvent the need for gradients via Laplace’s principle. We investigate the properties of this family of methods in terms of various parameter choices and present an overview of recent advances in the field.

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 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity