Polynomial time algorithm matches correlated Gaussian matrices without vanishing correlation.
problem Matching vertices in two correlated Erdős-Rényi graphs.
method Iterative matching algorithm for correlated Gaussian Wigner matrices.
result First polynomial time algorithm for graph matching with arbitrarily small constant correlation.
Researchers prove matrices generate a free group modulo p.
problem Faithfulness of Burau representation for n=4.
method Proved matrices generate a free group over Zp[t,t−1]. result Burau representation is faithful modulo p for n=4.
Dynamic systems linked to infinite permutation matrices.
problem Dynamic equivalence of control systems.
method Association of infinite permutation matrices.
result Relationship between dynamic equivalences and permutation matrices.
Random feature matrices' singular values concentrate near their full expectation in high dimensions.
problem Characterizing the spectra of random feature matrices for regression problems.
method Analyzing two settings of input variables (random or well-separated) with conditions on dimension, complexity ratio, and sampling variance.
result The singular values of random feature matrices concentrate near their full expectation and near one with high probability.
We define homological matrices, construct examples of one-dimension restricted homological quantum field theories, and show a relationship between the two theories.
The paper presents two schemes for sampling matrices from specific distributions on a manifold.
problem Sampling matrices from Gibbs distributions on the manifold of positive semi-definite matrices with fixed rank.
method Two explicit schemes based on Euler-Maruyama discretization of the Riemannian Langevin equation with Brownian motion on the manifold.
result Numerical validation of the schemes using specific energy functions and metrics.
Study on estimating Monge matrices with statistical methods.
problem Estimating Monge matrices with additive noise.
method Viewing structure as a shape constraint, establishing minimax rates, proposing efficient estimators.
result Established minimax rates of estimation for Monge and pre-Monge matrices.
Two algorithms estimate Wasserstein distance matrices from few entries for manifold learning.
problem Estimating Wasserstein distance matrices from limited data for manifold learning.
method Proposes two algorithms: matrix completion and Nyström completion for square Wasserstein matrices.
result Nyström completion can outperform matrix completion with a fixed sample budget and improve classification stability.
New binary matrices improve compressed sensing with faster and less storage requirements.
problem Achieving robust sparse recovery with binary measurement matrices.
method Derived bounds and conditions for binary matrices to satisfy the robust null space property (RNSP).
result Binary matrices with girth six are nearly optimal for compressed sensing.
We calculate eigenvector overlaps between intersecting time periods of covariance matrices.
problem Analyzing overlapping time periods in covariance matrices.
method Girko linearisation and extended local laws.
result Computed eigenvector overlaps for intersecting time intervals.
Paper predicts travel costs across regions using neural networks.
problem Predicting travel costs in sparse, stochastic OD matrices.
method Recurrent Multi-Graph Neural Networks (R-MGNN) for sparse, stochastic OD matrix forecasting.
result Framework effectively predicts future OD matrices without empty elements.
Study on rotating surfaces in 4D space with matrices.
problem Understanding rotational surfaces in pseudo-Euclidean 4-space.
method Defined hyperbolic and elliptic rotational surfaces using curves and matrices in 4D semi-Euclidean space.
result Generated rotated surfaces using specific rotation matrices.
This paper studies geodesics between covariance matrices of different ranks using the Bures-Wasserstein metric.
problem Geodesics between covariance matrices of varying ranks.
method Analyzes the Bures-Wasserstein distance on covariance matrices, completing previous work on geodesics and providing explicit formulas.
result The set of all minimizing geodesics between two covariance matrices is parametrized by a closed unit ball in R(k−r)imes(l−r). FedSPDnet improves federated learning for SPD matrices, outperforming existing methods.
problem Federated learning for SPD matrices with orthogonality constraints.
method Two efficient aggregation strategies: ProjAvg and RLAvg, preserving geometric structure.
result FedSPDnet outperforms federated EEGnet in F1 score and robustness to federation and partial participation.
Method estimates M-matrices in graphical models with improved accuracy.
problem Estimating M-matrices as precision matrices in Gaussian graphical models.
method Adaptive multiple-stage estimation method solving weighted ℓ1-regularized problems.
result Method outperforms state-of-the-art methods in precision matrix estimation and graph edge identification.
Researchers construct explicit bundles for ALF metrics, revealing rational patching matrices for gravitational instantons.
problem Constructing explicit toric Ricci-flat metrics and their associated bundles.
method Explicit construction of patching matrices for ALF metrics and gravitational instantons.
result Rational form of patching matrices for gravitational instantons in the Chen--Teo family.
The Clifford group for 2 qubits is divided into 20 orbits, each with 4608 matrices.
problem Understanding the structure of the Clifford group for 2 qubits.
method Equivalence relation based on local Clifford gates and analysis of orbits.
result The Clifford group for 2 qubits is divided into 20 orbits, each with 4608 matrices.
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.
DiffeoCFM efficiently generates realistic brain connectivity matrices using pullback metrics.
problem Generating realistic brain connectivity matrices for population heterogeneity analysis.
method Conditional flow matching on matrix manifolds via pullback metrics induced by global diffeomorphisms.
result DiffeoCFM achieves state-of-the-art performance on large-scale fMRI and EEG datasets.
The Schatten quasi-norm can be used to bridge the gap between the nuclear norm and rank function, and is the tighter approximation to matrix rank. However, most existing Schatten quasi-norm minimization (SQNM) algorithms, as well as for nuclear norm minimization, are too slow or even impractical for large-scale problem…
A framework estimates multiple precision matrices with shared structures.
problem Estimating multiple precision matrices with shared structures.
method Penalized likelihood framework with iterative algorithm alternating between convex and clustering problems.
result The method outperforms competitors and performs similarly to methods using prior information.
Study of metrics on positive-definite matrices from power potential, linking to power means.
problem Understanding metrics on positive-definite matrices derived from power potential.
method Explicit expressions for geodesics and distance function derived from Hessian of power potential.
result Geodesics and distance function converge to weighted matrix geometric mean as β tends to zero.
Derives a sharp inequality for trace-free matrices with applications to hypersurfaces.
problem Classifying conformally flat hypersurfaces and characterizing rotational hypersurfaces.
method Derives a sharp inequality relating eigenvalues of trace-free matrices and applies it to hypersurfaces.
result New proof of the classification of conformally flat hypersurfaces and construction of a functional for rotational hypersurfaces.
Heavy-tailed regularization improves deep neural network performance.
problem Improving generalization of deep neural networks.
method Introducing Heavy-Tailed Regularization, using differentiable penalty terms and Bayesian statistics.
result Heavy-tailed regularization outperforms conventional regularization techniques.
CDPA identifies common and distinctive patterns in high-dimensional datasets.
problem Existing methods fail to capture the common pattern between coefficient matrices of shared latent factors.
method Proposes CDPA, an unsupervised learning method that incorporates both common and distinctive patterns of coefficient matrices.
result CDPA provides better characterization of common and distinctive patterns in high-dimensional datasets.
New algorithms for learning shift-invariant components and aligning signals.
problem Learning shift-invariant components and aligning signals.
method Formulated optimization problems using circulant and convolutional matrices, proposed efficient solutions.
result Effective algorithms for learning shift-invariant components and aligning signals.
The exact nonnegative matrix factorization (exact NMF) problem is the following: given an m-by-n nonnegative matrix X and a factorization rank r, find, if possible, an m-by-r nonnegative matrix W and an r-by-n nonnegative matrix H such that X=WH. In this paper, we propose two heuristics for exac…
Paper tackles fairness in CCA by minimizing correlation disparity error.
problem Fairness issues in CCA.
method Framework to minimize correlation disparity error in CCA.
result Reduces correlation disparity error without sacrificing CCA accuracy.
There has been an increasing interest in testing the equality of large Pearson's correlation matrices. However, in many applications it is more important to test the equality of large rank-based correlation matrices since they are more robust to outliers and nonlinearity. Unlike the Pearson's case, testing the equality…
In this paper many classes of sets of matrices with entries in F (F=R, F=C, F=H) are introduced. Each class with the corresponding topology determines a real analytical, complex or symplectic manifold for F=R, F=C or F=H respectively. Any such family is called to be a set of canonical forms of matrices. The constructio…
Multiresolution Matrix Factorization (MMF) was recently introduced as a method for finding multiscale structure and defining wavelets on graphs/matrices. In this paper we derive pMMF, a parallel algorithm for computing the MMF factorization. Empirically, the running time of pMMF scales linearly in the dimension for spa…
Paper develops new method for detecting latent structure in large symmetric data matrices.
problem Testing for latent structure in large symmetric data matrices.
method Introduces Wilcoxon--Wigner random matrices based on normalized rank statistics.
result Establishes asymptotic Gaussian fluctuations for leading eigenvalue and eigenvector of Wilcoxon--Wigner matrices.
We describe the inclusive Racah matrices for the first non-(anti)symmetric rectangular representation R=[2,2] for quantum groups U_q(sl_N). Most of them have sizes 2, 3, and 4 and are fully described by the eigenvalue hypothesis. Of two 6x6 matrices, one is also described in this way, but the other one corresponds to t…
Paper develops Riemannian geometry for SPSD matrices with DA applications.
problem Riemannian geometry of SPSD matrices for DA.
method Closed-form expressions, approximations of geodesic path, PT, canonical representation.
result Proposes an algorithm for DA with improved performance.
New metrics defined for full-rank correlation matrices, ensuring unique operations.
problem No suitable problem statement as the abstract does not describe a problem to be solved.
method New Riemannian metrics defined on full-rank correlation matrices, providing unique operations.
result Unique Riemannian logarithm and Fréchet mean defined for full-rank correlation matrices.
Optimal transport on SPD matrices improves domain adaptation for BCI.
problem Improving domain adaptation between two domains using SPD matrices.
method Modelled domain difference as diffeomorphism, used polar factorization theorem for optimal transport, applied weighted Riemannian mean.
result Demonstrated state-of-the-art performance on BCI data sets.
A general framework for solving the subspace clustering problem using the CUR decomposition is presented. The CUR decomposition provides a natural way to construct similarity matrices for data that come from a union of unknown subspaces U=i=1⋃MSi. The similarity matrices thus c…
Introduces matrix MLP for learning symmetric positive definite matrices.
problem Learning structured parameters like symmetric positive definite matrices.
method Develops matrix multilayer perceptron (matrix MLP) for structured parameter learning.
result Extends variational autoencoder (VAE) for dense covariance matrices.
Analyzes tt*-structures from ADE-type Stokes data.
problem Classifying tt*-structures over C∗. method Isomonodromic deformations with upper unitriangular real Stokes matrices.
result Establishes a direct analytic realization of the ADE classification. Extends MMF to nonsymmetric matrices for hierarchical structure.
problem Capturing hierarchical structure in nonsymmetric matrices.
method Multiresolution Matrix Factorization (MMF) extended to nonsymmetric matrices.
result Effective for matrix compression tasks, outperforming low-rank methods.
New framework uses symmetry-based matrices for efficient, flexible NNs.
problem Designing neural networks with relaxed equivariance.
method Symmetry-based structured matrices, Group Matrices (GMs).
result GMs enable competitive performance with fewer parameters.
Nonnegative Matrix Factorization (NMF) aims to factorize a matrix into two optimized nonnegative matrices appropriate for the intended applications. The method has been widely used for unsupervised learning tasks, including recommender systems (rating matrix of users by items) and document clustering (weighting matrix …
We analyze the spectral properties of correlation matrices between distinct statistical systems. Such matrices are intrinsically non symmetric, and lend themselves to extend the spectral analyses usually performed on standard Pearson correlation matrices to the realm of complex eigenvalues. We employ some recent random…
New algorithms improve RPCA for large matrices with upper rank bounds.
problem Efficiently decompose large matrices into low-rank and sparse parts.
method Combine regularization and matrix multiplication approaches with upper rank bounds.
result Proposed algorithms are faster and more robust than existing methods.
Paper explores geometry of covariance matrices using associated bundles.
problem Geometry of fixed-rank covariance matrices.
method Associated bundle approach to Bures--Wasserstein geometry.
result Established a one-to-one correspondence between geodesics.
Research on random matrices and machine learning consistency.
problem Understanding consistency in machine learning and random matrix theory.
method Analytical and theoretical approaches to Laguerre matrices, Wishart matrices, and machine learning algorithms.
result Derived necessary and sufficient conditions for inverse moments of matrices and consistency of machine learning algorithms.
New methods reveal colored Jones polynomials from quantum R-matrices and knot invariants.
problem Understanding colored Jones polynomials of knots.
method Two realizations: quantum R-matrices and refined quantum modularity conjecture.
result New insights into knot invariants from quantum R-matrices and matrix conjectures.
WISDoM uses the Wishart distribution to analyze neurological data like EEG and brain connectivity.
problem Characterizing deviations of covariance or correlation matrices from expected values.
method WISDoM framework for quantifying deviations from the Wishart distribution.
result Validated on EEG feature ranking and classification of autism subjects.