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

Adrien Cortés

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

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

Artificial intelligence and machine learning · 2 · 1 first-author · 2 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
2 papers
Kernel, tree and ensemble methods · 38% Time series and sequential data · 20% Generative modeling · 18%

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

TopicWeightPapersLastEvidence papers
Machine learning › Kernel, tree and ensemble methods › ensemble learning
multiple choice learning
1.622025
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 › 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
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 › Generative modeling
winner-takes-all
0.812024
Annealed Multiple Choice Learning: Overcoming limitations of Winner-takes-all with annealing · NeurIPS 2024
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

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

winner-takes-all loss · 0.9multiple choice learning · 0.9winner-takes-all · 0.8simulated annealing · 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
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
NeurIPS4