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

265177102 · May 202619922001200920172026
48 results for spectral defences

New defence against data-poisoning attacks in neural networks.

problem Data-poisoning attacks can evade existing defences and increase model efficacy.
method Proved geometric mechanism and identified near clone regime in input space.
result Regularisation and data augmentation reduce data fitting capacity and prevent poisoning.

Deep learning methods have shown state of the art performance in a range of tasks from computer vision to natural language processing. However, it is well known that such systems are vulnerable to attackers who craft inputs in order to cause misclassification. The level of perturbation an attacker needs to introduce in…

2019-10-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.

New attack strategy circumvents CC framework's defences in federated learning.

problem Vulnerabilities in Byzantine attacks in federated learning.
method Introducing a novel attack strategy and proposing a new robust defence mechanism.
result Reduces test accuracy of robust aggregators up to 33% in image classification tasks.

Adversarial perturbations are more effective in Y-channel of YCbCr color space.

problem Vulnerability of deep models to adversarial perturbations in images.
method Proposed ResUpNet defense that removes perturbations only from the Y-channel of YCbCr color space.
result ResUpNet achieves the best balance between defense and maintaining original image accuracy.

To accelerate research on adversarial examples and robustness of machine learning classifiers, Google Brain organized a NIPS 2017 competition that encouraged researchers to develop new methods to generate adversarial examples as well as to develop new ways to defend against them. In this chapter, we describe the struct…

2018-03-31abs ↗pdf ↗

Enhances neural networks' robustness against adversarial samples without sacrificing clean sample generalization.

problem Limited generalization and time complexity of adversarial training.
method Feature Pyramid Decoder (FPD) framework that integrates denoising and image restoration modules into CNNs and constrains the Lipschitz constant.
result FPD-enhanced CNNs achieve sufficient robustness against general adversarial samples on various datasets.

In this paper we use game theory to model poisoning attack scenarios. We prove the non-existence of pure strategy Nash Equilibrium in the attacker and defender game. We then propose a mixed extension of our game model and an algorithm to approximate the Nash Equilibrium strategy for the defender. We then demonstrate th…

2019-06-07abs ↗pdf ↗

This paper quantifies how hard it is to identify specific data points in machine learning models.

problem Quantifying the difficulty of identifying specific data points in machine learning models.
method Characterizing optimal attacks and privacy defences, deriving impacts of noise and misspecification, and proposing a new covariance attack.
result The Mahalanobis distance explains the hardness of fixed-target membership inference attacks.

Deep models for financial transactions are vulnerable to adversarial attacks, especially when adding transaction tokens.

problem Vulnerability of deep models to adversarial attacks on financial transaction records.
method Examine adversarial attacks and defenses on transaction records data, considering black-box attacks and adding transaction tokens.
result A few generated transactions can fool a deep-learning model, highlighting the need for robustness improvements.

Efficient method defends privacy in federated learning without accuracy loss.

problem Privacy attacks on federated learning by reconstructing and identifying local data.
method Random noise perturbation method that allows recovery of true gradients.
result Strong privacy protection without sacrificing learning accuracy.

There is a rising interest in studying the robustness of deep neural network classifiers against adversaries, with both advanced attack and defence techniques being actively developed. However, most recent work focuses on discriminative classifiers, which only model the conditional distribution of the labels given the …

2018-02-19abs ↗pdf ↗

Simple aggregation of multiple methods defends against adversarial attacks on neural networks.

problem Manipulation of machine learning models to hide discriminating features.
method Aggregation of multiple explanation methods to make the model robust against adversarial attacks.
result The model remains robust even when the attacker has knowledge of the model weights and explanation methods.

Deep learning has enabled traditional reinforcement learning methods to deal with high-dimensional problems. However, one of the disadvantages of deep reinforcement learning methods is the limited exploration capacity of learning agents. In this paper, we introduce an approach that integrates human strategies to increa…

2018-06-12abs ↗pdf ↗

Convolutional neural networks (CNNs) are known for their good performance and generalization in vision-related tasks and have become state-of-the-art in both application and research-based domains. However, just like other neural network models, they suffer from a susceptibility to noise and adversarial attacks. An adv…

2019-05-02abs ↗pdf ↗

We study the problem of learning classifiers robust to universal adversarial perturbations. While prior work approaches this problem via robust optimization, adversarial training, or input transformation, we instead phrase it as a two-player zero-sum game. In this new formulation, both players simultaneously play the s…

2018-09-20abs ↗pdf ↗

Low-rate application layer distributed denial of service (LDDoS) attacks are both powerful and stealthy. They force vulnerable webservers to open all available connections to the adversary, denying resources to real users. Mitigation advice focuses on solutions that potentially degrade quality of service for legitimate…

2019-03-12abs ↗pdf ↗

In this paper, we study the adversarial attack and defence problem in deep learning from the perspective of Fourier analysis. We first explicitly compute the Fourier transform of deep ReLU neural networks and show that there exist decaying but non-zero high frequency components in the Fourier spectrum of neural network…

2019-05-30abs ↗pdf ↗

It has recently been shown that neural networks but also other classifiers are vulnerable to so called adversarial attacks e.g. in object recognition an almost non-perceivable change of the image changes the decision of the classifier. Relatively fast heuristics have been proposed to produce these adversarial inputs bu…

2018-11-28abs ↗pdf ↗

Paper defines spectral triple and computes functional for nonminimal de Rham-Hodge operator.

problem Computing spectral functions for nonminimal de Rham-Hodge operators.
method Definitions and computations of spectral triple and functional.
result Computed spectral Einstein functional for even-dimensional compact manifolds.

The paper explores rigidity theorems for spectral curvature bounds in 3-manifolds.

problem Classical rigidity results in scalar curvature geometry are extended to the spectral setting.
method Warped μμ-bubble method is systematically employed to classify stable weighted minimal hypersurfaces and establish band width estimates.
result Classification theorems and band width estimates for spectral Ricci and scalar curvatures are proven.

The abstract discusses a spectral sequence for Lie algebroids.

problem The abstract tackles the spectral sequence of Lie algebroids.
method The abstract presents a spectral sequence for Lie algebroids, generalizing classical constructions.
result The spectral sequence converges to Lie algebroid cohomology for wide Lie subalgebroids and to formal Lie algebroid cohomology for Lie subalgebroids over proper submanifolds.

New spectral functionals for Dirac operators with inner fluctuations computed.

problem Spectral functionals and Dirac operators with inner fluctuations.
method Extension of spectral functionals for Dirac operators with inner fluctuations.
result Computed spectral Einstein functional for Dirac operator with inner fluctuations on even-dimensional spin manifolds.

Spectral algorithms are graph partitioning algorithms that partition a node set of a graph into groups by using a spectral embedding map. Clustering techniques based on the algorithms are referred to as spectral clustering and are widely used in data analysis. To gain a better understanding of why spectral clustering i…

2019-12-06abs ↗pdf ↗