Skip to main content

All Questions

Filter by
Sorted by
Tagged with
1 vote
0 answers
83 views

Convex optimization with one-point feedback

In an adversarial bandit setting, we want to minimize $\sum_{1}^{T}l_t$(not exactly this but the corresponding regret), where $l_t$ is the loss function in the $t-$th round. Each round we can specify ...