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

Victor Letzelter

dblp:360/0588 · DBLP profile ↗
← Back
6ranked-venue papers
2as first author
6since 2021 · last 2025
—ORCID · none

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

Artificial intelligence and machine learning · 6 · 2 first-author · 6 since 2021Systems, architecture and hardware · 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
6 papers
Kernel, tree and ensemble methods · 28% Generative modeling · 13% Probabilistic and Bayesian machine learning · 12%
Computer graphics and multimedia
1 paper
Audio and music processing · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Kernel, tree and ensemble methods › ensemble learning
multiple choice learning
3.242025
Annealed Winner-Takes-All for Motion Forecasting · ICRA 2025
Winner-takes-all for Multivariate Probabilistic Time Series Forecasting · ICML 2025
Annealed Multiple Choice Learning: Overcoming limitations of Winner-takes-all with annealing · NeurIPS 2024
Machine learning › Generative modeling
winner-takes-all
1.522024
Annealed Multiple Choice Learning: Overcoming limitations of Winner-takes-all with annealing · NeurIPS 2024
Winner-takes-all learners are geometry-aware conditional density estimators · ICML 2024
Machine learning › Probabilistic and Bayesian machine learning › statistical inference › density estimation
conditional density estimation
1.422024
Winner-takes-all learners are geometry-aware conditional density estimators · ICML 2024
Resilient Multiple Choice Learning: A learned scoring scheme with application to audio scene analysis · NeurIPS 2023
Machine learning › Time series and sequential data › time series analysis › time series forecasting
multivariate time series forecasting
0.912025
Winner-takes-all for Multivariate Probabilistic Time Series Forecasting · ICML 2025
Robotics › Autonomous driving
trajectory prediction
0.912025
Annealed Winner-Takes-All for Motion Forecasting · ICRA 2025
Computer vision › 3D vision
3d human pose estimation
0.812024
ManiPose: Manifold-Constrained Multi-Hypothesis 3D Human Pose Estimation · NeurIPS 2024
Computer vision › Face, body and person analysis
human pose estimation
0.812024
ManiPose: Manifold-Constrained Multi-Hypothesis 3D Human Pose Estimation · NeurIPS 2024
Machine learning › Optimization for machine learning › black-box optimization › zeroth-order optimization
simulated annealing
0.812024
Annealed Multiple Choice Learning: Overcoming limitations of Winner-takes-all with annealing · NeurIPS 2024
Machine learning › Trustworthy machine learning
uncertainty estimation
0.812024
Winner-takes-all learners are geometry-aware conditional density estimators · ICML 2024
Machine learning › Deep learning architectures and training
training objective
0.312025
Annealed Winner-Takes-All for Motion Forecasting · ICRA 2025
Natural language and speech › Speech recognition and synthesis
speech separation
0.212024
Annealed Multiple Choice Learning: Overcoming limitations of Winner-takes-all with annealing · NeurIPS 2024
Audio and music processing
sound source localization
0.212023
Resilient Multiple Choice Learning: A learned scoring scheme with application to audio scene analysis · NeurIPS 2023

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

winner-takes-all loss · 2.2multiple choice learning · 1.7voronoi tessellation · 1.3annealed winner-takes-all loss · 0.9winner-takes-all training · 0.8winner-takes-all · 0.8simulated annealing · 0.8regression · 0.8manifold learning · 0.8centroidal voronoi tessellation · 0.8
YearPublicationVenuePosition
2025 Winner-takes-all for Multivariate Probabilistic Time Series Forecasting
abstract
We introduce $\texttt{TimeMCL}$, a method leveraging the Multiple Choice Learning (MCL) paradigm to forecast multiple plausible time series futures. Our approach employs a neural network with multiple heads and utilizes the Winner-Takes-All (WTA) loss to promote diversity among predictions. MCL has recently gained attention due to its simplicity and ability to address ill-posed and ambiguous tasks. We propose an adaptation of this framework for time-series forecasting, presenting it as an efficient method to predict diverse futures, which we relate to its implicit quantization objective. We provide insights into our approach using synthetic data and evaluate it on real-world time series, demonstrating its promising performance at a light computational cost.
Adrien Cortés, Rémi Rehm, Victor Letzelter
ICML3
2025 Annealed Winner-Takes-All for Motion Forecasting
abstract
In autonomous driving, motion prediction aims at forecasting the future trajectories of nearby agents, helping the ego vehicle to anticipate behaviors and drive safely. A key challenge is generating a diverse set of future predictions, commonly addressed using data-driven models with Multiple Choice Learning (MCL) architectures and Winner-Takes-All (WTA) training objectives. However, these methods face initialization sensitivity and training instabilities. Additionally, to compensate for limited performance, some approaches rely on training with a large set of hypotheses, requiring a post-selection step during inference to significantly reduce the number of predictions. To tackle these issues, we take inspiration from annealed MCL, a recently introduced technique that improves the convergence properties of MCL methods through an annealed Winner-Takes-All loss (aWTA). In this paper, we demonstrate how the aWTA loss can be integrated with state-of-the-art motion forecasting models to enhance their performance using only a minimal set of hypotheses, eliminating the need for the cumbersome post-selection step. Our approach can be easily incorporated into any trajectory prediction model normally trained using WTA and yields significant improvements. To facilitate the application of our approach to future motion forecasting models, the code is made publicly available: https://github.com/valeoai/MF_aWTA.
Victor Letzelter, Mickaël Chen, Eloi Zablocki, Matthieu Cord
ICRA2
2024 Winner-takes-all learners are geometry-aware conditional density estimators
abstract
Winner-takes-all training is a simple learning paradigm, which handles ambiguous tasks by predicting a set of plausible hypotheses. Recently, a connection was established between Winner-takes-all training and centroidal Voronoi tessellations, showing that, once trained, hypotheses should quantize optimally the shape of the conditional distribution to predict. However, the best use of these hypotheses for uncertainty quantification is still an open question. In this work, we show how to leverage the appealing geometric properties of the Winner-takes-all learners for conditional density estimation, without modifying its original training scheme. We theoretically establish the advantages of our novel estimator both in terms of quantization and density estimation, and we demonstrate its competitiveness on synthetic and real-world datasets, including audio data.
Victor Letzelter, David Perera, Cédric Rommel, Mathieu Fontaine 0002, Slim Essid, Gaël Richard, Patrick Pérez
ICML1
2024 Annealed Multiple Choice Learning: Overcoming limitations of Winner-takes-all with annealing
abstract
We introduce Annealed Multiple Choice Learning (aMCL) which combines simulated annealing with MCL. MCL is a learning framework handling ambiguous tasks by predicting a small set of plausible hypotheses. These hypotheses are trained using the Winner-takes-all (WTA) scheme, which promotes the diversity of the predictions. However, this scheme may converge toward an arbitrarily suboptimal local minimum, due to the greedy nature of WTA. We overcome this limitation using annealing, which enhances the exploration of the hypothesis space during training. We leverage insights from statistical physics and information theory to provide a detailed description of the model training trajectory. Additionally, we validate our algorithm by extensive experiments on synthetic datasets, on the standard UCI benchmark, and on speech separation.
David Perera, Victor Letzelter, Théo Mariotte, Adrien Cortés, Mickaël Chen, Slim Essid, Gaël Richard
NeurIPS2
2024 ManiPose: Manifold-Constrained Multi-Hypothesis 3D Human Pose Estimation
abstract
We propose ManiPose, a manifold-constrained multi-hypothesis model for human-pose 2D-to-3D lifting. We provide theoretical and empirical evidence that, due to the depth ambiguity inherent to monocular 3D human pose estimation, traditional regression models suffer from pose-topology consistency issues, which standard evaluation metrics (MPJPE, P-MPJPE and PCK) fail to assess. ManiPose addresses depth ambiguity by proposing multiple candidate 3D poses for each 2D input, each with its estimated plausibility. Unlike previous multi-hypothesis approaches, ManiPose forgoes generative models, greatly facilitating its training and usage. By constraining the outputs to lie on the human pose manifold, ManiPose guarantees the consistency of all hypothetical poses, in contrast to previous works. We showcase the performance of ManiPose on real-world datasets, where it outperforms state-of-the-art models in pose consistency by a large margin while being very competitive on the MPJPE metric.
Cédric Rommel, Victor Letzelter, Nermin Samet, Renaud Marlet, Matthieu Cord, Patrick Pérez, Eduardo Valle
NeurIPS2
2023 Resilient Multiple Choice Learning: A learned scoring scheme with application to audio scene analysis
abstract
We introduce Resilient Multiple Choice Learning (rMCL), an extension of the MCL approach for conditional distribution estimation in regression settings where multiple targets may be sampled for each training input. Multiple Choice Learning is a simple framework to tackle multimodal density estimation, using the Winner-Takes-All (WTA) loss for a set of hypotheses. In regression settings, the existing MCL variants focus on merging the hypotheses, thereby eventually sacrificing the diversity of the predictions. In contrast, our method relies on a novel learned scoring scheme underpinned by a mathematical framework based on Voronoi tessellations of the output space, from which we can derive a probabilistic interpretation. After empirically validating rMCL with experiments on synthetic data, we further assess its merits on the sound source localization problem, demonstrating its practical usefulness and the relevance of its interpretation.
Victor Letzelter, Mathieu Fontaine 0002, Mickaël Chen, Patrick Pérez, Slim Essid, Gaël Richard
NeurIPS1