Sicun Gao, Zhizhen Qin, Yaoguang Zhai
We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
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 exponentially in the number of dimensions. We propose new sampling-based methods for non-convex optimization that adapts Monte Carlo Tree Search (MCTS) to improve efficiency. Instead of the standard use of visitation count in Upper Confidence Bounds, we utilize numerical overapproximations of the objective as an uncertainty metric, and also take into account of sampled estimates of first-order and second-order information. The Monte Carlo tree in our approach avoids the usual fixed combinatorial patterns in growing the tree, and aggressively zooms into the promising regions, while still balancing exploration and exploitation. We evaluate the proposed algorithms on high-dimensional nonconvex optimization benchmarks against competitive baselines and analyze the effects of the hyper parameters.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2401.04812")
get_code_for_paper("2401.04812")
have("2401.04812")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2401.04812.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2401.04812)
Connect an agent — have() is free.