English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Zendy Open

Presents the pdf analysis as premium feature

PDF Analysis

Insights

Presents the summarisation as premium feature

Summarisation

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the zaia usage as premium feature

ZAIA

Zendy Tools

Zendy Plus

Presents the access of premium content as premium feature

Premium Content

International audienceThis paper analyses extensions of No-Free-Lunch (NFL) theorems to countably innite and uncountable innite domains and investigates the design of optimal optimization algorithms. The original NFL theorem due to Wolpert and Macready states that, for nite search domains, all search heuristics have the same performance when averaged over the uniform distribution over all possible functions. For innite domains the extension of the concept of distribution over all possible functions involves measurability issues and stochastic process the- ory. For countably innite domains, we prove that the natural extension of NFL theorems, for the current formalization of probability, does not hold, but that a weaker form of NFL does hold, by stating the existence of non-trivial distributions of tness leading to equal performances for all search heuristics. Our main result is that for continuous domains, NFL does not hold. This free-lunch theorem is based on the formalization of the concept of random tness functions by means of random elds. We also consider the design of optimal optimization algorithms for a given random eld, in a black-box setting, namely, a complexity measure based solely on the number of requests to the tness function. We derive an optimal algorithm based on Bellman's decomposition principle, for a given number of iterates and a given distribution of tness functions. We also approximate this algorithm thanks to a Monte-Carlo planning algorithm close to the UCT (Upper Condence Trees) algorithm, and provide experimental results

Continuous Lunches Are Free Plus the Design of Optimal Optimization Algorithms