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.
Deep neural networks are susceptible to adversarial manipulations in the input domain. The extent of vulnerability has been explored intensively in cases of ℓp-bounded and ℓp-minimal adversarial perturbations. However, the vulnerability of DNNs to adversarial perturbations with specific statistical properti…
We study perturbations of a partially hyperbolic toral automorphism L which is diagonalizable over C and has a dense center foliation. For a small perturbation of L with a smooth center foliation we establish existence of a smooth leaf conjugacy to L. We also show that if a small perturbation of an ergodic irreducible …
We prove a Freed-Uhlenbeck style generic smoothness theorem for the moduli space of solutions to the Vafa--Witten equations on a closed symplectic four-manifold by using a method developed by Feehan for the study of the PU(2)-monopole equations on smooth closed four-manifolds. We introduce a set of perturbation terms…
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…
On a smooth complete Riemannian spin manifold with smooth compact boundary, we demonstrate that the Atiyah-Singer Dirac operator DB in L2 depends Riesz continuously on L∞ perturbations of local boundary conditions B. The Lipschitz bound for the map ${…
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…
The problem of attribution is concerned with identifying the parts of an input that are responsible for a model's output. An important family of attribution methods is based on measuring the effect of perturbations applied to the input. In this paper, we discuss some of the shortcomings of existing approaches to pertur…
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…
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 norm. This "randomized smoothing" technique has been proposed recently in the literature, but existing guarantees are loose. We prove a tight robu…
The traceless SU(2) character variety R(S2,{ai,bi}i=1n) of a 2n-punctured 2-sphere is the symplectic reduction of a Hamiltonian n-torus action on the SU(2) character variety of a closed surface of genus n. It is stratified with a finite singular stratum and a top smooth symplectic stratum of dimens…
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.
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…
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…
We consider the problem of finding local minimizers in non-convex and non-smooth optimization. Under the assumption of strict saddle points, positive results have been derived for first-order methods. We present the first known results for the non-smooth case, which requires different analysis and a different algorithm…
The large k asymptotics (perturbation series) for integrals of the form ∫FμeikS, where μ is a smooth top form and S is a smooth function on a manifold F, both of which are invariant under the action of a symmetry group G, may be computed using the stationary phase approximation…
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) minim…
In the framework of fibred cusp operators on a manifold X 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 T∗Y. It is shown that there is a periodicity, namely the odd and the even h…
α-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, the latter are known to satisfy a Palais-Smale condtion, and so, the technique of Sacks-Uhlenbeck consists in …