Robust CLIP improves vision models' resistance to attacks.
problem Vulnerability of vision models to adversarial attacks.
method Unsupervised adversarial fine-tuning of CLIP.
result Robust CLIP prevents stealth attacks on vision models.
ADAPT improves robustness of Vision Transformers without full model fine-tuning.
problem Vulnerability of Vision Transformers to adversarial attacks.
method Parameter-efficient prompt tuning with ADAPT framework for adaptive adversarial training.
result ADAPT achieves robust accuracy of ~40% w.r.t. SOTA methods using only ~1% of the parameters.
Introduces PCG for better counterfactual explanations in vision models.
problem Ambiguity in latent-space optimization methods for counterfactual explanations.
method Constructs counterfactuals by tracing geodesics under a perceptually Riemannian metric.
result PCG outperforms baselines and reveals hidden failure modes.
3DB framework tests and debugs computer vision models using photorealistic simulation.
problem Discovering vulnerabilities and understanding model decision-making in computer vision systems.
method Unified framework using photorealistic simulation to test and debug vision models.
result Insights generated by 3DB transfer to the physical world, enabling robustness analysis.
The NIPS 2018 Adversarial Vision Challenge is a competition to facilitate measurable progress towards robust machine vision models and more generally applicable adversarial attacks. This document is an updated version of our competition proposal that was accepted in the competition track of 32nd Conference on Neural In…
AI models aligned with human vision perform well on few data tasks.
problem Few-shot learning performance with limited data.
method Information-theoretic analysis and empirical testing of 491 models.
result Highly aligned models show better robustness to attacks and domain shifts.
Unsupervised learning techniques in computer vision often require learning latent representations, such as low-dimensional linear and non-linear subspaces. Noise and outliers in the data can frustrate these approaches by obscuring the latent spaces. Our main goal is deeper understanding and new development of robust ap…
New mechanisms from primate vision improve neural network robustness.
problem Demonstrating robust neural networks to small adversarial perturbations.
method Investigated two biologically plausible mechanisms: non-uniform retina sampling and receptive field diversity.
result Non-uniform retina sampling and receptive field diversity improve adversarial robustness.
Improved model robustness against corruptions using online adaptation.
problem Machine vision models' vulnerability to image corruptions like blurring or compression artefacts.
method Using corrupted images' statistics for unsupervised online adaptation to improve robustness.
result ResNet-50 achieves 62.2% mCE on ImageNet-C with adaptation, improving from 76.7% without.
Evaluates deep learning models in histopathology for robustness and classification strategies.
problem Lack of comprehensive evaluation of histopathology models beyond accuracy.
method Developed a new methodology to evaluate models on five histopathology datasets, including vision transformers and CNNs.
result Identified insights into cancer classification strategies and robustness against stain variations.
Achieving robustness to distributional shift is a longstanding and challenging goal of computer vision. Data augmentation is a commonly used approach for improving robustness, however robustness gains are typically not uniform across corruption types. Indeed increasing performance in the presence of random noise is oft…
This paper bridges outlier-robust estimation in robotics and computer vision with robust statistics.
problem Outlier-robust estimation for geometric perception in robotics and computer vision.
method Adapting and extending robust linear regression and list-decodable regression to non-convex domains and vector-valued measurements.
result Performance guarantees for modern estimation algorithms in the presence of outliers.
Motivated by vision tasks such as robust face and object recognition, we consider the following general problem: given a collection of low-dimensional linear subspaces in a high-dimensional ambient (image) space and a query point (image), efficiently determine the nearest subspace to the query in ℓ1 distance. We …
The paper investigates AI robustness through experiments and statistical analysis.
problem Inaccurate AI predictions can lead to safety and adoption issues.
method Design of experiments framework to study AI classification robustness.
result AI algorithms' robustness is influenced by various factors.
Develops a robust multiclass classification method for deep image classifiers.
problem Tackles data contamination and robustness to outliers in deep image classifiers.
method Uses Distributionally Robust Optimization (DRO) with Wasserstein metric ambiguity sets and regularized learning.
result Reduces test error rate by up to 83.5% and loss by up to 91.3% in image classification tasks.
Deep Neural Networks(DNN) have excessively advanced the field of computer vision by achieving state of the art performance in various vision tasks. These results are not limited to the field of vision but can also be seen in speech recognition and machine translation tasks. Recently, DNNs are found to poorly fail when …
CViT learns complex physical systems using vision transformer techniques.
problem Learning maps between infinite-dimensional function spaces in scientific machine learning.
method Combines vision transformer encoder, grid-based coordinate embedding, and cross-attention mechanism.
result Achieves state-of-the-art performance on multiple benchmarks, often surpassing larger models.
Noisy Feature Mixup improves model robustness with noise-perturbed convex combinations.
problem Improving model robustness against data perturbations.
method Noise-perturbed convex combinations of pairs of data points in input and feature space.
result Improved model robustness and favorable trade-offs between accuracy and robustness.
Vision transformers benefit from non-smooth components in adaptation.
problem Understanding the role of non-smoothness in vision transformer adaptation.
method Theoretical analysis and extensive experiments on large-scale vision transformers.
result High plasticity of attention modules and feedforward layers leads to better finetuning performance.
This paper surveys black-box attacks on computer vision models.
problem Real-life adversarial attacks on deep learning models.
method Comprehensive comparative study of attacks and defenses.
result Significant amount of research on reliability of models.
This survey presents a review of state-of-the-art deep neural network architectures, algorithms, and systems in vision and speech applications. Recent advances in deep artificial neural network algorithms and architectures have spurred rapid innovation and development of intelligent vision and speech systems. With avai…
Paper presents certified defenses against adversarial patch attacks.
problem Certified defenses against adversarial patch attacks are needed.
method Proposes the first certified defense and faster training methods.
result Demonstrates robustness transfer across different patch shapes.
Image classifiers are sensitive to small changes, affecting most images in a class.
problem Sensitivity of image classifiers to small perturbations.
method Demonstrated sensitivity for any classifier over images, showing that for most classes, a tiny perturbation can change the classification of a majority of images.
result Image classifiers are sensitive to small perturbations, affecting most images in a class.
While deep neural networks have become the go-to approach in computer vision, the vast majority of these models fail to properly capture the uncertainty inherent in their predictions. Estimating this predictive uncertainty can be crucial, for example in automotive applications. In Bayesian deep learning, predictive unc…
MoreauGrad interprets neural nets robustly and sparsely.
problem Lack of robustness and sparsity in gradient-based interpretation methods.
method Moreau envelope for smooth and robust interpretation, combined with L1 regularization for sparsity.
result MoreauGrad provides a smooth, robust, and sparse explanation of neural nets.
Anomaly Awareness detects anomalies in particle physics and computer vision.
problem Detect anomalies in complex data sets.
method Modifies cost function to learn normal events and anomalies.
result Effective at identifying new anomalies not previously seen.
CLIP models robustness to spurious features is re-evaluated using a new dataset.
problem Existing robustness tests of CLIP models may not fully reflect their performance on spurious features.
method Crafted a new dataset (CounterAnimal) to reveal CLIP models' reliance on realistic spurious features.
result CLIP models are robust to spurious features learned from their training data, not ImageNet.
Paper uses 'manifold attack' to improve model accuracy and robustness.
problem Improving model performance with limited training data and large model parameters.
method Enforces manifold preservation from original data into latent space using adversarial learning.
result Improves accuracy rate and robustness to adversarial examples.
CNNs encode data augmentation transformations, especially in early layers.
problem Whether neural network features encode data augmentation transformations.
method Systematic approach using pre-trained vision models to predict augmentation transformations.
result Neural network features encode data augmentation transformations, especially in early layers.
Deep Networks have been shown to provide state-of-the-art performance in many machine learning challenges. Unfortunately, they are susceptible to various types of noise, including adversarial attacks and corrupted inputs. In this work we introduce a formal definition of robustness which can be viewed as a localized Lip…
MPT improves CNN and energy-based models' OOD detection and generalization.
problem Challenging out-of-distribution detection in computer vision.
method Applying Maximum Probability Theorem as a regularization scheme in CNN and energy-based models.
result MPT-based regularization strategy stabilizes and improves generalization and robustness of base models.
Proposes new convex relaxations for certifying spatial robustness of neural networks.
problem Lack of provable guarantees for robustness against vector field transformations.
method Novel convex relaxations for certifying robustness against vector field transformations.
result First time providing a certificate of robustness against vector field transformations.
Motivated by vision tasks such as robust face and object recognition, we consider the following general problem: given a collection of low-dimensional linear subspaces in a high-dimensional ambient (image) space, and a query point (image), efficiently determine the nearest subspace to the query in ℓ1 distance. In…
Scene understanding and semantic segmentation are at the core of many computer vision tasks, many of which, involve interacting with humans in potentially dangerous ways. It is therefore paramount that techniques for principled design of robust models be developed. In this paper, we provide analytic and empirical evide…
Robust PCA has drawn significant attention in the last decade due to its success in numerous application domains, ranging from bio-informatics, statistics, and machine learning to image and video processing in computer vision. Robust PCA and its variants such as sparse PCA and stable PCA can be formulated as optimizati…
This paper surveys algorithmic advancements in Optimal Transport with applications in machine learning.
problem Quantifying differences between distributions in various fields.
method Examines classical and modern computational techniques, including Sinkhorn iterations and primal-dual strategies.
result Highlights the robustness and scalability of OT algorithms in high-dimensional problems.
New method improves robust low-rank matrix completion for computer vision.
problem Robust low-rank matrix completion for partially observed data.
method Formulated as a nonsmooth Riemannian optimization problem over Grassmann manifold, solved with an alternating manifold proximal gradient continuation method.
result Demonstrated advantages over existing approaches in background extraction from surveillance videos.
We present a generalization of the Cauchy/Lorentzian, Geman-McClure, Welsch/Leclerc, generalized Charbonnier, Charbonnier/pseudo-Huber/L1-L2, and L2 loss functions. By introducing robustness as a continuous parameter, our loss function allows algorithms built around robust loss minimization to be generalized, which imp…
Enhances SSL methods with depth cues for better image understanding.
problem Lack of depth cues in 2D image pixel maps limits SSL performance.
method Integrates depth signals from a pretrained monocular RGB-to-depth model into contrastive learning frameworks.
result Improves SSL methods' robustness and generalization with depth signals.
Plex improves model reliability across vision and language tasks.
problem Improving model reliability in diverse decision-making tasks involving uncertainty and adaptation.
method Developed ViT-Plex and T5-Plex pretrained model extensions to evaluate and improve reliability across 40 datasets.
result Plex greatly improves state-of-the-art across reliability tasks, simplifying evaluation and performance.
An image-driven approach for time series forecasting.
problem Time-series forecasting as a computer vision task.
method Capture input data as an image and train a model to produce the subsequent image.
result Our method outperforms various baselines, including ARIMA, using image-based evaluation metrics.
This work improves certifiably robust models by distilling knowledge from adversarially robust teachers.
problem Certifiably robust models suffer from poor standard performance.
method Knowledge distillation from adversarially robust teachers to improve standard performance.
result Distillation from adversarially robust teachers consistently improves certified training performance.
PACE explains ViTs by modeling patch-level concept distributions, surpassing existing methods.
problem Lack of trustworthy post-hoc explanations for Vision Transformers (ViTs)
method Variational Bayesian explanation framework (PACE)
result PACE surpasses state-of-the-art methods in meeting desiderata for ViT explanations.
While great progress has been made at making neural networks effective across a wide range of visual tasks, most models are surprisingly vulnerable. This frailness takes the form of small, carefully chosen perturbations of their input, known as adversarial examples, which represent a security threat for learned vision …
We revisit the Blind Deconvolution problem with a focus on understanding its robustness and convergence properties. Provable robustness to noise and other perturbations is receiving recent interest in vision, from obtaining immunity to adversarial attacks to assessing and describing failure modes of algorithms in missi…
A robust aggregation method improves federated learning's accuracy in corrupted settings.
problem Making federated learning robust to corrupted updates from devices.
method Robust aggregation oracle based on geometric median for constant iterations of non-robust averaging.
result The robust aggregation oracle outperforms classical methods in high corruption levels.
We investigate the robustness properties of image recognition models equipped with two features inspired by human vision, an explicit episodic memory and a shape bias, at the ImageNet scale. As reported in previous work, we show that an explicit episodic memory improves the robustness of image recognition models agains…
Convolutional neural networks (CNNs) are known for their good performance and generalization in vision-related tasks and have become state-of-the-art in both application and research-based domains. However, just like other neural network models, they suffer from a susceptibility to noise and adversarial attacks. An adv…