A note on no-free-lunch theorem

DOI10.1142/S1793830922500276OpenAlexW3214758576MaRDI QIDQ5057731

Lidong Wu

Publication date: 19 December 2022

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s1793830922500276

zbMATH Keywords

NP-hardmachine learningno-free-lunch theorem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Learning and adaptive systems in artificial intelligence (68T05)

Cites Work

• Unnamed Item
• Machine learning for combinatorial optimization: a methodological tour d'horizon
• A note of vertex arboricity of planar graphs without 4-cycles intersecting with 6-cycles
• Tadpole domination in duplicated graphs
• Black-Box and Data-Driven Computation
• Theory of Computational Complexity
• Solving Combinatorial Problems with Machine Learning Methods

This page was built for publication: A note on no-free-lunch theorem