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

1223 · Feb 202019922001200920172026
46 results for unperturbed

In this paper we will perturb the scalar curvature of compact Kahler manifolds by incorporating it with higher Chern forms, and then show that the perturbed scalar curvature has many common properties with the unperturbed scalar curvature. In particular the perturbed scalar curvature becomes a moment map, with respect …

2006-03-30abs ↗pdf ↗

We study general linear perturbations of a class of 4d real-dimensional hyperkahler manifolds obtainable by the (generalized) Legendre transform method. Using twistor methods, we show that deformations can be encoded in a set of holomorphic functions of 2d+1 variables, as opposed to the functions of d+1 variables contr…

2008-06-27abs ↗pdf ↗

Classical matrix perturbation results, such as Weyl's theorem for eigenvalues and the Davis-Kahan theorem for eigenvectors, are general purpose. These classical bounds are tight in the worst case, but in many settings sub-optimal in the typical case. In this paper, we present perturbation bounds which consider the natu…

2017-06-20abs ↗pdf ↗

EMPIR combines low and full precision DNNs to enhance robustness against adversarial attacks.

problem Vulnerability of DNNs to adversarial attacks that misclassify inputs with small perturbations.
method Ensemble of quantized DNN models with different numerical precisions.
result EMPIR ensembles increase adversarial robustness by 42.6% on average across different tasks.

We establish a canonical gluing procedure for Seiberg-Witten monopoles on the two pieces of a closed, oriented 4-manifold X which is split along a 3-dimensional closed, oriented submanifold. We only assume that the (unperturbed) character variety is Kuranishi-smooth and the limiting maps are transversal -- then we will…

2003-11-19abs ↗pdf ↗

We study the determination of the second-order normal form for perturbed Hamiltonians Hε=H0+εH1+ε22H2H_ε=H_0 +εH_1 +\frac{ε^2}{2} H_2, relative to the periodic flow of the unperturbed Hamiltonian H0H_0. The formalism presented here is global, and can be easily implemented in any CAS. We illustrate it by means of two examples: the H…

2013-01-15abs ↗pdf ↗

In \cite{LZ2} it is proved that for certain class of perturbations of the hyperbolic equation ut=f(u)uxu_t=f(u) u_x, there exist changes of coordinate, called quasi-Miura transformations, that reduce the perturbed equations to the unperturbed one. We prove in the present paper that if in addition the perturbed equations posse…

2007-11-16abs ↗pdf ↗

We outline a detection method for adversarial inputs to deep neural networks. By viewing neural network computations as graphs upon which information flows from input space to out- put distribution, we compare the differences in graphs induced by different inputs. Specifically, by applying persistent homology to these …

2017-11-28abs ↗pdf ↗

We propose an algorithm to enhance certified robustness of a deep model ensemble by optimally weighting each base model. Unlike previous works on using ensembles to empirically improve robustness, our algorithm is based on optimizing a guaranteed robustness certificate of neural networks. Our proposed ensemble framewor…

2019-10-31abs ↗pdf ↗

Node-perturbation learning is a type of statistical gradient descent algorithm that can be applied to problems where the objective function is not explicitly formulated, including reinforcement learning. It estimates the gradient of an objective function by using the change in the object function in response to the per…

2017-06-20abs ↗pdf ↗

Geometrically transforms nonconservative dynamics to linearize Kepler and Manev systems.

problem Regularizing and linearizing nonconservative central force dynamics.
method Projective transformation and conformal scaling in configuration and phase spaces.
result Full linearization of Kepler and Manev dynamics in any finite dimension.

This work precisely characterizes and improves the tradeoff between robustness and accuracy in linear regression.

problem Tradeoff between robustness and accuracy in adversarial training.
method Characterizes the effect of augmentation on standard error in linear regression; proves RST improves robust error without sacrificing standard error.
result RST improves both standard and robust error for neural networks under various perturbations.

More data can widen the gap between robust and standard models against adversarial attacks.

problem The gap between adversarially robust and standard machine learning models' generalization error increases with more data.
method Theoretical analysis of Gaussian and Bernoulli models under \ell_\infty attacks, and experiments on linear regression models.
result Additional data can increase the generalization gap between adversarially robust and standard models.

Improves deep learning robustness by enforcing local and global compactness.

problem Deep neural networks' vulnerability to adversarial attacks.
method Proposes Adversary Divergence Reduction Network (ADRN) that enforces local/global compactness and clustering assumption.
result Augmenting adversarial training with ADRN components improves robustness.

Study how nodal domains change on surfaces under perturbations.

problem How eigenfunction nodal domains change on surfaces under smooth perturbations.
method Sector/graph count near nodal critical points, upper semicontinuity proof, branch-free on spectral clusters, wavelength-scale analysis.
result Upper semicontinuity of nodal domain count, no new domains created at wavelength scale, stable count in noncritical cases.

This paper provides both a detailed study of color-dependence of link homologies, as realized in physics as certain spaces of BPS states, and a broad study of the behavior of BPS states in general. We consider how the spectrum of BPS states varies as continuous parameters of a theory are perturbed. This question can be…

2015-12-24abs ↗pdf ↗

Clustering algorithms are used in a large number of applications and play an important role in modern machine learning-- yet, adversarial attacks on clustering algorithms seem to be broadly overlooked unlike supervised learning. In this paper, we seek to bridge this gap by proposing a black-box adversarial attack for c…

2019-11-16abs ↗pdf ↗

Deep neural networks are known to be vulnerable to adversarial attacks. Current methods of defense from such attacks are based on either implicit or explicit regularization, e.g., adversarial training. Randomized smoothing, the averaging of the classifier outputs over a random distribution centered in the sample, has b…

2019-11-17abs ↗pdf ↗

The study uses response theory to understand RNNs processing input signals.

problem Understanding how RNNs process sequential data.
method Deriving a Volterra series representation for SRNNs output using response theory from nonequilibrium statistical mechanics.
result SRNNs can be viewed as kernel machines operating on a reproducing kernel Hilbert space associated with the response feature.

Study shows different behaviors of noncompact hypersurfaces under mean curvature flow.

problem Analyzing stability of noncompact hypersurfaces with curvature blowup.
method Numerical overlap method to construct global solutions.
result Existence of near and far classes of initial data leading to distinct behaviors.

Framework predicts nonlinear system responses using GFDT and generative models.

problem Predicting higher-order moments of nonlinear stochastic systems to small perturbations.
method Combining GFDT with generative modeling to estimate score function directly from data.
result Accurately captures nonlinear and non-Gaussian features of system responses.

Reinforcement Learning optimizes low-thrust interplanetary trajectories under disturbances.

problem Designing robust interplanetary trajectories in the presence of disturbances.
method Reformulated as a Markov Decision Process, RL algorithm Proximal Policy Optimization trained on a deep neural network.
result Deep neural network provides robust nominal trajectory and guidance law.

In adversarial attacks to machine-learning classifiers, small perturbations are added to input that is correctly classified. The perturbations yield adversarial examples, which are virtually indistinguishable from the unperturbed input, and yet are misclassified. In standard neural networks used for deep learning, atta…

2018-09-25abs ↗pdf ↗

The paper analyzes adversarial training effects on classification accuracy.

problem Understanding adversarial training's impact on standard and robust accuracy.
method Derived precise statistical analysis for binary classification problems with Gaussian data.
result Theoretical explanation of standard and robust accuracy trends for adversarial training.

More training data can hurt the generalization of adversarially robust models.

problem The challenge of balancing adversarial robustness and generalization in machine learning models.
method Investigation of three regimes based on adversary strength and empirical studies on various models.
result More training data can hurt the generalization of adversarially robust models in different regimes.

LGAC enhances heat transfer in turbulent boundary layers using slot jets.

problem Enhancing convective heat transfer in turbulent boundary layers.
method Artificial intelligence-based linear genetic algorithms control (LGAC) with slot jets.
result LGAC optimizes heat transfer and flow asymmetry in turbulent boundary layers.

Empirical study on SGD hyperparameters and adversarial robustness.

problem Effect of SGD hyperparameters on adversarial robustness and generalization.
method Empirical observation of learning rate, batch size, and momentum effects on adversarial robustness and generalization.
result Constant learning rate to batch size ratio leads to good generalization and almost constant adversarial robustness.

The paper analyzes how quantization affects the Fisher Information Matrix's dominant eigenvalue.

problem The impact of quantization on the Fisher Information Matrix's dominant eigenvalue.
method The study examines spectral perturbation of the empirical Fisher Information Matrix under in-distribution input and quantized parameter perturbations.
result A bound on the eigenvalue under quantization noise, showing it strictly exceeds the unperturbed value at leading order.