Follow
Eric Balkanski
Title
Cited by
Cited by
Year
The adaptive complexity of maximizing a submodular function
E Balkanski, Y Singer
Proceedings of the 50th annual ACM SIGACT symposium on theory of computing …, 2018
932018
An exponential speedup in parallel running time for submodular maximization without loss in approximation
E Balkanski, A Rubinstein, Y Singer
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019
792019
The limitations of optimization from samples
E Balkanski, A Rubinstein, Y Singer
ACM Journal of the ACM (JACM) 69 (3), 1-33, 2022
552022
The power of optimization from samples
E Balkanski, A Rubinstein, Y Singer
Advances in Neural Information Processing Systems 29, 2016
402016
Non-monotone submodular maximization in exponentially fewer iterations
E Balkanski, A Breuer, Y Singer
Advances in Neural Information Processing Systems 31, 2018
382018
Bayesian budget feasibility with posted pricing
E Balkanski, JD Hartline
Proceedings of the 25th International Conference on World Wide Web, 189-203, 2016
292016
An optimal approximation for submodular maximization under a matroid constraint in the adaptive complexity model
E Balkanski, A Rubinstein, Y Singer
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing …, 2019
282019
Approximation guarantees for adaptive sampling
E Balkanski, Y Singer
International Conference on Machine Learning, 384-393, 2018
272018
Parallelization does not accelerate convex optimization: Adaptivity lower bounds for non-smooth convex minimization
E Balkanski, Y Singer
arXiv preprint arXiv:1808.03880, 2018
242018
Learning sparse combinatorial representations via two-stage submodular maximization
E Balkanski, B Mirzasoleiman, A Krause, Y Singer
International Conference on Machine Learning, 2207-2216, 2016
242016
Statistical cost sharing
E Balkanski, U Syed, S Vassilvitskii
Advances in Neural Information Processing Systems 30, 2017
222017
Simultaneous cake cutting
E Balkanski, S Brânzei, D Kurokawa, A Procaccia
Proceedings of the AAAI Conference on Artificial Intelligence 28 (1), 2014
212014
The FAST algorithm for submodular maximization
A Breuer, E Balkanski, Y Singer
International Conference on Machine Learning, 1134-1143, 2020
202020
The importance of communities for learning to influence
E Balkanski, N Immorlica, Y Singer
Advances in Neural Information Processing Systems 30, 2017
202017
The sample complexity of optimizing a convex function
E Balkanski, Y Singer
Conference on Learning Theory, 275-301, 2017
152017
Learning to optimize combinatorial functions
N Rosenfeld, E Balkanski, A Globerson, Y Singer
International Conference on Machine Learning, 4374-4383, 2018
142018
Minimizing a submodular function from samples
E Balkanski, Y Singer
Advances in Neural Information Processing Systems 30, 2017
142017
A lower bound for parallel submodular minimization
E Balkanski, Y Singer
Proceedings of the 52nd annual ACM SIGACT symposium on theory of computing …, 2020
102020
Mechanisms for fair attribution
E Balkanski, Y Singer
Proceedings of the Sixteenth ACM Conference on Economics and Computation …, 2015
92015
On the construction of substitutes
E Balkanski, R Paes Leme
Mathematics of Operations Research 45 (1), 272-291, 2020
62020
The system can't perform the operation now. Try again later.
Articles 1–20