Black-Box and Data-Driven Computation

DOI10.1007/978-3-030-66515-9_6OpenAlexW3169891249MaRDI QIDQ5153503

Weili Wu, My T. Thai, Rong Jin, Ding-Zhu Du

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://doi.org/10.1007/978-3-030-66515-9_6

Mathematics Subject Classification ID

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

Related Items

A note on no-free-lunch theorem

Cites Work

• Unnamed Item
• Separating the low and high hierarchies by oracles
• Parity, circuits, and the polynomial-time hierarchy
• Separating and collapsing results on the relativized probabilistic polynomial-time hierarchy
• A note on separating the relativized polynomial time hierarchy by immune sets
• Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ Question
• Theory of Computational Complexity