What Is Important About the No Free Lunch Theorems?

DOI10.1007/978-3-030-66515-9_13OpenAlexW3044727412MaRDI QIDQ5153510

David H. Wolpert

Publication date: 30 September 2021

Published in: Black Box Optimization, Machine Learning, and No-Free Lunch Theorems (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2007.10928

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Approximation methods and heuristics in mathematical programming (90C59)

Cites Work

• What makes an optimization problem hard?.
• A no-free-lunch theorem for non-uniform distributions of target functions
• No Free Lunch versus Occam’s Razor in Supervised Learning
• An introduction to Kolmogorov complexity and its applications
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: What Is Important About the No Free Lunch Theorems?