arXiv research

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

A method to analyze neural network performance by measuring layer saturation.

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

Efficiently approximates eigenspaces for symmetric and general matrices.

Study spectral properties of graph Laplacian for manifold data.

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

Essential self-adjointness and spectrum of CR GJMS operator proved.

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…

In this note we explore a connection between finite covers of surfaces and the Teichmüller polynomial of a fibered face of a hyperbolic 3--manifold. We consider the action of a homological pseudo-Anosov homeomorphism $ψ$ on the homology groups of a class of finite abelian covers of a surface $Σ_{g,n}$. Eigenspaces of t…

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

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

FedPower improves eigenspace estimation privacy in federated learning.

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

A fundamental operation in many vision tasks, including motion understanding, stereopsis, visual odometry, or invariant recognition, is establishing correspondences between images or between images and data from other modalities. We present an analysis of the role that multiplicative interactions play in learning such …

Researchers create surfaces with exceptionally high Steklov eigenvalues.

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…

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

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

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

New methods compare Steklov eigenspaces of free boundary minimal surfaces in balls.

New algorithm reduces communication in distributed eigenspace estimation.

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

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…

This work studies low-rank approximation of a positive semidefinite matrix from partial entries via nonconvex optimization. We characterized how well local-minimum based low-rank factorization approximates a fixed positive semidefinite matrix without any assumptions on the rank-matching, the condition number or eigensp…

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

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

Extends active subspace analysis to infinite dimensions.

Sparse coding is a common approach to learning local features for object recognition. Recently, there has been an increasing interest in learning features from spatio-temporal, binocular, or other multi-observation data, where the goal is to encode the relationship between images rather than the content of a single ima…

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…

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…

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…

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

We focus in this work on the estimation of the first $k$ eigenvectors of any graph Laplacian using filtering of Gaussian random signals. We prove that we only need $k$ 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…

This work analyzes the role of data augmentation in self-supervised learning using RKHS approximation and regression.

We show that the monodromy of a spherical conical metric is reducible if and only if it has a real-valued eigenfunction with eigenvalue 2 in the holomorphic extension of the associated Laplace--Beltrami operator. Such an eigenfunction produces a meromorphic vector field, which is then related to the developing maps of …

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 $n-1$, then the metric is a warped product where t…

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

Study finds the spectrum of a cubic Dirac operator on specific oscillator group manifolds.

SU(3) instanton homology counts Tait colorings for webs and foams.

In this paper, we develop a relative error bound for nuclear norm regularized matrix completion, with the focus on the completion of full-rank matrices. Under the assumption that the top eigenspaces of the target matrix are incoherent, we derive a relative upper bound for recovering the best low-rank approximation of t…

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

Laplacian mixture models identify overlapping regions of influence in unlabeled graph and network data in a scalable and computationally efficient way, yielding useful low-dimensional representations. By combining Laplacian eigenspace and finite mixture modeling methods, they provide probabilistic or fuzzy dimensionali…

We show how the discovery of robust scalable numerical solvers for arbitrary bounded linear operators can be automated as a Game Theory problem by reformulating the process of computing with partial information and limited resources as that of playing underlying hierarchies of adversarial information games. When the so…

In this undergraduate thesis, we present an analytical proof of the Morse inequalities for closed smooth $n$-manifolds following Witten's approach. Using techniques from PDE theory, the proof is reduced to study the eigenspaces and eigenvalues of harmonic oscillators on $\mathbb{R}^n$.

New principle reveals how neural networks learn complex interactions.

A new GNN architecture called coVariance neural network (VNN) improves stability and transferability of covariance matrix analysis.

We show that the eigenspaces of the Laplacian $Δ_k$ on $k$-forms on a compact Kähler manifold carry Hodge and Lefschetz decompositions. Among other consequences, we show that the positive part of the spectrum of $Δ_k$ lies in the spectrum of $Δ_{k+1}$.

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