12 citations · 64 across the 17 of their papers we have counts for
4 papers · 1 filter
Computational Concentration of Measure: Optimal Bounds, Reductions, and More
Omid Etesami, Saeed Mahloujifar, Mohammad Mahmoody
Product measures of dimension are known to be concentrated in Hamming distance: for any set in the product space of probability , a random point in the space, with proba…
Lower Bounds for Adversarially Robust PAC Learning
Dimitrios I. Diochnos, Saeed Mahloujifar, Mohammad Mahmoody
In this work, we initiate a formal study of probably approximately correct (PAC) learning under evasion attacks, where the adversary's goal is to \emph{misclassify} the adversarial…
Empirically Measuring Concentration: Fundamental Limits on Intrinsic Robustness
Saeed Mahloujifar, Xiao Zhang, Mohammad Mahmoody +1
Many recent works have shown that adversarial examples that fool classifiers can be found by minimally perturbing a normal input. Recent theoretical results, starting with Gilmer e…
Adversarially Robust Learning Could Leverage Computational Hardness
Sanjam Garg, Somesh Jha, Saeed Mahloujifar +1
Over recent years, devising classification algorithms that are robust to adversarial perturbations has emerged as a challenging problem. In particular, deep neural nets (DNNs) seem…