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.
arXiv:2506. 14126v2 Announce Type: replace-cross Abstract: Modern deep learning is increasingly characterized by the use of open-weight foundation models that can be fine-tuned on specialized datasets.
arXiv:2410.21582v4 Announce Type: replace-cross Abstract: Large-scale pretrained models are widely leveraged as foundations for learning new specialized tasks via fine-tuning, with the goal of mainta...
arXiv:2606. 01746v1 Announce Type: cross Abstract: Modern neural networks are highly susceptible to adversarial perturbations.
arXiv:2606. 16050v1 Announce Type: cross Abstract: Robust deep learning under heavy-tailed and impulsive noise remains challenging because conventional losses such as mean squared error (MSE) exhibit unbounded sensitivity to outliers.
arXiv:2506.17874v3 Announce Type: replace-cross Abstract: In many real-world applications, ensuring the robustness and stability of deep neural networks (DNNs) is crucial, particularly for image clas...
The paper introduces a concept-guided poisoning unlearning framework that explicitly identifies semantic concepts most strongly linked to a target class or knowledge. For image classification, it uses a Post-hoc Concept Bottleneck Model to locate relevant image regions and creates poisoned samples; for large language models, it aggregates Integrated Gradients over multiple question responses to mask important content and generate poisoned training targets. Experiments across several datasets demonstrate effective unlearning while largely preserving model utility.
Learning-State-Aware Dynamic Generative Data Augmentation on Small-Scale Datasets proposes LSADA, a method that constructs a learning state for each sample based on its loss and loss‑decrease rate to determine a sample‑specific augmentation strength. LSADA also introduces a decoupled data augmentation and diffusion fusion strategy that applies strength‑controlled transformations to class‑relevant regions while generating diverse class‑irrelevant regions, progressively fusing them to enhance image diversity while preserving class semantics. Experiments on nine public datasets demonstrate that LSADA outperforms the current state‑of‑the‑art dynamic GDA method by an average of 4.5% on six natural image datasets and 2.5% on three medical image datasets.
arXiv:2607. 10391v1 Announce Type: cross Abstract: Despite exposing rich intermediate representations, Vision Transformers (ViTs) are almost exclusively utilized as black-box feature extractors, where only the last layer is considered for downstream tasks.
CORE-STACK+ is a new meta‑learning framework for deep stacked generalization that tackles two key problems in heterogeneous vision ensembles: prediction‑space multicollinearity and calibration collapse. It introduces a four‑step preconditioning pipeline—kernelized redundancy filtering, a lightweight differentiable meta‑feature gate, a spectrum‑adaptive ridge penalty, and a Laplace‑approximate Bayesian blender—to jointly improve conditioning and calibration. Across six vision benchmarks, CORE‑STACK+ boosts accuracy, reduces model count and inference cost, and significantly lowers expected calibration error compared to existing methods.
arXiv:2608. 09768v1 Announce Type: new Abstract: A prediction that is both confident and wrong is a critical reliability failure because it can bypass abstention and human review precisely when the model is mistaken.
arXiv:2505.07675v3 Announce Type: replace-cross Abstract: Semi-supervised learning (SSL) has emerged as a practical solution for addressing data scarcity challenges by leveraging unlabeled data. Rece...
The paper introduces Conflict‑Aware Evidential Deep Learning (C‑EDL), a lightweight post‑hoc method that improves uncertainty quantification for deep learning models. C‑EDL applies diverse, task‑preserving transformations to each input and uses representational disagreement to adjust predictions, thereby reducing overconfident errors on adversarial and out‑of‑distribution data. Experiments demonstrate that C‑EDL outperforms existing Evidential Deep Learning variants and baselines, achieving up to 55 % reduction in coverage for OOD data and 90 % for adversarial data across multiple datasets and attack types.