Bandit Convex Optimisation
<|reference_start|>Bandit Convex Optimisation: Bandit convex optimisation is a fundamental framework for studying zeroth-order convex optimisation. These notes cover the many tools used for this problem, including cutting plane methods, interior point methods, continuous exponential weights, gradient descent and online Newton step. The nuances between the many assumptions and setups are explained. Although there is not much truly new here, some existing tools are applied in novel ways to obtain new algorithms. A few bounds are improved in minor ways.<|reference_end|>
@article{lattimore2024bandit,
    title={Bandit Convex Optimisation},
    author={Tor Lattimore},
    journal={arXiv preprint arXiv:2402.06535},
    year={2024},
    archivePrefix={arXiv},
    eprint={2402.06535},
    primaryClass={math.OC cs.LG stat.ML}
}