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.

169,051 papers · 148 categories

Trend · papers per month

2.4%4.7%7.1%9.4% · Apr 202019922001200920182026
48 results for evasion detection

Paper extends method to detect reverse engineering attacks on DNN classifiers.

problem Detecting reverse engineering attacks on deep neural network image classifiers.
method Extend ADA approach to detect RE attacks (ADA-RE).
result Successfully detects 'stealthy' RE attacks before they launch test-time evasion attacks.

PAD offers a principled approach to malware detection against evasion attacks.

problem Machine Learning techniques for malware detection are vulnerable to evasion attacks.
method PAD proposes a new adversarial training framework with convergence guarantees for robust optimization.
result PAD significantly outperforms state-of-the-art defenses and can harden ML-based malware detection against 27 evasion attacks.

Tool detects tax evasion on social media using multi-modal deep learning.

problem Detecting tax evasion on social media platforms.
method Developed a multi-modal deep neural network combining comments, hashtags, and images.
result Multi-modal deep neural network achieved AUC of 0.808 and F1 score of 0.762.

New adversarial training enhances malware detectors against various attacks.

problem Vulnerability of malware detectors to evasion attacks.
method Proposes a mixture of attacks and adversarial training to improve deep neural networks.
result Significantly enhances robustness of deep neural networks against a wide range of attacks.

Study evaluates predictive uncertainty in malware detection.

problem Detecting dataset shift and adversarial examples in malware detection.
method Re-designed and built 24 Android malware detectors, quantified their uncertainties with nine metrics.
result Predictive uncertainty helps reliable malware detection but not adversarial evasion attacks.

Study evaluates adversarial training for deep learning IDSs against various attacks.

problem Evasion attacks against deep learning-based IDSs.
method Investigated adversarial training using min-max approach on CNN and RNN.
result Adversarial training improves robustness against five attack methods.

Traditional classification algorithms assume that training and test data come from similar distributions. This assumption is violated in adversarial settings, where malicious actors modify instances to evade detection. A number of custom methods have been developed for both adversarial evasion attacks and robust learni…

2016-04-09abs ↗pdf ↗

New model predicts dynamic tax evasion with audits and imitation.

problem Static treatment of tax compliance and evasion in Bertotti and Modanese model.
method Piecewise Deterministic Markov Processes (PDMPs) for audits and imitation mechanisms.
result Model shows persistent fluctuations and stationary distribution, not extreme equilibrium.

We develop a model of tax evasion based on the Ising model. We augment the model using an appropriate enforcement mechanism that may allow policy makers to curb tax evasion. With a certain probability tax evaders are subject to an audit. If they get caught they behave honestly for a certain number of periods. Simulatin…

2008-01-18abs ↗pdf ↗

Study of pursuit-evasion game on sphere and its relation to planar Apollonius circle.

problem Analyzing pursuit-evasion game on a sphere and its properties.
method Extending classical planar pursuit-evasion game to spherical geometry, studying equilibrium intercept points and their relation to Apollonius domain.
result Condition for intercept point to belong to Apollonius domain on sphere, analogous to planar game.

MatchGNet detects malware by learning program behavior graphs.

problem Malware evasion through obfuscation and high false positives in traditional detection methods.
method Heterogeneous Graph Matching Network model that learns graph representation and similarity metrics.
result MatchGNet reduces false positives by 50% while maintaining zero false negatives.

The paper certifies decision trees against evasion attacks using program analysis.

problem Vulnerability of decision tree models to evasion attacks by maliciously crafted perturbations.
method Transform decision trees into imperative programs for program analysis, leveraging abstract interpretation.
result Soundly verifies security guarantees of decision tree models, yielding minimal false positives.

Classifier evasion consists in finding for a given instance xx the nearest instance xx' such that the classifier predictions of xx and xx' are different. We present two novel algorithms for systematically computing evasions for tree ensembles such as boosted trees and random forests. Our first algorithm uses a Mixe…

2015-09-25abs ↗pdf ↗

The existence of evasion attacks during the test phase of machine learning algorithms represents a significant challenge to both their deployment and understanding. These attacks can be carried out by adding imperceptible perturbations to inputs to generate adversarial examples and finding effective defenses and detect…

2018-06-05abs ↗pdf ↗

We consider the static and dynamic models of Cournot duopoly with tax evasion. In the dynamic model we introduce the time delay and we analyze the local stability of the stationary state. There is a critical value of the delay when the Hopf bifurcation occurs.

2007-06-05abs ↗pdf ↗

Open-world evasion attacks using OOD adversarial examples outperform in-distribution attacks.

problem Evasion attacks on deep learning systems in open-world environments.
method Using 11 neural network models trained on 3 datasets, the study demonstrates the effectiveness of OOD adversarial examples against state-of-the-art detectors and defenses.
result OOD adversarial examples can achieve up to 4x higher success rates than in-distribution adversarial examples against known defenses.

Efficient black-box evasion attacks against deep networks with fewer queries.

problem Optimizing targeted evasion attacks with limited query budget.
method Formalized problem, evaluated benefits of using substitute models, presented two new attack strategies.
result Attack strategies are as effective as previous techniques but require significantly fewer queries.

This paper reviews defenses against adversarial learning attacks on statistical classifiers.

problem Adversarial attacks on machine learning systems, particularly statistical classifiers.
method Survey of recent work on test-time evasion, data poisoning, and reverse engineering attacks and defenses.
result Novel insights that challenge conventional AL wisdom and target unresolved issues.

Generative ML learns optimal pursuit trajectories in pursuit-evasion games.

problem Optimizing Blue's pursuit trajectory to intercept Red in a game of pursuit-evasion.
method Applying generative machine learning to learn optimal action policies for Blue.
result Generative ML models can learn relevant representations for pursuit-evasion dynamics.

In 1967, Chillingworth proved that all convex simplicial 3-balls are collapsible. Using the classical notion of tightness, we generalize this to arbitrary manifolds: We show that all tight simplicial 3-manifolds admit some perfect discrete Morse function. We also strengthen Chillingworth's theorem by proving that all c…

2012-02-15abs ↗pdf ↗

This work studies PAC learning under evasion attacks, proving exponential sample complexity for high-dimensional inputs.

problem Formal study of PAC learning under evasion attacks where the adversary misclassifies perturbed samples.
method Proves exponential sample complexity for high-dimensional inputs under evasion attacks, formalizes hybrid attacks.
result PAC learning requires exponential sample complexity for high-dimensional inputs under evasion attacks.

The paper calculates how much data is needed to learn decision lists in the presence of evasion attacks.

problem Quantifying sample complexity for robust learning of decision lists against evasion attacks.
method PAC learning framework, Lipschitz condition on distributions, lower and upper bounds on sample complexity.
result Upper and lower bounds on sample complexity for robust learning of decision lists, showing exponential vs polynomial dependence on adversary's budget.

Detects backdoors in trained models without poisoned training data.

problem Detecting backdoors in DNNs trained without access to the poisoned training set.
method Proposes a novel detector using the maximum achievable misclassification fraction (MAMF) statistic.
result Detects backdoors and infers source and target classes.