University of Cambridge > Talks.cam > Isaac Newton Institute Seminar Series > Random Batch Methods for Interacting Particle Systems and Consensus-based Global Non-convex Optimization in High-dimensional Machine Learning (copy)

Random Batch Methods for Interacting Particle Systems and Consensus-based Global Non-convex Optimization in High-dimensional Machine Learning (copy)

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

If you have a question about this talk, please contact info@newton.ac.uk.

GCS - Geometry, compatibility and structure preservation in computational differential equations

We develop random batch methods for interacting particle systems with large number of particles. These methods
use small but random batches for particle interactions,
thus the computational cost is reduced from O(N^2) per time step to O(N), for a
system with N particles with binary interactions.
For one of the methods, we give a particle number independent error estimate under some special interactions.
Then, we apply these methods
to some representative problems in mathematics, physics, social and data sciences, including the Dyson Brownian
motion from random matrix theory, Thomson's problem,
distribution of wealth, opinion dynamics and clustering. Numerical results show that
the methods can capture both the transient solutions and the global equilibrium in
these problems.

We also apply this method and improve the consensus-based global optimization algorithm for high
dimensional machine learning problems. This method does not require taking gradient in finding global
minima for non-convex functions in high dimensions.

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