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

3977116154 · May 202619922001200920172026
48 results for spectral perturbation

The paper introduces spectral Einstein functionals for Dirac operators on manifolds with boundary.

problem Analyzing perturbations of Dirac operators on manifolds with boundary.
method Introduction of spectral Einstein functionals and proof of Dabrowski-Sitarz-Zalecki type theorems.
result Proof of theorems associated with spectral Einstein functionals for perturbations of Dirac operators.

Paper introduces a new multilinear functional for spectral triples and computes its properties.

problem Computing properties of spectral triples and their associated Hodge operators.
method Introduces a new multilinear functional for spectral triples and computes its properties using noncommutative residue and perturbed de-Rham Hodge operators.
result Recover two forms, torsion of the linear connection, and four forms by the noncommutative residue and perturbed de-Rham Hodge Dirac triple.

The paper examines how gradient descent stabilizes low-rank matrix factorization in noisy conditions.

problem Stability of low-rank implicit regularization in perturbed deep matrix factorization.
method Derives spectral conditions for gradient descent to exhibit a low-rank phase in noiseless settings and analyzes perturbed dynamics.
result Gradient descent converges to a low-rank solution under perturbation, with explicit dependence on perturbation size.

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.

Study spectral learning for odeco tensors, addressing initialization bottlenecks.

problem Recovering orthogonally decomposable tensors under noise.
method Investigates perturbation bounds, non-convex optimization, and initialization strategies.
result Initialization is the main bottleneck for efficient algorithms.

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 ↗

Beyond existing multi-view clustering, this paper studies a more realistic clustering scenario, referred to as incomplete multi-view clustering, where a number of data instances are missing in certain views. To tackle this problem, we explore spectral perturbation theory. In this work, we show a strong link between per…

2019-05-31abs ↗pdf ↗

We study the relationship between Bar-Natan's perturbation in Khovanov homology and Szabo's geometric spectral sequence, and construct a link invariant that generalizes both into a common theory. We study a few properties of the new invariant, and introduce a family of s-invariants from the new theory in the same spiri…

2014-10-10abs ↗pdf ↗

The paper addresses uncertainties in spectral clustering of corrupted data.

problem Uncertainties in spectral clustering due to measurement errors and missing data.
method Mathematical framework based on random set theory for Monte Carlo approximation of expected clusterings.
result Consistent quantities of interest for evaluating clusterings in corrupted data.

Deterministic bounds for tensor singular values and vectors, differing from matrix cases.

problem Spectral learning of higher-order orthogonally decomposable tensors.
method Deterministic perturbation bounds for singular values and vectors of orthogonally decomposable tensors.
result Perturbation affects each essential singular value/vector in isolation, independent of multiplicity and distance from other singular values.

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.

Laplacian Eigenvectors of the graph constructed from a data set are used in many spectral manifold learning algorithms such as diffusion maps and spectral clustering. Given a graph constructed from a random sample of a dd-dimensional compact submanifold MM in RD\mathbb{R}^D, we establish the spectral convergence rate…

2015-10-27abs ↗pdf ↗

New framework for higher-order singular-value derivatives of rectangular matrices.

problem Challenging to derive higher-order Fréchet derivatives of singular values in real rectangular matrices.
method Using Kato's analytic perturbation theory for self-adjoint operators and embedding rectangular matrices into block self-adjoint operators.
result Closed-form expressions for the nn-th order spectral variations of singular values.

Spectral portfolio theory links neural networks to wealth dynamics via SGD weight matrices.

problem Understanding wealth dynamics from neural network training.
method Direct identification of weight matrices as portfolio allocation matrices, linking SGD forces to portfolio dynamics.
result Spectral properties of SGD weight matrices transition between additive and multiplicative regimes, influencing wealth dynamics.

A method to explain disease transformation using biomarker covariance matrices.

problem Understanding disease transformation from a healthy baseline.
method Modeling healthy and disease states of biomarker covariance matrices to characterize perturbations.
result Disease perturbs the biomarker covariance structure, allowing for mechanistic explanations and individual patient prognosis.

The paper calculates spectral torsion for rescaled Dirac operators on manifolds.

problem Computing spectral torsion for rescaled Dirac operators.
method Using trilinear Clifford multiplication and functional of differential one-forms.
result Computed spectral torsion for four types of rescaled Dirac operators.

We study the (massless) Dirac operator on a 3-sphere equipped with Riemannian metric. For the standard metric the spectrum is known. In particular, the eigenvalues closest to zero are the two double eigenvalues +3/2 and -3/2. Our aim is to analyse the behaviour of eigenvalues when the metric is perturbed in an arbitrar…

2016-05-27abs ↗pdf ↗

Given the apparent difficulty of learning models that are robust to adversarial perturbations, we propose tackling the simpler problem of developing adversarially robust features. Specifically, given a dataset and metric of interest, the goal is to return a function (or multiple functions) that 1) is robust to adversar…

2018-11-15abs ↗pdf ↗

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.

Deep neural networks (DNNs) have set benchmarks on a wide array of supervised learning tasks. Trained DNNs, however, often lack robustness to minor adversarial perturbations to the input, which undermines their true practicality. Recent works have increased the robustness of DNNs by fitting networks using adversarially…

2018-11-19abs ↗pdf ↗

We derive a gauge theoretic invariant of integral homology 3-spheres which counts gauge orbits of irreducible, perturbed flat SU(3) connections with sign given by spectral flow. To compensate for the dependence of this sum on perturbations, the invariant includes contributions from the reducible, perturbed flat orbits.…

1998-09-22abs ↗pdf ↗

We study a regularizer which is defined as a parameterized infimum of quadratics, and which we call the box-norm. We show that the k-support norm, a regularizer proposed by [Argyriou et al, 2012] for sparse vector prediction problems, belongs to this family, and the box-norm can be generated as a perturbation of the fo…

2015-12-27abs ↗pdf ↗

Spectral graph sparsification preserves geometry of GNN embeddings.

problem Maintaining geometric properties of graph neural network embeddings during sparsification.
method Proving spectral sparsification preserves squared pairwise distances, class means, and covariance structure in embedding space.
result Spectral sparsification preserves the geometry of learned embeddings in GNNs.

This work uses Lyapunov theory to improve the robustness of deep neural networks against adversarial attacks.

problem Vulnerability of deep neural networks to subtle adversarial perturbations.
method Treated each layer as a nonlinear dynamical system and used Lyapunov theory for stability and robustness.
result Developed empirically tight bounds on adversarial perturbations and proved stability and robustness globally.

Researchers calculate exact moduli for type II flux backgrounds using spectral sequences.

problem Determining exact moduli of type II flux backgrounds in string theory.
method Using techniques from generalised geometry, they count infinitesimal deformations via a spectral sequence.
result The spectral sequence reproduces naïve expectations and shows all obstructions vanish, impacting the tadpole conjecture.

This work analyzes how different forms of compressibility affect adversarial robustness in neural networks.

problem Understanding the interaction between compressibility and adversarial robustness in neural networks.
method Developed a principled framework to analyze the effects of neuron-level sparsity and spectral compressibility on adversarial robustness.
result Identified that different forms of compression can induce highly sensitive directions in the representation space that adversaries can exploit.

We develop techniques for computing the integer valued SU(3) Casson invariant. Our method involves resolving the singularities in the flat moduli space using a twisting perturbation and analyzing its effect on the topology of the perturbed flat moduli space. These techniques, together with Bott-Morse theory and the spl…

2003-11-11abs ↗pdf ↗

In a noncommutative torus, effect of perturbation by inner derivation on the associated quantum stochastic process and geometric parameters like volume and scalar curvature have been studied. Cohomological calculations show that the above perturbation produces new spectral triples. Also for the Weyl C^*-algebra, the La…

2000-12-20abs ↗pdf ↗

The paper shows how solutions of perturbed Dirac operators concentrate near singular sets.

problem Understanding concentration of solutions for perturbed Dirac operators.
method Analyzing the algebraic criterion on $(c, \A)$ and spectral properties of deformed Laplacians.
result Proves an index localization theorem based on spectral separation properties.

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 ↗

Simple technique turns any adversarial attack into a universal one using few test examples.

problem Creating universal adversarial attacks with minimal data.
method Universalization technique using few adversarial test examples and spectral properties.
result Simple universalization technique achieves comparable fooling rates to state-of-the-art methods.

This paper focuses on spectral graph convolutional neural networks (ConvNets), where filters are defined as elementwise multiplication in the frequency domain of a graph. In machine learning settings where the dataset consists of signals defined on many different graphs, the trained ConvNet should generalize to signals…

2019-07-30abs ↗pdf ↗

Perturbation theory improves nonparametric instrumental variable estimation accuracy.

problem Improving nonparametric instrumental variable estimation accuracy in high-dimensional settings.
method Perturbative approach based on physics perturbation theory, extending kernel ridge methods with higher-order corrections.
result First-order perturbative corrections reduce prediction error by up to 99% in high-dimensional ill-defined cases.

We compute the Ricci curvature of a curved noncommutative three torus. The computation is done both for conformal and non-conformal perturbations of the flat metric. To perturb the flat metric, the standard volume form on the noncommutative three torus is perturbed and the corresponding perturbed Laplacian is analyzed.…

2018-08-09abs ↗pdf ↗

New spectral clustering method using LASSO regularization for robust graph partitioning.

problem Lack of theoretical guarantees for spectral clustering on general graph models.
method 1-spectral clustering on a new random model with LASSO regularization.
result Effective and robust to small noise perturbations, validated by simulations and real data.

Spectral clustering achieves strong consistency in the stochastic block model under certain conditions.

problem Achieving strong consistency in spectral clustering for the stochastic block model.
method Entrywise analysis of the Fielder eigenvector of graph Laplacians.
result Spectral clustering achieves exact recovery of hidden communities under matching information-theoretic limits.