46 citations · 272 across the 54 of their papers we have counts for
Showing 2018 · stat.MLShow all
2 papers · 2 filters
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…
stat.ML2018
Projection-Free Online Optimization with Stochastic Gradient: From Convexity to Submodularity
Lin Chen, Christopher Harshaw, Hamed Hassani +1
Online optimization has been a successful framework for solving large-scale problems under computational constraints and partial information. Current methods for online convex opti…