English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Zendy Plus

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Zendy Tools

Zendy Open

In this paper, the problem of maximizing a black-box function $f:\mathcal{X}\to \mathbb{R}$ is studied in the Bayesian framework with a Gaussian Process(GP) prior. In particular, a new algorithm for this problem is proposed, andhigh probability bounds on its simple and cumulative regret are established.The query point selection rule in most existing methods involves an exhaustivesearch over an increasingly fine sequence of uniform discretizations of$\mathcal{X}$. The proposed algorithm, in contrast, adaptively refines$\mathcal{X}$ which leads to a lower computational complexity, particularlywhen $\mathcal{X}$ is a subset of a high dimensional Euclidean space. Inaddition to the computational gains, sufficient conditions are identified underwhich the regret bounds of the new algorithm improve upon the known results.Finally an extension of the algorithm to the case of contextual bandits isproposed, and high probability bounds on the contextual regret are presented.

Gaussian Process bandits with adaptive discretization