Kernel-based methods for bandit convex optimization-Reference-Cited by-同舟云学术

Kernel-based methods for bandit convex optimization

Published:2017-06-19 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing
language:
Short-container-title:

Author:

Bubeck Sébastien¹,Lee Yin Tat¹,Eldan Ronen²

Affiliation:

1. Microsoft Research, USA

2. Weizmann Institute of Science, Israel

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3055399.3055403

Reference33 articles.

1. J. Abernethy E. Hazan and A. Rakhlin. 2008. J. Abernethy E. Hazan and A. Rakhlin. 2008.

2. A. Agarwal D.P. Foster D. Hsu S.M. Kakade and A. Rakhlin. 2011. Stochastic convex optimization with bandit feedback. In Advances in Neural Information Processing Systems (NIPS). A. Agarwal D.P. Foster D. Hsu S.M. Kakade and A. Rakhlin. 2011. Stochastic convex optimization with bandit feedback. In Advances in Neural Information Processing Systems (NIPS).

Cited by 34 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Boosting One-Point Derivative-Free Online Optimization via Residual Feedback;IEEE Transactions on Automatic Control;2024-09

2. Projection-Free Bandit Convex Optimization over Strongly Convex Sets;Lecture Notes in Computer Science;2024

3. Distributed zeroth-order optimization: Convergence rates that match centralized counterpart;Automatica;2024-01

4. Non-smooth setting of stochastic decentralized convex optimization problem over time-varying Graphs;Computational Management Science;2023-10-24

5. Randomized Gradient-Free Methods in Convex Optimization;Encyclopedia of Optimization;2023-09-08