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

Trend · papers per month

63125188250 · Jun 202019922001200920172026
48 results for smoothed perturbations

The paper smooths out equations on 4-manifolds to show smooth moduli spaces.

problem Understanding the structure of solutions to Vafa-Witten equations on 4-manifolds.
method Constructing perturbation terms to ensure transversality and showing moduli spaces are smooth.
result For generic perturbation, the general part of the moduli space is a smooth 0-dimensional manifold.

Study perturbations of submodules in Drury-Arveson space, finding smooth vector bundles with Hermitian connections.

problem Geometry of perturbations in Drury-Arveson space.
method Analysis of smooth vector bundles with Hermitian connections and computation of parallel transport operators.
result Found natural Hermitian connections on perturbed submodules.

In this work we prove the fact that, for a short time, it is possible to construct a smooth parametrized family of isometric embeddings of an arbitrary smooth parametrized family of Riemannian metrics on a smooth closed manifold into an Euclidean space. In order to prove this statement we work out stability estimates w…

2017-12-07abs ↗pdf ↗

This paper establishes transversality for perturbed Vafa-Witten moduli spaces on 4-manifolds.

problem Transversality of Vafa-Witten moduli spaces on 4-manifolds with C0C\equiv0.
method Constructing perturbation terms to ensure the moduli space is a smooth manifold of dimension zero.
result For generic perturbation terms, the moduli space of solutions is a smooth manifold of dimension zero.

Perturbs area-minimizing hypersurfaces to reduce singular set's dimension.

problem Reduces the dimension of the singular set of area-minimizing hypersurfaces.
method Perturbs a smooth hypersurface to minimize the Minkowski dimension of the singular set.
result The singular set of the perturbed minimizing current has Minkowski dimension less than n-9.

New framework improves adversarial robustness certification for various perturbations.

problem Certifying robustness against adversarial attacks in deep learning models.
method Unified functional optimization approach with non-Gaussian smoothing noise for multiple types of attacks.
result Achieves better certification results and identifies key trade-offs between accuracy and robustness.

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.

Introduces a new geometric framework for non-perturbative BV-theory.

problem Non-perturbative generalization of BV-theory in infinite-dimensional spaces.
method Derived differential geometry and homotopical algebraic geometry.
result Concrete model of derived smooth stacks for encoding non-perturbative BV-theory.

The paper studies heat kernels on modified manifolds and bounds their properties.

problem Bounding heat kernels on modified Riemannian manifolds.
method Derives upper bounds and gradient estimates for the heat kernel of (M,ildeg)(M, ilde{g}).
result Establishes upper bounds and gradient estimates for the heat kernel of modified manifolds.

We introduce a new stochastic smoothing perspective to study adversarial contextual bandit problems. We propose a general algorithm template that represents random perturbation based algorithms and identify several perturbation distributions that lead to strong regret bounds. Using the idea of smoothness, we provide an…

2018-10-11abs ↗pdf ↗

Local minimizers are convex and close to Wulff shapes.

problem Finding local minimizers in anisotropic isoperimetric problems.
method Showed local minimizers are geodesically convex and small smooth perturbations of tangent Wulff shapes.
result Local minimizers are quantitatively close to Wulff shapes.

Modified perturbation method removes non-smoothness in solving Black-Scholes equations.

problem Non-smoothness in solving Black-Scholes equations.
method Variable transformations and homotopy perturbation method.
result Excellent agreement with exact solutions for Black-Scholes and multi-asset options.

Despite achieving impressive performance, state-of-the-art classifiers remain highly vulnerable to small, imperceptible, adversarial perturbations. This vulnerability has proven empirically to be very intricate to address. In this paper, we study the phenomenon of adversarial perturbations under the assumption that the…

2018-02-23abs ↗pdf ↗

Work on making classifiers robust against adversarial attacks for top-k predictions.

problem Vulnerability of classifiers to adversarial perturbations, especially for top-k predictions.
method Randomized smoothing to turn any classifier into a robust one, using Gaussian noise.
result Derives a tight robustness in ℓ2 norm for top-k predictions, achieving 62.8% certified top-5 accuracy on ImageNet.

We show how to turn any classifier that classifies well under Gaussian noise into a new classifier that is certifiably robust to adversarial perturbations under the 2\ell_2 norm. This "randomized smoothing" technique has been proposed recently in the literature, but existing guarantees are loose. We prove a tight robu…

2019-02-08abs ↗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.

New method improves solving combinatorial optimization problems with smoothed policies.

problem Solving combinatorial optimization problems repeatedly with varying instances.
method Smoothed policies with controlled random perturbations to linear oracle, leading to differentiable surrogate risk.
result Generalization bound decomposes excess risk into bias, estimation, and optimization components.

New metrics produce discrete zero sets for nondegenerate harmonic forms.

problem Creating metrics to produce discrete zero sets for nondegenerate harmonic forms.
method Metric perturbation to produce new nondegenerate harmonic forms with discrete zero sets.
result Existence of metrics producing discrete zero sets for nondegenerate harmonic forms.

The traceless SU(2)SU(2) character variety R(S2,{ai,bi}i=1n)R(S^2,\{a_i,b_i\}_{i=1}^n) of a 2n2n-punctured 2-sphere is the symplectic reduction of a Hamiltonian nn-torus action on the SU(2)SU(2) character variety of a closed surface of genus nn. It is stratified with a finite singular stratum and a top smooth symplectic stratum of dimens…

2015-11-01abs ↗pdf ↗

SIGNNAP learns stable and identifiable node representations in GNNs against graph perturbations.

problem Fragility of GNN models to graph perturbations leading to unreliable node representations.
method SIGNNAP proposes a novel model that learns stable and identifiable node representations in an unsupervised manner, formalizing stability and identifiability through a contrastive objective and preserving smoothness with existing GNN backbones.
result SIGNNAP demonstrates effectiveness in learning stable and identifiable node representations in GNNs against graph perturbations on six benchmarks.

The paper proves stability of certain singularities in integrable systems.

problem Stability of singularities in integrable systems under perturbations.
method Analytic and smooth perturbations of completely integrable systems, connectedness condition.
result Non-degenerate singular fibers are structurally stable under small perturbations.

We present batch virtual adversarial training (BVAT), a novel regularization method for graph convolutional networks (GCNs). BVAT addresses the shortcoming of GCNs that do not consider the smoothness of the model's output distribution against local perturbations around the input. We propose two algorithms, sample-based…

2019-02-25abs ↗pdf ↗

The Yamabe flow can blow up in infinite time with small perturbations.

problem Understanding the behavior of the Yamabe flow under small perturbations.
method Constructive proof using solutions of the Yamabe problem on the unit sphere as blow-up profiles.
result The Yamabe flow can blow up at multiple points on a Riemannian manifold in infinite time with small perturbations.

Smooth knots with odd Conway polynomial terms have inscribed trefoils.

problem Finding inscribed trefoils for smooth knots with specific polynomial terms.
method Using a perturbation of the double-cover of the orientation class and analyzing planar configurations.
result Smooth knots with odd quadratic terms of the Conway polynomial have inscribed trefoils.

Langevin Monte Carlo (LMC) is an iterative algorithm used to generate samples from a distribution that is known only up to a normalizing constant. The nonasymptotic dependence of its mixing time on the dimension and target accuracy is understood mainly in the setting of smooth (gradient-Lipschitz) log-densities, a seri…

2019-05-30abs ↗pdf ↗

Hierarchical randomized smoothing improves model robustness for complex data.

problem Certifying robustness on complex data (e.g. images, graphs) is challenging.
method Add random noise to a randomly selected subset of entities in a hierarchical manner.
result Hierarchical randomized smoothing yields stronger robustness guarantees with high accuracy.

Improved online Lasso reduces regret in sparse linear contextual bandits.

problem Sparse linear contextual bandit problem with inefficient sampling.
method Perturbed adversary approach to alleviate sampling inefficiency.
result Online Lasso achieves O(kTlogd)\mathcal{O}(\sqrt{kT\log d}) regret bound.

The large kk asymptotics (perturbation series) for integrals of the form FμeikS\int_{\cal F}μe^{i k S}, where μμ is a smooth top form and SS is a smooth function on a manifold F{\cal F}, both of which are invariant under the action of a symmetry group G{\cal G}, may be computed using the stationary phase approximation…

1995-11-27abs ↗pdf ↗

We define a novel family of algorithms for the adversarial multi-armed bandit problem, and provide a simple analysis technique based on convex smoothing. We prove two main results. First, we show that regularization via the \emph{Tsallis entropy}, which includes EXP3 as a special case, achieves the Θ(TN)Θ(\sqrt{TN}) minim…

2015-12-14abs ↗pdf ↗

In the framework of fibred cusp operators on a manifold XX associated to a boundary fibration $Φ: \pa X\to Y$, the homotopy groups of the space of invertible smoothing perturbations of the identity are computed in terms of the K-theory of TYT^{*}Y. It is shown that there is a periodicity, namely the odd and the even h…

2004-08-17abs ↗pdf ↗

αα-Dirac-harmonic maps are variations of Dirac-harmonic maps, analogous to αα-harmonic maps that were introduced by Sacks-Uhlenbeck to attack the existence problem for harmonic maps from surfaces. For α>1α>1, the latter are known to satisfy a Palais-Smale condtion, and so, the technique of Sacks-Uhlenbeck consists in …

2019-03-19abs ↗pdf ↗

Paper defends deep learning classifiers against channel-aware adversarial attacks.

problem Deep learning classifiers are vulnerable to adversarial attacks.
method Channel-aware adversarial attacks are presented and defended against.
result Certified defense based on randomized smoothing makes classifiers robust.