Aug 2026· Proceedings of the 32nd ACM SIGKDD Conference on Knowledge Discovery and Data Mining V.2· pp. 2413-2424· 0 citations· 2 references
Abstract
Modern neural networks are often miscalibrated, assigning high confidence to predictions they have not learned stably, which leads to overconfident errors under noise, imbalance, and distribution shift. We propose Forgetting-Aware Learning (FAL) using a simple ranking regularizer that leverages forgetting events during training as a temporal signal of epistemic uncertainty. The proposed regularizer penalizes high confidence on volatile samples, enforcing an isotonic relationship between confidence and learning stability and thereby reducing the mass of high-confidence mistakes that dominate calibration error. We show that FAL provides complementary benefits to Confidence-Aware Learning (CAL) using temporal instability as a regularization signal yielding a more self-aware model. Empirically, FAL improves calibration and confidence ranking while preserving accuracy. We also show that combining FAL and CAL with focal loss yields the strongest calibration in our study, significantly outperforming cross-entropy-based counterparts in the expected calibration error (ECE). We validate these findings across five popular image benchmark datasets, (with additional results on tabular data reported in the appendix), demonstrating that confidence should be earned by stable learning.
CONfession-to-Forget-Set (CONFS), a data-blind framework that constructs model-aligned forget sets by eliciting and formalizing the model's memorized knowledge, approaches Gold-standard performance on several metrics and achieves a competitive forgetting-utility balance, while preserving utility better than other data-...
Miso Kim, Georu Lee, Seungwon Jeong et al.· 0 citations
Existing semi-supervised learning (SSL) methods rely predominantly on pseudo-labeling and consistency regularization to leverage unlabeled data, demonstrating significant performance improvements. However, we pinpoint that these methods suffer from a confidence-for-weighting issue, overvaluing high-confidence pseudo-la...
Anyang Tong, Zenglin Shi, Zhun Zhong et al.· IEEE Transactions on Image P...· 0 citations
Fast Evidential Rule Learning (FERL) is introduced, a method that learns interpretable, accurate fuzzy rule models whose outputs are evidential, and is Lipschitz stable, which means that its evidential outputs vary smoothly with the input.
Javier Fumanal-Idocin, Javier Andreu-Perez· 0 citations
CON decomposition is introduced, which quantifies how much of a layer's variance each concept explains given all other concepts and the outcome, and how much none of them explains, yielding layer-comparable, calibrated scores that suppress false positives.
Roshan Prakash, Marco Simnacher, Manuel Pfeuffer et al.· 0 citations
While neural networks are typically evaluated by their training and test performance, these metrics do not reveal how robust a learned representation is. Recent studies have shown that solutions occupying larger volumes in parameter space, as quantified by Boltzmann entropy, often exhibit superior generalizability comp...
Xiaotian Zhang, Lai Shun Chan, Yue Shang et al.· arXiv.org· 0 citations
This work proposes Forgetting Only What Matters via Unlearning Layers (FOM-UL), a layer-level unlearning framework that selects transformer layers using a forget-to-retain significance score and provides an empirical path toward quantization-resilient unlearning.
Ravi Ranjan, O. Kotevska, Agoritsa Polyzou· 3 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.