Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Renato Berlinghieri

dblp:319/7080 · DBLP profile ↗
← Back
4ranked-venue papers
1as first author
4since 2021 · last 2025
—ORCID · unresolved

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

Artificial intelligence and machine learning · 4 · 1 first-author · 4 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 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
Generative modeling · 48% Trustworthy machine learning · 36% Probabilistic and Bayesian machine learning · 8%
Interdisciplinary, comprehensive, and emerging computing
2 papers
Computational science and engineering · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Trustworthy machine learning
uncertainty estimation
0.912025
Smooth Sailing: Lipschitz-Driven Uncertainty Quantification for Spatial Associations · NeurIPS 2025
Computational science and engineering
spatial statistics
0.912025
Smooth Sailing: Lipschitz-Driven Uncertainty Quantification for Spatial Associations · NeurIPS 2025
Machine learning › Generative modeling
diffusion model
0.612022
Subspace Diffusion Generative Models · ECCV (23) 2022
Machine learning › Generative modeling › diffusion model › efficient diffusion model
subspace diffusion model
0.612022
Subspace Diffusion Generative Models · ECCV (23) 2022
Machine learning › Probabilistic and Bayesian machine learning › stochastic processes
gaussian process
0.212023
Gaussian processes at the Helm(holtz): A more fluid model for ocean currents · ICML 2023

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

lipschitz smoothness · 1.7gaussian error model · 1.7helmholtz decomposition · 1.3gaussian process · 1.3
YearPublicationVenuePosition
2025 Multi-marginal Schrödinger Bridges with Iterative Reference Refinement
abstract
Practitioners often aim to infer an unobserved population trajectory using sample snapshots at multiple time points. E.g. given single-cell sequencing data, scientists would like to learn how gene expression changes over a cell’s life cycle. But sequencing any cell destroys that cell. So we can access data for any particular cell only at a single time point, but we have data across many cells. The deep learning community has recently explored using Schr{ö}dinger bridges (SBs) and their extensions in similar settings. However, existing methods either (1) interpolate between just two time points or (2) require a single fixed reference dynamic (often set to Brownian motion within SB). But learning piecewise from adjacent time points can fail to capture long-term dependencies. And practitioners are typically able to specify a model class for the reference dynamic but not the exact values of the parameters within it. So we propose a new method that (1) learns the unobserved trajectories from sample snapshots across multiple time points and (2) requires specification only of a class of reference dynamics, not a single fixed one. We demonstrate the advantages of our method on simulated and real data.
Yunyi Shen, Renato Berlinghieri, Tamara Broderick
AISTATS2
2025 Smooth Sailing: Lipschitz-Driven Uncertainty Quantification for Spatial Associations
abstract
Estimating associations between spatial covariates and responses — rather than merely predicting responses — is central to environmental science, epidemiology, and economics. For instance, public health officials might be interested in whether air pollution has a strictly positive association with a health outcome, and the magnitude of any effect. Standard machine learning methods often provide accurate predictions but offer limited insight into covariate-response relationships. And we show that existing methods for constructing confidence (or credible) intervals for associations can fail to provide nominal coverage in the face of model misspecification and nonrandom locations — despite both being essentially always present in spatial problems. We introduce a method that constructs valid frequentist confidence intervals for associations in spatial settings. Our method requires minimal assumptions beyond a form of spatial smoothness and a homoskedastic Gaussian error assumption. In particular, we do not require model correctness or covariate overlap between training and target locations. Our approach is the first to guarantee nominal coverage in this setting and outperforms existing techniques in both real and simulated experiments. Our confidence intervals are valid in finite samples when the noise of the Gaussian error is known, and we provide an asymptotically consistent estimation procedure for this noise variance when it is unknown.
David R. Burt, Renato Berlinghieri, Stephen Bates, Tamara Broderick
NeurIPS2
2023 Gaussian processes at the Helm(holtz): A more fluid model for ocean currents
abstract
Oceanographers are interested in predicting ocean currents and identifying divergences in a current vector field based on sparse observations of buoy velocities. Since we expect current dynamics to be smooth but highly non-linear, Gaussian processes (GPs) offer an attractive model. But we show that applying a GP with a standard stationary kernel directly to buoy data can struggle at both current prediction and divergence identification – due to some physically unrealistic prior assumptions. To better reflect known physical properties of currents, we propose to instead put a standard stationary kernel on the divergence and curl-free components of a vector field obtained through a Helmholtz decomposition. We show that, because this decomposition relates to the original vector field just via mixed partial derivatives, we can still perform inference given the original data with only a small constant multiple of additional computational expense. We illustrate the benefits of our method on synthetic and real oceans data.
Renato Berlinghieri, Brian L. Trippe, David R. Burt, Ryan Giordano, Kaushik Srinivasan, Tamay M. Özgökmen, Junfei Xia, Tamara Broderick
ICML1
2022 Subspace Diffusion Generative Models
Bowen Jing 0002, Gabriele Corso, Renato Berlinghieri, Tommi S. Jaakkola
ECCV (23)3