DUA-D2C: Dynamic Uncertainty Aware Method for Overfitting Remediation in Deep Learning
Not on the map. Why?
Abstract (arXiv)
Overfitting remains a significant challenge in deep learning, often arising from data outliers, noise, and limited training data. To address this, we previously proposed the Divide2Conquer (D2C) method, which partitions training data into multiple subsets and trains identical models independently on each. This strategy enables learning more consistent patterns while minimizing the influence of individual outliers and noise. D2C's standard aggregation typically treats all subset models equally or based on fixed heuristics (like data size), potentially underutilizing information about their varying generalization capabilities. Building upon this foundation, we introduce Dynamic Uncertainty-Aware Divide2Conquer (DUA-D2C), an advanced technique that refines the aggregation process. DUA-D2C dynamically weights the contributions of subset models based on their performance on a shared validation set, employing a novel composite score of accuracy and normalized prediction entropy. This intelligent aggregation allows the central model to preferentially learn from subsets yielding more generalizable and confident edge models, thereby more effectively combating overfitting. In this work, we provide a rigorous theoretical justification for this approach, analytically demonstrating how dynamic parameter fusion reduces model variance. Empirical evaluations on benchmark datasets spanning image, audio, and text domains demonstrate that DUA-D2C significantly improves generalization. Our analysis includes evaluations of decision boundaries, loss curves, and ablation studies, highlighting that DUA-D2C provides additive performance gains even when applied on top of standard regularizers like Dropout. This study establishes it as a theoretically grounded and effective approach to combating overfitting in deep learning. Our code is publicly available at: https://github.com/Saiful185/DUAD2C.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 19 of its 48 references that are in the map. First posted on arXiv 24 Nov 2024.
Builds on
19 of 48 references.
References · 19
- 2016Communication-Efficient Learning of Deep Networks from Decentralized Datacited by 7,592
- 2015Batch Normalization: Accelerating Deep Network Training by Reducing Internal Covariate Shiftcited by 6,979
- 2015Dropout as a Bayesian Approximation: Representing Model Uncertainty in Deep Learningcited by 4,416
- 2017Fashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning Algorithmscited by 4,283
- 2018Federated Optimization in Heterogeneous Networkscited by 2,971
- 2018Neural Tangent Kernel: Convergence and Generalization in Neural Networkscited by 2,597
- 2015Character-level Convolutional Networks for Text Classificationcited by 2,293
- 2022Model soups: averaging weights of multiple fine-tuned models improves accuracy without increasing inference timecited by 1,366
- 2018Averaging Weights Leads to Wider Optima and Better Generalizationcited by 1,194
- 2020Tackling the Objective Inconsistency Problem in Heterogeneous Federated Optimizationcited by 897
- 2015Federated Optimization:Distributed Optimization Beyond the Datacentercited by 193
- 2015Reducing Overfitting in Deep Networks by Decorrelating Representationscited by 94
7 more
- 2022Personalized Federated Learning via Variational Bayesian Inferencecited by 68
- 2018Learning Private Neural Language Modeling with Attentive Aggregationcited by 49
- 2018Understanding the Disharmony between Dropout and Batch Normalization by Variance Shiftcited by 36
- 2019The Theory Behind Overfitting, Cross Validation, Regularization, Bagging, and Boosting: Tutorialcited by 22
- 2020Sampling Algorithms, from Survey Sampling to Monte Carlo Methods: Tutorial and Literature Reviewcited by 8
- 2023Uncertainty Guided Ensemble Self-Training for Semi-Supervised Global Field Reconstructioncited by 2
- 2023PAC-Chernoff Bounds: Understanding Generalization in the Interpolation Regimecited by 2
Built on by
Not cited yet.