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

25497498 · Feb 202019922001200920172026
48 results for perturbation radius

Stability of submanifold cut loci under metric perturbations proved.

problem Stability of submanifold cut loci under metric perturbations.
method Continuity of injectivity radius and Whitney C2C^2 perturbation of submanifolds.
result Hausdorff stability of submanifold cut loci under C2C^2 metric perturbations.

For a polygonal knot K, it is shown that a tube of radius R(K), the polygonal thickness radius, is an embedded torus. Given a thick configuration K, perturbations of size r<R(K) define satellite structures, or local knotting. We explore knotting within these tubes both theoretically and numerically. We provide bounds o…

2005-08-16abs ↗pdf ↗

New uniqueness concept for adversarial Bayes classifier.

problem Understanding adversarial Bayes classifiers in binary classification.
method Developed a new notion of uniqueness and analyzed it for a family of one-dimensional data distributions.
result Improved regularity of adversarial Bayes classifiers as perturbation radius increases.

In this paper, we discuss the sensitivity of quantum PageRank. By using the finite dimensional perturbation theory, we estimate the change of the quantum PageRank under a small analytical perturbation on the Google matrix. In addition, we will show the way to estimate the lower bound of the convergence radius as well a…

2019-06-27abs ↗pdf ↗

Adversarial training purifies hidden weights to remove small perturbations.

problem Understanding and removing adversarial perturbations in deep learning models.
method Introducing Feature Purification, a principle that adversarial training aims to remove small dense mixtures in hidden weights.
result Adversarial training can make neural networks robust against small perturbations, even with simple algorithms.

Adversarial training improves linear regression solutions, offering robustness against small perturbations.

problem Vulnerability of linear models to adversarial perturbations.
method Formulated as a min-max problem, adversarial training minimizes the best solution under worst-case attacks.
result Adversarial training yields the minimum-norm interpolating solution in overparameterized models, equivalent to parameter shrinking methods in underparameterized models.

In this paper we study the behaviour of the continuous spectrum of the Laplacian on a complete Riemannian manifold of bounded curvature under perturbations of the metric. The perturbations that we consider are such that its covariant derivatives up to some order decay with some rate in the geodesic distance from a fixe…

2007-01-10abs ↗pdf ↗

New method μP2μP^2 improves neural network training by scaling perturbations layerwise.

problem Improving neural network performance as models scale up.
method Layerwise perturbation scaling in the infinite-width limit of neural networks.
result Layerwise perturbation scaling ensures all layers are effectively perturbed in the limit.

The gluing technique is used to construct hypersurfaces in Euclidean space having approximately constant prescribed mean curvature. These surfaces are perturbations of unions of finitely many spheres of the same radius assembled end-to-end along a line segment. The condition on the existence of these hypersurfaces is t…

2009-02-20abs ↗pdf ↗

Extends randomized smoothing to certify robustness against various threat models and adversarial perturbations.

problem Certifying robustness of classifiers against adversarial perturbations.
method Develops a method to certify robustness against any p\ell_p (pN>0p\in\mathbb{N}_{>0}) minimized adversarial perturbation.
result Randomized smoothing suffers from the curse of dimensionality, reducing effective radius as pp increases.

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.

Let (M,g)(\mathcal{M}, g) be a compact Riemannian manifold of dimension N2N\geq 2. We prove the existence of a family (Ωε)ε(0,ε0)(Ω_\varepsilon)_{\varepsilon\in (0,\varepsilon_0)} of self-Cheeger sets in (M,g)(\mathcal{M}, g) . The domains ΩεMΩ_\varepsilon\subset\mathcal{M} are perturbations of geodesic balls of radius ε\varepsilon c…

2016-06-12abs ↗pdf ↗

Let (M,g)(\mathcal{M},g) be a compact Riemannian manifold of dimension N2N\geq 2. We prove the existence of a family (Ωε)ε(0,ε0)(Ω_\varepsilon)_{\varepsilon\in (0,\varepsilon_0)} of self-Cheeger sets in (M,g)(\mathcal{M},g) . The domains ΩεMΩ_\varepsilon\subset\mathcal{M} are perturbations of geodesic balls of radius ε\varepsilon cen…

2016-03-01abs ↗pdf ↗

The ratio of convexity radius over injectivity radius may be made arbitrarily small within the class of compact Riemannian manifolds of any fixed dimension at least two. This is proved using Gulliver's method of constructing manifolds with focal points but no conjugate points. The approach is suggested by a characteriz…

2014-12-01abs ↗pdf ↗

This paper is concerned with the location of nodal sets of eigenfunctions of the Dirichlet Laplacian in thin tubular neighbourhoods of hypersurfaces of the Euclidean space of arbitrary dimension. In the limit when the radius of the neighbourhood tends to zero, it is known that spectral properties of the Laplacian are a…

2014-06-16abs ↗pdf ↗

Upper bound for conjugate radius in open manifolds with scalar curvature and spectrum constraints.

problem Bounding the conjugate radius of open manifolds with specific curvature and spectrum conditions.
method Established an upper bound using scalar curvature and bottom-of-spectrum constraints.
result For certain conditions, the conjugate radius is no more than π.

Adversarial training leads to large generalization gap, decomposed into bias and variance.

problem Understanding the large generalization gap in adversarially trained models.
method Bias-Variance decomposition of test risk as a function of adversarial perturbation radius.
result Bias increases monotonically with adversarial perturbation radius and is dominant in test risk.

The paper bounds bandwidth and focal radius for manifolds with positive isotropic curvature.

problem Bounding bandwidth and focal radius for manifolds with positive isotropic curvature.
method Using spectral properties of a twisted de Rham-Hodge operator.
result Upper bounds on bandwidth and focal radius are derived for hypersurfaces in PIC manifolds.

Upper bound on Stiefel manifold's injectivity radius found.

problem Finding the maximum distance within which the Stiefel manifold remains injective.
method Exhibited conjugate points and calculated the minimum of geodesic lengths.
result Upper bound on Stiefel manifold's injectivity radius is conjectured to be equal to the injectivity radius.