mlsanityData to 7 Oct 2026

MD tree: a model-diagnostic tree grown on loss landscape

arXiv 2406.16988 ↗First posted 24 Jun 2024cs.LG stat.MLcited by 3

Not on the map. Why?

Abstract (arXiv)

This paper considers "model diagnosis", which we formulate as a classification problem. Given a pre-trained neural network (NN), the goal is to predict the source of failure from a set of failure modes (such as a wrong hyperparameter, inadequate model size, and insufficient data) without knowing the training configuration of the pre-trained NN. The conventional diagnosis approach uses training and validation errors to determine whether the model is underfitting or overfitting. However, we show that rich information about NN performance is encoded in the optimization loss landscape, which provides more actionable insights than validation-based measurements. Therefore, we propose a diagnosis method called MD tree based on loss landscape metrics and experimentally demonstrate its advantage over classical validation-based approaches. We verify the effectiveness of MD tree in multiple practical scenarios: (1) use several models trained on one dataset to diagnose a model trained on another dataset, essentially a few-shot dataset transfer problem; (2) use small models (or models trained with small data) to diagnose big models (or models trained with big data), essentially a scale transfer problem. In a dataset transfer task, MD tree achieves an accuracy of 87.7%, outperforming validation-based approaches by 14.88%. Our code is available at https://github.com/YefanZhou/ModelDiagnosis.

Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 56 of its 75 references that are in the map. First posted on arXiv 24 Jun 2024.

Builds on

56 of 75 references.

References · 56

  1. 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 29,915
  2. 2023Judging LLM-as-a-Judge with MT-Bench and Chatbot Arenacited by 8,393
  3. 2020Scaling Laws for Neural Language Modelscited by 6,411
  4. 2019Benchmarking Neural Network Robustness to Common Corruptions and Perturbationscited by 2,857
  5. 2022Locating and Editing Factual Associations in GPTcited by 2,609
  6. 2019Similarity of Neural Network Representations Revisitedcited by 1,695
  7. 2020Sharpness-Aware Minimization for Efficiently Improving Generalizationcited by 1,404
  8. 2016On Large-Batch Training for Deep Learning: Generalization Gap and Sharp Minimacited by 1,337
  9. 2019Class-Balanced Loss Based on Effective Number of Samplescited by 1,239
  10. 2022Interpretability in the Wild: a Circuit for Indirect Object Identification in GPT-2 smallcited by 1,130
  11. 2018Reconciling modern machine learning practice and the bias-variance trade-offcited by 919
  12. 2017Revisiting Unreasonable Effectiveness of Data in Deep Learning Eracited by 916
38 more
  1. 2023Towards Automated Circuit Discovery for Mechanistic Interpretabilitycited by 700
  2. 2017Spectrally-normalized margin bounds for neural networkscited by 681
  3. 2021Do Vision Transformers See Like Convolutional Neural Networks?cited by 671
  4. 2019Deep Double Descent: Where Bigger Models and More Data Hurtcited by 667
  5. 2018Loss Surfaces, Mode Connectivity, and Fast Ensembling of DNNscited by 585
  6. 2021Editing Factual Knowledge in Language Modelscited by 548
  7. 2019Benign Overfitting in Linear Regressioncited by 544
  8. 2019Surprises in High-Dimensional Ridgeless Least Squares Interpolationcited by 508
  9. 2019Fantastic Generalization Measures and Where to Find Themcited by 507
  10. 2021Fast Model Editing at Scalecited by 491
  11. 2021ConViT: Improving Vision Transformers with Soft Convolutional Inductive Biasescited by 484
  12. 2017Sharp Minima Can Generalize For Deep Netscited by 462
  13. 2019The generalization error of random features regression: Precise asymptotics and double descent curvecited by 410
  14. 2023Scaling Data-Constrained Language Modelscited by 391
  15. 2023GPTScore: Evaluate as You Desirecited by 357
  16. 2021Self-Diagnosis and Self-Debiasing: A Proposal for Reducing Corpus-Based Bias in NLPcited by 336
  17. 2018Essentially No Barriers in Neural Network Energy Landscapecited by 328
  18. 2023Finding Neurons in a Haystack: Case Studies with Sparse Probingcited by 328
  19. 2019PyHessian: Neural Networks Through the Lens of the Hessiancited by 291
  20. 2023TRAK: Attributing Model Behavior at Scalecited by 273
  21. 2021Accuracy on the Line: On the Strong Correlation Between Out-of-Distribution and In-Distribution Generalizationcited by 248
  22. 2020Do Wide and Deep Networks Learn the Same Things? Uncovering How Neural Network Representations Vary with Width and Depthcited by 241
  23. 2018Implicit Self-Regularization in Deep Neural Networks: Evidence from Random Matrix Theory and Implications for Learningcited by 211
  24. 2018Model Evaluation, Model Selection, and Algorithm Selection in Machine Learningcited by 157
  25. 2023A Toy Model of Universality: Reverse Engineering How Networks Learn Group Operationscited by 141
  26. 2022Revisiting Neural Scaling Laws in Language and Visioncited by 129
  27. 2015Statistical physics of inference: Thresholds and algorithmscited by 128
  28. 2021Assessing Generalization of SGD via Disagreementcited by 116
  29. 2020Predicting trends in the quality of state-of-the-art neural networks without access to training or testing datacited by 113
  30. 2020Optimal Regularization Can Mitigate Double Descentcited by 107
  31. 2022Broken Neural Scaling Lawscited by 102
  32. 2022Agreement-on-the-Line: Predicting the Performance of Neural Networks under Distribution Shiftcited by 94
  33. 2023A Modern Look at the Relationship between Sharpness and Generalizationcited by 91
  34. 2018Hessian-based Analysis of Large Batch Training and Robustness to Adversariescited by 87
  35. 2020In Search of Robust Measures of Generalizationcited by 79
  36. 2021The Shape of Learning Curves: a Reviewcited by 67
  37. 2021Taxonomizing local versus global structure in neural network loss landscapescited by 34
  38. 2022ModelDiff: A Framework for Comparing Learning Algorithmscited by 30

50 most cited of 56 All 56 (JSON)

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2025: 2; 2026: 1.

3 papers.