. 2019. “An Exponential Speedup in Parallel Running Time for Submodular Maximization without Loss in Approximation.” In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA) 2019 . Download
Balkanski, Eric
. 2018. “Approximation Guarantees for Adaptive Sampling.” In Proceedings of the 35th International Conference on Machine Learning (ICML 2018).
. 2018. “Non-monotone Submodular Maximization in Exponentially Fewer Iterations.” In Proceedings of the Conference on Neural Information Processing Systems (NIPS) 2018.
. 2018. “The Adaptive Complexity of Maximizing a Submodular Function.” In Proceedings of the ACM Symposium on the Theory of Computation (STOC) 2018 . Download
. 2018. “Learning to Optimize Combinatorial Functions.” In Proceedings of the 35th International Conference on Machine Learning (ICML 2018). Download
. 2017. “The Importance of Communities for Learning to Influence.” In Proceedings of the Conference on Neural Information Processing Systems (NIPS) 2017. Download
. 2017. “Minimizing a Submodular Function from Samples.” In Proceedings of the Conference on Neural Information Processing Systems (NIPS) 2017. Download
. 2017. “The Sample Complexity of Optimizing a Convex Function.” In Proc. of the Conference on Learning Theory (COLT-17). Download
. 2017. “The Limitations of Optimization from Samples.” In ACM Symposium on the Theory of Computing (STOC 2017). Download
. 2016. “The Power of Optimization from Samples.” In Proceedings of the Conference on Neural Information Processing Systems (NIPS) 2016. Download
. 2016. “Learning Sparse Combinatorial Representations viaTwo-stage Submodular Maximization.” In International Conference of Machine Learning (ICML) , Pp. 2207-2216. Download
. 2015. “Mechanisms for Fair Attribution.” In Proceedings of the ACM Conference on Economics and Computation (EC) 2015, Pp. 529-546. Download