67 citations · 323 across the 25 of their papers we have counts for
25 papers
Maximization of Approximately Submodular Functions
Thibaut Horel, Yaron Singer
We study the problem of maximizing a function that is approximately submodular under a cardinality constraint. Approximate submodularity implicitly appears in a wide range of appli…
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…
An Optimal Elimination Algorithm for Learning a Best Arm
Avinatan Hassidim, Ron Kupfer, Yaron Singer
We consider the classic problem of -PAC learning a best arm where the goal is to identify with confidence an arm whose mean is an -approximation to that of the high…
Causal Mediation Analysis for Interpreting Neural NLP: The Case of Gender Bias
Jesse Vig, Sebastian Gehrmann, Yonatan Belinkov +6
Common methods for interpreting neural models in natural language processing typically examine either their structure or their behavior, but not both. We propose a methodology grou…
Robustness from Simple Classifiers
Sharon Qian, Dimitris Kalimeris, Gal Kaplun +1
Despite the vast success of Deep Neural Networks in numerous application domains, it has been shown that such models are not robust i.e., they are vulnerable to small adversarial p…