Related papers: Uniform-in-time propagation of chaos for Consensus…
An algorithm to characterize collective motion is presented, with the introduction of ``collective Lyapunov exponent'', as the orbital instability at a macroscopic level. By applying the algorithm to a globally coupled map, existence of…
Continuous p-dispersion problems with and without boundary constraints are NP-hard optimization problems with numerous real-world applications, notably in facility location and circle packing, which are widely studied in mathematics and…
Bayesian optimization (BO) has become popular for sequential optimization of black-box functions. When BO is used to optimize a target function, we often have access to previous evaluations of potentially related functions. This begs the…
We study the problem of globally optimising a target variable of an unknown causal graph on which a sequence of soft or hard interventions can be performed. The problem of optimising the target variable associated with a causal graph is…
In this work, we propose a robust optimization approach to mitigate the impact of uncertainties in particle precipitation. Our model incorporates partial differential equations, more particular nonlinear and nonlocal population balance…
Distributionally robust optimization (DRO) can improve the robustness and fairness of learning methods. In this paper, we devise stochastic algorithms for a class of DRO problems including group DRO, subpopulation fairness, and empirical…
Bayesian optimization (BO) based on Gaussian process models is a powerful paradigm to optimize black-box functions that are expensive to evaluate. While several BO algorithms provably converge to the global optimum of the unknown function,…
We propose a zero-order optimization method for sequential min-max problems based on two populations of interacting particles. The systems are coupled so that one population aims to solve the inner maximization problem, while the other aims…
This paper addresses the consensus of a class of uncertain nonlinear fractional-order multi-agent systems (FOMAS). First a fractional non-fragile dynamic output feedback controller is put forward via the output measurements of neighboring…
Macroscopically heterogeneous materials, characterised mostly by comparable heterogeneity lengthscale and structural sizes, can no longer be modelled by deterministic approach instead. It is convenient to introduce stochastic approach with…
We analyse the performance of a recursive Monte Carlo method for the Bayesian estimation of the static parameters of a discrete--time state--space Markov model. The algorithm employs two layers of particle filters to approximate the…
The purpose of the present paper is to introduce and establish a notion of stability for the backward propagation of chaos with respect to (initial) data sets. Consider, for example, a sequence of discrete-time martingales converging to a…
We consider derivative-free black-box global optimization of expensive noisy functions, when most of the randomness in the objective is produced by a few influential scalar random inputs. We present a new Bayesian global optimization…
Time-uniform log-Sobolev inequalities (LSI) satisfied by solutions of semi-linear mean-field equations have recently appeared to be a key tool to obtain time-uniform propagation of chaos estimates. This work addresses the more general…
In the paper, we study spatially distributed particle systems whose time evolution is governed by vanishing diffusion in space $\mathbb{R}^d$, $d\ge 1$, and by size-continuous fragmentation and coagulation processes with unbounded rates. We…
Collaborative Optimization (CO) is a multidisciplinary design optimization (MDO) framework that decomposes large-scale engineering problems into parallel, independently solvable subsystems coordinated by a system-level optimizer. Its…
The aim of this note is to revisit propagation of chaos for a Langevin-type interacting particle system used for sampling probability measures. The interacting particle system we consider coincides, in the setting of a log-quadratic target…
Automated matching engines execute millions of orders per session, yet systematic asymmetries in latency, order size, and market access compound into persistent execution disparities that erode participant trust. We formulate provably fair…
This paper investigates the distributed continuous-time nonconvex optimization problem over unbalanced directed networks. The objective is to cooperatively drive all the agent states to an optimal solution that minimizes the sum of the…
In distributed model predictive control (MPC), the control input at each sampling time is computed by solving a large-scale optimal control problem (OCP) over a finite horizon using distributed algorithms. Typically, such algorithms require…