Sudeep Salgia, Sattar Vakili, Qing Zhao
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.
We consider sequential optimization of an unknown function in a reproducing kernel Hilbert space. We propose a Gaussian process-based algorithm and establish its order-optimal regret performance (up to a poly-logarithmic factor). This is the first GP-based algorithm with an order-optimal regret guarantee. The proposed algorithm is rooted in the methodology of domain shrinking realized through a sequence of tree-based region pruning and refining to concentrate queries in increasingly smaller high-performing regions of the function domain. The search for high-performing regions is localized and guided by an iterative estimation of the optimal function value to ensure both learning efficiency and computational efficiency. Compared with the prevailing GP-UCB family of algorithms, the proposed algorithm reduces computational complexity by a factor of O(T 2d-1 ) (where T is the time horizon and d the dimension of the function domain).
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2010.13997")
get_code_for_paper("2010.13997")
have("2010.13997")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2010.13997.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2010.13997)
Connect an agent — have() is free.