Search Results for author: Grigorios A. Pavliotis

Found 7 papers, 3 papers with code

Neural parameter calibration and uncertainty quantification for epidemic forecasting

1 code implementation5 Dec 2023 Thomas Gaskin, Tim Conrad, Grigorios A. Pavliotis, Christof Schütte

The recent COVID-19 pandemic has thrown the importance of accurately forecasting contagion dynamics and learning infection parameters into sharp focus.

Uncertainty Quantification

Machine Learning for the identification of phase-transitions in interacting agent-based systems

no code implementations29 Oct 2023 Nikolaos Evangelou, Dimitrios G. Giovanis, George A. Kevrekidis, Grigorios A. Pavliotis, Ioannis G. Kevrekidis

Deriving closed-form, analytical expressions for reduced-order models, and judiciously choosing the closures leading to them, has long been the strategy of choice for studying phase- and noise-induced transitions for agent-based models (ABMs).

Numerical Integration

Inferring networks from time series: a neural approach

1 code implementation30 Mar 2023 Thomas Gaskin, Grigorios A. Pavliotis, Mark Girolami

Network structures underlie the dynamics of many complex phenomena, from gene regulation and foodwebs to power grids and social media.

regression Time Series +1

Neural parameter calibration for large-scale multi-agent models

1 code implementation27 Sep 2022 Thomas Gaskin, Grigorios A. Pavliotis, Mark Girolami

Computational models have become a powerful tool in the quantitative sciences to understand the behaviour of complex systems that evolve in time.

Epidemiology Time Series Analysis

Geometric Methods for Sampling, Optimisation, Inference and Adaptive Agents

no code implementations20 Mar 2022 Alessandro Barp, Lancelot Da Costa, Guilherme França, Karl Friston, Mark Girolami, Michael I. Jordan, Grigorios A. Pavliotis

In this chapter, we identify fundamental geometric structures that underlie the problems of sampling, optimisation, inference and adaptive decision-making.

counterfactual Decision Making

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

no code implementations15 Jul 2020 Anastasia Borovykh, Nikolas Kantas, Panos Parpas, Grigorios A. Pavliotis

A second alternative is to use a fixed step-size and run independent replicas of the algorithm and average these.

The sharp, the flat and the shallow: Can weakly interacting agents learn to escape bad minima?

no code implementations10 May 2019 Nikolas Kantas, Panos Parpas, Grigorios A. Pavliotis

As a first step towards understanding this question we formalize it as an optimization problem with weakly interacting agents.

BIG-bench Machine Learning

Cannot find the paper you are looking for? You can Submit a new open access paper.