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

7142027 · May 202619922001200920172026
48 results for finite-dimensional eigenspace

In a noncompact harmonic manifold MM we establish finite dimensionality of the eigenspaces VλV_λ generated by radial eigenfunctions of the form coshr+c\cosh r + c. As a consequence, for such harmonic manifolds, we give an isometric imbedding of MM into (Vλ,B)(V_λ,B), where BB is a nondegenerate symmetric bilinear indefinite …

1996-03-23abs ↗pdf ↗

Consider the sum of the first NN eigenspaces for the Laplacian on a Riemannian manifold. A basis for this space determines a map to Euclidean space and for NN sufficiently large the map is an embedding. In analogy with a fruitful idea of Kähler geometry, we define (Riemannian) Bergman metrics of degree NN to be thos…

2013-10-18abs ↗pdf ↗

Efficiently approximates eigenspaces for symmetric and general matrices.

problem Fast computation of eigenspaces for large matrices.
method Factor eigenspaces into fundamental components using transformations, solve minimization problems, and iteratively update.
result Improved computational efficiency for eigenspace approximation.

Minimal Morse functions on Poincaré dodecahedral space are selected via spectral properties.

problem Identifying minimal Morse functions on the Poincaré dodecahedral space.
method Spectral selection property P, obstruction principle, conformal variations, finite dimensional reduction.
result Restoration of minimal Morse selection on the Poincaré dodecahedral space via spectral mechanisms.

This paper tackles distributed estimation of the top-L eigenspace in PCA for large data sets.

problem Challenges in estimating the top-L eigenspace in principal component analysis for large data sets.
method Proposes a novel multi-round algorithm using shift-and-invert preconditioning and convex optimization.
result Achieves a fast convergence rate and covers the targeted top-L eigenspace without explicit eigengap assumption.

Our work connects parameter magnitudes and Hessian eigenspaces in deep neural nets.

problem Understanding the relationship between parameter magnitudes and Hessian curvature in deep learning models.
method Developed a matrix-free algorithm based on sketched SVDs to measure similarity between parameter masks and Hessian eigenspaces.
result Top Hessian eigenvectors tend to be concentrated around larger parameters, indicating a connection between parameter magnitudes and loss curvature.

New algorithm estimates eigenspace with faulty nodes, matching performance of existing methods.

problem Estimating eigenspace in distributed systems with node failures.
method Develops an eigenspace estimation algorithm for distributed environments with arbitrary node failures.
result Matches performance of existing non-robust estimator up to an additive error.

FedPower improves eigenspace estimation privacy in federated learning.

problem Privacy breaches and communication challenges in federated eigenspace estimation.
method FedPower uses a power method with local power iterations and global aggregation, weighted by OPT, and adds Gaussian noise for privacy.
result FedPower provides convergence bounds and demonstrates effectiveness in experiments.

Physics-informed GP regression solves eigenvalue problems by identifying non-trivial eigenspaces.

problem Solving eigenvalue problems of linear operators with trivial solutions.
method Constructing a transfer function-type indicator using physics-informed Gaussian Process posterior.
result The posterior covariance is non-trivial only for eigenvalues of the operator, indicating non-trivial eigenspaces.

Compressing word embeddings is important for deploying NLP models in memory-constrained settings. However, understanding what makes compressed embeddings perform well on downstream tasks is challenging---existing measures of compression quality often fail to distinguish between embeddings that perform well and those th…

2019-09-03abs ↗pdf ↗

Paper identifies key function spaces for ReLU networks based on Fisher information.

problem Understanding the structure of Fisher information matrices in ReLU networks.
method Spectral decomposition of Fisher information matrices, focusing on the first three eigenspaces.
result The first three eigenspaces account for 97.7% of the trace of the Fisher information matrix, corresponding to spherical harmonic functions of order ≤2.

For a compact homogeneous space G/KG/K, we study the problem of existence of GG-invariant Riemannian metrics such that each eigenspace of the Laplacian is a real irreducible representation of GG. We prove that the normal metric of a compact irreducible symmetric space has this property only in rank one. Furthermore, w…

2017-07-05abs ↗pdf ↗

If GG is a compact Lie group endowed with a left invariant metric gg, then GG acts via pullback by isometries on each eigenspace of the associated Laplace operator ΔgΔ_g. We establish algebraic criteria for the existence of left invariant metrics gg on GG such that each eigenspace of ΔgΔ_g, regarded as the real ve…

2016-02-15abs ↗pdf ↗

In this paper, we present an online adaptive PCA algorithm that is able to compute the full dimensional eigenspace per new time-step of sequential data. The algorithm is based on a one-step update rule that considers all second order correlations between previous samples and the new time-step. Our algorithm has O(n) co…

2017-09-07abs ↗pdf ↗

In this paper, we aim at recovering an undirected weighted graph of NN vertices from the knowledge of a perturbed version of the eigenspaces of its adjacency matrix WW. For instance, this situation arises for stationary signals on graphs or for Markov chains observed at random times. Our approach is based on minimizi…

2016-03-26abs ↗pdf ↗

Let XX be an nn-dimensional manifold and V1,,VnC(X,R)V_1, \ldots, V_n \subset C^\infty(X, \mathbb R) finite-dimensional vector spaces with Euclidean metric. We assign to each ViV_i a Finsler ellipsoid, i.e., a family of ellipsoids in the fibers of the cotangent bundle of XX. We prove that the average number of isolated common…

2018-02-08abs ↗pdf ↗

The instanton Floer homology of a knot in the three-sphere is a vector space with a canonical mod 2 grading. It carries a distinguished endomorphism of even degree,arising from the 2-dimensional homology class represented by a Seifert surface. The Floer homology decomposes as a direct sum of the generalized eigenspaces…

2009-07-27abs ↗pdf ↗

Analysis of DPPs and k-DPPs via spectral decomposition reveals identifiable parameters and non-identifiability gaps.

problem Identifying parameters of DPPs and k-DPPs through spectral decomposition.
method Spectral decomposition of the covariance matrix, analysis of invariances, and counting arguments.
result Identifiability of parameters changes fundamentally for k-DPPs, with specific invariances and non-identifiability gaps.

A local classification of locally conformal flat Riemannian Einstein-like four-manifolds as well as a local classification of all locally conformal flat Riemannian four-manifolds for which all Jacobi operators have parallel eigenspaces along every geodesic is given. Non-trivial explicit examples are presented. The prob…

1997-02-24abs ↗pdf ↗

This paper presents a novel time series clustering method, the self-organising eigenspace map (SOEM), based on a generalisation of the well-known self-organising feature map (SOFM). The SOEM operates on the eigenspaces of the embedded covariance structures of time series which are related directly to modes in those tim…

2019-05-14abs ↗pdf ↗

TransNet improves community detection on target networks using privacy-preserved source networks.

problem Community detection on sensitive network data with privacy constraints.
method Spectral clustering framework leveraging locally distributed privacy-preserved auxiliary networks via randomized response and adaptive weighting.
result TransNet delivers strong gains in community detection across various privacy levels and heterogeneity patterns.

New spectral theory for non-associative algebras with applications to Moufang dynamics.

problem Spectral theory of non-associative algebras and their applications.
method Introducing almost periodic Banach--Malcev algebras and analyzing their spectral properties.
result Spectral characterization and continuous functional calculus for almost periodic derivations.

We focus in this work on the estimation of the first kk eigenvectors of any graph Laplacian using filtering of Gaussian random signals. We prove that we only need kk such signals to be able to exactly recover as many of the smallest eigenvectors, regardless of the number of nodes in the graph. In addition, we address…

2016-11-03abs ↗pdf ↗

A theory of feature geometry using spectral analysis of weight matrices.

problem Current methods decompose neural network activations into sparse linear features, losing geometric structure.
method Develops a theory by analyzing the spectra of weight-derived matrices, introducing the frame operator.
result Features collapse onto single eigenspaces, organizing into tight frames, and admit discrete classification.

Principal components analysis (PCA) is a widely used dimension reduction technique with an extensive range of applications. In this paper, an online distributed algorithm is proposed for recovering the principal eigenspaces. We further establish its rate of convergence and show how it relates to the number of nodes emp…

2019-05-17abs ↗pdf ↗

This paper addresses a gap in the classifcation of Codazzi tensors with exactly two eigenfunctions on a Riemannian manifold of dimension three or higher. Derdzinski proved that if the trace of such a tensor is constant and the dimension of one of the the eigenspaces is n1n-1, then the metric is a warped product where t…

2011-11-29abs ↗pdf ↗

For generic torus-invariant metrics, eigenspaces are 2D and nodal sets are connected hypersurfaces.

problem Understanding spectral multiplicity and nodal sets for generic torus-invariant metrics.
method Analyzing real ΔgΔ_g-eigenspaces and nodal sets for generic TT-invariant metrics.
result For generic TT-invariant metrics, real ΔgΔ_g-eigenspaces are irreducible and have dimension at most 2, and nodal sets are connected hypersurfaces with specific properties.

Study spectral properties of graph Laplacian for manifold data.

problem Understanding spectral properties of graph Laplacian for manifold data.
method Non-asymptotic error bounds on spectral properties of empirical graph Laplacian.
result Eigenvalues and eigenspaces of empirical graph Laplacian are close to Laplace-Beltrami operator of manifold.

Proposes BONMI for integrating noisy matrices from multi-source data.

problem Integrating noisy matrices from multi-source data with block-wise missingness.
method Exploits orthogonal Procrustes problem to align eigenspaces and completes missing blocks.
result Statistical rate for eigenspace of underlying matrix comparable to independently missing assumption.

The paper explores how word embeddings affect the stability of downstream NLP models.

problem Small changes in training data can cause significant changes in model predictions.
method Empirical and theoretical analysis of embedding instability, including the introduction of eigenspace instability measure.
result Increasing embedding memory can reduce the disagreement in predictions by 5% to 37%.

Researchers create surfaces with exceptionally high Steklov eigenvalues.

problem Creating surfaces with first non-zero Steklov eigenvalue of large multiplicity.
method Constructing surfaces with specific isometry groups and gluing them based on Cayley graph structures, then analyzing the eigenspace properties.
result Surfaces with arbitrarily large multiplicity for their first non-zero Steklov eigenvalue are constructed.

This paper uncovers the low-rank structure of neural network Hessians.

problem Understanding the structure of Hessians in neural networks.
method Proposes a decoupling conjecture to decompose layer-wise Hessians into Kronecker products of smaller matrices.
result Proves the structure of top eigenspaces in 2-layer networks and shows high overlap in top eigenvectors across different models.

The paper calibrates shrinkage covariance estimators for spectral functionals in high dimensions.

problem Calibrating shrinkage covariance estimators for spectral functionals in high dimensions.
method Derives first-order null laws, distribution-free Davis-Kahan bands, and calibrated tests for spectral functionals under shrinkage.
result Calibrated tests and intervals for spectral functionals are provided, addressing the issue of estimation noise and shrinkage bias.

Let (E,h)(E,h) be a holomorphic Hermitian vector bundle over a polarized manifold. We provide a canonical quantization of the Laplacian operator acting on sections of the bundle of Hermitian endomorphisms of EE. If EE is simple we obtain an approximation of the eigenvalues and eigenspaces of the Laplacian.

2015-05-14abs ↗pdf ↗

The resonant band is a useful notion for the computation of the nontrivial monodromy eigenspaces of the Milnor fiber of a real line arrangement. In this article, we develop the resonant band description for the cohomology of the Aomoto complex. As an application, we prove that real 4-nets do not exist.

2014-04-20abs ↗pdf ↗

Let (M,g)(M,g) be a compact Riemannian manifold and PgP_g an elliptic, formally self-adjoint, conformally covariant operator of order mm acting on smooth sections of a bundle over MM. We prove that if PgP_g has no rigid eigenspaces (see Definition 2.2), the set of functions fC(M,R)f \in C^\infty(M, R) for which PefgP_{e^fg} ha…

2012-07-03abs ↗pdf ↗

SGD's training dynamics align with Hessian and gradient spectra in high-dimensional classification tasks.

problem Understanding the spectra of Hessian and gradient matrices in high-dimensional classification tasks.
method Rigorous analysis of SGD dynamics and spectra of Hessian and gradient matrices.
result SGD trajectory and emergent outlier eigenspaces align with a common low-dimensional subspace in multi-class high-dimensional mixtures and neural networks.