Related papers: Well-posedness and mean-field limit estimate of a …

This study develops a fixed-time convergent saddle point dynamical system for solving min-max problems under a relaxation of standard convexity-concavity assumption. In particular, it is shown that by leveraging the dynamical systems…

A pathwise large deviation principle in the Wasserstein topology and a pathwise central limit theorem are proved for the empirical measure of a mean-field system of interacting diffusions. The coefficients are path-dependent. The framework…

We establish a uniform-in-time estimate for the mean-field convergence of the Consensus-Based Optimization (CBO) algorithm by rescaling the consensus point in the dynamics with a small parameter $\kappa \in (0,1)$. This uniform-in-time…

We develop a framework for convexifying a fairly general class of optimization problems. Under additional assumptions, we analyze the suboptimality of the solution to the convexified problem relative to the original nonconvex problem and…

In this work, we formulate an abstract framework to study mean-field systems. In contrast to most approaches in the available literature which primarily rely on the analysis of SDEs, ours is based on optimal transport and semigroup theory.…

This paper considers the decentralized convex optimization problem, which has a wide range of applications in large-scale machine learning, sensor networks, and control theory. We propose novel algorithms that achieve optimal computation…

While the topic of mean-field games (MFGs) has a relatively long history, heretofore there has been limited work concerning algorithms for the computation of equilibrium control policies. In this paper, we develop a computable policy…

Starting from a particle model describing self-propelled particles interacting through nematic alignment, we derive a macroscopic model for the particle density and mean direction of motion. We first propose a mean-field kinetic model of…

In this paper we study a mean field control problem in which particles are absorbed when they reach the boundary of a smooth domain. The value of the N-particle problem is described by a hierarchy of Hamilton-Jacobi equations which are…

Active systems, which are driven out of equilibrium by local non-conservative forces, exhibit unique behaviors and structures with potential utility for the design of novel materials. An important and difficult challenge along the path…

Many machine learning problems can be formulated as minimax problems such as Generative Adversarial Networks (GANs), AUC maximization and robust estimation, to mention but a few. A substantial amount of studies are devoted to studying the…

The present work establishes the mean-field limit of a N-particle system towards a regularized variant of the relativistic Vlasov-Maxwell system, following the work of Braun-Hepp [Comm. in Math. Phys. 56 (1977), 101-113] and Dobrushin…

We consider solving nonconvex composite optimization problems in which the sum of a smooth function and a nonsmooth function is minimized. Many of convergence analyses of proximal gradient-type methods rely on global descent property…

We present a model-based derivative-free method for optimization subject to general convex constraints, which we assume are unrelaxable and accessed only through a projection operator that is cheap to evaluate. We prove global convergence…

We address the numerical approximation of Mean Field Games with local couplings. For power-like Hamiltonians, we consider both unconstrained and constrained stationary systems with density constraints in order to model hard congestion…

We introduce a system of self-propelled agents (active Brownian particles) with velocity alignment in two spatial dimensions and derive a mean-field theory from the microscopic dynamics via a nonlinear Fokker-Planck equation and a moment…

We contribute the first provable guarantees of global convergence to Nash equilibria (NE) in two-player zero-sum convex Markov games (cMGs) by using independent policy gradient methods. Convex Markov games, recently defined by Gemp et al.…

In this paper we consider mean-field optimal control problems with selective action of the control, where the constraint is a continuity equation involving a non-local term and diffusion. First order optimality conditions are formally…

We propose a MINRES-based Newton-type algorithm for solving unconstrained nonconvex optimization problems. Our approach uses the minimal residual method (MINRES), a well-known solver for indefinite symmetric linear systems, to compute…

Bi-level optimization problems, where one wishes to find the global minimizer of an upper-level objective function over the globally optimal solution set of a lower-level objective, arise in a variety of scenarios throughout science and…