Post-Hoc Reversal: Are We Selecting Models Prematurely?
Not on the map. Why?
Abstract (arXiv)
Trained models are often composed with post-hoc transforms such as temperature scaling (TS), ensembling and stochastic weight averaging (SWA) to improve performance, robustness, uncertainty estimation, etc. However, such transforms are typically applied only after the base models have already been finalized by standard means. In this paper, we challenge this practice with an extensive empirical study. In particular, we demonstrate a phenomenon that we call post-hoc reversal, where performance trends are reversed after applying post-hoc transforms. This phenomenon is especially prominent in high-noise settings. For example, while base models overfit badly early in training, both ensembling and SWA favor base models trained for more epochs. Post-hoc reversal can also prevent the appearance of double descent and mitigate mismatches between test loss and test error seen in base models. Preliminary analyses suggest that these transforms induce reversal by suppressing the influence of mislabeled examples, exploiting differences in their learning dynamics from those of clean examples. Based on our findings, we propose post-hoc selection, a simple technique whereby post-hoc metrics inform model development decisions such as early stopping, checkpointing, and broader hyperparameter choices. Our experiments span real-world vision, language, tabular and graph datasets. On an LLM instruction tuning dataset, post-hoc selection results in >1.5x MMLU improvement compared to naive selection.
Key facts. Cited by 7 papers in the map (data through 7 Oct 2026). Builds on 67 of its 83 references that are in the map. First posted on arXiv 11 Apr 2024.
Builds on
67 of 83 references.
References · 67
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
- 2023Llama 2: Open Foundation and Fine-Tuned Chat Modelscited by 12,865
- 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,282
- 2020Measuring Massive Multitask Language Understandingcited by 7,768
- 2016Densely Connected Convolutional Networkscited by 6,691
- 2020Scaling Laws for Neural Language Modelscited by 6,411
- 2017On Calibration of Modern Neural Networkscited by 4,860
- 2018How Powerful are Graph Neural Networks?cited by 4,355
- 2016Simple and Scalable Predictive Uncertainty Estimation using Deep Ensemblescited by 3,888
- 2021Finetuned Language Models Are Zero-Shot Learnerscited by 3,747
- 2023QLoRA: Efficient Finetuning of Quantized LLMscited by 3,355
38 more
- 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,250
- 2021Calibrate Before Use: Improving Few-Shot Performance of Language Modelscited by 1,371
- 2020WILDS: A Benchmark of in-the-Wild Distribution Shiftscited by 1,366
- 2022Model soups: averaging weights of multiple fine-tuned models improves accuracy without increasing inference timecited by 1,366
- 2019Can You Trust Your Model's Uncertainty? Evaluating Predictive Uncertainty Under Dataset Shiftcited by 1,274
- 2018Averaging Weights Leads to Wider Optima and Better Generalizationcited by 1,194
- 2019Big Transfer (BiT): General Visual Representation Learningcited by 766
- 2020TUDataset: A collection of benchmark datasets for learning with graphscited by 718
- 2020Prevalence of Neural Collapse during the terminal phase of deep learning trainingcited by 713
- 2023OpenAssistant Conversations -- Democratizing Large Language Model Alignmentcited by 712
- 2023Scaling Vision Transformers to 22 Billion Parameterscited by 690
- 2019Deep Double Descent: Where Bigger Models and More Data Hurtcited by 667
- 2022Grokking: Generalization Beyond Overfitting on Small Algorithmic Datasetscited by 599
- 2018Loss Surfaces, Mode Connectivity, and Fast Ensembling of DNNscited by 585
- 2020Learning from Noisy Labels with Deep Neural Networks: A Surveycited by 580
- 2023LLM-Blender: Ensembling Large Language Models with Pairwise Ranking and Generative Fusioncited by 550
- 2020Bayesian Deep Learning and a Probabilistic Perspective of Generalizationcited by 480
- 2021Retiring Adult: New Datasets for Fair Machine Learningcited by 443
- 2019Deep Ensembles: A Loss Landscape Perspectivecited by 438
- 2021SWAD: Domain Generalization by Seeking Flat Minimacited by 431
- 2018Bag of Tricks for Image Classification with Convolutional Neural Networkscited by 430
- 2020Early-Learning Regularization Prevents Memorization of Noisy Labelscited by 414
- 2021Gradient Descent on Neural Networks Typically Occurs at the Edge of Stabilitycited by 413
- 2023Scaling Data-Constrained Language Modelscited by 391
- 2021ResNet strikes back: An improved training procedure in timmcited by 365
- 2017Snapshot Ensembles: Train 1, get M for freecited by 349
- 2017Functional Map of the Worldcited by 338
- 2020Towards Understanding Ensemble, Knowledge Distillation and Self-Distillation in Deep Learningcited by 292
- 2021Learning with Noisy Labels Revisited: A Study Using Real-World Human Annotationscited by 253
- 2022Patching open-vocabulary models by interpolating weightscited by 187
- 2017CleanNet: Transfer Learning for Scalable Image Classifier Training with Label Noisecited by 181
- 2022Diverse Weight Averaging for Out-of-Distribution Generalizationcited by 148
- 2024WARM: On the Benefits of Weight Averaged Reward Modelscited by 145
- 2021Ensemble of Averages: Improving Model Selection and Boosting Performance in Domain Generalizationcited by 144
- 2023Routing to the Expert: Efficient Reward-guided Ensemble of Large Language Modelscited by 141
- 2023Distributional Preference Learning: Understanding and Accounting for Hidden Context in RLHFcited by 125
- 2020Optimal Regularization Can Mitigate Double Descentcited by 107
- 2022Robust Training under Label Noise by Over-parameterizationcited by 93
50 most cited of 67 All 67 (JSON)
Built on by
Citing papers per year: 2025: 3; 2026: 4.
7 papers.
- 2025Relational Transformer: Toward Zero-Shot Foundation Models for Relational Datacited by 32
- 2026PluRel: Synthetic Data unlocks Scaling Laws for Relational Foundation Modelscited by 15
- 2025Rethinking Early Stopping: Refine, Then Calibratecited by 13
- 2026Relatron: Automating Relational Machine Learning over Relational Databasescited by 2
- 2025MaP: A Unified Framework for Reliable Evaluation of Pre-training Dynamicscited by 1
- 2026Are we Merging the Right Models? Impact of Expert Training Duration on Model Merging for LLMscited by 1
- 2026A Free Knob: Decoupling Calibration and Predictive Skill in Threshold-Based Evaluationcited by 0
- 2026A Free Knob: Decoupling Calibration and Predictive Skill in Threshold-Based Evaluation27 Sep 2026
- 2026Are we Merging the Right Models? Impact of Expert Training Duration on Model Merging for LLMs13 Jul 2026
- 2026Relatron: Automating Relational Machine Learning over Relational Databases26 Feb 2026
- 2026PluRel: Synthetic Data unlocks Scaling Laws for Relational Foundation Models3 Feb 2026
- 2025MaP: A Unified Framework for Reliable Evaluation of Pre-training Dynamics10 Oct 2025
- 2025Relational Transformer: Toward Zero-Shot Foundation Models for Relational Data7 Oct 2025
- 2025Rethinking Early Stopping: Refine, Then Calibrate31 Jan 2025