Regret Analysis of Dyadic Search
arXiv:2209.00885v22 citationsh-index: 12
Originality Synthesis-oriented
AI Analysis
This work offers incremental theoretical insights for researchers in optimization or bandit algorithms.
The paper analyzes the cumulative regret of the Dyadic Search algorithm, providing theoretical bounds on its performance.
We analyze the cumulative regret of the Dyadic Search algorithm of Bachoc et al. [2022].