arXiv research

New measure helps identify better word embedding compression methods.

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

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…

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

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

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

Clustering of data sets is a standard problem in many areas of science and engineering. The method of spectral clustering is based on embedding the data set using a kernel function, and using the top eigenvectors of the normalized Laplacian to recover the connected components. We study the performance of spectral clust…

Efficiently approximates eigenspaces for symmetric and general matrices.

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

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…

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…

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

FedPower improves eigenspace estimation privacy in federated learning.

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

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

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.

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…

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 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…

Analysis of DPPs and k-DPPs via spectral decomposition reveals identifiable parameters 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…

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…

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

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

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…

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.

Overlapping clustering problem is an important learning issue in which clusters are not mutually exclusive and each object may belongs simultaneously to several clusters. This paper presents a kernel based method that produces overlapping clusters on a high feature space using mercer kernel techniques to improve separa…

Deconfounding scores improve causal effect estimation with weak overlap.

A new method speeds up overlapping group lasso computations.

In medicine, visualizing chromosomes is important for medical diagnostics, drug development, and biomedical research. Unfortunately, chromosomes often overlap and it is necessary to identify and distinguish between the overlapping chromosomes. A segmentation solution that is fast and automated will enable scaling of co…

New method improves CATE estimation in low overlap regions.

Proposes a sensitivity framework to handle limited overlap in causal inference.

Study spectral properties of graph Laplacian for manifold data.

Producing overlapping schemes is a major issue in clustering. Recent proposed overlapping methods relies on the search of an optimal covering and are based on different metrics, such as Euclidean distance and I-Divergence, used to measure closeness between observations. In this paper, we propose the use of another meas…

The study simplifies assessing overlap in logistic regression models using empirical likelihood.

Estimates overlap in observational studies for causal effect estimation.

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

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 …

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

New algorithm reduces communication in distributed eigenspace estimation.

Researchers create surfaces with exceptionally high Steklov eigenvalues.

Recently, to solve large-scale lasso and group lasso problems, screening rules have been developed, the goal of which is to reduce the problem size by efficiently discarding zero coefficients using simple rules independently of the others. However, screening for overlapping group lasso remains an open challenge because…

Community detection is a fundamental problem in network analysis which is made more challenging by overlaps between communities which often occur in practice. Here we propose a general, flexible, and interpretable generative model for overlapping communities, which can be thought of as a generalization of the degree-co…