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

103205308410 · Jun 202019922001200920172026
48 results for Small smooth perturbations

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.

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 ↗

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.

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.

Graphs can be fooled by small edge changes, but this work protects them.

problem Adversaries can manipulate graph data to mislead graph classification models.
method We introduce a smoothed graph classification model with a robustness guarantee.
result The smoothed model maintains consistent predictions under small adversarial perturbations.

Noise injection before gradient steps helps in regularization for neural networks.

problem Improving generalization in overparametrized neural networks.
method Injecting small noise perturbations before computing gradient steps, especially in layer-wise fashion.
result Small noise perturbations can explicitly regularize neural networks without variance explosion.

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.

This paper focuses on spectral filters on graphs, namely filters defined as elementwise multiplication in the frequency domain of a graph. In many graph signal processing settings, it is important to transfer a filter from one graph to another. One example is in graph convolutional neural networks (ConvNets), where the…

2019-01-29abs ↗pdf ↗

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 ↗

This paper studies least-square regression penalized with partly smooth convex regularizers. This class of functions is very large and versatile allowing to promote solutions conforming to some notion of low-complexity. Indeed, they force solutions of variational problems to belong to a low-dimensional manifold (the so…

2014-05-05abs ↗pdf ↗

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.

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 ↗

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.

Smooth minimizing hypersurfaces in 11D are generic, with singularities in higher dimensions.

problem Finding smooth minimizing hypersurfaces in high dimensions.
method Analyzing the Plateau problem and area minimization in integral homology.
result Smooth minimizing hypersurfaces are generic in 11D, with singularities in higher dimensions.

Let ΩΩ be an open half-space or slab in Rn+1\mathbb{R}^{n+1} endowed with a perturbation of the Gaussian measure of the form f(p):=exp(ω(p)cp2)f(p):=\exp(ω(p)-c|p|^2), where c>0c>0 and ωω is a smooth concave function depending only on the signed distance from the linear hyperplane parallel to Ω\partialΩ. In this work we follow a varia…

2014-03-18abs ↗pdf ↗

Study small perturbations on low energy Laplace eigenfunctions.

problem Understanding small changes in low energy Laplace eigenfunctions.
method Investigates nodal geometry and topology, focusing on low frequency regimes and small perturbations.
result Highlight interesting aspects of spectral theory and nodal phenomena tied to ground state/low energy eigenfunctions.

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.

A large class of vacuum space-times is constructed in dimension 4+1 from hyperboloidal initial data sets which are not small perturbations of empty space data. These space-times are future geodesically complete, smooth up to their future null infinity, and extend as vacuum space-times through their Cauchy horizon. Dime…

2001-06-20abs ↗pdf ↗

Billiard trajectories (broken generalised geodesics) are considered in the exterior of an obstacle KK with smooth boundary on an arbitrary Riemannian manifold. We prove a generalisation of the well-known Santalo's formula. As a consequence, it is established that if the set of trapped points has positive measure, then…

2016-01-15abs ↗pdf ↗

The paper examines fair pricing and hedging stability under small numéraire perturbations.

problem Fair pricing and hedging stability under numéraire perturbations.
method Reformulating the stochastic control problem to show stability and deriving asymptotic formulas.
result Fair price and hedging strategy are stable with small numéraire perturbations.

It is conjectured that the moduli b-divisor of the Kawamata-Kodaira canonical bundle formula associated to a klt-trivial fibration (X,B)Z(X,B)\to Z is semi-ample. In this paper, we show the semi-ampleness of an arbitrarily small perturbation of the moduli b-divisor by a fixed appropriate divisor which roughly speaking come…

2012-07-17abs ↗pdf ↗

Image classifiers are sensitive to small changes, affecting most images in a class.

problem Sensitivity of image classifiers to small perturbations.
method Demonstrated sensitivity for any classifier over images, showing that for most classes, a tiny perturbation can change the classification of a majority of images.
result Image classifiers are sensitive to small perturbations, affecting most images in a class.

New method improves smoothness of minimizing currents near singular points.

problem Improving smoothness of minimizing currents near singular points.
method New method to estimate the full singular set of the foliation by minimizers and proof of superlinear decay of closeness.
result Generic smoothness of minimizers improved to n9εnn-9-\varepsilon_n for n11n \geq 11.

In this paper we find smooth embeddings of solenoids in smooth foliations. We show that if a smooth foliation F of a manifold M contains a compact leaf L with H^1(L;R)= 0 and if the foliation is a product foliation in some saturated open neighbourhood U of L, then there exists a foliation F' on M which is C^1-close to …

2008-12-05abs ↗pdf ↗

Geodesic spheres in certain symmetric spaces are quantitatively stable under small perturbations.

problem Stability of geodesic spheres in symmetric spaces under perturbations.
method Quantitative stability analysis using spectral gap of the Laplacian on geodesic spheres.
result Geodesic spheres are uniformly stable with respect to small C1C^1-volume preserving perturbations.

New robustness measure accounts for task-specific symmetries.

problem Traditional robustness measures fail for tasks with inherent symmetries.
method Sound notion of adversarial robustness for equivariant tasks, using randomized smoothing and graph edit distance certificates.
result Provable robustness can be achieved for various tasks with inherent symmetries.

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.

SmoothLLM defends LLMs from jailbreaking attacks by randomly perturbing inputs.

problem Adversaries can fool large language models into generating objectionable content.
method SmoothLLM randomly perturbs multiple copies of a prompt and aggregates predictions to detect adversarial inputs.
result SmoothLLM sets the state-of-the-art for robustness against various jailbreak attacks.