arXiv Machine Learning

Beyond Homoscedasticity: Decoupled Uncertainty Optimization for Deep Imbalanced Regression

The paper introduces DUO, a framework for Deep Imbalanced Regression that models each prediction as a conditional Gaussian to capture instance‑level uncertainty. By decoupling mean and variance optimization, DUO enhances learning signals for tail samples and mitigates gradient coupling that hampers hard examples. A distribution‑guided contrastive learning component further refines feature representations, leading to state‑of‑the‑art performance on several visual and biological regression benchmarks.

arXiv Machine Learning
Sep 1

Prediction-Powered Conditional Inference

arXiv:2603.05575v2 Announce Type: replace-cross Abstract: We study prediction-powered conditional inference in the setting where labeled data are scarce, unlabeled covariates are abundant, and a blac...

By Yang Sui, Jin Zhou, Hua Zhou, Xiaowu Dai
arXiv AI
Sep 10

DUA-D2C: Dynamic Uncertainty Aware Method for Overfitting Remediation in Deep Learning

The paper introduces DUA-D2C, a Dynamic Uncertainty-Aware Divide2Conquer method that improves overfitting remediation in deep learning. It refines the traditional Divide2Conquer approach by dynamically weighting subset models based on a composite score of accuracy and normalized prediction entropy, allowing the central model to learn more from generalizable and confident edge models. The authors provide theoretical justification, show reduced model variance, and demonstrate significant generalization gains across image, audio, and text benchmarks, even when combined with standard regularizers like Dropout.

By Md. Saiful Bari Siddiqui, Md Mohaiminul Islam, Md. Golam Rabiul Alam
arXiv Machine Learning
Jun 26

Learning from a Biased Sample

arXiv:2209. 01754v5 Announce Type: replace-cross Abstract: The empirical risk minimization approach to data-driven decision making requires access to training data drawn under the same conditions as those that will be faced when the decision rule is deployed.

By Roshni Sahoo, Lihua Lei, Stefan Wager
arXiv AI
Sep 10

Deep Barycentric Regression for Optimal Transport Map Estimation and its Statistical Optimality

The paper introduces BROT, a two‑step approach for estimating optimal transport maps. First, it computes the unregularized OT plan, then fits a deep neural network to the resulting barycentric targets using least‑squares regression. The authors prove that, under standard regularity conditions, BROT achieves the minimax convergence rate when the true OT map is Lipschitz, and demonstrate its effectiveness on synthetic data, images, and downstream tasks such as single‑cell perturbation prediction and unsupervised domain adaptation.

By Kunwoong Kim, Insung Kong, Yongdai Kim