Improved Regret Bounds for Projection-free Bandit Convex Optimization

8 October 2019

Papers citing "Improved Regret Bounds for Projection-free Bandit Convex Optimization"

7 / 7 papers shown

Title
Projection-Free Online Convex Optimization with Time-Varying Constraints Dan Garber Ben Kretzu 73 3 0 13 Feb 2024
Multi-point Feedback of Bandit Convex Optimization with Hard Constraints Yasunari Hikima 114 0 0 17 Oct 2023
New Projection-free Algorithms for Online Convex Optimization with Adaptive Regret Guarantees Dan Garber Ben Kretzu 99 21 0 09 Feb 2022
From the Greene--Wu Convolution to Gradient Estimation over Riemannian Manifolds Tianyu Wang Yifeng Huang Didong Li 40 8 0 17 Aug 2021
Projection-free Online Learning over Strongly Convex Sets Yuanyu Wan Lijun Zhang 119 28 0 16 Oct 2020
Revisiting Projection-free Online Learning: the Strongly Convex Case Dan Garber Ben Kretzu 77 31 0 15 Oct 2020
Online Boosting with Bandit Feedback Nataly Brukhim Elad Hazan 67 10 0 23 Jul 2020