Simple explanation of the no-free-lunch theorem and its implications

DOI10.1023/A:1021251113462zbMath1031.91018OpenAlexW2102184039MaRDI QIDQ1411370

Yu-Chi Ho, David L. Pepyne

Publication date: 27 October 2003

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1021251113462

zbMATH Keywords

sensitivityoptimizationcomplexitydecision makingrobustnesslearningsearchstrategy selectionimpossibility theoremNo-free-lunch theoremrepresentation and encoding

Mathematics Subject Classification ID

Decision theory (91B06) Sensitivity, stability, parametric optimization (90C31) Stochastic programming (90C15)

Related Items

A neuromuscular interface for robotic devices control ⋮ Parameter discrepancy hypothesis: adversarial attack for graph data ⋮ A novel improved chef-based optimization algorithm with Gaussian random walk-based diffusion process for global optimization and engineering problems ⋮ First Complexity Results for Evolutionary Knowledge Transfer ⋮ Do prior information on performance of individual classifiers for fusion of probabilistic classifier outputs matter? ⋮ Maximum principle for optimal distributed control of the viscous dullin-gottwald-Holm equation ⋮ The no-free-lunch theorems of supervised learning ⋮ Recent progress on reservoir history matching: a review ⋮ Absolutely no free lunches! ⋮ On normalization and algorithm selection for unsupervised outlier detection ⋮ Unrelated parallel machine scheduling -- perspectives and progress ⋮ Maximum principle for optimal boundary control of the Kuramoto-Sivashinsky equation ⋮ Analytical and numerical comparisons of biogeography-based optimization and genetic algorithms ⋮ An analysis of the equilibrium of migration models for biogeography-based optimization ⋮ Maximum principle for optimal distributed control of viscous weakly dispersive Degasperis-Procesi equation ⋮ A novel population initialization method for accelerating evolutionary algorithms ⋮ Necessary optimality conditions for optimal distributed and (Neumann) boundary control of Burgers equation in both fixed and free final horizon cases ⋮ Gorthaur-EXP3: bandit-based selection from a portfolio of recommendation algorithms balancing the accuracy-diversity dilemma ⋮ Stochastic modelling and feedback control of bistability in a turbulent bluff body wake ⋮ Optimal control of age-structured population dynamics for spread of universally fatal diseases ⋮ A new effective operator for the hybrid algorithm for solving global optimisation problems

Cites Work

• Convergence properties of ordinal comparison in the simulation of discrete event dynamic systems
• An explanation of ordinal optimization: Soft computing for hard problems
• Unnamed Item
• Unnamed Item