← Search

Pierre Glaser

7 accepted papers

2026

(De)-regularized Maximum Mean Discrepancy Gradient Flow

ICML 2026poster

We introduce a (de)-regularization of the Maximum Mean Discrepancy (DrMMD) and its Wasserstein gradient flow. Existing gradient flows that transport samples from source distribution to target distribution with only target samples, either lack tractable numerical implementation ($f$-divergence flows)…

Cited by 0SourcecodeScholar
2025

Efficiently Vectorized MCMC on Modern Accelerators

ICML 2025spotlight

With the advent of automatic vectorization tools (e.g., JAX's vmap), writing multi-chain MCMC algorithms is often now as simple as invoking those tools on single-chain code. Whilst convenient, for various MCMC algorithms this results in a synchronization problem---loosely speaking, at each iteration…

2025

SIMPL: Scalable and hassle-free optimisation of neural representations from behaviour

ICLR 2025poster

Neural activity in the brain is known to encode low-dimensional, time-evolving, behaviour-related variables. A long-standing goal of neural data analysis has been to identify these variables and their mapping to neural activity. A productive and canonical approach has been to simply visualise neural…

Cited by 0SourcePDFScholar
2024

Kernel-Based Evaluation of Conditional Biological Sequence Models

ICML 2024poster

We propose a set of kernel-based tools to evaluate the designs and tune the hyperparameters of conditional sequence models, with a focus on problems in computational biology. The backbone of our tools is a new measure of discrepancy between the true conditional distribution and the model's estimate,…

Cited by 1SourcePDFScholar
2023

Fast and scalable score-based kernel calibration tests

UAI 2023poster

We introduce the Kernel Calibration Conditional Stein Discrepancy test (KCCSD test), a nonparametric, kernel-based test for assessing the calibration of probabilistic models with well-defined scores. In contrast to previous methods, our test avoids the need for possibly expensive expectation approxi…

2021

KALE Flow: A Relaxed KL Gradient Flow for Probabilities with Disjoint Support

NeurIPS 2021poster

We study the gradient flow for a relaxed approximation to the Kullback-Leibler (KL) divergence between a moving source and a fixed target distribution. This approximation, termed the KALE (KL approximate lower-bound estimator), solves a regularized version of the Fenchel dual problem defining the KL…