Forget Me Not: Fighting Local Overfitting with Knowledge Fusion and Distillation
This addresses overfitting issues for deep learning practitioners, offering a method to enhance model robustness, though it is incremental as it builds on existing ensemble and distillation techniques.
The paper tackles the problem of local overfitting in deep neural networks, where performance degrades in specific data regions, and introduces a two-stage method that aggregates checkpoints into an ensemble and distills it into a single model, achieving improved performance without added inference cost, notably outperforming baselines in label noise scenarios.
Overfitting in deep neural networks occurs less frequently than expected. This is a puzzling observation, as theory predicts that greater model capacity should eventually lead to overfitting -- yet this is rarely seen in practice. But what if overfitting does occur, not globally, but in specific sub-regions of the data space? In this work, we introduce a novel score that measures the forgetting rate of deep models on validation data, capturing what we term local overfitting: a performance degradation confined to certain regions of the input space. We demonstrate that local overfitting can arise even without conventional overfitting, and is closely linked to the double descent phenomenon. Building on these insights, we introduce a two-stage approach that leverages the training history of a single model to recover and retain forgotten knowledge: first, by aggregating checkpoints into an ensemble, and then by distilling it into a single model of the original size, thus enhancing performance without added inference cost. Extensive experiments across multiple datasets, modern architectures, and training regimes validate the effectiveness of our approach. Notably, in the presence of label noise, our method -- Knowledge Fusion followed by Knowledge Distillation -- outperforms both the original model and independently trained ensembles, achieving a rare win-win scenario: reduced training and inference complexity.