4 papers
Certifying Confidence via Randomized Smoothing
Aounon Kumar, Alexander Levine, Soheil Feizi +1
Randomized smoothing has been shown to provide good certified-robustness guarantees for high-dimensional classification problems. It uses the probabilities of predicting the top tw…
Tight Second-Order Certificates for Randomized Smoothing
Alexander Levine, Aounon Kumar, Thomas Goldstein +1
Randomized smoothing is a popular way of providing robustness guarantees against adversarial attacks: randomly-smoothed functions have a universal Lipschitz-like bound, allowing fo…
Curse of Dimensionality on Randomized Smoothing for Certifiable Robustness
Aounon Kumar, Alexander Levine, Tom Goldstein +1
Randomized smoothing, using just a simple isotropic Gaussian distribution, has been shown to produce good robustness guarantees against -norm bounded adversaries. In this w…
On the cost of essentially fair clusterings
Ioana O. Bercea, Martin Groß, Samir Khuller +4
Clustering is a fundamental tool in data mining. It partitions points into groups (clusters) and may be used to make decisions for each point based on its group. However, this proc…