The no-free-lunch theorems of supervised learning
From MaRDI portal
Publication:6187752
DOI10.1007/s11229-021-03233-1zbMath1529.68268arXiv2202.04513OpenAlexW3119241782WikidataQ113900472 ScholiaQ113900472MaRDI QIDQ6187752
Peter D. Grünwald, Tom F. Sterkenburg
Publication date: 1 February 2024
Published in: Synthese (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2202.04513
Foundations and philosophical topics in statistics (62A01) Learning and adaptive systems in artificial intelligence (68T05)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Local induction
- Simple explanation of the no-free-lunch theorem and its implications
- Inconsistency of Bayesian inference for misspecified linear models, and a proposal for repairing it
- Convergence rates of posterior distributions.
- Putnam's diagonal argument and the impossibility of a universal learning machine
- Absolutely no free lunches!
- Suboptimal behavior of Bayes and MDL in classification under misspecification
- Nonparametric Bayesian model selection and averaging
- The Oxford Handbook of Probability and Philosophy
- No Free Lunch versus Occam’s Razor in Supervised Learning
- Statistical Learning Theory: Models, Concepts, and Results
- Present Position and Potential Developments: Some Personal Views: Statistical Theory: The Prequential Approach
- Can the strengths of AIC and BIC be shared? A conflict between model indentification and regression estimation
- Catching up Faster by Switching Sooner: A Predictive Approach to Adaptive Estimation with an Application to the AIC–BIC Dilemma
- Black Box Optimization, Machine Learning, and No-Free Lunch Theorems
- Minimum description length revisited
- On the marginal likelihood and cross-validation
- Determination and the No-Free-Lunch Paradox
- Would “Direct Realism” Resolve the Classical Problem of Induction?
- Advanced Lectures on Machine Learning
- Understanding Machine Learning
- Inductive logic
This page was built for publication: The no-free-lunch theorems of supervised learning