mlsanityData to 7 Oct 2026

Beyond the Mean: Distribution-Aware Loss Functions for Bimodal Regression

arXiv 2603.22328 ↗First posted 20 Mar 2026cs.LG cs.AI stat.MLcited by 2

Not on the map. Why?

Abstract (arXiv)

Despite the strong predictive performance achieved by machine learning models across many application domains, assessing their trustworthiness through reliable estimates of predictive confidence remains a critical challenge. This issue arises in scenarios where the likelihood of error inferred from learned representations follows a bimodal distribution, resulting from the coexistence of confident and ambiguous predictions. Standard regression approaches often struggle to adequately express this predictive uncertainty, as they implicitly assume unimodal Gaussian noise, leading to mean-collapse behavior in such settings. Although Mixture Density Networks (MDNs) can represent different distributions, they suffer from severe optimization instability. We propose a family of distribution-aware loss functions integrating normalized RMSE with Wasserstein and Cram'er distances. When applied to standard deep regression models, our approach recovers bimodal distributions without the volatility of mixture models. Validated across four experimental stages, our results show that the proposed Wasserstein loss establishes a new Pareto efficiency frontier: matching the stability of standard regression losses like MSE in unimodal tasks while reducing Jensen-Shannon Divergence by 45% on complex bimodal datasets. Our framework strictly dominates MDNs in both fidelity and robustness, offering a reliable tool for aleatoric uncertainty estimation in trustworthy AI systems.

Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 15 of its 43 references that are in the map. First posted on arXiv 20 Mar 2026.

Builds on

15 of 43 references.

References · 15

  1. 2014Adam: A Method for Stochastic Optimizationcited by 36,960
  2. 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,160
  3. 2019EfficientNet: Rethinking Model Scaling for Convolutional Neural Networkscited by 6,415
  4. 2015Dropout as a Bayesian Approximation: Representing Model Uncertainty in Deep Learningcited by 4,416
  5. 2017Fashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning Algorithmscited by 4,283
  6. 2016Simple and Scalable Predictive Uncertainty Estimation using Deep Ensemblescited by 3,888
  7. 2017What Uncertainties Do We Need in Bayesian Deep Learning for Computer Vision?cited by 2,335
  8. 2018An Empirical Study of Example Forgetting during Deep Neural Network Learningcited by 669
  9. 2019On The Power of Curriculum Learning in Training Deep Networkscited by 285
  10. 2015Learning with a Wasserstein Losscited by 194
  11. 2021Delving into Deep Imbalanced Regressioncited by 157
  12. 2021Deep Learning Through the Lens of Example Difficultycited by 139
3 more
  1. 2017The Cramer Distance as a Solution to Biased Wasserstein Gradientscited by 116
  2. 2019Overcoming Limitations of Mixture Density Networks: A Sampling and Fitting Framework for Multimodal Future Predictioncited by 96
  3. 2022Balanced MSE for Imbalanced Visual Regressioncited by 89

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 2.

2 papers.