3 citations · 3 across the 2 of their papers we have counts for
7 papers
Decomposable Submodular Function Minimization via Maximum Flow
Kyriakos Axiotis, Adam Karczmarz, Anish Mukherjee +2
This paper bridges discrete and continuous optimization approaches for decomposable submodular function minimization, in both the standard and parametric settings. We provide impro…
Projection-Free Bandit Optimization with Privacy Guarantees
Alina Ene, Huy L. Nguyen, Adrian Vladu
We design differentially private algorithms for the bandit convex optimization problem in the projection-free setting. This setting is important whenever the decision set has a com…
Adaptive Gradient Methods for Constrained Convex Optimization and Variational Inequalities
Alina Ene, Huy L. Nguyen, Adrian Vladu
We provide new adaptive first-order methods for constrained convex optimization. Our main algorithms AdaACSA and AdaAGD+ are accelerated methods, which are universal in the sense t…
Circulation Control for Faster Minimum Cost Flow in Unit-Capacity Graphs
Kyriakos Axiotis, Aleksander Mądry, Adrian Vladu
We present an -time algorithm for solving the minimum cost flow problem in graphs with unit capacity, where is the maximum absolute value of any edge weight…
Improved Convergence for and Regression via Iteratively Reweighted Least Squares
Alina Ene, Adrian Vladu
The iteratively reweighted least squares method (IRLS) is a popular technique used in practice for solving regression problems. Various versions of this method have been proposed,…
A Parallel Double Greedy Algorithm for Submodular Maximization
Alina Ene, Huy L. Nguyen, Adrian Vladu
We study parallel algorithms for the problem of maximizing a non-negative submodular function. Our main result is an algorithm that achieves a nearly-optimal approximation…