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

109218326435 · Jun 202019922001200920172026
48 results for perturbation technique

In this paper we introduce a family of stochastic gradient estimation techniques based of the perturbative expansion around the mean of the sampling distribution. We characterize the bias and variance of the resulting Taylor-corrected estimators using the Lagrange error formula. Furthermore, we introduce a family of va…

2019-03-31abs ↗pdf ↗

New regularization techniques improve stability of deep neural networks.

problem Improving stability of deep neural networks in high-dimensional data.
method Apply manifold regularization to develop new regularizers based on graph Laplacian sparsification.
result Empirically, networks achieve high stability in various perturbation models, including adversarial attacks.

Develops new methods to create imperceptible image changes that fool classifiers.

problem Improving the robustness of image classifiers by creating subtle changes undetectable to humans.
method Two methods: Edge-Aware and Color-Aware, designed to reduce detectability of image perturbations.
result Demonstrated that the new methods effectively cause misclassification and are computationally efficient.

New technique stabilizes singular values in concatenated matrices.

problem How singular values of concatenated matrices relate to individual components.
method Developed perturbation technique extending classical results to concatenated matrices.
result Dominant singular values remain stable under small perturbations in submatrices.

Improved generalization with semantic perturbations using normalizing flows.

problem Overfitting in deep neural networks training.
method Use normalizing flows for generating semantically meaningful perturbations in latent space.
result Achieved 96.6% test accuracy on CIFAR-10 with ResNet-18, outperforming existing methods.

New method for analyzing compositional data, addressing biases in summary statistics.

problem Inadequate effect measures for compositional data, especially in high-dimensionality and sparsity.
method Perturbation-based effect measures, average perturbation effects.
result Proposed estimators efficiently estimate average perturbation effects, outperforming existing techniques.

We propose denoising dictionary learning (DDL), a simple yet effective technique as a protection measure against adversarial perturbations. We examined denoising dictionary learning on MNIST and CIFAR10 perturbed under two different perturbation techniques, fast gradient sign (FGSM) and jacobian saliency maps (JSMA). W…

2018-01-07abs ↗pdf ↗

We develop techniques for computing the integer valued SU(3) Casson invariant. Our method involves resolving the singularities in the flat moduli space using a twisting perturbation and analyzing its effect on the topology of the perturbed flat moduli space. These techniques, together with Bott-Morse theory and the spl…

2003-11-11abs ↗pdf ↗

In this work, we demonstrate the existence of universal adversarial audio perturbations that cause mis-transcription of audio signals by automatic speech recognition (ASR) systems. We propose an algorithm to find a single quasi-imperceptible perturbation, which when added to any arbitrary speech signal, will most likel…

2019-05-09abs ↗pdf ↗

This study benchmarks transcriptomics models for perturbation analysis, finding scVI and PCA superior.

problem Limited evaluation of transcriptomics foundation models for perturbation analysis.
method Developed a novel evaluation framework using diverse public datasets from different sequencing techniques and cell lines.
result scVI and PCA identified as superior models for understanding biological perturbations.

Neural networks are known to be vulnerable to adversarial examples, inputs that have been intentionally perturbed to remain visually similar to the source input, but cause a misclassification. It was recently shown that given a dataset and classifier, there exists so called universal adversarial perturbations, a single…

2017-08-17abs ↗pdf ↗

Adversarial Training (AT) and Virtual Adversarial Training (VAT) are the regularization techniques that train Deep Neural Networks (DNNs) with adversarial examples generated by adding small but worst-case perturbations to input examples. In this paper, we propose xAT and xVAT, new adversarial training algorithms, that …

2019-12-04abs ↗pdf ↗

The vulnerability of deep neural networks to adversarial attacks has been widely demonstrated (e.g., adversarial example attacks). Traditional attacks perform unstructured pixel-wise perturbation to fool the classifier. An alternative approach is to have perturbations in the latent space. However, such perturbations ar…

2020-01-06abs ↗pdf ↗

Many machine learning systems are vulnerable to small perturbations made to inputs either at test time or at training time. This has received much recent interest on the empirical front due to applications where reliability and security are critical. However, theoretical understanding of algorithms that are robust to a…

2019-11-29abs ↗pdf ↗

Adversarial examples are perturbed inputs designed to fool machine learning models. Adversarial training injects such examples into training data to increase robustness. To scale this technique to large datasets, perturbations are crafted using fast single-step methods that maximize a linear approximation of the model'…

2017-05-19abs ↗pdf ↗

The paper assesses machine learning robustness with covariate perturbations.

problem Ensuring robustness of machine learning models against adversarial attacks and data changes.
method Proposes a framework using covariate perturbation techniques to assess model robustness.
result Demonstrates the effectiveness of the approach in comparing robustness across models and identifying instabilities.

In a previous paper [\AS], we used superspace techniques to prove that perturbation theory (around a classical solution with no zero modes) for Chern--Simons quantum field theory on a general 33-manifold MM is finite. We conjectured (and proved for the case of 22-loops) that, after adding counterterms of the expecte…

1993-04-21abs ↗pdf ↗

New invariants for 3-manifolds derived from equivariant Cerf theory.

problem Existence of perturbative SU(n)SU(n) Casson invariants on integer homology spheres.
method Equivariant Cerf theory for Morse functions, adapted to infinite-dimensional setting.
result Existence and explicit formula for SU(4)SU(4) Casson invariants.

The conformal Willmore functional (which is conformal invariant in general Riemannian manifold (M,g)(M,g)) is studied with a perturbative method: the Lyapunov-Schmidt reduction. Existence of critical points is shown in ambient manifolds (R3,gε)(\mathbb{R}^3, g_ε) -where gεg_ε is a metric close and asymptotic to the euclidean o…

2010-10-20abs ↗pdf ↗

Evolutionary algorithm finds optimal pixel perturbations to improve neural network generalization.

problem Minimal data corruption by pixel modifications causes overfitting in neural networks.
method Evolutionary algorithm with a novel cost function to maximize generalization gap and domain divergence.
result Method outperforms previous pixel-based data distribution shift methods on CNNs.

Novel framework predicts cell responses to perturbations using GRNs.

problem Predicting cellular responses to perturbations for drug discovery and personalized therapeutics.
method Graph variational Bayesian causal inference framework with refined GRNs and robust estimator.
result Enhanced model performance and robust estimation of perturbation effects.

Human-machine interaction is increasingly dependent on speech communication. Machine Learning models are usually applied to interpret human speech commands. However, these models can be fooled by adversarial examples, which are inputs intentionally perturbed to produce a wrong prediction without being noticed. While mu…

2020-01-23abs ↗pdf ↗

We study the point of transition between complete and incomplete financial models thanks to Dirichlet Forms methods. We apply recent techniques, developped by Bouleau, to hedging procedures in order to perturbate parameters and stochastic processes, in the case of a volatility parameter fixed but uncertain for traders;…

2008-06-02abs ↗pdf ↗

Improved perturbation reduces matrix condition number to O(n) with minimal storage.

problem Reducing the condition number of deterministic matrices for efficient algorithmic use.
method Introduced pattern matrices and sparse perturbations with dependent entries.
result Condition number reduced to O(n) with O(n) random numbers in O(log n) precision.

This work improves structured prediction by learning the balance between signal and random noise.

problem Structured prediction with random perturbations.
method Learning the variance of randomized structured predictors to balance signal and noise.
result Learning the balance improves structured prediction effectiveness.

DIP-FAT improves adversarial training by diversifying perturbations.

problem Adversarial examples fool deep neural networks, leading to overfitting and poor performance.
method DIP-FAT uses random directions to diversify perturbations in adversarial training.
result DIP-FAT reduces overfitting and improves clean data accuracy.

Simple technique turns any adversarial attack into a universal one using few test examples.

problem Creating universal adversarial attacks with minimal data.
method Universalization technique using few adversarial test examples and spectral properties.
result Simple universalization technique achieves comparable fooling rates to state-of-the-art methods.

Paper proposes a black-box technique to generate adversarial samples.

problem Robustness of Deep Neural Networks (DNNs) to adversarial samples.
method Black-box Momentum Iterative Fast Gradient Sign Method (BMI-FGSM) using Differential Evolution to approximate gradients.
result Achieves high success rates in generating adversarial samples and misclassification.

In this paper we present a new methodology for option pricing. The main idea consists to represent a generic probability distribution function (PDF) via a perturbative expansion around a given, simpler, PDF (typically a gaussian function) by matching moments of increasing order. Because, as shown in literature, the pri…

2004-01-26abs ↗pdf ↗

We present CROSSGRAD, a method to use multi-domain training data to learn a classifier that generalizes to new domains. CROSSGRAD does not need an adaptation phase via labeled or unlabeled data, or domain features in the new domain. Most existing domain adaptation methods attempt to erase domain signals using technique…

2018-04-28abs ↗pdf ↗

Consider the massless Dirac operator on a 3-torus equipped with Euclidean metric and standard spin structure. It is known that the eigenvalues can be calculated explicitly: the spectrum is symmetric about zero and zero itself is a double eigenvalue. The aim of the paper is to develop a perturbation theory for the eigen…

2013-06-24abs ↗pdf ↗

This paper improves flow models to better handle perturbations in real-world data.

problem Flow models amplify initial errors in perturbed data, leading to poor generalization.
method Utilizes Bernstein-type polynomials to construct Normalizing Flows (NF) for higher robustness.
result Proposed NF framework provides theoretical upper bounds and practical advantages.

Enhances robustness of AT frameworks to multiple perturbations without increasing training complexity.

problem Defending against the union of multiple perturbations in adversarial training.
method SNAP technique that augments a network with shaped noise to enhance robustness.
result 14%-to-20% improvement in adversarial accuracy for ResNet-18 on CIFAR-10.