Sanmitra Ghosh

dblp:175/5677 · DBLP profile ↗
← Back
5ranked-venue papers
4as first author
5since 2021 · last 2025
0000-0002-4879-7587ORCID · reported

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 4 · 3 first-author · 4 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Deep learning architectures and training · 33% Efficient and distributed learning · 33% Trustworthy machine learning · 17%

Topics — the 6 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Probabilistic and Bayesian machine learning › deep probabilistic models › bayesian deep learning
bayesian neural networks
0.912025
Light-Weight Diffusion Multiplier and Uncertainty Quantification for Fourier Neural Operators · NeurIPS 2025
Machine learning › Deep learning architectures and training › neural operator
fourier neural operator
0.912025
Light-Weight Diffusion Multiplier and Uncertainty Quantification for Fourier Neural Operators · NeurIPS 2025
Machine learning › Efficient and distributed learning
model compression
0.912025
Light-Weight Diffusion Multiplier and Uncertainty Quantification for Fourier Neural Operators · NeurIPS 2025
Machine learning › Deep learning architectures and training
neural operator
0.912025
Light-Weight Diffusion Multiplier and Uncertainty Quantification for Fourier Neural Operators · NeurIPS 2025
Machine learning › Efficient and distributed learning › model compression
parameter reduction
0.912025
Light-Weight Diffusion Multiplier and Uncertainty Quantification for Fourier Neural Operators · NeurIPS 2025
Machine learning › Trustworthy machine learning
uncertainty estimation
0.912025
Light-Weight Diffusion Multiplier and Uncertainty Quantification for Fourier Neural Operators · NeurIPS 2025

Methods — techniques the papers use, named apart from their topics

diffusion model · 0.9bayesian inference · 0.9
YearPublicationVenuePosition
2025 Light-Weight Diffusion Multiplier and Uncertainty Quantification for Fourier Neural Operators
abstract
Operator learning is a powerful paradigm for solving partial differential equations, with Fourier Neural Operators serving as a widely adopted foundation. However, FNOs face significant scalability challenges due to overparameterization and offer no native uncertainty quantification -- a key requirement for reliable scientific and engineering applications. Instead, neural operators rely on post hoc UQ methods that ignore geometric inductive biases. In this work, we introduce DINOZAUR: a diffusion-based neural operator parametrization with uncertainty quantification. Inspired by the structure of the heat kernel, DINOZAUR replaces the dense tensor multiplier in FNOs with a dimensionality-independent diffusion multiplier that has a single learnable time parameter per channel, drastically reducing parameter count and memory footprint without compromising predictive performance. By defining priors over those time parameters, we cast DINOZAUR as a Bayesian neural operator to yield spatially correlated outputs and calibrated uncertainty estimates. Our method achieves competitive or superior performance across several PDE benchmarks while providing efficient uncertainty quantification.
Albert Matveev, Sanmitra Ghosh, Aamal Hussain, James-Michael Leahy, Michalis Michaelides
NeurIPS2
2024 Sample-efficient neural likelihood-free Bayesian inference of implicit HMMs
abstract
Likelihood-free inference methods based on neural conditional density estimation were shown to drastically reduce the simulation burden in comparison to classical methods such as ABC. When applied in the context of any latent variable model, such as a Hidden Markov model (HMM), these methods are designed to only estimate the parameters, rather than the joint distribution of the parameters and the hidden states. Naive application of these methods to a HMM, ignoring the inference of this joint posterior distribution, will thus produce an inaccurate estimate of the posterior predictive distribution, in turn hampering the assessment of goodness-of-fit. To rectify this problem, we propose a novel, sample-efficient likelihood-free method for estimating the high-dimensional hidden states of an implicit HMM. Our approach relies on learning directly the intractable posterior distribution of the hidden states, using an autoregressive-flow, by exploiting the Markov property. Upon evaluating our approach on some implicit HMMs, we found that the quality of the estimates retrieved using our method is comparable to what can be achieved using a much more computationally expensive SMC algorithm.
Sanmitra Ghosh, Paul Birrell, Daniela De Angelis
AISTATS1
2023 An approximate diffusion process for environmental stochasticity in infectious disease transmission modelling
abstract
Modelling the transmission dynamics of an infectious disease is a complex task. Not only it is difficult to accurately model the inherent non-stationarity and heterogeneity of transmission, but it is nearly impossible to describe, mechanistically, changes in extrinsic environmental factors including public behaviour and seasonal fluctuations. An elegant approach to capturing environmental stochasticity is to model the force of infection as a stochastic process. However, inference in this context requires solving a computationally expensive "missing data" problem, using data-augmentation techniques. We propose to model the time-varying transmission-potential as an approximate diffusion process using a path-wise series expansion of Brownian motion. This approximation replaces the "missing data" imputation step with the inference of the expansion coefficients: a simpler and computationally cheaper task. We illustrate the merit of this approach through three examples: modelling influenza using a canonical SIR model, capturing seasonality using a SIRS model, and the modelling of COVID-19 pandemic using a multi-type SEIR model.
Sanmitra Ghosh, Paul Birrell, Daniela De Angelis
PLoS Comput. Biol.1
2022 Differentiable Bayesian inference of SDE parameters using a pathwise series expansion of Brownian motion
abstract
By invoking a pathwise series expansion of Brownian motion, we propose to approximate a stochastic differential equation (SDE) with an ordinary differential equation (ODE). This allows us to reformulate Bayesian inference for a SDE as the parameter estimation task for an ODE. Unlike a nonlinear SDE, the likelihood for an ODE model is tractable and its gradient can be obtained using adjoint sensitivity analysis. This reformulation allows us to use an efficient sampler, such as NUTS, that rely on the gradient of the log posterior. Applying the reparameterisation trick, variational inference can also be used for the same estimation task. We illustrate the proposed method on a variety of SDE models. We obtain similar parameter estimates when compared to data augmentation techniques.
Sanmitra Ghosh, Paul Birrell, Daniela De Angelis
AISTATS1
2021 Variational inference for nonlinear ordinary differential equations
abstract
We apply the reparameterisation trick to obtain a variational formulation of Bayesian inference in nonlinear ODE models. By invoking the linear noise approximation we also extend this variational formulation to a stochastic kinetic model. Our proposed inference method does not depend on any emulation of the ODE solution and only requires the extension of automatic differentiation to an ODE. We achieve this through a novel and holistic approach that uses both forward and adjoint sensitivity analysis techniques. Consequently, this approach can cater to both small and large ODE models efficiently. Upon benchmarking on some widely used mechanistic models, the proposed inference method produced a reliable approximation to the posterior distribution, with a significant reduction in execution time, in comparison to MCMC.
Sanmitra Ghosh, Paul Birrell, Daniela De Angelis
AISTATS1