VLDB 2026 Research / reviewers in the wild / expert
Riccardo Barbano
dblp:270/8895
· DBLP profile ↗
5ranked-venue papers
2as first author
4since 2021 · last 2025
0000-0003-1863-2092ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 4 · 1 first-author · 3 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-authorApplied, 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
3 papers |
Probabilistic and Bayesian machine learning · 46% Generative modeling · 40% Trustworthy machine learning · 10% |
Topics — the 8 heaviest of 9, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Probabilistic and Bayesian machine learning › statistical inference › bayesian inference › approximate bayesian inference
linearized laplace approximation |
0.8 | 2 | 2023 | Adapting the Linearised Laplace Model Evidence for Modern Deep Learning · ICML 2022 Sampling-based inference for large linear models, with application to linearised Laplace · ICLR 2023 |
Machine learning › Generative modeling › diffusion model
conditional sampling |
0.8 | 1 | 2024 | DEFT: Efficient Fine-tuning of Diffusion Models by Learning the Generalised $h$-transform · NeurIPS 2024 |
Machine learning › Generative modeling
diffusion model |
0.8 | 1 | 2024 | DEFT: Efficient Fine-tuning of Diffusion Models by Learning the Generalised $h$-transform · NeurIPS 2024 |
Machine learning › Generative modeling › diffusion model
inverse problem solving |
0.8 | 1 | 2024 | DEFT: Efficient Fine-tuning of Diffusion Models by Learning the Generalised $h$-transform · NeurIPS 2024 |
Machine learning › Probabilistic and Bayesian machine learning › statistical inference
bayesian inference |
0.7 | 1 | 2023 | Sampling-based inference for large linear models, with application to linearised Laplace · ICLR 2023 |
Machine learning › Probabilistic and Bayesian machine learning › sampling
sampling-based inference |
0.7 | 1 | 2023 | Sampling-based inference for large linear models, with application to linearised Laplace · ICLR 2023 |
Machine learning › Probabilistic and Bayesian machine learning › deep probabilistic models
bayesian deep learning |
0.6 | 1 | 2022 | Adapting the Linearised Laplace Model Evidence for Modern Deep Learning · ICML 2022 |
Machine learning › Trustworthy machine learning
uncertainty estimation |
0.6 | 1 | 2022 | Adapting the Linearised Laplace Model Evidence for Modern Deep Learning · ICML 2022 |
Methods — techniques the papers use, named apart from their topics
fine-tuning · 0.8doob's h-transform · 0.8sampling-based inference · 0.7linearised laplace · 0.7stochastic approximation · 0.6normalisation layers · 0.6
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Steerable Conditional Diffusion for Out-of-Distribution Adaptation in Medical Image ReconstructionabstractDenoising diffusion models have emerged as the go-to generative framework for solving inverse problems in imaging. A critical concern regarding these models is their performance on out-of-distribution tasks, which remains an under-explored challenge. Using a diffusion model on an out-of-distribution dataset, realistic reconstructions can be generated, but with hallucinating image features that are uniquely present in the training dataset. To address this discrepancy and improve reconstruction accuracy, we introduce a novel test-time adaptation sampling framework called Steerable Conditional Diffusion. Specifically, this framework adapts the diffusion model, concurrently with image reconstruction, based solely on the information provided by the available measurement. Utilising the proposed method, we achieve substantial enhancements in out-of-distribution performance across diverse imaging modalities, advancing the robust deployment of denoising diffusion models in real-world applications. Riccardo Barbano, Alexander Denker, Hyungjin Chung, Tae-Hoon Roh, Simon R. Arridge, Peter Maass, Bangti Jin, Jong Chul Ye |
IEEE Trans. Medical Imaging | 1 |
| 2024 | DEFT: Efficient Fine-tuning of Diffusion Models by Learning the Generalised $h$-transformabstractGenerative modelling paradigms based on denoising diffusion processes have emerged as a leading candidate for conditional sampling in inverse problems.
In many real-world applications, we often have access to large, expensively trained unconditional diffusion models, which we aim to exploit for improving conditional sampling.
Most recent approaches are motivated heuristically and lack a unifying framework, obscuring connections between them. Further, they often suffer from issues such as being very sensitive to hyperparameters, being expensive to train or needing access to weights hidden behind a closed API. In this work, we unify conditional training and sampling using the mathematically well-understood Doob's h-transform. This new perspective allows us to unify many existing methods under a common umbrella. Under this framework, we propose DEFT (Doob's h-transform Efficient FineTuning), a new approach for conditional generation that simply fine-tunes a very small network to quickly learn the conditional $h$-transform, while keeping the larger unconditional network unchanged. DEFT is much faster than existing baselines while achieving state-of-the-art performance across a variety of linear and non-linear benchmarks. On image reconstruction tasks, we achieve speedups of up to 1.6$\times$, while having the best perceptual quality on natural images and reconstruction performance on medical images. Further, we also provide initial experiments on protein motif scaffolding and outperform reconstruction guidance methods. Alexander Denker, Francisco Vargas 0001, Shreyas Padhy, Kieran Didi, Simon V. Mathis, Riccardo Barbano, Vincent Dutordoir, Emile Mathieu, Urszula Julia Komorowska, Pietro Liò |
NeurIPS | 6 |
| 2023 | Sampling-based inference for large linear models, with application to linearised Laplace
Javier Antorán, Shreyas Padhy, Riccardo Barbano, Eric T. Nalisnick, David Janz, José Miguel Hernández-Lobato |
ICLR | 3 |
| 2022 | Adapting the Linearised Laplace Model Evidence for Modern Deep LearningabstractThe linearised Laplace method for estimating model uncertainty has received renewed attention in the Bayesian deep learning community. The method provides reliable error bars and admits a closed-form expression for the model evidence, allowing for scalable selection of model hyperparameters. In this work, we examine the assumptions behind this method, particularly in conjunction with model selection. We show that these interact poorly with some now-standard tools of deep learning–stochastic approximation methods and normalisation layers–and make recommendations for how to better adapt this classic method to the modern setting. We provide theoretical support for our recommendations and validate them empirically on MLPs, classic CNNs, residual networks with and without normalisation layers, generative autoencoders and transformers. Javier Antorán, David Janz, James Urquhart Allingham, Erik A. Daxberger, Riccardo Barbano, Eric T. Nalisnick, José Miguel Hernández-Lobato |
ICML | 5 |
| 2020 | Quantifying Model Uncertainty in Inverse Problems via Bayesian Deep Gradient DescentabstractRecent advances in reconstruction methods for inverse problems leverage powerful data-driven models, e.g., deep neural networks. These techniques have demonstrated state-of-the-art performances for several imaging tasks, but they often do not provide uncertainty on the obtained reconstruction. In this work, we develop a scalable, data-driven, knowledge-aided computational framework to quantify the model uncertainty via Bayesian neural networks. The approach builds on, and extends deep gradient descent, a recently developed greedy iterative training scheme, and recasts it within a probabilistic framework. Scalability is achieved by being hybrid in the architecture: only the last layer of each block is Bayesian, while the others remain deterministic, and by being greedy in training. The framework is showcased on one representative medical imaging modality, viz. computed tomography with either sparse view or limited view data, and exhibits competitive performance with respect to state-of-the-art benchmarks, e.g., total variation, deep gradient descent and learned primal-dual. Riccardo Barbano, Chen Zhang 0023, Simon R. Arridge, Bangti Jin |
ICPR | 1 |