← Search

Tom Goldstein

141 accepted papers

2026

A Fictional Q&A Dataset for Studying Memorization and Knowledge Acquisition

ICLR 2026poster

When language models are trained on textual data, they acquire both knowledge about the structure of language as well as knowledge of facts about the world. At inference time, their knowledge of facts can be leveraged to solve interesting problems and perform useful knowledge work for users. It is w…

Cited by 0SourcecodeScholar
2026

Antidistillation Fingerprinting

ICML 2026poster

Model distillation enables efficient emulation of frontier large language models (LLMs), creating a need for robust mechanisms to detect when a third-party student model has trained on a teacher model's outputs. However, existing fingerprinting techniques that could be used to detect such distillati…

Cited by 0SourceScholar
2026

DynaGuard: A Dynamic Guardian Model With User-Defined Policies

ICLR 2026poster

Guardian models play a crucial role in ensuring the safety and ethical behavior of user-facing AI applications by enforcing guardrails and detecting harmful content. While standard guardian models are limited to predefined, static harm categories, we introduce DynaGuard, a suite of dynamic guardian…

Cited by 0SourcecodeScholar
2026

Identifying and Evaluating Inactive Heads in Pretrained LLMs

ICLR 2026poster

Attention is foundational to large language models (LLMs), enabling different heads to have diverse focus on relevant input tokens. However, learned behaviors like attention sinks, where the first token receives the most attention despite limited semantic importance, suggest some heads may be inacti…

Cited by 0SourceScholar
2026

SpeeDe3DGS: Speedy Deformable 3D Gaussian Splatting with Temporal Pruning and Motion Grouping

CVPR 2026

Dynamic extensions of 3D Gaussian Splatting (3DGS) achieve high-quality reconstructions through neural motion fields, but per-Gaussian neural inference makes these models computationally expensive. Building on DeformableGS, we introduce Speedy Deformable 3D Gaussian Splatting (SpeeDe3DGS), which bri

Cited by 0SourcecodeScholar
2026

SplatSuRe: Selective Super-Resolution for Multi-view Consistent 3D Gaussian Splatting

CVPR 2026

3D Gaussian Splatting (3DGS) enables high-quality novel view synthesis, motivating interest in generating higher-resolution renders than those available during training. A natural strategy is to apply super-resolution (SR) to low-resolution (LR) input views, but independently enhancing each image in

Cited by 0SourcecodeScholar
2026

Zebra-CoT: A Dataset for Interleaved Vision-Language Reasoning

ICLR 2026poster

Humans often rely on visual aids, such as diagrams or sketches, when tackling complex problems. Teaching multimodal models to adopt similar strategies, a process known as Visual Chain of Thought (visual CoT), is much more difficult. The main challenges are: (1) weak performance of off-the-shelf visu…

Cited by 0SourcecodeScholar
2025

A Technical Report on “Erasing the Invisible”: The 2024 NeurIPS Competition on Stress Testing Image Watermarks

NeurIPS 2025poster

AI-generated images have become pervasive, raising critical concerns around content authenticity, intellectual property, and the spread of misinformation. Invisible watermarks offer a promising solution for identifying AI-generated images, preserving content provenance without degrading visual quali…

Cited by 0SourceScholar
2025

ARGUS: Hallucination and Omission Evaluation in Video-LLMs

ICCV 2025poster

Video large language models have not yet been widely deployed, largely due to their tendency to hallucinate. Typical benchmarks for Video-LLMs rely simply on multiple choice questions. Unfortunately, VideoLLMs hallucinate far more aggressively on freeform text generation tasks like video captioning…

2025

Can Watermarking Large Language Models Prevent Copyrighted Text Generation and Hide Training Data?

AAAI 2025technical

Large Language Models (LLMs) have demonstrated impressive capabilities in generating diverse and contextually rich text. However, concerns regarding copyright infringement arise as LLMs may inadvertently produce copyrighted material. In this paper, we first investigate the effectiveness of watermark…

Cited by 4SourcePDFScholar
2025

Dense Backpropagation Improves Training for Sparse Mixture-of-Experts

NeurIPS 2025poster

Mixture of Experts (MoE) pretraining is more scalable than dense Transformer pretraining, because MoEs learn to route inputs to a sparse set of their feedforward parameters. However, this means that MoEs only receive a sparse backward update, leading to training instability and suboptimal performanc…

Cited by 0SourcecodeScholar
2025

Efficient Fine-Tuning and Concept Suppression for Pruned Diffusion Models

CVPR 2025poster

Recent advances in diffusion generative models have yielded remarkable progress. While the quality of generated content continues to improve, these models have grown considerably in size and complexity. This increasing computational burden poses significant challenges, particularly in resource-const…

2025

Enhancing Visual-Language Modality Alignment in Large Vision Language Models via Self-Improvement

NAACL 2025findings

Large vision-language models (LVLMs) have achieved impressive results in visual question-answering and reasoning tasks through vision instruction tuning on specific datasets. However, there remains significant room for improvement in aligning visual and language modalities. Existing methods often de…

2025

FineGRAIN: Evaluating Failure Modes of Text-to-Image Models with Vision Language Model Judges

NeurIPS 2025spotlight

Text-to-image (T2I) models are capable of generating visually impressive images, yet they often fail to accurately capture specific attributes in user prompts, such as the correct number of objects with the specified colors. The diversity of such errors underscores the need for a hierarchical evalua…

Cited by 0SourceScholar
2025

Gemstones: A Model Suite for Multi-Faceted Scaling Laws

NeurIPS 2025poster

Scaling laws are typically fit using a family of models with a narrow range of frozen hyperparameter choices. In this work we study scaling laws using multiple architectural shapes and hyperparameter choices, highlighting their impact on resulting prescriptions. As a primary artifact of our researc…

Cited by 0SourcecodeScholar
2025

LLM-Generated Passphrases That Are Secure and Easy to Remember

NAACL 2025findings

Automatically generated passwords and passphrases are a cornerstone of IT security. Yet, these passphrases are often hard to remember and see only limited adoption. In this work, we use large language models to generate passphrases with rigorous security guarantees via the computation of the entropy…

2025

LiveBench: A Challenging, Contamination-Limited LLM Benchmark

ICLR 2025spotlight

Test set contamination, wherein test data from a benchmark ends up in a newer model's training set, is a well-documented obstacle for fair LLM evaluation and can quickly render benchmarks obsolete. To mitigate this, many recent benchmarks crowdsource new prompts and evaluations from human or LLM jud…

2025

PUP 3D-GS: Principled Uncertainty Pruning for 3D Gaussian Splatting

CVPR 2025poster

Recent advances in novel view synthesis have enabled real-time rendering speeds with high reconstruction accuracy. 3D Gaussian Splatting (3D-GS), a foundational point-based parametric 3D scene representation, models scenes as large sets of 3D Gaussians. However, complex scenes can consist of million…

2025

Quantifying Cross-Modality Memorization in Vision-Language Models

NeurIPS 2025poster

Understanding what and how neural networks memorize during training is crucial, both from the perspective of unintentional memorization of potentially sensitive information and from the standpoint of effective knowledge acquisition for real-world, knowledge-intensive tasks. While previous studies pr…

Cited by 0SourceScholar
2025

Scaling up Test-Time Compute with Latent Reasoning: A Recurrent Depth Approach

NeurIPS 2025spotlight

We study a novel language model architecture that is capable of scaling test-time computation by implicitly reasoning in latent space. Our model works by iterating a recurrent block, thereby unrolling to arbitrary depth at test-time. This stands in contrast to mainstream reasoning models that scale…

Cited by 0SourcecodeScholar
2025

Speedy-Splat: Fast 3D Gaussian Splatting with Sparse Pixels and Sparse Primitives

CVPR 2025poster

3D Gaussian Splatting (3D-GS) is a recent 3D scene reconstruction technique that enables real-time rendering of novel views by modeling scenes as parametric point clouds of differentiable 3D Gaussians. However, its rendering speed and model size still present bottlenecks, especially in resource-cons…

2025

The Common Pile v0.1: An 8TB Dataset of Public Domain and Openly Licensed Text

NeurIPS 2025poster

Large language models (LLMs) are typically trained on enormous quantities of unlicensed text, a practice that has led to scrutiny due to possible intellectual property infringement and ethical concerns. Training LLMs on openly licensed text presents a first step towards addressing these issues, but…

Cited by 0SourceScholar
2025

Zero-Shot Vision Encoder Grafting via LLM Surrogates

ICCV 2025poster

Vision language models (VLMs) typically pair a modestly sized vision encoder with a large language model (LLM), e.g., Llama-70B, making the decoder the primary computational burden during training.To reduce costs, a promising strategy is to first train the vision encoder using a small language model…

2024

Be like a Goldfish, Don't Memorize! Mitigating Memorization in Generative LLMs

NeurIPS 2024poster

Large language models can memorize and repeat their training data, causing privacy and copyright risks. To mitigate memorization, we introduce a subtle modification to the next-token training objective that we call the goldfish loss. During training, a randomly sampled subsets of tokens are excluded…

2024

CALVIN: Improved Contextual Video Captioning via Instruction Tuning

NeurIPS 2024poster

The recent emergence of powerful Vision-Language models (VLMs) has significantly improved image captioning. Some of these models are extended to caption videos as well. However, their capabilities to understand complex scenes are limited, and the descriptions they provide for scenes tend to be overl…

Cited by 0SourcePDFScholar
2024

Easy2Hard-Bench: Standardized Difficulty Labels for Profiling LLM Performance and Generalization

NeurIPS 2024poster

Despite the abundance of datasets available for assessing large language models (LLMs), the scarcity of continuous and reliable difficulty labels for individual data points, in most cases, curtails their capacity to benchmark model generalization performance across different levels of complexity. Ad…

Cited by 0SourcePDFScholar
2024

FedAQT: Accurate Quantized Training with Federated Learning

ICASSP 2024accepted

Federated learning (FL) has been widely used to train neural networks with the decentralized training procedure where data is only accessed on clients’ devices for privacy preservation. However, the limited computation resources on clients’ devices prevent FL of large models. To overcome the constra…

Cited by 0SourceScholar
2024

Hierarchical Point Attention for Indoor 3D Object Detection

ICRA 2024poster

3D object detection is an essential vision technique for various robotic systems, such as augmented reality and domestic robots. Transformers as versatile network architectures have recently seen great success in 3D point cloud object detection. However, the lack of hierarchy in a plain transformer…

Cited by 1SourceScholar
2024

InstructZero: Efficient Instruction Optimization for Black-Box Large Language Models

ICML 2024poster

Large language models (LLMs) are instruction followers but the performance varies under different instructions. It is challenging to create the best instruction, especially for black-box LLMs on which backpropagation is forbidden. Instead of directly optimizing the discrete instruction, we optimize…

2024

Investigating Style Similarity in Diffusion Models

ECCV 2024poster

"Generative models are now widely used by graphic designers and artists. Prior works have shown that these models remember and often replicate content from their training data during generation. Hence as their proliferation increases, it has become important to perform a database search to determine…

Cited by 0SourcePDFScholar
2024

NEFTune: Noisy Embeddings Improve Instruction Finetuning

ICLR 2024poster

We show that language model finetuning can be improved, sometimes dramatically, with a simple augmentation. NEFTune adds noise to the embedding vectors during training. Standard finetuning of LLaMA-2-7B using Alpaca achieves $29.79$\% on AlpacaEval, which rises to $64.69$\% using noisy embeddings.…

2024

ODIN: Disentangled Reward Mitigates Hacking in RLHF

ICML 2024poster

In this work, we study the issue of reward hacking on the response length, a challenge emerging in Reinforcement Learning from Human Feedback (RLHF) on LLMs. A well-formatted, verbose but less helpful response from the LLMs can often deceive LLMs or even human evaluators and achieve high scores. The…

Cited by 57SourcePDFScholar
2024

Object Recognition as Next Token Prediction

CVPR 2024highlight

We present an approach to pose object recognition as next token prediction. The idea is to apply a language decoder that auto-regressively predicts the text tokens from image embeddings to form labels. To ground this prediction process in auto-regression we customize a non-causal attention mask for…

2024

On the Reliability of Watermarks for Large Language Models

ICLR 2024poster

As LLMs become commonplace, machine-generated text has the potential to flood the internet with spam, social media bots, and valueless content. _Watermarking_ is a simple and effective strategy for mitigating such harms by enabling the detection and documentation of LLM-generated text. Yet a crucial…

2024

Privacy Backdoors: Enhancing Membership Inference through Poisoning Pre-trained Models

NeurIPS 2024poster

It is commonplace to produce application-specific models by fine-tuning large pre-trained models using a small bespoke dataset. The widespread availability of foundation model checkpoints on the web poses considerable risks, including the vulnerability to backdoor attacks. In this paper, we unveil a…

Cited by 18SourcePDFScholar
2024

Shadowcast: Stealthy Data Poisoning Attacks Against Vision-Language Models

NeurIPS 2024poster

Vision-Language Models (VLMs) excel in generating textual responses from visual inputs, but their versatility raises security concerns. This study takes the first step in exposing VLMs’ susceptibility to data poisoning attacks that can manipulate responses to innocuous, everyday prompts. We introduc…

2024

Spotting LLMs With Binoculars: Zero-Shot Detection of Machine-Generated Text

ICML 2024poster

Detecting text generated by modern large language models is thought to be hard, as both LLMs and humans can exhibit a wide range of complex behaviors. However, we find that a score based on contrasting two closely related language models is highly accurate at separating human-generated and machine-g…

2024

Transformers Can Do Arithmetic with the Right Embeddings

NeurIPS 2024poster

The poor performance of transformers on arithmetic tasks seems to stem in large part from their inability to keep track of the exact position of each digit inside of a large span of digits. We mend this problem by adding an embedding to each digit that encodes its position relative to the start of t…

2024

Universal Guidance for Diffusion Models

ICLR 2024poster

Typical diffusion models are trained to accept a particular form of conditioning, most commonly text, and cannot be conditioned on other modalities without retraining. In this work, we propose a universal guidance algorithm that enables diffusion models to be controlled by arbitrary guidance modalit…

2024

WAVES: Benchmarking the Robustness of Image Watermarks

ICML 2024poster

In the burgeoning age of generative AI, watermarks act as identifiers of provenance and artificial content. We present WAVES (Watermark Analysis via Enhanced Stress-testing), a benchmark for assessing image watermark robustness, overcoming the limitations of current evaluation methods. WAVES integra…

2023

A Performance-Driven Benchmark for Feature Selection in Tabular Deep Learning

NeurIPS 2023poster

Academic tabular benchmarks often contain small sets of curated features. In contrast, data scientists typically collect as many features as possible into their datasets, and even engineer new features from existing ones. To prevent over-fitting in subsequent downstream modeling, practitioners commo…

2023

A Watermark for Large Language Models

ICML 2023oral

Potential harms of large language models can be mitigated by watermarking model output, i.e., embedding signals into generated text that are invisible to humans but algorithmically detectable from a short span of tokens. We propose a watermarking framework for proprietary language models. The waterm…

2023

Battle of the Backbones: A Large-Scale Comparison of Pretrained Models across Computer Vision Tasks

NeurIPS 2023poster

Neural network based computer vision systems are typically built on a backbone, a pretrained or randomly initialized feature extractor. Several years ago, the default option was an ImageNet-trained convolutional neural network. However, the recent past has seen the emergence of countless backbones…

2023

Canary in a Coalmine: Better Membership Inference with Ensembled Adversarial Queries

ICLR 2023top-25%

As industrial applications are increasingly automated by machine learning models, enforcing personal data ownership and intellectual property rights requires tracing training data back to their rightful owners. Membership inference algorithms approach this problem by using statistical techniques to…

2023

Cold Diffusion: Inverting Arbitrary Image Transforms Without Noise

NeurIPS 2023poster

Standard diffusion models involve an image transform -- adding Gaussian noise -- and an image restoration operator that inverts this degradation. We observe that the generative behavior of diffusion models is not strongly dependent on the choice of image degradation, and in fact, an entire family…

2023

Decepticons: Corrupted Transformers Breach Privacy in Federated Learning for Language Models

ICLR 2023poster

Privacy is a central tenet of Federated learning (FL), in which a central server trains models without centralizing user data. However, gradient updates used in FL can leak user information. While the most industrial uses of FL are for text applications (e.g. keystroke prediction), the majority of…

2023

Diffusion Art or Digital Forgery? Investigating Data Replication in Diffusion Models

CVPR 2023poster

Cutting-edge diffusion models produce images with high quality and customizability, enabling them to be used for commercial art and graphic design purposes. But do diffusion models create unique works of art, or are they replicating content directly from their training sets? In this work, we study i…

2023

Exploring and Exploiting Decision Boundary Dynamics for Adversarial Robustness

ICLR 2023poster

The robustness of a deep classifier can be characterized by its margins: the decision boundary's distances to natural data points. However, it is unclear whether existing robust training methods effectively increase the margin for each vulnerable point during training. To understand this, we propose…

2023

GOAT: A Global Transformer on Large-scale Graphs

ICML 2023poster

Graph transformers have been competitive on graph classification tasks, but they fail to outperform Graph Neural Networks (GNNs) on node classification, which is a common task performed on large-scale graphs for industrial applications. Meanwhile, existing GNN architectures are limited in their abil…

Cited by 67SourcePDFScholar
2023

Hard Prompts Made Easy: Gradient-Based Discrete Optimization for Prompt Tuning and Discovery

NeurIPS 2023poster

The strength of modern generative models lies in their ability to be controlled through prompts. Hard prompts comprise interpretable words and tokens, and are typically hand-crafted by humans. Soft prompts, on the other hand, consist of continuous feature vectors. These can be discovered using pow…

2023

How Much Data Are Augmentations Worth? An Investigation into Scaling Laws, Invariance, and Implicit Regularization

ICLR 2023poster

Despite the clear performance benefits of data augmentations, little is known about why they are so effective. In this paper, we disentangle several key mechanisms through which data augmentations operate. Establishing an exchange rate between augmented and additional real data, we find that in out-…

2023

Loss Landscapes are All You Need: Neural Network Generalization Can Be Explained Without the Implicit Bias of Gradient Descent

ICLR 2023top-25%

It is commonly believed that the implicit regularization of optimizers is needed for neural networks to generalize in the overparameterized regime. In this paper, we observe experimentally that this implicit regularization behavior is {\em generic}, i.e. it does not depend strongly on the choice of…

2023

On the Exploitability of Instruction Tuning

NeurIPS 2023poster

Instruction tuning is an effective technique to align large language models (LLMs) with human intent. In this work, we investigate how an adversary can exploit instruction tuning by injecting specific instruction-following examples into the training data that intentionally changes the model's behavi…

2023

Panning for Gold in Federated Learning: Targeted Text Extraction under Arbitrarily Large-Scale Aggregation

ICLR 2023poster

As federated learning (FL) matures, privacy attacks against FL systems in turn become more numerous and complex. Attacks on language models have progressed from recovering single sentences in simple classification tasks to recovering larger parts of user data. Current attacks against federated langu…

Cited by 13SourcePDFScholar
2023

Provable Robustness against Wasserstein Distribution Shifts via Input Randomization

ICLR 2023poster

Certified robustness in machine learning has primarily focused on adversarial perturbations with a fixed attack budget for each sample in the input distribution. In this work, we present provable robustness guarantees on the accuracy of a model under bounded Wasserstein shifts of the data distributi…

Cited by 7SourcePDFScholar
2023

STYX: Adaptive Poisoning Attacks Against Byzantine-Robust Defenses in Federated Learning

ICASSP 2023accepted

Decentralized training of machine learning models, for instance with federated learning protocols, continues to diffuse from theory toward practical applications and use cases. In federated learning (FL), a central server trains a model collaboratively with a group of users by communicating model up…

Cited by 0SourceScholar
2023

Transfer Learning with Deep Tabular Models

ICLR 2023poster

Recent work on deep learning for tabular data demonstrates the strong performance of deep tabular models, often bridging the gap between gradient boosted decision trees and neural networks. Accuracy aside, a major advantage of neural models is that they are easily fine-tuned in new domains and learn…

2023

Tree-Rings Watermarks: Invisible Fingerprints for Diffusion Images

NeurIPS 2023poster

Watermarking the outputs of generative models is a crucial technique for tracing copyright and preventing potential harm from AI-generated content. In this paper, we introduce a novel technique called Tree-Ring Watermarking that robustly fingerprints diffusion model outputs. Unlike existing methods…

Cited by 60SourcePDFScholar
2023

Understanding and Mitigating Copying in Diffusion Models

NeurIPS 2023poster

Images generated by diffusion models like Stable Diffusion are increasingly widespread. Recent works and even lawsuits have shown that these models are prone to replicating their training data, unbeknownst to the user. In this paper, we first analyze this memorization problem in text-to-image diffus…

2023

What Can We Learn from Unlearnable Datasets?

NeurIPS 2023poster

In an era of widespread web scraping, unlearnable dataset methods have the potential to protect data privacy by preventing deep neural networks from generalizing. But in addition to a number of practical limitations that make their use unlikely, we make a number of findings that call into question t…

2022

Autoregressive Perturbations for Data Poisoning

NeurIPS 2022accept

The prevalence of data scraping from social media as a means to obtain datasets has led to growing concerns regarding unauthorized use of data. Data poisoning attacks have been proposed as a bulwark against scraping, as they make data ``unlearnable'' by adding small, imperceptible perturbations. Unf…

2022

Can Neural Nets Learn the Same Model Twice? Investigating Reproducibility and Double Descent From the Decision Boundary Perspective

CVPR 2022oral

We discuss methods for visualizing neural network decision boundaries and decision regions. We use these visualizations to investigate issues related to reproducibility and generalization in neural network training. We observe that changes in model architecture (and its associate inductive bias) cau…

Cited by 80PDFcodeScholar
2022

Certified Neural Network Watermarks with Randomized Smoothing

ICML 2022spotlight

Watermarking is a commonly used strategy to protect creators’ rights to digital images, videos and audio. Recently, watermarking methods have been extended to deep learning models – in principle, the watermark should be preserved when an adversary tries to copy the model. However, in practice, water…

2022

Diurnal or Nocturnal? Federated Learning of Multi-branch Networks from Periodically Shifting Distributions

ICLR 2022poster

Federated learning has been deployed to train machine learning models from decentralized client data on mobile devices in practice. The clients available for training are observed to have periodically shifting distributions changing with the time of day, which can cause instability in training and d…

Cited by 35SourcePDFScholar
2022

Does your graph need a confidence boost? Convergent boosted smoothing on graphs with tabular node features

ICLR 2022spotlight

Many practical modeling tasks require making predictions using tabular data composed of heterogeneous feature types (e.g., text-based, categorical, continuous, etc.). In this setting boosted decision trees and related ensembling techniques generally dominate real-world applications involving iid tr…

2022

End-to-end Algorithm Synthesis with Recurrent Networks: Extrapolation without Overthinking

NeurIPS 2022accept

Machine learning systems perform well on pattern matching tasks, but their ability to perform algorithmic or logical reasoning is not well understood. One important reasoning capability is algorithmic extrapolation, in which models trained only on small/simple reasoning problems can synthesize compl…

Cited by 21SourcePDFScholar
2022

Fishing for User Data in Large-Batch Federated Learning via Gradient Magnification

ICML 2022spotlight

Federated learning (FL) has rapidly risen in popularity due to its promise of privacy and efficiency. Previous works have exposed privacy vulnerabilities in the FL pipeline by recovering user data from gradient updates. However, existing attacks fail to address realistic settings because they either…

2022

Learning Revenue-Maximizing Auctions With Differentiable Matching

AISTATS 2022poster

We propose a new architecture to approximately learn incentive compatible, revenue-maximizing auctions from sampled valuations. Our architecture uses the Sinkhorn algorithm to perform a differentiable bipartite matching which allows the network to learn strategyproof revenue-maximizing mechanisms in…

Cited by 26SourcePDFScholar
2022

Plug-In Inversion: Model-Agnostic Inversion for Vision with Data Augmentations

ICML 2022spotlight

Existing techniques for model inversion typically rely on hard-to-tune regularizers, such as total variation or feature regularization, which must be individually calibrated for each network in order to produce adequate images. In this work, we introduce Plug-In Inversion, which relies on a simple s…

2022

Robbing the Fed: Directly Obtaining Private Data in Federated Learning with Modified Models

ICLR 2022poster

Federated learning has quickly gained popularity with its promises of increased user privacy and efficiency. Previous works have shown that federated gradient updates contain information that can be used to approximately recover user data in some situations. These previous attacks on user privacy…

2022

Robust Optimization As Data Augmentation for Large-Scale Graphs

CVPR 2022poster

Data augmentation helps neural networks generalize better by enlarging the training set, but it remains an open question how to effectively augment graph data to enhance the performance of GNNs (Graph Neural Networks). While most existing graph regularizers focus on manipulating graph topological st…

Cited by 122PDFcodeScholar
2022

Sleeper Agent: Scalable Hidden Trigger Backdoors for Neural Networks Trained from Scratch

NeurIPS 2022accept

As the curation of data for machine learning becomes increasingly automated, dataset tampering is a mounting threat. Backdoor attackers tamper with training data to embed a vulnerability in models that are trained on that data. This vulnerability is then activated at inference time by placing a "tr…

2022

Stochastic Training is Not Necessary for Generalization

ICLR 2022poster

It is widely believed that the implicit regularization of SGD is fundamental to the impressive generalization behavior we observe in neural networks. In this work, we demonstrate that non-stochastic full-batch training can achieve comparably strong performance to SGD on CIFAR-10 using modern archit…

2022

Test-Time Prompt Tuning for Zero-Shot Generalization in Vision-Language Models

NeurIPS 2022accept

Pre-trained vision-language models (e.g., CLIP) have shown promising zero-shot generalization in many downstream tasks with properly designed text prompts. Instead of relying on hand-engineered prompts, recent works learn prompts using the training data from downstream tasks. While effective, traini…

2022

The Close Relationship Between Contrastive Learning and Meta-Learning

ICLR 2022poster

Contrastive learning has recently taken off as a paradigm for learning from unlabeled data. In this paper, we discuss the close relationship between contrastive learning and meta-learning under a certain task distribution. We complement this observation by showing that established meta-learning meth…

Cited by 23SourcePDFScholar
2022

The Uncanny Similarity of Recurrence and Depth

ICLR 2022poster

It is widely believed that deep neural networks contain layer specialization, wherein networks extract hierarchical features representing edges and patterns in shallow layers and complete objects in deeper layers. Unlike common feed-forward models that have distinct filters at each layer, recurrent…

2022

Towards Transferable Adversarial Attacks on Vision Transformers

AAAI 2022technical

Vision transformers (ViTs) have demonstrated impressive performance on a series of computer vision tasks, yet they still suffer from adversarial examples. In this paper, we posit that adversarial attacks on transformers should be specially tailored for their architecture, jointly considering both pa…

2022

Where do Models go Wrong? Parameter-Space Saliency Maps for Explainability

NeurIPS 2022accept

Conventional saliency maps highlight input features to which neural network predictions are highly sensitive. We take a different approach to saliency, in which we identify and analyze the network parameters, rather than inputs, which are responsible for erroneous decisions. We first verify that ide…

2021

Adversarial Examples Make Strong Poisons

NeurIPS 2021poster

The adversarial machine learning literature is largely partitioned into evasion attacks on testing data and poisoning attacks on training data. In this work, we show that adversarial examples, originally intended for attacking pre-trained models, are even more effective for data poisoning than rece…

2021

Are Adversarial Examples Created Equal? A Learnable Weighted Minimax Risk for Robustness under Non-uniform Attacks

AAAI 2021technical

Adversarial Training is proved to be an efficient method to defend against adversarial examples, being one of the few defenses that withstand strong attacks. However, traditional defense mechanisms assume a uniform attack over the examples according to the underlying data distribution, which is appa…

Cited by 28SourcePDFScholar
2021

Can You Learn an Algorithm? Generalizing from Easy to Hard Problems with Recurrent Networks

NeurIPS 2021poster

Deep neural networks are powerful machines for visual pattern recognition, but reasoning tasks that are easy for humans may still be difficult for neural models. Humans possess the ability to extrapolate reasoning strategies learned on simple problems to solve harder examples, often by thinking for…

2021

Center Smoothing: Certified Robustness for Networks with Structured Outputs

NeurIPS 2021poster

The study of provable adversarial robustness has mostly been limited to classification tasks and models with one-dimensional real-valued outputs. We extend the scope of certifiable robustness to problems with more general and structured outputs like sets, images, language, etc. We model the output s…

2021

Data Augmentation for Meta-Learning

ICML 2021spotlight

Conventional image classifiers are trained by randomly sampling mini-batches of images. To achieve state-of-the-art performance, practitioners use sophisticated data augmentation schemes to expand the amount of training data available for sampling. In contrast, meta-learning algorithms sample suppor…

2021

Encoding Robustness to Image Style via Adversarial Feature Perturbations

NeurIPS 2021poster

Adversarial training is the industry standard for producing models that are robust to small adversarial perturbations. However, machine learning practitioners need models that are robust to other kinds of changes that occur naturally, such as changes in the style or illumination of input images. Su…

2021

GradInit: Learning to Initialize Neural Networks for Stable and Efficient Training

NeurIPS 2021poster

Innovations in neural architectures have fostered significant breakthroughs in language modeling and computer vision. Unfortunately, novel architectures often result in challenging hyper-parameter choices and training instability if the network parameters are not properly initialized. A number of ar…

2021

Gradient-Free Adversarial Training Against Image Corruption for Learning-based Steering

NeurIPS 2021poster

We introduce a simple yet effective framework for improving the robustness of learning algorithms against image corruptions for autonomous driving. These corruptions can occur due to both internal (e.g., sensor noises and hardware abnormalities) and external factors (e.g., lighting, weather, visibil…

Cited by 38SourcePDFScholar
2021

Just How Toxic is Data Poisoning? A Unified Benchmark for Backdoor and Data Poisoning Attacks

ICML 2021spotlight

Data poisoning and backdoor attacks manipulate training data in order to cause models to fail during inference. A recent survey of industry practitioners found that data poisoning is the number one concern among threats ranging from model stealing to adversarial attacks. However, it remains unclear…

2021

Long-Short Transformer: Efficient Transformers for Language and Vision

NeurIPS 2021poster

Transformers have achieved success in both language and vision domains. However, it is prohibitively expensive to scale them to long sequences such as long documents or high-resolution images, because self-attention mechanism has quadratic time and memory complexities with respect to the input seque…

2021

LowKey: Leveraging Adversarial Attacks to Protect Social Media Users from Facial Recognition

ICLR 2021poster

Facial recognition systems are increasingly deployed by private corporations, government agencies, and contractors for consumer services and mass surveillance programs alike. These systems are typically built by scraping social media profiles for user images. Adversarial perturbations have been pr…

Cited by 163SourcePDFScholar
2021

Strong Data Augmentation Sanitizes Poisoning and Backdoor Attacks Without an Accuracy Tradeoff

ICASSP 2021accepted

Data poisoning and backdoor attacks manipulate victim models by maliciously modifying training data. In light of this growing threat, a recent survey of industry professionals revealed heightened fear in the private sector regarding data poisoning. Many previous defenses against poisoning either fai…

Cited by 0SourceScholar
2021

The Intrinsic Dimension of Images and Its Impact on Learning

ICLR 2021spotlight

It is widely believed that natural image data exhibits low-dimensional structure despite the high dimensionality of conventional pixel representations. This idea underlies a common intuition for the remarkable success of deep learning in computer vision. In this work, we apply dimension estimation…

2021

VQ-GNN: A Universal Framework to Scale up Graph Neural Networks using Vector Quantization

NeurIPS 2021poster

Most state-of-the-art Graph Neural Networks (GNNs) can be defined as a form of graph convolution which can be realized by message passing between direct neighbors or beyond. To scale such GNNs to large graphs, various neighbor-, layer-, or subgraph-sampling techniques are proposed to alleviate the "…

2021

Witches' Brew: Industrial Scale Data Poisoning via Gradient Matching

ICLR 2021poster

Data Poisoning attacks modify training data to maliciously control a model trained on such data. In this work, we focus on targeted poisoning attacks which cause a reclassification of an unmodified test image and as such breach model integrity. We consider a particularly malicious poisoning attack t…

2021

WrapNet: Neural Net Inference with Ultra-Low-Precision Arithmetic

ICLR 2021poster

Low-precision neural networks represent both weights and activations with few bits, drastically reducing the cost of multiplications. Meanwhile, these products are accumulated using high-precision (typically 32-bit) additions. Additions dominate the arithmetic complexity of inference in quantized (…

Cited by 19SourcePDFScholar
2020

Adversarially Robust Few-Shot Learning: A Meta-Learning Approach

NeurIPS 2020poster

Previous work on adversarially robust neural networks for image classification requires large training sets and computationally expensive training procedures. On the other hand, few-shot learning methods are highly vulnerable to adversarial examples. The goal of our work is to produce networks whi…

2020

Adversarially robust transfer learning

ICLR 2020poster

Transfer learning, in which a network is trained on one task and re-purposed on another, is often used to produce neural network classifiers when data is scarce or full-scale training is too costly. When the goal is to produce a model that is not only accurate but also adversarially robust, data sc…

Cited by 157SourcecodeScholar
2020

BREAKING CERTIFIED DEFENSES: SEMANTIC ADVERSARIAL EXAMPLES WITH SPOOFED ROBUSTNESS CERTIFICATES

ICLR 2020poster

Defenses against adversarial attacks can be classified into certified and non-certified. Certifiable defenses make networks robust within a certain $\ell_p$-bounded radius, so that it is impossible for the adversary to make adversarial examples in the certificate bound. We present an attack that mai…

Cited by 84SourcecodeScholar
2020

Certified Data Removal from Machine Learning Models

ICML 2020poster

Good data stewardship requires removal of data at the request of the data’s owner. This raises the question if and how a trained machine-learning model, which implicitly stores information about its training data, should be affected by such a removal request. Is it possible to “remove” data from a m…

2020

Certified Defenses for Adversarial Patches

ICLR 2020poster

Adversarial patch attacks are among one of the most practical threat models against real-world computer vision systems. This paper studies certified and empirical defenses against patch attacks. We begin with a set of experiments showing that most existing defenses, which work by pre-processing inpu…

Cited by 198SourcecodeScholar
2020

Certifying Confidence via Randomized Smoothing

NeurIPS 2020poster

Randomized smoothing has been shown to provide good certified-robustness guarantees for high-dimensional classification problems. It uses the probabilities of predicting the top two most-likely classes around an input point under a smoothing distribution to generate a certified radius for a classifi…

2020

Curse of Dimensionality on Randomized Smoothing for Certifiable Robustness

ICML 2020poster

Randomized smoothing, using just a simple isotropic Gaussian distribution, has been shown to produce good robustness guarantees against $\ell_2$-norm bounded adversaries. In this work, we show that extending the smoothing technique to defend against other attack models can be challenging, especially…

2020

Detection as Regression: Certified Object Detection with Median Smoothing

NeurIPS 2020poster

Despite the vulnerability of object detectors to adversarial attacks, very few defenses are known to date. While adversarial training can improve the empirical robustness of image classifiers, a direct extension to object detection is very expensive. This work is motivated by recent progress on cert…

Cited by 80SourcePDFScholar
2020

FreeLB: Enhanced Adversarial Training for Natural Language Understanding

ICLR 2020spotlight

Adversarial training, which minimizes the maximal risk for label-preserving input perturbations, has proved to be effective for improving the generalization of language models. In this work, we propose a novel adversarial training algorithm, FreeLB, that promotes higher invariance in the embedding s…

Cited by 567SourcecodeScholar
2020

Headless Horseman: Adversarial Attacks on Transfer Learning Models

ICASSP 2020accepted

Transfer learning facilitates the training of task-specific classifiers using pre-trained models as feature extractors. We present a family of transferable adversarial attacks against such classifiers, generated without access to the classification head; we call these headless attacks. We first demo…

Cited by 0SourceScholar
2020

Making an Invisibility Cloak: Real World Adversarial Attacks on Object Detectors

ECCV 2020poster

We present a systematic study of adversarial attacks on state-of-the-art object detection frameworks. Using standard detection datasets, we train patterns that suppress the objectness scores produced by a range of commonly used detectors, and ensembles of detectors. Through extensive experiments, we…

Cited by 339SourcePDFScholar
2020

MetaPoison: Practical General-purpose Clean-label Data Poisoning

NeurIPS 2020poster

Data poisoning---the process by which an attacker takes control of a model by making imperceptible changes to a subset of the training data---is an emerging threat in the context of neural networks. Existing attacks for data poisoning neural networks have relied on hand-crafted heuristics, because s…

2020

Soft-Output Finite Alphabet Equalization for mmWave Massive MIMO

ICASSP 2020accepted

Nxt-generation wireless systems are expected to combine millimeter-wave (mmWave) and massive multi-user multiple-input multiple-output (MU-MIMO) technologies to deliver high data-rates. These technologies require the basestations (BSs) to process high-dimensional data at extreme rates, which results…

Cited by 0SourceScholar
2020

The Impact of Neural Network Overparameterization on Gradient Confusion and Stochastic Gradient Descent

ICML 2020poster

This paper studies how neural network architecture affects the speed of training. We introduce a simple concept called gradient confusion to help formally analyze this. When gradient confusion is high, stochastic gradients produced by different data samples may be negatively correlated, slowing down…

Cited by 121SourcePDFScholar
2020

Truth or backpropaganda? An empirical investigation of deep learning theory

ICLR 2020spotlight

We empirically evaluate common assumptions about neural networks that are widely held by practitioners and theorists alike. In this work, we: (1) prove the widespread existence of suboptimal local minima in the loss landscape of neural networks, and we use our theory to find examples; (2) show that…

Cited by 46SourcecodeScholar
2020

Unraveling Meta-Learning: Understanding Feature Representations for Few-Shot Tasks

ICML 2020poster

Meta-learning algorithms produce feature extractors which achieve state-of-the-art performance on few-shot classification. While the literature is rich with meta-learning methods, little is known about why the resulting feature extractors perform so well. We develop a better understanding of the und…

2020

Witchcraft: Efficient PGD Attacks with Random Step Size

ICASSP 2020accepted

State-of-the-art adversarial attacks on neural networks use expensive iterative methods and numerous random restarts from different initial points. Iterative FGSM-based methods without restarts trade off performance for computational efficiency because they do not adequately explore the image space…

Cited by 0SourceScholar
2019

ACE: Adapting to Changing Environments for Semantic Segmentation

ICCV 2019poster

Deep neural networks exhibit exceptional accuracy when they are trained and tested on the same data distributions. However, neural classifiers are often extremely brittle when confronted with domain shift---changes in the input distribution that occur over time. We present ACE, a framework for seman…

Cited by 119PDFScholar
2019

Adversarial training for free!

NeurIPS 2019poster

Adversarial training, in which a network is trained on adversarial examples, is one of the few defenses against adversarial attacks that withstands strong attacks. Unfortunately, the high cost of generating strong adversarial examples makes standard adversarial training impractical on large-scale pr…

Cited by 1720SourcePDFScholar
2019

Transferable Clean-Label Poisoning Attacks on Deep Neural Nets

ICML 2019oral

In this paper, we explore clean-label poisoning attacks on deep convolutional networks with access to neither the network’s output nor its architecture or parameters. Our goal is to ensure that after injecting the poisons into the training data, a model with unknown architecture and parameters train…

2018

DCAN: Dual Channel-wise Alignment Networks for Unsupervised Scene Adaptation

ECCV 2018poster

Harvesting dense pixel-level annotations to train deep neural networks for semantic segmentation is extremely expensive and unwieldy at scale. While learning from synthetic data where labels are readily available sounds promising, performance degrades significantly when testing on novel realistic da…

Cited by 317SourcePDFScholar
2018

Linear Spectral Estimators and an Application to Phase Retrieval

ICML 2018oral

Phase retrieval refers to the problem of recovering real- or complex-valued vectors from magnitude measurements. The best-known algorithms for this problem are iterative in nature and rely on so-called spectral initializers that provide accurate initialization vectors. We propose a novel class of es…

Cited by 15SourcePDFScholar
2018

Poison Frogs! Targeted Clean-Label Poisoning Attacks on Neural Networks

NeurIPS 2018poster

Data poisoning is an attack on machine learning models wherein the attacker adds examples to the training set to manipulate the behavior of the model at test time. This paper explores poisoning attacks on neural nets. The proposed attacks use ``clean-labels''; they don't require the attacker to have…

2018

Stabilizing Adversarial Nets with Prediction Methods

ICLR 2018poster

Adversarial neural networks solve many important problems in data science, but are notoriously difficult to train. These difficulties come from the fact that optimal weights for adversarial nets correspond to saddle points, and not minimizers, of the loss function. The alternating stochastic gradien…

2018

Visualizing the Loss Landscape of Neural Nets

NeurIPS 2018poster

Neural network training relies on our ability to find "good" minimizers of highly non-convex loss functions. It is well known that certain network architecture designs (e.g., skip connections) produce loss functions that train easier, and well-chosen training parameters (batch size, learning rate, o…

2017

A New Rank Constraint on Multi-View Fundamental Matrices, and Its Application to Camera Location Recovery

CVPR 2017spotlight

Accurate estimation of camera matrices is an important step in structure from motion algorithms. In this paper we introduce a novel rank constraint on collections of fundamental matrices in multi-view settings. We show that in general, with the selection of proper scale factors, a matrix formed by s…

Cited by 31PDFScholar
2017

Adaptive Consensus ADMM for Distributed Optimization

ICML 2017poster

The alternating direction method of multipliers (ADMM) is commonly used for distributed model fitting problems, but its performance and reliability depend strongly on user-defined penalty parameters. We study distributed ADMM methods that boost performance by using different fine-tuned algorithm par…

Cited by 89SourcePDFScholar
2017

Adaptive Relaxed ADMM: Convergence Theory and Practical Implementation

CVPR 2017poster

Many modern computer vision and machine learning applications rely on solving difficult optimization problems that involve non-differentiable objective functions and constraints. The alternating direction method of multipliers (ADMM) is a widely used approach to solve such problems. Relaxed ADMM is…

Cited by 57PDFScholar
2017

POKEMON: A non-linear beamforming algorithm for 1-bit massive MIMO

ICASSP 2017accepted

One-bit quantization at the base-station (BS) of a massive multiple-input multiple-output (MIMO) wireless system enables significant power and cost savings. While the 1-bit uplink (users communicate to BS) has gained significant attention, the downlink (BS transmits to users) is far less studied. In…

Cited by 0SourceScholar
2017

Son of Zorn's lemma: Targeted style transfer using instance-aware semantic segmentation

ICASSP 2017accepted

Style transfer is an important task in which the style of a source image is mapped onto that of a target image. The method is useful for synthesizing derivative works of a particular artist or specific painting. This work considers targeted style transfer, in which the style of a template image is u…

Cited by 0SourceScholar
2017

Training Quantized Nets: A Deeper Understanding

NeurIPS 2017poster

Currently, deep neural networks are deployed on low-power portable devices by first training a full-precision model using powerful hardware, and then deriving a corresponding low-precision model for efficient inference on such systems. However, training models directly with coarsely quantized weight…

Cited by 257SourcePDFScholar
2016

Dealbreaker: A Nonlinear Latent Variable Model for Educational Data

ICML 2016poster

Statistical models of student responses on assessment questions, such as those in homeworks and exams, enable educators and computer-based personalized learning systems to gain insights into students’ knowledge using machine learning. Popular student-response models, including the Rasch model and it…

Cited by 11SourcePDFScholar
2016

Estimating Sparse Signals With Smooth Support via Convex Programming and Block Sparsity

CVPR 2016poster

Conventional algorithms for sparse signal recovery and sparse representation rely on l1-norm regularized variational methods. However, when applied to the reconstruction of sparse images, i.e., images where only a few pixels are non-zero, simple l1-norm-based methods ignore poten- tial correlations…

Cited by 7PDFScholar
2016

Training Neural Networks Without Gradients: A Scalable ADMM Approach

ICML 2016poster

With the growing importance of large network models and enormous training datasets, GPUs have become increasingly necessary to train neural networks. This is largely because conventional optimization algorithms rely on stochastic gradient methods that don’t scale well to large numbers of cores in a…

Cited by 341SourcePDFScholar
2016

Unwrapping ADMM: Efficient Distributed Computing via Transpose Reduction

AISTATS 2016poster

Recent approaches to distributed model fitting rely heavily on consensus ADMM, where each node solves small sub-problems using only local data. We propose iterative methods that solve global sub-problems over an entire distributed dataset. This is possible using transpose reduction strategies that…

Cited by 24SourcePDFScholar
2015

Adaptive Primal-Dual Splitting Methods for Statistical Learning and Image Processing

NeurIPS 2015poster

The alternating direction method of multipliers (ADMM) is an important tool for solving complex optimization problems, but it involves minimization sub-steps that are often difficult to solve efficiently. The Primal-Dual Hybrid Gradient (PDHG) method is a powerful alternative that often has simple…

Cited by 109SourcePDFScholar