Continuous lunches are free plus the design of optimal optimization algorithms (Q848643): Difference between revisions
From MaRDI portal
Latest revision as of 13:03, 2 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Continuous lunches are free plus the design of optimal optimization algorithms |
scientific article |
Statements
Continuous lunches are free plus the design of optimal optimization algorithms (English)
0 references
4 March 2010
0 references
The authors investigate extensions of no-free-lunch theorems for countably infinite and continuous domains and derive an optimal optimization algorithm assuming a prior distribution on the distribution of functions and a finite number of iterates.
0 references
no-free-lunch
0 references
Kolmogorov's extension theorem
0 references
expensive optimization
0 references
dynamic programming
0 references
complexity
0 references
bandit-based Monte-Carlo planning
0 references
0 references
0 references
