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 Open

Presents the pdf analysis as premium feature

PDF Analysis

Insights

Presents the summarisation as premium feature

Summarisation

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the zaia usage as premium feature

ZAIA

Zendy Tools

Zendy Plus

Presents the access of premium content as premium feature

Premium Content

The recently proposed Brent-STEP algorithm was generalized for separable functions by performing axis-parallel searches, interleaving the steps in individual dimensions in a round-robin fashion. This article explores the possibility to choose the dimension for the next step in a more “intelligent way”, i.e. to optimize first along dimensions which are believed to bring the highest profit. We present here the results for the epsilon-greedy strategy, and for a method based on the internals of the Brent-STEP algorithm. Although the proposed methods work better than the round robin strategy in some situations, due to the marginal improvement they bring we suggest the round robin strategyto be used, thanks to its simplicity

Dimension Selection in Axis-Parallel Brent-STEP Method for Black-Box Optimization of Separable Continuous Functions