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,694 papers · 148 categories

Trend · papers per month

86171257342 · Jun 202019922001200920172026
48 results for Adversarial Goals

OptiGAN uses GAN and RL to optimize sequence generation for specific goals.

problem Challenging in sequence generation tasks to generate sequences with specific desired goals.
method Integrates GAN and RL to optimize desired goal scores using policy gradients.
result Achieves higher desired scores in text and real-valued sequence generation.

In this paper, we study a new learning paradigm for Neural Machine Translation (NMT). Instead of maximizing the likelihood of the human translation as in previous works, we minimize the distinction between human translation and the translation given by an NMT model. To achieve this goal, inspired by the recent success …

2017-04-20abs ↗pdf ↗

Obtaining deep networks that are robust against adversarial examples and generalize well is an open problem. A recent hypothesis even states that both robust and accurate models are impossible, i.e., adversarial robustness and generalization are conflicting goals. In an effort to clarify the relationship between robust…

2018-12-03abs ↗pdf ↗

I describe an optimal control view of adversarial machine learning, where the dynamical system is the machine learner, the input are adversarial actions, and the control costs are defined by the adversary's goals to do harm and be hard to detect. This view encompasses many types of adversarial machine learning, includi…

2018-11-11abs ↗pdf ↗

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 which both perform well a…

2019-10-02abs ↗pdf ↗

Can machine learning models for recommendation be easily fooled? While the question has been answered for hand-engineered fake user profiles, it has not been explored for machine learned adversarial attacks. This paper attempts to close this gap. We propose a framework for generating fake user profiles which, when inco…

2018-09-21abs ↗pdf ↗

In this paper, we investigate the adversarial robustness of multivariate MM-Estimators. In the considered model, after observing the whole dataset, an adversary can modify all data points with the goal of maximizing inference errors. We use adversarial influence function (AIF) to measure the asymptotic rate at which t…

2019-03-27abs ↗pdf ↗

We present heuristics for solving the maximin problem induced by the generative adversarial privacy setting for linear and convolutional neural network (CNN) adversaries. In the linear adversary setting, we present a greedy algorithm for approximating the optimal solution for the privatizer, which performs better as th…

2018-10-04abs ↗pdf ↗

We consider the problem of influence maximization in fixed networks for contagion models in an adversarial setting. The goal is to select an optimal set of nodes to seed the influence process, such that the number of influenced nodes at the conclusion of the campaign is as large as possible. We formulate the problem as…

2016-11-01abs ↗pdf ↗

In this work, we initiate a formal study of probably approximately correct (PAC) learning under evasion attacks, where the adversary's goal is to \emph{misclassify} the adversarially perturbed sample point x~\widetilde{x}, i.e., h(x~)c(x~)h(\widetilde{x})\neq c(\widetilde{x}), where cc is the ground truth concept and hh is t…

2019-06-13abs ↗pdf ↗

Neural networks are vulnerable to adversarial examples, malicious inputs crafted to fool trained models. Adversarial examples often exhibit black-box transfer, meaning that adversarial examples for one model can fool another model. However, adversarial examples may be overfit to exploit the particular architecture and …

2018-11-20abs ↗pdf ↗

Given the apparent difficulty of learning models that are robust to adversarial perturbations, we propose tackling the simpler problem of developing adversarially robust features. Specifically, given a dataset and metric of interest, the goal is to return a function (or multiple functions) that 1) is robust to adversar…

2018-11-15abs ↗pdf ↗

The goal of network representation learning is to learn low-dimensional node embeddings that capture the graph structure and are useful for solving downstream tasks. However, despite the proliferation of such methods, there is currently no study of their robustness to adversarial attacks. We provide the first adversari…

2018-09-04abs ↗pdf ↗

Study on robustness in linear regression models, focusing on adversarial perturbations.

problem Understanding and improving robustness in linear regression models to adversarial perturbations.
method Developed a two-stage adversarial learning framework that incorporates model structure information.
result Proved the consistency and developed the Bahadur representation of the adversarially robust estimator.

A new algorithm finds minimizers in dueling optimization with a monotone adversary.

problem Finding minimizers in dueling optimization with a monotone adversary.
method Introduces and studies dueling optimization with a monotone adversary, designs an efficient randomized algorithm.
result Efficient algorithm incurs cost O(d)O(d) and iteration complexity O(dlog(1/ε)2)O(d\log(1/\varepsilon)^2), asymptotically optimal.

The decentralized nature of federated learning makes detecting and defending against adversarial attacks a challenging task. This paper focuses on backdoor attacks in the federated learning setting, where the goal of the adversary is to reduce the performance of the model on targeted tasks while maintaining good perfor…

2019-11-18abs ↗pdf ↗

An important goal in deep learning is to learn versatile, high-level feature representations of input data. However, standard networks' representations seem to possess shortcomings that, as we illustrate, prevent them from fully realizing this goal. In this work, we show that robust optimization can be re-cast as a too…

2019-06-03abs ↗pdf ↗

Generating and eliminating adversarial examples has been an intriguing topic in the field of deep learning. While previous research verified that adversarial attacks are often fragile and can be defended via image-level processing, it remains unclear how high-level features are perturbed by such attacks. We investigate…

2019-06-26abs ↗pdf ↗

Polynomial-time tester-learner for general halfspaces with Gaussian adversarial noise.

problem Learning general halfspaces with adversarial label noise.
method Reduction to testable learning of nearly homogeneous halfspaces.
result First polynomial time tester-learner for general halfspaces with dimension-independent misclassification error.

The goal of this paper is not to introduce a single algorithm or method, but to make theoretical steps towards fully understanding the training dynamics of generative adversarial networks. In order to substantiate our theoretical analysis, we perform targeted experiments to verify our assumptions, illustrate our claims…

2017-01-17abs ↗pdf ↗

This paper discusses adversarial attacks on cyber security systems using machine learning.

problem Adversarial attacks limit the use of machine learning in cyber security.
method Characterizes adversarial attack methods and their applications in cyber security.
result Highlights unique challenges and future research directions for adversarial attacks in cyber security.

New method defends deep nets against large perturbations perceptible to humans.

problem Vulnerability of deep nets to adversarial attacks with perceptible but not changing predictions.
method Oracle-Aligned Adversarial Training (OA-AT) to align network predictions with Oracle's.
result Achieves state-of-the-art performance at large perturbation bounds (L-inf of 16/255 on CIFAR-10).

Adversarial examples can be defined as inputs to a model which induce a mistake - where the model output is different than that of an oracle, perhaps in surprising or malicious ways. Original models of adversarial attacks are primarily studied in the context of classification and computer vision tasks. While several at…

2018-11-04abs ↗pdf ↗

It is well-known that many machine learning models are susceptible to adversarial attacks, in which an attacker evades a classifier by making small perturbations to inputs. This paper discusses how industrial copyright detection tools, which serve a central role on the web, are susceptible to adversarial attacks. We di…

2019-06-17abs ↗pdf ↗

Detecting adversarial examples is as hard as classifying them.

problem The difficulty of detecting adversarial examples in machine learning models.
method Proved a general hardness reduction between detection and classification of adversarial examples.
result The hardness reduction implies that detecting adversarial examples is computationally infeasible.

Optimizes quantile and semi-adversarial regret with novel root-logarithmic regularizers.

problem Minimizes regret in adversarial and semi-adversarial online learning.
method FTRL with root-logarithmic regularizers for quantile and semi-adversarial settings.
result Achieves minimax optimal regret bounds in both paradigms.

Reinforcement learning (RL) has advanced greatly in the past few years with the employment of effective deep neural networks (DNNs) on the policy networks. With the great effectiveness came serious vulnerability issues with DNNs that small adversarial perturbations on the input can change the output of the network. Sev…

2018-05-31abs ↗pdf ↗

In this paper, we advocate for representation learning as the key to mitigating unfair prediction outcomes downstream. Motivated by a scenario where learned representations are used by third parties with unknown objectives, we propose and explore adversarial representation learning as a natural method of ensuring those…

2018-02-17abs ↗pdf ↗

Anomaly detection method tackles hidden adversary actions in real-world scenarios.

problem Detecting hidden adversary actions in real-world scenarios where the defender cannot perfectly observe the attacker's actions.
method Extends existing anomaly detection models to handle continuous action spaces and game-theoretic framework. Proposes two algorithms: direct extension and learning-based approach.
result Learning-based approach produces less exploitable strategies and is scalable to higher dimensions.

This paper optimizes attacks on stochastic bandits and proposes defenses against them.

problem Optimizing adversarial attacks on stochastic bandit algorithms.
method Designs optimal attack strategies and proposes defense algorithms.
result Optimal attack strategies and defense algorithms achieve near perfect performance.

Noisy labels often occur in vision datasets, especially when they are obtained from crowdsourcing or Web scraping. We propose a new regularization method, which enables learning robust classifiers in presence of noisy data. To achieve this goal, we propose a new adversarial regularization scheme based on the Wasserstei…

2019-04-08abs ↗pdf ↗

Continuous-time algorithms improve online learning performance.

problem Online learning with sequential data and minimizing overall regret.
method Extending discrete-time algorithms to continuous-time models for online linear optimization, adversarial bandit, and adversarial linear bandit.
result Optimal regret bounds are proven for continuous-time settings.

Algorithm learns a single neuron robustly to shifts and adversarial noise.

problem Learning a single neuron robustly to distributional shifts and adversarial label noise.
method Designs a computationally efficient algorithm using primal-dual framework.
result Recover a vector satisfying a risk bound under adversarial conditions.

Deep Neural Networks are quite vulnerable to adversarial perturbations. Current state-of-the-art adversarial attack methods typically require very time consuming hyper-parameter tuning, or require many iterations to solve an optimization based adversarial attack. To address this problem, we present a new family of trus…

2018-12-16abs ↗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.

Study on adversarial attacks on user identification systems using motion sensors.

problem Adversarial attacks on deep learning models for user identification based on motion sensors.
method Study of adversarial example generation methods and their impact on user identification systems.
result Deep neural networks trained for user identification based on motion sensors are vulnerable to adversarial attacks, leading to high misclassification rates.

Interpreting machine learning models helps understand adversarial attacks and defenses.

problem Understanding model vulnerability to adversarial attacks.
method Model interpretation techniques to explore adversarial attacks and defenses.
result Interpretation methods can be applied to adversarial attacks and defenses.

Optimal bounds on regret and constraint violation in adversarial COCO.

problem Minimizing regret and cumulative constraint violation in adversarial COCO.
method New surrogate loss function and Follow-the-Regularized-Leader/Online Gradient Descent.
result Achieved optimal O(T)O(\sqrt{T}) bounds on both regret and cumulative constraint violation.

Generative Adversarial Networks (GANs) have achieved remarkable results in the task of generating realistic natural images. In most successful applications, GAN models share two common aspects: solving a challenging saddle point optimization problem, interpreted as an adversarial game between a generator and a discrimi…

2017-07-18abs ↗pdf ↗