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

Trend · papers per month

20406080 · May 202619922001200920172026
48 results for evasion path

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.

Reviews spams are prevalent in e-commerce to manipulate product ranking and customers decisions maliciously. While spams generated based on simple spamming strategy can be detected effectively, hardened spammers can evade regular detectors via more advanced spamming strategies. Previous work gave more attention to evas…

2018-11-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.

Pursuit-evasion is a multi-agent sequential decision problem wherein a group of agents known as pursuers coordinate their traversal of a spatial domain to locate an agent trying to evade them. Pursuit evasion problems arise in a number of import application domains including defense and route planning. Learning to opti…

2018-11-11abs ↗pdf ↗

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.

Despite its success and popularity, machine learning is now recognized as vulnerable to evasion attacks, i.e., carefully crafted perturbations of test inputs designed to force prediction errors. In this paper we focus on evasion attacks against decision tree ensembles, which are among the most successful predictive mod…

2019-07-02abs ↗pdf ↗

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.

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 ↗

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 ↗

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 ↗

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.

Unmanned Aerial Vehicles (UAVs), autonomously-guided aircraft, are widely used for tasks involving surveillance and reconnaissance. A version of the pursuit-evasion problems centered around UAVs and its variants has been extensively studied in recent years due to numerous breakthroughs in AI. We present an approach to …

2019-11-02abs ↗pdf ↗

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 ↗

Machine learning (ML) classifiers are vulnerable to adversarial examples. An adversarial example is an input sample which is slightly modified to induce misclassification in an ML classifier. In this work, we investigate white-box and grey-box evasion attacks to an ML-based malware detector and conduct performance eval…

2019-04-07abs ↗pdf ↗

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.

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 ↗

This study evaluates the robustness of transformation-based ensemble defense against evasion attacks.

problem Understanding the reasons behind the robustness improvement in transformation-based ensemble defense.
method Designing two adaptive attacks to evaluate transformation-based ensemble defense, conducting experiments to analyze robustness.
result The robustness improvement is mainly from irreversible transformations rather than the ensemble of models.

We construct the first explicit example of a simplicial 3-ball B_{15,66} that is not collapsible. It has only 15 vertices. We exhibit a second 3-ball B_{12,38} with 12 vertices that is collapsible and evasive, but not shellable. Finally, we present the first explicit triangulation of a 3-sphere S_{18, 125} (with only 1…

2013-03-08abs ↗pdf ↗

This work proposes a robust ensemble method for decision trees that resists adversarial attacks.

problem Adversarial attacks on machine learning models, especially decision trees.
method Feature partitioning to train robust ensembles and approximate certification methods.
result The proposed ensemble method can resist evasion attacks by a majority of its models.

Proposes using mode connectivity to improve adversarial robustness of neural networks.

problem Improving adversarial robustness of deep neural networks.
method Employing mode connectivity in loss landscapes to study adversarial robustness and propose methods for improvement.
result Path connection learned using limited bonafide data can effectively mitigate adversarial effects while maintaining original accuracy.

A commonly used heuristic in non-convex optimization is Normalized Gradient Descent (NGD) - a variant of gradient descent in which only the direction of the gradient is taken into account and its magnitude ignored. We analyze this heuristic and show that with carefully chosen parameters and noise injection, this method…

2016-11-15abs ↗pdf ↗

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.

Tax evasion is the illegal evasion of taxes by individuals, corporations, and trusts. The revenue loss from tax avoidance can undermine the effectiveness and equity of the government policies. A standard measure of tax evasion is the tax gap, that can be estimated as the difference between the total amounts of tax theo…

2019-12-08abs ↗pdf ↗

This paper presents a simple agent-based model of an economic system, populated by agents playing different games according to their different view about social cohesion and tax payment. After a first set of simulations, correctly replicating results of existing literature, a wider analysis is presented in order to stu…

2018-09-21abs ↗pdf ↗

A microscopic dynamic model is here constructed and analyzed, describing the evolution of the income distribution in the presence of taxation and redistribution in a society in which also tax evasion and auditing processes occur. The focus is on effects of enforcement regimes, characterized by different choices of the …

2016-02-18abs ↗pdf ↗

RDLI integrates domain logic and context grounding to detect crypto anomalies under scarce labels.

problem Extreme label scarcity and evasion strategies in crypto networks.
method Relational Domain Logic Integration (RDLI) with Retrieval Grounded Context (RGC).
result RDLI outperforms GNN baselines by 28.9% in F1 score under 0.01% label scarcity.

Recent research studies revealed that neural networks are vulnerable to adversarial attacks. State-of-the-art defensive techniques add various adversarial examples in training to improve models' adversarial robustness. However, these methods are not universal and can't defend unknown or non-adversarial evasion attacks.…

2019-09-12abs ↗pdf ↗

We investigate how an adversary can optimally use its query budget for targeted evasion attacks against deep neural networks in a black-box setting. We formalize the problem setting and systematically evaluate what benefits the adversary can gain by using substitute models. We show that there is an exploration-exploita…

2019-06-08abs ↗pdf ↗