← Search

Jean-Yves Franceschi

11 accepted papers

2026

Fused-Planes: Why Train a Thousand Tri-Planes When You Can Share?

ICLR 2026poster

Tri-Planar NeRFs enable the application of powerful 2D vision models for 3D tasks, by representing 3D objects using 2D planar structures. This has made them the prevailing choice to model large collections of 3D objects. However, training Tri-Planes to model such large collections is computationally…

Cited by 0SourcecodeScholar
2026

Position: Fairness Failure in Generative Models is an Evaluation Problem

ICML 2026poster

Despite groundbreaking advancements in generative models during the last decade, concerns about their lack of fairness, reinforcing societal inequalities and harming marginalized groups, remain under-addressed and difficult to act upon. This position paper argues that fairness failures in generative…

Cited by 0SourceScholar
2025

Bringing NeRFs to the Latent Space: Inverse Graphics Autoencoder

ICLR 2025poster

While pre-trained image autoencoders are increasingly utilized in computer vision, the application of inverse graphics in 2D latent spaces has been under-explored. Yet, besides reducing the training and rendering complexity, applying inverse graphics in the latent space enables a valuable interopera…

2025

Improving Consistency Models with Generator-Augmented Flows

ICML 2025spotlight

Consistency models imitate the multi-step sampling of score-based diffusion in a single forward pass of a neural network. They can be learned in two ways: consistency distillation and consistency training. The former relies on the true velocity field of the corresponding differential equation, appro…

2023

Continuous PDE Dynamics Forecasting with Implicit Neural Representations

ICLR 2023top-25%

Effective data-driven PDE forecasting methods often rely on fixed spatial and / or temporal discretizations. This raises limitations in real-world applications like weather prediction where flexible extrapolation at arbitrary spatiotemporal locations is required. We address this problem by introduci…

2023

Unifying GANs and Score-Based Diffusion as Generative Particle Models

NeurIPS 2023poster

Particle-based deep generative models, such as gradient flows and score-based diffusion models, have recently gained traction thanks to their striking performance. Their principle of displacing particle distributions using differential equations is conventionally seen as opposed to the previously wi…

2022

A Neural Tangent Kernel Perspective of GANs

ICML 2022spotlight

We propose a novel theoretical framework of analysis for Generative Adversarial Networks (GANs). We reveal a fundamental flaw of previous analyses which, by incorrectly modeling GANs’ training scheme, are subject to ill-defined discriminator gradients. We overcome this issue which impedes a principl…

2021

PDE-Driven Spatiotemporal Disentanglement

ICLR 2021poster

A recent line of work in the machine learning community addresses the problem of predicting high-dimensional spatiotemporal phenomena by leveraging specific tools from the differential equations theory. Following this direction, we propose in this article a novel and general paradigm for this task b…

2020

Stochastic Latent Residual Video Prediction

ICML 2020poster

Designing video prediction models that account for the inherent uncertainty of the future is challenging. Most works in the literature are based on stochastic image-autoregressive recurrent networks, which raises several performance and applicability issues. An alternative is to use fully latent tem…

2019

Unsupervised Scalable Representation Learning for Multivariate Time Series

NeurIPS 2019poster

Time series constitute a challenging data type for machine learning algorithms, due to their highly variable lengths and sparse labeling in practice. In this paper, we tackle this challenge by proposing an unsupervised method to learn universal embeddings of time series. Unlike previous works, it is…

2018

Robustness of classifiers to uniform $\ell_p$ and Gaussian noise

AISTATS 2018poster

We study the robustness of classifiers to various kinds of random noise models. In particular, we consider noise drawn uniformly from the $\ell_p$ ball for $p ∈[1, ∞]$ and Gaussian noise with an arbitrary covariance matrix. We characterize this robustness to random noise in terms of the distance to…

Cited by 0SourcePDFScholar