Researcher profile

Grigorios A. Pavliotis

Grigorios A. Pavliotis contributes to research discovery and scholarly infrastructure.

ResearcherAffiliation not importedOpen to collaborate

Trust snapshot

Quick read

Trust 21 - EmergingVerification L1Unclaimed author
7works
0followers
12topics
4close collaborators

Actions

Decide how to stay connected

Follow researcher0

Identity and collaboration

How to connect with this researcher

Claiming links this public author record to a researcher profile and unlocks direct collaboration workflows.

Log in to claim

Direct collaboration

Open a focused conversation when the fit is right

Claim this author entity first to unlock direct invitations.

Research graph

See the researcher in context

Open full explorer

Inspect adjacent work, topics, institutions and collaborators without jumping out to a separate graph page.

Building this graph slice

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Published work

7 published item(s)

preprint2026arXiv

Recursive Maximum Likelihood Estimation for Interacting Particle Systems using Virtual Particles

We study recursive maximum likelihood estimation for stochastic interacting particle systems based on continuous observation of a single particle. In this regime, consistent estimation of the finite-particle log-likelihood is not possible, even in the limit as the number of particles $N\rightarrow\infty$ and the time horizon $t\rightarrow\infty$. We thus seek to optimise the stationary log-likelihood of the limiting mean-field system. We achieve this via a form of stochastic gradient estimate in continuous time, with stochastic gradient estimates computed using the continuous trajectory of the single observed particle, alongside a virtual interacting particle system and a virtual tangent interacting particle system, which are integrated with the online parameter estimate. For fixed numbers of real and virtual particles, we show that the resulting algorithms drive the gradient of a finite-particle surrogate objective to zero as $t\to\infty$. We then prove that, in the iterated limit $t\to\infty$ followed by $N,M\to\infty$, these surrogate gradients converge uniformly to the gradient of the stationary log-likelihood of the limiting mean-field system, yielding convergence to its stationary points. We illustrate the method on several numerical examples, including a model with quadratic confinement and interaction potentials, a model of interacting FitzHugh--Nagumo neurons, and a stochastic Kuramoto model.

preprint2022arXiv

Eigenfunction martingale estimating functions and filtered data for drift estimation of discretely observed multiscale diffusions

We propose a novel method for drift estimation of multiscale diffusion processes when a sequence of discrete observations is given. For the Langevin dynamics in a two-scale potential, our approach relies on the eigenvalues and the eigenfunctions of the homogenized dynamics. Our first estimator is derived from a martingale estimating function of the generator of the homogenized diffusion process. However, the unbiasedness of the estimator depends on the rate with which the observations are sampled. We therefore introduce a second estimator which relies also on filtering the data and we prove that it is asymptotically unbiased independently of the sampling rate. A series of numerical experiments illustrate the reliability and efficiency of our different estimators.

preprint2022arXiv

Geometric Methods for Sampling, Optimisation, Inference and Adaptive Agents

In this chapter, we identify fundamental geometric structures that underlie the problems of sampling, optimisation, inference and adaptive decision-making. Based on this identification, we derive algorithms that exploit these geometric structures to solve these problems efficiently. We show that a wide range of geometric theories emerge naturally in these fields, ranging from measure-preserving processes, information divergences, Poisson geometry, and geometric integration. Specifically, we explain how (i) leveraging the symplectic geometry of Hamiltonian systems enable us to construct (accelerated) sampling and optimisation methods, (ii) the theory of Hilbertian subspaces and Stein operators provides a general methodology to obtain robust estimators, (iii) preserving the information geometry of decision-making yields adaptive agents that perform active inference. Throughout, we emphasise the rich connections between these fields; e.g., inference draws on sampling and optimisation, and adaptive decision-making assesses decisions by inferring their counterfactual consequences. Our exposition provides a conceptual overview of underlying ideas, rather than a technical discussion, which can be found in the references herein.

preprint2020arXiv

Homogenization and hypocoercivity for Fokker-Planck equations driven by weakly compressible shear flows

We study the long-time dynamics of two-dimensional linear Fokker-Planck equations driven by a drift that can be decomposed in the sum of a large shear component and the gradient of a regular potential depending on one spatial variable. The problem can be interpreted as that of a passive scalar advected by a slightly compressible shear flow, and undergoing small diffusion. For the corresponding stochastic differential equation, we give explicit homogenization rates in terms of a family of time-scales depending on the parameter measuring the strength of the incompressible perturbation. This is achieved by exploiting an auxiliary Poisson problem, and by computing the related effective diffusion coefficients. Regarding the long-time behaviour of the solution of the Fokker-Planck equation, we provide explicit decay rates to the unique invariant measure by employing a quantitative version of the classical hypocoercivity scheme. From a fluid mechanics perspective, this turns out to be equivalent to quantifying the phenomenon of enhanced diffusion for slightly compressible shear flows.

preprint2020arXiv

Manifold Learning for Accelerating Coarse-Grained Optimization

Algorithms proposed for solving high-dimensional optimization problems with no derivative information frequently encounter the "curse of dimensionality," becoming ineffective as the dimension of the parameter space grows. One feature of a subclass of such problems that are effectively low-dimensional is that only a few parameters (or combinations thereof) are important for the optimization and must be explored in detail. Knowing these parameters/ combinations in advance would greatly simplify the problem and its solution. We propose the data-driven construction of an effective (coarse-grained, "trend") optimizer, based on data obtained from ensembles of brief simulation bursts with an "inner" optimization algorithm, that has the potential to accelerate the exploration of the parameter space. The trajectories of this "effective optimizer" quickly become attracted onto a slow manifold parameterized by the few relevant parameter combinations. We obtain the parameterization of this low-dimensional, effective optimization manifold on the fly using data mining/manifold learning techniques on the results of simulation (inner optimizer iteration) burst ensembles and exploit it locally to "jump" forward along this manifold. As a result, we can bias the exploration of the parameter space towards the few, important directions and, through this "wrapper algorithm," speed up the convergence of traditional optimization algorithms.

preprint2020arXiv

On stochastic mirror descent with interacting particles: convergence properties and variance reduction

An open problem in optimization with noisy information is the computation of an exact minimizer that is independent of the amount of noise. A standard practice in stochastic approximation algorithms is to use a decreasing step-size. This however leads to a slower convergence. A second alternative is to use a fixed step-size and run independent replicas of the algorithm and average these. A third option is to run replicas of the algorithm and allow them to interact. It is unclear which of these options works best. To address this question, we reduce the problem of the computation of an exact minimizer with noisy gradient information to the study of stochastic mirror descent with interacting particles. We study the convergence of stochastic mirror descent and make explicit the tradeoffs between communication and variance reduction. We provide theoretical and numerical evidence to suggest that interaction helps to improve convergence and reduce the variance of the estimate.

preprint2013arXiv

Numerical Methods for Computing Effective Transport Properties of Flashing Brownian Motors

We develop a numerical algorithm for computing the effective drift and diffusivity of the steady-state behavior of an overdamped particle driven by a periodic potential whose amplitude is modulated in time by multiplicative noise and forced by additive Gaussian noise (the mathematical structure of a flashing Brownian motor). The numerical algorithm is based on a spectral decomposition of the solution to the Fokker-Planck equation with periodic boundary conditions and the cell problem which result from homogenization theory. We also show that the numerical method of Wang, Peskin, Elston (WPE, 2003) for computing said quantities is equivalent to that resulting from homogenization theory. We show how to adapt the WPE numerical method to this problem by means of discretizing the multiplicative noise via a finite-volume method into a discrete-state Markov jump process which preserves many important properties of the original continuous-state process, such as its invariant distribution and detailed balance. Our numerical experiments show the effectiveness of both methods, and that the spectral method can have some efficiency advantages when treating multiplicative random noise, particularly with strong volatility.