← Search

David Berthelot

10 accepted papers

2026

STARFlow-V: End-to-End Video Generative Modeling with Autoregressive Normalizing Flows

CVPR 2026

Normalizing flows (NFs) are end-to-end likelihood-based generative models for continuous data, and have recently regained attention with encouraging progress on image generation. Yet in the video generation domain, where spatiotemporal complexity and computational cost are substantially higher, stat

Cited by 0SourcecodeScholar
2025

Mechanisms of Projective Composition of Diffusion Models

ICML 2025poster

We study the theoretical foundations of composition in diffusion models, with a particular focus on out-of-distribution extrapolation and length-generalization. Prior work has shown that composing distributions via linear score combination can achieve promising results, including length-generalizati…

Cited by 15SourcePDFScholar
2025

Normalizing Flows are Capable Generative Models

ICML 2025oral

Normalizing Flows (NFs) are likelihood-based models for continuous inputs. They have demonstrated promising results on both density estimation and generative modeling tasks, but have received relatively little attention in recent years. In this work, we demonstrate that NFs are more powerful than pr…

2025

STARFlow: Scaling Latent Normalizing Flows for High-resolution Image Synthesis

NeurIPS 2025spotlight

We present STARFlow, a scalable generative model based on normalizing flows that achieves strong performance on high-resolution image synthesis. STARFlow's main building block is Transformer Autoregressive Flow (TARFlow), which combines normalizing flows with Autoregressive Transformer architecture…

Cited by 0SourcecodeScholar
2025

TADA: Improved Diffusion Sampling with Training-free Augmented DynAmics

NeurIPS 2025poster

Diffusion models have demonstrated exceptional capabilities in generating high-fidelity images but typically suffer from inefficient sampling. Many solver designs and noise scheduling strategies have been proposed to dramatically improve sampling speeds. In this paper, we introduce a new sampling m…

Cited by 0SourcecodeScholar
2022

AdaMatch: A Unified Approach to Semi-Supervised Learning and Domain Adaptation

ICLR 2022poster

We extend semi-supervised learning to the problem of domain adaptation to learn significantly higher-accuracy models that train on one data distribution and test on a different one. With the goal of generality, we introduce AdaMatch, a unified solution for unsupervised domain adaptation (UDA), semi-…

2020

FixMatch: Simplifying Semi-Supervised Learning with Consistency and Confidence

NeurIPS 2020poster

Semi-supervised learning (SSL) provides an effective means of leveraging unlabeled data to improve a model’s performance. This domain has seen fast progress recently, at the cost of requiring more complex methods. In this paper we propose FixMatch, an algorithm that is a significant simplification o…

2020

ReMixMatch: Semi-Supervised Learning with Distribution Matching and Augmentation Anchoring

ICLR 2020poster

We improve the recently-proposed ``MixMatch semi-supervised learning algorithm by introducing two new techniques: distribution alignment and augmentation anchoring. - Distribution alignment encourages the marginal distribution of predictions on unlabeled data to be close to the marginal distribution…

Cited by 0SourcecodeScholar
2019

MixMatch: A Holistic Approach to Semi-Supervised Learning

NeurIPS 2019poster

Semi-supervised learning has proven to be a powerful paradigm for leveraging unlabeled data to mitigate the reliance on large labeled datasets. In this work, we unify the current dominant approaches for semi-supervised learning to produce a new algorithm, MixMatch, that guesses low-entropy labels fo…