Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,695 papers · 148 categories

Trend · papers per month

90180269359 · Jun 202019922001200920172026
48 results for randomized attacks

Randomized classifiers outperform deterministic ones in robustness against adversarial attacks.

problem Ensuring optimal robustness against all adversarial attacks.
method Game-theoretic approach, focusing on the non-existence of Nash equilibrium in deterministic classifiers and demonstrating the superiority of randomized classifiers.
result Randomized classifiers can outperform deterministic ones in robustness against adversarial attacks.

This paper proposes a framework for certifying neural network defenses against data poisoning attacks.

problem Vulnerability of neural networks to data poisoning attacks.
method Random selection based defenses that average predictions on sub-datasets sampled from the training set.
result The certified radius of bagging derived by the framework is tighter than previous work.

Face recognition systems are vulnerable to composite face reconstruction attacks.

problem Vulnerability of face recognition systems to composite face reconstruction attacks.
method Assumed attacker uses composite face parts to reconstruct faces faster and more efficiently.
result Current face recognition systems are extremely vulnerable to random search attacks.

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 and are highly sensi…

2019-11-18abs ↗pdf ↗

The vulnerability of machine learning systems to adversarial attacks questions their usage in many applications. In this paper, we propose a randomized diversification as a defense strategy. We introduce a multi-channel architecture in a gray-box scenario, which assumes that the architecture of the classifier and the t…

2019-04-01abs ↗pdf ↗

A bias classifier is introduced to resist adversarial attacks.

problem Resisting adversarial attacks on deep neural networks (DNNs).
method Introducing the bias part of a DNN with Relu as the activation function as a classifier, and adding a random first-degree part to make it information-theoretically safe.
result The bias classifier is more robust than DNNs of similar size against adversarial attacks.

Paper analyzes adversarial attacks and defenses using game theory.

problem Unclear conditions for optimal attacks and defenses in adversarial learning.
method Game-theoretic framework with locally linear decision boundary model.
result Fast Gradient Method attack and Randomized Smoothing defense form a Nash Equilibrium.

Adversarial examples have been shown to exist for a variety of deep learning architectures. Deep reinforcement learning has shown promising results on training agent policies directly on raw inputs such as image pixels. In this paper we present a novel study into adversarial attacks on deep reinforcement learning polic…

2017-05-18abs ↗pdf ↗

Deep neural networks are known to be vulnerable to adversarial attacks. Current methods of defense from such attacks are based on either implicit or explicit regularization, e.g., adversarial training. Randomized smoothing, the averaging of the classifier outputs over a random distribution centered in the sample, has b…

2019-11-17abs ↗pdf ↗

Randomized smoothing reduces accuracy in ML models, especially at higher noise levels.

problem Adversarial attacks on ML models, especially randomized smoothing's accuracy drop.
method Theoretical and empirical analysis of randomized smoothing's effect on feasible hypotheses space.
result For some noise levels, randomized smoothing shrinks the set of feasible hypotheses, leading to accuracy drops.

We propose a new randomized ensemble technique with a provable security guarantee against black-box transfer attacks. Our proof constructs a new security problem for random binary classifiers which is easier to empirically verify and a reduction from the security of this new model to the security of the ensemble classi…

2019-06-07abs ↗pdf ↗

New algorithm robust to probabilistic unbounded adversarial attacks in bandit problems.

problem Powerful adversaries that can catastrophically perturb the revealed reward in bandit problems.
method Proposes med-E-UCB and med-εε-greedy algorithms based on sample median for robustness.
result Achieves O(logT)\mathcal{O}(\log T) pseudo-regret under arbitrary and unbounded reward perturbation.

New framework improves adversarial robustness certification for various perturbations.

problem Certifying robustness against adversarial attacks in deep learning models.
method Unified functional optimization approach with non-Gaussian smoothing noise for multiple types of attacks.
result Achieves better certification results and identifies key trade-offs between accuracy and robustness.

Paper defends deep learning classifiers against channel-aware adversarial attacks.

problem Deep learning classifiers are vulnerable to adversarial attacks.
method Channel-aware adversarial attacks are presented and defended against.
result Certified defense based on randomized smoothing makes classifiers robust.

This study improves scalability of randomized smoothing for certifying classifier robustness.

problem Certifying machine learning classifiers against adversarial attacks is challenging and scalable solutions are needed.
method The study reviews and explores randomized smoothing and its derivatives, focusing on scalability.
result The study provides theoretical guarantees and discusses scalability challenges of randomized smoothing.

Recent studies have revealed the vulnerability of deep neural networks: A small adversarial perturbation that is imperceptible to human can easily make a well-trained deep neural network misclassify. This makes it unsafe to apply neural networks in security-critical applications. In this paper, we propose a new defense…

2017-12-02abs ↗pdf ↗

Simple adaptive attacks can jailbreak state-of-the-art safety-aligned language models.

problem Vulnerability of safety-aligned language models to simple adaptive attacks.
method Designing adversarial prompt templates, random search on suffixes, and transfer/prefilling attacks.
result 100% attack success rate on various models including GPT-4, Vicuna, Mistral, and Claude.

Collaborative learning allows participants to jointly train a model without data sharing. To update the model parameters, the central server broadcasts model parameters to the clients, and the clients send updating directions such as gradients to the server. While data do not leave a client device, the communicated gra…

2019-09-24abs ↗pdf ↗

This paper studies adversarial attacks on Gaussian process bandits.

problem Adversarial attacks on Gaussian process bandits to manipulate optimal function regions.
method Proposes various adversarial attack methods on GP bandits, including white-box and black-box attacks.
result Adversarial attacks can force GP bandits to optima in target regions even with low attack budgets.

ODS improves adversarial attacks by maximizing output diversity.

problem Efficiency and effectiveness of adversarial attacks, especially black-box attacks.
method Output Diversified Sampling (ODS) that maximizes diversity in model outputs.
result ODS reduces the number of queries needed for black-box attacks on ImageNet by a factor of two.

A new attack for probabilistic classifiers adapts to noise levels.

problem Adversarial examples can mislead probabilistic classifiers.
method Adapts HopSkipJump attack for probabilistic classifiers, adjusting queries based on noise levels.
result Decision-based attacks are effective against probabilistic classifiers, even with noise.

This paper tackles the problem of defending a neural network against adversarial attacks crafted with different norms (in particular \ell_\infty and 2\ell_2 bounded adversarial examples). It has been observed that defense mechanisms designed to protect against one type of attacks often offer poor performance against…

2019-03-25abs ↗pdf ↗

This paper investigates the theory of robustness against adversarial attacks. It focuses on the family of randomization techniques that consist in injecting noise in the network at inference time. These techniques have proven effective in many contexts, but lack theoretical arguments. We close this gap by presenting a …

2019-02-04abs ↗pdf ↗