← Search

Søren Hauberg

34 accepted papers

2026

Contact Wasserstein Geodesics for Non-Conservative Schrödinger Bridges

ICLR 2026poster

The Schrödinger Bridge provides a principled framework for modeling stochastic processes between distributions; however, existing methods are limited by energy-conservation assumptions, which constrains the bridge's shape preventing it from model varying-energy phenomena. To overcome this, we introd…

Cited by 0SourceScholar
2026

The Spacetime of Diffusion Models: An Information Geometry Perspective

ICLR 2026oral

We present a novel geometric perspective on the latent space of diffusion models. We first show that the standard pullback approach, utilizing the deterministic probability flow ODE decoder, is fundamentally flawed. It provably forces geodesics to decode as straight segments in data space, effective…

Cited by 0SourcecodeScholar
2025

Bayes without Underfitting: Fully Correlated Deep Learning Posteriors via Alternating Projections

AISTATS 2025poster

Bayesian deep learning all too often underfits so that the Bayesian prediction is less accurate than a simple point estimate. Uncertainty quantification then comes at the cost of accuracy. For linearized models, the null space of the generalized Gauss-Newton matrix corresponds to parameters that pre…

Cited by 0SourcecodeScholar
2025

Connecting Neural Models Latent Geometries with Relative Geodesic Representations

NeurIPS 2025poster

Neural models learn representations of high-dimensional data on low-dimensional manifolds. Multiple factors, including stochasticities in the training process, model architectures, and additional inductive biases, may induce different representations, even when learning the same task on the same dat…

Cited by 0SourcecodeScholar
2025

Geometric Contact Flows: Contactomorphisms for Dynamics and Control

ICML 2025poster

Accurately modeling and predicting complex dynamical systems, particularly those involving force exchange and dissipation, is crucial for applications ranging from fluid dynamics to robotics, but presents significant challenges due to the intricate interplay of geometric constraints and energy trans…

Cited by 0SourcePDFScholar
2025

Identifying Metric Structures of Deep Latent Variable Models

ICML 2025poster

Deep latent variable models learn condensed representations of data that, hopefully, reflect the inner workings of the studied phenomena. Unfortunately, these latent representations are not statistically identifiable, meaning they cannot be uniquely determined. Domain experts, therefore, need to tre…

2025

Riemann$^2$: Learning Riemannian Submanifolds from Riemannian Data

AISTATS 2025poster

Latent variable models are powerful tools for learning low-dimensional manifolds from high-dimensional data. However, when dealing with constrained data such as unit-norm vectors or symmetric positive-definite matrices, existing approaches ignore the underlying geometric constraints or fail to provi…

Cited by 0SourceScholar
2025

VIKING: Deep variational inference with stochastic projections

NeurIPS 2025poster

Variational mean field approximations tend to struggle with contemporary overparametrized deep neural networks. Where a Bayesian treatment is usually associated with high-quality predictions and uncertainties, the practical reality has been the opposite, with unstable training, poor predictive power…

Cited by 0SourceScholar
2024

A survey and benchmark of high-dimensional Bayesian optimization of discrete sequences

NeurIPS 2024poster

Optimizing discrete black-box functions is key in several domains, e.g. protein engineering and drug design. Due to the lack of gradient information and the need for sample efficiency, Bayesian optimization is an ideal candidate for these tasks. Several methods for high-dimensional continuous and ca…

2024

Gradients of Functions of Large Matrices

NeurIPS 2024spotlight

Tuning scientific and probabilistic machine learning models - for example, partial differential equations, Gaussian processes, or Bayesian neural networks - often relies on evaluating functions of matrices whose size grows with the data set or the number of parameters. While the state-of-the-art for…

2024

Improving Adversarial Energy-Based Model via Diffusion Process

ICML 2024poster

Generative models have shown strong generation ability while efficient likelihood estimation is less explored. Energy-based models (EBMs) define a flexible energy function to parameterize unnormalized densities efficiently but are notorious for being difficult to train. Adversarial EBMs introduce a…

Cited by 5SourcePDFScholar
2024

Neural Contractive Dynamical Systems

ICLR 2024spotlight

Stability guarantees are crucial when ensuring that a fully autonomous robot does not take undesirable or potentially harmful actions. Unfortunately, global stability guarantees are hard to provide in dynamical systems learned from data, especially when the learned dynamics are governed by neural ne…

Cited by 10SourcePDFScholar
2024

Reparameterization invariance in approximate Bayesian inference

NeurIPS 2024spotlight

Current approximate posteriors in Bayesian neural networks (BNNs) exhibit a crucial limitation: they fail to maintain invariance under reparameterization, i.e. BNNs assign different posterior densities to different parametrizations of identical functions. This creates a fundamental flaw in the appli…

Cited by 4SourcePDFScholar
2024

Sketched Lanczos uncertainty score: a low-memory summary of the Fisher information

NeurIPS 2024poster

Current uncertainty quantification is memory and compute expensive, which hinders practical uptake. To counter, we develop Sketched Lanczos Uncertainty (SLU): an architecture-agnostic uncertainty score that can be applied to pre-trained neural networks with minimal overhead. Importantly, the memory…

Cited by 2SourcePDFScholar
2023

Bayesian Metric Learning for Uncertainty Quantification in Image Retrieval

NeurIPS 2023poster

We propose a Bayesian encoder for metric learning. Rather than relying on neural amortization as done in prior works, we learn a distribution over the network weights with the Laplace Approximation. We first prove that the contrastive loss is a negative log-likelihood on the spherical space. We prop…

2023

Learning to Taste: A Multimodal Wine Dataset

NeurIPS 2023poster

We present WineSensed, a large multimodal wine dataset for studying the relations between visual perception, language, and flavor. The dataset encompasses 897k images of wine labels and 824k reviews of wines curated from the Vivino platform. It has over 350k unique bottlings, annotated with year, re…

2023

On Masked Pre-training and the Marginal Likelihood

NeurIPS 2023poster

Masked pre-training removes random input dimensions and learns a model that can predict the missing values. Empirical results indicate that this intuitive form of self-supervised learning yields models that generalize very well to new domains. A theoretical understanding is, however, lacking. This p…

2023

Riemannian Laplace approximations for Bayesian neural networks

NeurIPS 2023poster

Bayesian neural networks often approximate the weight-posterior with a Gaussian distribution. However, practical posteriors are often, even locally, highly non-Gaussian, and empirical performance deteriorates. We propose a simple parametric approximate posterior that adapts to the shape of the true…

Cited by 13SourcePDFScholar
2022

Danish Airs and Grounds: A Dataset for Aerial-to-Street-Level Place Recognition and Localization

RA-L 2022

Place recognition and visual localization are particularly challenging in wide baseline configurations. In this letter, we contribute with the <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">Danish Airs and Grounds</i> (DAG) dataset, a large collecti

Cited by 12SourceScholar
2022

Laplacian Autoencoders for Learning Stochastic Representations

NeurIPS 2022accept

Established methods for unsupervised representation learning such as variational autoencoders produce none or poorly calibrated uncertainty estimates making it difficult to evaluate if learned representations are stable and reliable. In this work, we present a Bayesian autoencoder for unsupervised r…

2022

Probabilistic spatial transformer networks

UAI 2022poster

Spatial Transformer Networks (STNs) estimate image transformations that can improve downstream tasks by ‘zooming in’ on relevant regions in an image. However, STNs are hard to train and sensitive to mis-predictions of transformations. To circumvent these limitations, we propose a probabilistic exten…

2022

Revisiting Active Sets for Gaussian Process Decoders

NeurIPS 2022accept

Decoders built on Gaussian processes (GPs) are enticing due to the marginalisation over the non-linear function space. Such models (also known as GP-LVMs) are often expensive and notoriously difficult to train in practice, but can be scaled using variational inference and inducing points. In this pa…

2021

Bayesian Triplet Loss: Uncertainty Quantification in Image Retrieval

ICCV 2021poster

Uncertainty quantification in image retrieval is crucial for downstream decisions, yet it remains a challenging and largely unexplored problem. Current methods for estimating uncertainties are poorly calibrated, computationally expensive, or based on heuristics. We present a new method that views im…

Cited by 39PDFScholar
2021

Bounds all around: training energy-based models with bidirectional bounds

NeurIPS 2021poster

Energy-based models (EBMs) provide an elegant framework for density estimation, but they are notoriously difficult to train. Recent work has established links to generative adversarial networks, where the EBM is trained through a minimax game with a variational value function. We propose a bidirecti…

Cited by 19SourcePDFScholar
2021

Hierarchical VAEs Know What They Don’t Know

ICML 2021spotlight

Deep generative models have been demonstrated as state-of-the-art density estimators. Yet, recent work has found that they often assign a higher likelihood to data from outside the training distribution. This seemingly paradoxical behavior has caused concerns over the quality of the attained density…

2021

Learning Riemannian Manifolds for Geodesic Motion Skills

RSS 2021poster

For robots to work alongside humans and perform in unstructured environments; they must learn new motion skills and adapt them to unseen situations on the fly. This demands learning models that capture relevant motion patterns; while offering enough flexibility to adapt the encoded skills to new req…

Cited by 33SourcePDFScholar
2019

Explicit Disentanglement of Appearance and Perspective in Generative Models

NeurIPS 2019poster

Disentangled representation learning finds compact, independent and easy-to-interpret factors of the data. Learning such has been shown to require an inductive bias, which we explicitly encode in a generative model of images. Specifically, we propose a model with two latent spaces: one that represen…

2019

Probabilistic Riemannian submanifold learning with wrapped Gaussian process latent variable models

AISTATS 2019poster

Latent variable models (LVMs) learn probabilistic models of data manifolds lying in an ambient Euclidean space. In a number of applications, a priori known spatial constraints can shrink the ambient space into a considerably smaller manifold. Additionally, in these applications the Euclidean geomet…

Cited by 17SourcePDFScholar
2019

Reliable training and estimation of variance networks

NeurIPS 2019poster

We propose and investigate new complementary methodologies for estimating predictive variance networks in regression neural networks. We derive a locally aware mini-batching scheme that results in sparse robust gradients, and we show how to make unbiased weight updates to a variance network. Further…

2018

Latent Space Oddity: on the Curvature of Deep Generative Models

ICLR 2018poster

Deep generative models provide a systematic way to learn nonlinear data distributions through a set of latent variables and a nonlinear "generator" function that maps latent points into the input space. The nonlinearity of the generator implies that the latent space gives a distorted view of the inp…

Cited by 308SourcePDFScholar
2016

Dreaming More Data: Class-dependent Distributions over Diffeomorphisms for Learned Data Augmentation

AISTATS 2016poster

Data augmentation is a key element in training high-dimensional models. In this approach, one synthesizes new observations by applying pre-specified transformations to the original training data; e.g. new images are formed by rotating old ones. Current augmentation schemes, however, rely on ma…

Cited by 193SourcePDFScholar