Search Results for author:
Found 2 papers, 0 papers with code
Adaptive approximation of monotone functions
We prove that GreedyBox achieves an optimal sample complexity for any function $f$, up to logarithmic factors.
Certified Multi-Fidelity Zeroth-Order Optimization
We also prove an $f$-dependent lower bound showing that this algorithm has a near-optimal cost complexity.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
