1 citations · 1 across the 2 of their papers we have counts for
2 papers
cs.AI2024
Sample-and-Bound for Non-Convex Optimization
Yaoguang Zhai, Zhizhen Qin, Sicun Gao
Standard approaches for global optimization of non-convex functions, such as branch-and-bound, maintain partition trees to systematically prune the domain. The tree size grows expo…
cs.LG2022★ 1 cited
Monte Carlo Tree Descent for Black-Box Optimization
Yaoguang Zhai, Sicun Gao
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 progre…