MathDB1 problem
- 0 votes0 replies0 views
Conjecture that simplified global Lipschitz optimization algorithms have worse sample complexity
Sample-complexity conjecture. The associated sample complexity of such simplified algorithms is worse than that of the Piyavskii--Shubert algorithm by a non-negligible multiplicati…