← Search

Hadi Salman

17 accepted papers

2023

A Data-Based Perspective on Transfer Learning

CVPR 2023poster

It is commonly believed that more pre-training data leads to better transfer learning performance. However, recent evidence suggests that removing data from the source dataset can actually help too. In this work, we present a framework for probing the impact of the source dataset's composition on tr…

2023

FFCV: Accelerating Training by Removing Data Bottlenecks

CVPR 2023poster

We present FFCV, a library for easy, fast, resource-efficient training of machine learning models. FFCV speeds up model training by eliminating (often subtle) data bottlenecks from the training process. In particular, we combine techniques such as an efficient file storage format, caching, data pre-…

2023

Raising the Cost of Malicious AI-Powered Image Editing

ICML 2023oral

We present an approach to mitigating the risks of malicious image editing posed by large diffusion models. The key idea is to immunize images so as to make them resistant to manipulation by these models. This immunization relies on injection of imperceptible adversarial perturbations designed to dis…

2023

Rethinking Backdoor Attacks

ICML 2023poster

In a *backdoor attack*, an adversary inserts maliciously constructed backdoor examples into a training set to make the resulting model vulnerable to manipulation. Defending against such attacks involves viewing inserted examples as outliers in the training set and using techniques from robust statis…

Cited by 22SourcePDFScholar
2022

3DB: A Framework for Debugging Computer Vision Models

NeurIPS 2022accept

We introduce 3DB: an extendable, unified framework for testing and debugging vision models using photorealistic simulation. We demonstrate, through a wide range of use cases, that 3DB allows users to discover vulnerabilities in computer vision systems and gain insights into how models make decision…

2022

Missingness Bias in Model Debugging

ICLR 2022poster

Missingness, or the absence of features from an input, is a concept fundamental to many model debugging tools. However, in computer vision, pixels cannot simply be removed from an image. One thus tends to resort to heuristics such as blacking out pixels, which may in turn introduce bias into the deb…

2021

Unadversarial Examples: Designing Objects for Robust Vision

NeurIPS 2021poster

We study a class of computer vision settings wherein one can modify the design of the objects being recognized. We develop a framework that leverages this capability---and deep networks' unusual sensitivity to input perturbations---to design ``robust objects,'' i.e., objects that are explicitly opti…

Cited by 58SourcePDFScholar
2020

Denoised Smoothing: A Provable Defense for Pretrained Classifiers

NeurIPS 2020poster

We present a method for provably defending any pretrained image classifier against $\ell_p$ adversarial attacks. This method, for instance, allows public vision API providers and users to seamlessly convert pretrained non-robust classification services into provably robust ones. By prepending a cust…

2020

Do Adversarially Robust ImageNet Models Transfer Better?

NeurIPS 2020oral

Transfer learning is a widely-used paradigm in deep learning, where models pre-trained on standard datasets can be efficiently adapted to downstream tasks. Typically, better pre-trained models yield better transfer results, suggesting that initial accuracy is a key aspect of transfer learning perfor…

2020

Randomized Smoothing of All Shapes and Sizes

ICML 2020poster

Randomized smoothing is the current state-of-the-art defense with provable robustness against $\ell_2$ adversarial attacks. Many works have devised new randomized smoothing schemes for other metrics, such as $\ell_1$ or $\ell_\infty$; however, substantial effort was needed to derive such new guarant…

2019

A Convex Relaxation Barrier to Tight Robustness Verification of Neural Networks

NeurIPS 2019poster

Verification of neural networks enables us to gauge their robustness against adversarial attacks. Verification algorithms fall into two categories: exact verifiers that run in exponential time and relaxed verifiers that are efficient but incomplete. In this paper, we unify all existing LP-relaxed ve…

2019

Provably Robust Deep Learning via Adversarially Trained Smoothed Classifiers

NeurIPS 2019spotlight

Recent works have shown the effectiveness of randomized smoothing as a scalable technique for building neural network-based classifiers that are provably robust to $\ell_2$-norm adversarial perturbations. In this paper, we employ adversarial training to improve the performance of randomized smoothin…

2018

A Real-time Augmented Reality Surgical System for Overlaying Stiffness Information

RSS 2018poster

We describe a surgical system that autonomously searches for tumors and dynamically displays a computer graphic model of them super-imposed on the organ (or in our case, phantom). Once localized, the phantom is tracked in real time and augmented with overlaid stiffness information in 3D. We believe…

Cited by 7SourcePDFScholar
2018

Stabilize an Unsupervised Feature Learning for LiDAR-based Place Recognition

IROS 2018poster

Place recognition is one of the major challenges for the LiDAR-based effective localization and mapping task. Traditional methods are usually relying on geometry matching to achieve place recognition, where a global geometry map need to be restored. In this paper, we accomplish the place recognition…

Cited by 21SourceScholar
2018

Trajectory-Optimized Sensing for Active Search of Tissue Abnormalities in Robotic Surgery

ICRA 2018poster

In this work, we develop an approach for guiding robots to automatically localize and find the shapes of tumors and other stiff inclusions present in the anatomy. Our approach uses Gaussian processes to model the stiffness distribution and active learning to direct the palpation path of the robot. T…

Cited by 27SourceScholar
2017

Ergodic coverage in constrained environments using stochastic trajectory optimization

IROS 2017poster

In search and surveillance applications in robotics, it is intuitive to spatially distribute robot trajectories with respect to the probability of locating targets in the domain. Ergodic coverage is one such approach to trajectory planning in which a robot is directed such that the percentage of tim…

Cited by 70SourcecodeScholar