11 citations · 30 across the 7 of their papers we have counts for
4 papers · 1 filter
Instance Specific Approximations for Submodular Maximization
Eric Balkanski, Sharon Qian, Yaron Singer
For many optimization problems in machine learning, finding an optimal solution is computationally intractable and we seek algorithms that perform well in practice. Since computati…
Adversarial Attacks on Binary Image Recognition Systems
Eric Balkanski, Harrison Chase, Kojin Oshiba +3
We initiate the study of adversarial attacks on models for binary (i.e. black and white) image classification. Although there has been a great deal of work on attacking models for…
The FAST Algorithm for Submodular Maximization
Adam Breuer, Eric Balkanski, Yaron Singer
In this paper we describe a new algorithm called Fast Adaptive Sequencing Technique (FAST) for maximizing a monotone submodular function under a cardinality constraint whose ap…
Parallelization does not Accelerate Convex Optimization: Adaptivity Lower Bounds for Non-smooth Convex Minimization
Eric Balkanski, Yaron Singer
In this paper we study the limitations of parallelization in convex optimization. A convenient approach to study parallelization is through the prism of \emph{adaptivity} which is…