GSGreig Smith

Greig Smith

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Greig Smith has a total of 3 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    An unbiased Ito type stochastic representation for transport PDEs: A Toy Example

    by Goncalo dos Reis, Greig Smith

    We propose a stochastic representation for a simple class of transport PDEs based on Ito representations. We detail an algorithm using an estimator stemming for the representation that, unlike regularization by noise estimators, is unbiased. We rely on recent developments on branching diffusions, regime switching processes and their representations of PDEs. There is a loose relation between our technique and regularization by noise, but contrary to the latter, we add a perturbation and immediately its correction. The method is only possible through a judicious choice of the diffusion coefficient $\sigma$. A key feature is that our approach does not rely on the smallness of $\sigma$, in fact, our $\sigma$ is strictly bounded from below which is in stark contrast with standard perturbation techniques. This is critical for extending this method to non-toy PDEs which have nonlinear terms in the first derivative where the usual perturbation technique breaks down. The examples presented show the algorithm outperforming alternative approaches. Moreover, the examples point toward a potential algorithm for the fully nonlinear case where the method of characteristics breaks down.

  • Open Access

    Importance sampling for McKean-Vlasov SDEs

    by Goncalo dos Reis, Greig Smith, Peter Tankov

    This paper deals with the Monte-Carlo methods for evaluating expectations of functionals of solutions to McKean-Vlasov Stochastic Differential Equations (MV-SDE) with drifts of super-linear growth. We assume that the MV-SDE is approximated in the standard manner by means of an interacting particle system and propose two importance sampling (IS) techniques to reduce the variance of the resulting Monte Carlo estimator. In the \emph{complete measure change} approach, the IS measure change is applied simultaneously in the coefficients and in the expectation to be evaluated. In the \emph{decoupling} approach we first estimate the law of the solution in a first set of simulations without measure change and then perform a second set of simulations under the importance sampling measure using the approximate solution law computed in the first step. For both approaches, we use large deviations techniques to identify an optimisation problem for the candidate measure change. The decoupling approach yields a far simpler optimisation problem than the complete measure change, however, we can reduce the complexity of the complete measure change through some symmetry arguments. We implement both algorithms for two examples coming from the Kuramoto model from statistical physics and show that the variance of the importance sampling schemes is up to 3 orders of magnitude smaller than that of the standard Monte Carlo. The computational cost is approximately the same as for standard Monte Carlo for the complete measure change and only increases by a factor of 2--3 for the decoupled approach. We also estimate the propagation of chaos error and find that this is dominated by the statistical error by one order of magnitude.

  • Hybrid PDE solver for data-driven problems and modern branching

    by Francisco Bernal, Gonçalo DOS Reis, Greig Smith

    The numerical solution of large-scale PDEs, such as those occurring in data-driven applications, unavoidably require powerful parallel computers and tailored parallel algorithms to make the best possible use of them. In fact, considerations about the parallelization and scalability of realistic problems are often critical enough to warrant acknowledgement in the modelling phase. The purpose of this paper is to spread awareness of the Probabilistic Domain Decomposition (PDD) method, a fresh approach to the parallelization of PDEs with excellent scalability properties. The idea exploits the stochastic representation of the PDE and its approximation via Monte Carlo in combination with deterministic high-performance PDE solvers. We describe the ingredients of PDD and its applicability in the scope of data science. In particular, we highlight recent advances in stochastic representations for non-linear PDEs using branching diffusions, which have significantly broadened the scope of PDD. We envision this work as a dictionary giving large-scale PDE practitioners references on the very latest algorithms and techniques of a non-standard, yet highly parallelizable, methodology at the interface of deterministic and probabilistic numerical methods. We close this work with an invitation to the fully non-linear case and open research questions.


  • Open Access

    Hybrid PDE solver for data-driven problems and modern branching

    by Francisco Bernal, Gonçalo dos Reis, Greig Smith

    The numerical solution of large-scale PDEs, such as those occurring in data-driven applications, unavoidably require powerful parallel computers and tailored parallel algorithms to make the best possible use of them. In fact, considerations about the parallelization and scalability of realistic problems are often critical enough to warrant acknowledgement in the modelling phase. The purpose of this paper is to spread awareness of the Probabilistic Domain Decomposition (PDD) method, a fresh approach to the parallelization of PDEs with excellent scalability properties. The idea exploits the stochastic representation of the PDE and its approximation via Monte Carlo in combination with deterministic high-performance PDE solvers. We describe the ingredients of PDD and its applicability in the scope of data science. In particular, we highlight recent advances in stochastic representations for nonlinear PDEs using branching diffusions, which have significantly broadened the scope of PDD. We envision this work as a dictionary giving large-scale PDE practitioners references on the very latest algorithms and techniques of a non-standard, yet highly parallelizable, methodology at the interface of deterministic and probabilistic numerical methods. We close this work with an invitation to the fully nonlinear case and open research questions.