paper-with-me

홈 › Papers

What causes the test error? Going beyond bias-variance via ANOVA

2020-10-11 · Licong Lin, Edgar Dobriban

Modern machine learning methods are often overparametrized, allowing adaptation to the data at a fine level. This can seem puzzling; in the worst case, such models do not need to generalize. This puzzle inspired a great amount of work, arguing when overparametrization reduces test error, in a phenomenon called "double descent". Recent work aimed to understand in greater depth why overparametrization is helpful for generalization. This leads to discovering the unimodality of variance as a function of the level of parametrization, and to decomposing the variance into that arising from label noise, initialization, and randomness in the training data to understand the sources of the error. In this work we develop a deeper understanding of this area. Specifically, we propose using the analysis of variance (ANOVA) to decompose the variance in the test error in a symmetric way, for studying the generalization performance of certain two-layer linear and non-linear networks. The advantage of the analysis of variance is that it reveals the effects of initialization, label noise, and training data more clearly than prior approaches. Moreover, we also study the monotonicity and unimodality of the variance components. While prior work studied the unimodality of the overall variance, we study the properties of each term in variance decomposition. One key insight is that in typical settings, the interaction between training samples and initialization can dominate the variance; surprisingly being larger than their marginal effect. Also, we characterize "phase transitions" where the variance changes from unimodal to monotone. On a technical level, we leverage advanced deterministic equivalent techniques for Haar random matrices, that -- to our knowledge -- have not yet been used in the area. We also verify our results in numerical simulations and on empirical data examples.

📄 PDF Abstract BibTeX arXiv:2010.05170

Code (1)

licong-lin/VarianceDecomposition 공식 구현

Similar Papers 제목 키워드 기반

Prediction of Future Terrorist Activities Using Deep Neural Networks

2020-04-22 · Hindawi 2020 4 · M. Irfan Uddin, Nazir Zada, Furqan Aziz, Yousaf Saeed 외

One of the most important threats to today’s civilization is terrorism. Terrorism not only disturbs the law and order situations in a society but also affects the quality of lives of humans and makes them suppressed phys…

Prediction

Beyond But-for Test: Counterfactual Explanation in Abstract Argumentation via Actual Causality (Extended Version)

2026-06-30 · Siyi Liu, Muyun Shao, Beishui Liao arxiv

Counterfactual explanation in abstract argumentation calls for an answer to the what-if query: would the topic argument still be accepted if the status of certain other arguments were changed? Existing approaches are lim…

What Can ResNet Learn Efficiently, Going Beyond Kernels?

2019-05-24 · NeurIPS 2019 12 · Zeyuan Allen-Zhu, Yuanzhi Li

How can neural networks such as ResNet efficiently learn CIFAR-10 with test accuracy more than 96%, while other methods, especially kernel methods, fall relatively behind? Can we more provide theoretical justifications f…

One-Shot Learning

Generative Logic with Time: Beyond Logical Consistency and Statistical Possibility

2023-01-20 · Hiroyuki Kido

This paper gives a simple theory of inference to logically reason symbolic knowledge fully from data over time. We take a Bayesian approach to model how data causes symbolic knowledge. Probabilistic reasoning with symbol…

Formal Logic

Beyond the Loss Curve: Scaling Laws, Active Learning, and the Limits of Learning from Exact Posteriors

2026-01-30 · Arian Khorasani, Nathaniel Chen, Yug D Oswal, Akshat Santhana Gopalan 외 arxiv

How close are neural networks to the best they could possibly do? Standard benchmarks cannot answer this because they lack access to the true posterior p(y|x). We use class-conditional normalizing flows as oracles that m…

Active Learning