arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,742 papers · 148 categories

Trend · papers per month

count % of corpus

1 result for “comp-gp-ucb”

Zeroth Order Non-convex optimization with Dueling-Choice Banditscs.LG

Algorithm optimizes non-convex functions using dueling comparisons.

problem Optimizing non-convex functions with limited function evaluations.

method COMP-GP-UCB algorithm, leveraging dueling-choice bandits.

result Theoretical guarantee of

O(\fracΦ{\sqrt{T}})

on simple regret.

non-convex optimization dueling-choice bandits comp-gp-ucb simple regret

2019-11-03abs ↗pdf ↗