activity
20172021
most citedOn Adversarial Bias and the Robustness of Fair Machine Learning

37 citations · 103 across the 10 of their papers we have counts for

collaborators
Showing 2020Show all

5 papers · 1 filter

cs.LG2020

Trace-Norm Adversarial Examples

Ehsan Kazemi, Thomas Kerdreux, Liqiang Wang

White box adversarial perturbations are sought via iterative optimization algorithms most often minimizing an adversarial loss on a neighborhood of the original image, the so…

stat.ML202037 cited

On Adversarial Bias and the Robustness of Fair Machine Learning

Hongyan Chang, Ta Duy Nguyen, Sasi Kumar Murakonda +2

Optimizing prediction accuracy can come at the expense of fairness. Towards minimizing discrimination against a group, fair machine learning algorithms strive to equalize the behav…

cs.LG20203 cited

Submodular Maximization Through Barrier Functions

Ashwinkumar Badanidiyuru, Amin Karbasi, Ehsan Kazemi +1

In this paper, we introduce a novel technique for constrained submodular maximization, inspired by barrier functions in continuous optimization. This connection not only improves t…

cs.LG202016 cited

Regularized Submodular Maximization at Scale

Ehsan Kazemi, Shervin Minaee, Moran Feldman +1

In this paper, we propose scalable methods for maximizing a regularized submodular function expressed as the difference between a monotone submodular function an…

cs.DS20206 cited

Streaming Submodular Maximization under a -Set System Constraint

Ran Haba, Ehsan Kazemi, Moran Feldman +1

In this paper, we propose a novel framework that converts streaming algorithms for monotone submodular maximization into streaming algorithms for non-monotone submodular maximizati…