Théo Bourdais

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

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

Artificial intelligence and machine learning · 1 · 1 first-author · 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
1 paper
Efficient and distributed learning · 50% Kernel, tree and ensemble methods · 50%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Computational science and engineering · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Kernel, tree and ensemble methods
ensemble learning
0.912025
Minimal Variance Model Aggregation: A principled, non-intrusive, and versatile integration of black box models · ICLR 2025
Machine learning › Efficient and distributed learning › federated learning
model aggregation
0.912025
Minimal Variance Model Aggregation: A principled, non-intrusive, and versatile integration of black box models · ICLR 2025
Computational science and engineering
partial differential equations
0.312025
Minimal Variance Model Aggregation: A principled, non-intrusive, and versatile integration of black box models · ICLR 2025

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

minimal variance aggregation · 1.7error estimation · 1.7
YearPublicationVenuePosition
2025 Minimal Variance Model Aggregation: A principled, non-intrusive, and versatile integration of black box models
abstract
Whether deterministic or stochastic, models can be viewed as functions designed to approximate a specific quantity of interest. We introduce Minimal Empirical Variance Aggregation (MEVA), a data-driven framework that integrates predictions from various models, enhancing overall accuracy by leveraging the individual strengths of each. This non-intrusive, model-agnostic approach treats the contributing models as black boxes and accommodates outputs from diverse methodologies, including machine learning algorithms and traditional numerical solvers. We advocate for a point-wise linear aggregation process and consider two methods for optimizing this aggregate: Minimal Error Aggregation (MEA), which minimizes the prediction error, and Minimal Variance Aggregation (MVA), which focuses on reducing variance. We prove a theorem showing that MVA can be more robustly estimated from data than MEA, making MEVA superior to Minimal Empirical Error Aggregation (MEEA). Unlike MEEA, which interpolates target values directly, MEVA formulates aggregation as an error estimation problem, which can be performed using any backbone learning paradigm. We demonstrate the versatility and effectiveness of our framework across various applications, including data science and partial differential equations, illustrating its ability to significantly enhance both robustness and accuracy.
Théo Bourdais, Houman Owhadi
ICLR1