Search Results for author:
Found 2 papers, 1 papers with code
Sample-and-Bound for Non-Convex Optimization
Standard approaches for global optimization of non-convex functions, such as branch-and-bound, maintain partition trees to systematically prune the domain.
Monte Carlo Tree Descent for Black-Box Optimization
The key to Black-Box Optimization is to efficiently search through input regions with potentially widely-varying numerical properties, to achieve low-regret descent and fast progress toward the optima.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
