Black-Box and Data-Driven Computation

DOI10.1007/978-3-030-66515-9_6MaRDI QIDQ5153503zbMATH OpenOpenAlexFDO

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

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)

Recommendations

• Computational complexity on the blackboard
• Black-Box Optimization: Methods and Applications
• Black-box complexities of combinatorial problems
• Black-Box Complexity of Local Minimization
• Black-box complexity for bounding the performance of randomized search heuristics

Cites work

• A note on separating the relativized polynomial time hierarchy by immune sets
• scientific article; zbMATH DE number 1246413 (Why is no real title available?)
• Parity, circuits, and the polynomial-time hierarchy
• Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ Question
• Separating and collapsing results on the relativized probabilistic polynomial-time hierarchy
• Separating the low and high hierarchies by oracles
• Theory of Computational Complexity

Cited in

(2)

• Towards a black box Lanczos program
• A note on no-free-lunch theorem

This page was built for publication: Black-Box and Data-Driven Computation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5153503)