20 citations · 52 across the 10 of their papers we have counts for
Showing 2018 · stat.MLShow all
2 papers · 2 filters
stat.ML2018
Projection-Free Bandit Convex Optimization
Lin Chen, Mingrui Zhang, Amin Karbasi
In this paper, we propose the first computationally efficient projection-free algorithm for bandit convex optimization (BCO). We show that our algorithm achieves a sublinear regret…
stat.ML2018
Online Continuous Submodular Maximization
Lin Chen, Hamed Hassani, Amin Karbasi
In this paper, we consider an online optimization process, where the objective functions are not convex (nor concave) but instead belong to a broad class of continuous submodular f…