Functional Diversity in Deep Ensembles via Wasserstein Representation Alignment

Deep ensembles (DE) are widely recognized for their robustness and improved uncertainty quantification in machine learning tasks. However, a persistent challenge lies in ensuring sufficient diversity among ensemble members: independently trained models often converge to similar solutions, limiting the ensemble’s overall effectiveness. In this work, we propose a novel Wasserstein regularization approach in function space. Specifically, we maximize pairwise Wasserstein or heuristic Gromov-Wasserstein (GW) distances between hidden layers’ representations of ensemble members. By interpreting these representations as empirical probability distributions, our method leverages the geometry of optimal transport to enforce functional diversity. Furthermore, we demonstrate that regularizing in function space—via distributional alignment using Wasserstein-based metrics—yields better diversity and generalization than approaches based on weight space alone. Empirical results on benchmark datasets demonstrate that our method outperforms standard DE and weight-space regularized variants in both predictive accuracy and uncertainty estimation. Code and experiments are available at: https://github.com/leotaku98/wass_de .

Authors

Institutions

Publication Details

Journal
ACM transactions on probabilistic machine learning.
Published
2026-02-09
DOI
https://doi.org/10.1145/3795796
Primary Topic
Generative Adversarial Networks and Image Synthesis
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Functional Diversity in Deep Ensembles via Wasserstein Representation Alignment

Junyu Xuan, Haowei Huang
ACM transactions on probabilistic machine learning.
Generative Adversarial Networks and Image Synthesis
article

Functional Diversity in Deep Ensembles via Wasserstein Representation Alignment

Junyu Xuan, Haowei Huang
article en

Abstract

Deep ensembles (DE) are widely recognized for their robustness and improved uncertainty quantification in machine learning tasks. However, a persistent challenge lies in ensuring sufficient diversity among ensemble members: independently trained models often converge to similar solutions, limiting the ensemble’s overall effectiveness. In this work, we propose a novel Wasserstein regularization approach in function space. Specifically, we maximize pairwise Wasserstein or heuristic Gromov-Wasserstein (GW) distances between hidden layers’ representations of ensemble members. By interpreting these representations as empirical probability distributions, our method leverages the geometry of optimal transport to enforce functional diversity. Furthermore, we demonstrate that regularizing in function space—via distributional alignment using Wasserstein-based metrics—yields better diversity and generalization than approaches based on weight space alone. Empirical results on benchmark datasets demonstrate that our method outperforms standard DE and weight-space regularized variants in both predictive accuracy and uncertainty estimation. Code and experiments are available at: https://github.com/leotaku98/wass_de .

ACM transactions on probabilistic machine learning.
University of Technology Sydney (AU), Australian Institute of Policy and Science (AU)
Openalex Percentile: Top 62%
Generative Adversarial Networks and Image Synthesis
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.