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

Trend · papers per month

154308461615 · Jun 202019922001200920172026
48 results for Adversarial process

Proposes an adversarial process using cosine similarity to improve robustness of models.

problem Improving robustness of models by eliminating subsidiary information.
method Adversarial process using cosine similarity to degrade subsidiary model performance.
result Cosine similarity-based adversarial process efficiently degrades subsidiary model performance.

Guarantees robustness of Gaussian process classifiers against adversarial attacks.

problem Protecting machine learning classifiers from adversarial perturbations.
method Developed an adversarial bound (AB) for Gaussian process classifiers, providing a formal guarantee of robustness.
result Proves that the proposed method produces a practical, useful, and provably robust classifier.

Bayesian adversaries can outsmart traditional adversarial attacks.

problem Bayesian adversaries can manipulate machine learning models through small perturbations.
method Developed a continuous-time particle system (Abram) to approximate the gradient flow of the Bayesian adversarial robustness problem.
result Abram approximates the minimizer of the Bayesian adversarial robustness problem under certain assumptions.

Adversarial examples are malicious inputs designed to fool machine learning models. They often transfer from one model to another, allowing attackers to mount black box attacks without knowledge of the target model's parameters. Adversarial training is the process of explicitly training a model on adversarial examples,…

2016-11-04abs ↗pdf ↗

Adversarial deep hedging learns to hedge without specifying asset price models.

problem Lack of effective underlying asset models for deep hedging.
method Adversarial learning framework where a hedger and a generator compete to improve hedging performance.
result Adversarial deep hedging achieves competitive performance without explicit asset process modeling.

We propose a novel adversarial learning strategy for mixture models of Hawkes processes, leveraging data augmentation techniques of Hawkes process in the framework of self-paced learning. Instead of learning a mixture model directly from a set of event sequences drawn from different Hawkes processes, the proposed metho…

2019-06-20abs ↗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.

The paper evaluates machine learning cyber defenses using log data against adversarial attacks.

problem Evaluating the robustness of machine learning cyber defenses against adversarial attacks.
method Developed a testing framework using deep reinforcement learning and adversarial natural language processing.
result Higher dropout levels increase robustness, with 90% dropout probability showing the highest robustness.

Paper proposes a GAN-based method for better next event prediction in business processes.

problem Insufficient training data and sub-optimal network configuration limit deep learning approaches to next event prediction.
method Adversarial training framework using Generative Adversarial Networks (GANs) for sequential temporal data.
result The proposed approach achieves at least as good accuracy as non-adversarial methods and outperforms them in accuracy and prediction earliness.

RTFE provides adversarial robustness to multiple models.

problem Adversarial examples can transfer to other models, compromising robustness.
method Proposes RTFE, a deep learning-based pre-processing mechanism.
result RTFE provides adversarial robustness to multiple independently trained classifiers.

This paper introduces blind adversarial pruning to balance accuracy, efficiency, and robustness in neural networks.

problem Balancing accuracy, efficiency, and robustness in neural networks with limited resources.
method Adversarial pruning with a cutoff-scale strategy to dynamically adjust the strength of adversarial examples.
result Blind adversarial pruning improves the overall AER of pruned models compared to adversarial pruning.

Overparameterized linear model shows strong classification but weak regression, susceptible to adversarial perturbations.

problem Adversarial vulnerability of overparameterized linear models.
method Lifted Fourier feature map, analyzing overparameterized linear ensemble.
result Spatial localization leads to adversarial vulnerability in an intermediate classification regime.

Differentiable adversarial attacks improve model robustness in MTPP models.

problem Improving model robustness against adversarial attacks in MTPP models.
method Proposed a differentiable adversarial attack scheme PERMTPP that addresses the sequential nature and varying time-scales of MTPPs.
result Demonstrated offensive and defensive capabilities, and reduced inference times on real-world datasets.

Charmer improves character-level adversarial attacks for language models.

problem Efficiency and effectiveness of character-level adversarial attacks for language models.
method Query-based adversarial attack method that maintains semantic similarity.
result Charmer achieves high attack success rate and similar adversarial examples.

Recent breakthroughs in the field of deep learning have led to advancements in a broad spectrum of tasks in computer vision, audio processing, natural language processing and other areas. In most instances where these tasks are deployed in real-world scenarios, the models used in them have been shown to be susceptible …

2019-05-26abs ↗pdf ↗

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…

2018-08-06abs ↗pdf ↗

Adversarial Robustness Toolbox (ART) is a Python library supporting developers and researchers in defending Machine Learning models (Deep Neural Networks, Gradient Boosted Decision Trees, Support Vector Machines, Random Forests, Logistic Regression, Gaussian Processes, Decision Trees, Scikit-learn Pipelines, etc.) agai…

2018-07-03abs ↗pdf ↗

In several reinforcement learning (RL) scenarios, mainly in security settings, there may be adversaries trying to interfere with the reward generating process. In this paper, we introduce Threatened Markov Decision Processes (TMDPs), which provide a framework to support a decision maker against a potential adversary in…

2018-09-05abs ↗pdf ↗

Random deep neural networks are robust to adversarial examples, scaling with input size and dimension.

problem Adversarial examples challenge the reliability of deep learning algorithms.
method Analysis of random deep neural networks with Gaussian process equivalence and experiments on MNIST and CIFAR10.
result The p\ell^p distance of adversarial examples scales as 1/dimesp1/\sqrt{d} imes \ell^p norm of the input.

Generative adversarial networks fix aliasing issues by making signals continuous.

problem Alias-free generation in GANs to prevent unwanted information leakage.
method Interpreting all signals as continuous, deriving small architectural changes.
result Generative models match FID of StyleGAN2 but have better internal representations.

New algorithms achieve no-regret learning even with adversarial transitions and losses.

problem No-regret learning impossible with adversarial transitions and losses.
method Developed algorithms for adversarial Markov Decision Processes with smooth regret increase.
result Achieved O~(T+CextsfP)\widetilde{O}(\sqrt{T} + C^{ extsf{P}}) regret, with CextsfPC^{ extsf{P}} measuring adversarial transition function.

Proposes a probabilistic method for generating semantically-aware adversarial examples.

problem Generating adversarial examples that are difficult for humans to detect while preserving semantics.
method Embeds subjective understanding of semantics as a distribution into adversarial example generation.
result Achieves higher success rates in circumventing adversarial defense mechanisms.

Paper tackles robustness in adversarial noise with a meta-optimizer.

problem Sensitivity to adversarial noise hinders machine learning deployment.
method Meta-optimizer learns to robustly optimize models using adversarial examples.
result Meta-optimizer transfers adversarial knowledge to new models without generating new examples.

WDAIL uses Wasserstein distance for more effective reward shaping in IL.

problem Fixed reward functions in GAIL limit performance on complex tasks.
method Introduces Wasserstein distance and PPO for improved reward shaping and stability.
result Significant performance improvement in complex MuJoCo tasks.

Improves classifier performance in multi-stage processes with adversarial autoencoders and multi-task learning.

problem Challenges in training classifiers due to varying sample sizes and information content across stages.
method Combines adversarial autoencoders, multi-task learning, and semi-supervised learning to address underfitting and overfitting.
result Our approach outperforms state-of-the-art methods across different domains.

Though deep neural networks have achieved state-of-the-art performance in visual classification, recent studies have shown that they are all vulnerable to the attack of adversarial examples. Small and often imperceptible perturbations to the input images are sufficient to fool the most powerful deep neural networks. Va…

2018-06-02abs ↗pdf ↗

New approach optimizes policies in adversarial MDPs using adversarial learning.

problem Optimizing policies in adversarial Markov decision processes.
method Adversarial learning on advantage functions, extending previous reductions.
result Stronger regret criteria and performance guarantees for policy optimization.

An adversarial detector identifies anomalous sequences in sequential data.

problem Detecting anomalous sequences in one-class settings with limited data.
method Solves a minimax problem to find an optimal detector against the worst-case sequences from a generator, using marked point process model.
result Demonstrated good performance on simulations and real credit card fraud datasets.

DVERGE diversifies adversarial vulnerabilities to enhance robust ensemble models.

problem Diverse adversarial vulnerabilities for robust ensemble models.
method Isolates and diversifies adversarial vulnerabilities through distillation and training.
result Achieves higher robustness against transfer attacks compared to previous methods.

We propose a method to generate audio adversarial examples that can attack a state-of-the-art speech recognition model in the physical world. Previous work assumes that generated adversarial examples are directly fed to the recognition model, and is not able to perform such a physical attack because of reverberation an…

2018-10-28abs ↗pdf ↗

New method tackles adversarial sign-corrupted isotonic regression, estimating monotonic signals under heavy dependence.

problem Estimating monotonic signals when responses are sign-corrupted and adversarially designed to violate monotonicity.
method Developed ASCIFIT, a three-step estimation procedure using PAVA with pre- and post-processing corrections.
result Theoretical guarantees of sharp high probability upper bounds and minimax lower bounds for ASCIFIT.

Analyzes biased random walks and corrupted intervals in adversarial settings.

problem Learning thresholds and intervals in adversarial conditions.
method Analyzes biased random walks and corrupted intervals under adversarial design.
result Analyzes the expected behavior of biased random walks and corrupted intervals.

We study the problem of multimodal generative modelling of images based on generative adversarial networks (GANs). Despite the success of existing methods, they often ignore the underlying structure of vision data or its multimodal generation characteristics. To address this problem, we introduce the Dirichlet prior fo…

2018-12-17abs ↗pdf ↗