62 citations · 408 across the 121 of their papers we have counts for
10 papers · 1 filter
Convergence of the Exponentiated Gradient Method with Armijo Line Search
Yen-Huan Li, Volkan Cevher
Consider the problem of minimizing a convex differentiable function on the probability simplex, spectrahedron, or set of quantum density matrices. We prove that the exponentiated g…
Smooth Primal-Dual Coordinate Descent Algorithms for Nonsmooth Convex Optimization
Ahmet Alacaoglu, Quoc Tran-Dinh, Olivier Fercoq +1
We propose a new randomized coordinate descent method for a convex optimization template with broad applications. Our analysis relies on a novel combination of four ideas applied t…
Streaming Robust Submodular Maximization: A Partitioned Thresholding Approach
Slobodan Mitrović, Ilija Bogunovic, Ashkan Norouzi-Fard +2
We study the classical problem of maximizing a monotone submodular function subject to a cardinality constraint k, with two additional twists: (i) elements arrive in a streaming fa…
Phase Transitions in the Pooled Data Problem
Jonathan Scarlett, Volkan Cevher
In this paper, we study the pooled data problem of identifying the labels associated with a large collection of items, based on a sequence of pooled tests revealing the counts of e…
Smoothing technique for nonsmooth composite minimization with linear operator
Quang Van Nguyen, Olivier Fercoq, Volkan Cevher
We introduce and analyze an algorithm for the minimization of convex functions that are the sum of differentiable terms and proximable terms composed with linear operators. The met…
Robust Submodular Maximization: A Non-Uniform Partitioning Approach
Ilija Bogunovic, Slobodan Mitrović, Jonathan Scarlett +1
We study the problem of maximizing a monotone submodular function subject to a cardinality constraint , with the added twist that a number of items from the returned set may…