SymNMF finds a simpler matrix approximating a given symmetric nonnegative matrix.
problem Finding a simpler matrix that approximates a given symmetric nonnegative matrix.
method Simple and efficient coordinate descent schemes.
result The methods effectively solve symNMF for large and sparse matrices.
We simplify symmetric NMF by transforming it into a nonsymmetric problem, enabling faster and more efficient solutions.
problem Efficiently solving symmetric nonnegative matrix factorization (NMF).
method Transforming symmetric NMF into a nonsymmetric problem, applying fast alternating algorithms, and rigorously proving convergence.
result Fast algorithms for symmetric NMF can converge to a critical point at least at a sublinear rate.
Adaptive algorithm improves convergence rate of Langevin dynamics.
problem Improving convergence rate of Langevin dynamics.
method Adaptive non-reversible stochastic gradient Langevin dynamics algorithm.
result Improved convergence rate of the algorithm.
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.
Study differential properties of matrix square roots in specific cases.
problem Understanding matrix square roots in semi-simple, symmetric, and orthogonal cases.
method Analysis of differential and metric structures of real square roots of matrices under specific conditions.
result Differential properties of matrix square roots in semi-simple, symmetric, and orthogonal cases.
A new method solves SymNMF problems faster and more efficiently.
problem Symmetric nonnegative matrix factorization (SymNMF) for data analytics.
method Nonconvex variable splitting method.
result The method converges to KKT points and has a global sublinear convergence rate.
Minimal submanifolds in matrix spaces proven for specific ranks.
problem Minimal submanifolds in matrix spaces.
method Proving semialgebraic sets of matrices are minimal.
result Rectangular, skew-symmetric, and symmetric matrices with prescribed eigenvalues are minimal.
We obtain a family of matrix integrals which decompose to a product of Gamma-functions (they have some relations with S.G.Gindikin 'Beta', but generally speaking essentially differ from it). We obtain Plancherel formula for Berezin representations for all series of classical groups (for large values of parameters of re…
A symmetric matrix invariant is defined for oriented link diagrams.
problem Defining an invariant for oriented link diagrams.
method Defining a symmetric map τD from regions of an oriented link diagram to Z[x], corrected by the writhe. result The negative signature of τD, corrected by the writhe, conjecturally equals twice the Tristram-Levine signature function. We present a formula for the trace of any symmetric power of a n×n matrix (with coefficients in a field) in terms of the ordinary powers of the matrix, an arbitrarily chosen linear function which vanishes on the identity matrix, and n−2 polynomial functions defined recursively.
Algorithm finds isotropy subgroups of orthogonal similarity on symmetric matrices.
problem Computing isotropy subgroups of orthogonal similarity on symmetric matrices.
method Algorithmic procedure solving a Toeplitz matrix equation.
result Structure of isotropy subgroups described.
Gradient descent achieves exact linear convergence rate for symmetric matrix completion.
problem Low-rank symmetric matrix completion using gradient descent.
method Local analysis of gradient descent for symmetric matrices without additional assumptions.
result Closed-form expression of exact linear convergence rate matches practice.
New method for symmetric matrix completion using ReLU sampling.
problem Symmetric positive semi-definite low-rank matrix completion with deterministic entry-dependent sampling.
method ReLU sampling, gradient descent with tailored initialization.
result Gradient descent with tailored initialization achieves global minima.
Paper extends matrix inequality to Hermitian matrices.
problem Extending inequalities to Hermitian matrices.
method Using Frobenius norm of commutators for real and skew matrices, extending to Hermitian and skew-Hermitian.
result DDVV-type inequalities now apply to Hermitian matrices.
Paper tackles small eigen-gap estimation and inference for noisy symmetric matrices.
problem Estimating eigenvectors with small eigen-gap and fine-grained statistical reasoning.
method Eigen-decomposition of asymmetric data matrix, distribution-free procedures, adaptive to heteroscedastic noise.
result Minimax optimal under Gaussian noise, confidence intervals for eigenvalues, small eigen-gap handling.
Characterizes the local diffeomorphism structure of the exponential in the set of skew-symmetric matrices.
problem Characterizing the local diffeomorphism structure of the exponential in the set of skew-symmetric matrices.
method Introduce the diffeomorphic logarithm of special orthogonal matrices and an efficient algorithm.
result The region containing the principal logarithm has a special multiplicity structure.
New method for mixed memberships using symmetrized Laplacian inverse matrix.
problem Mixed memberships in community detection.
method Spectral clustering on symmetrized Laplacian inverse matrix.
result Mixed-SLIM methods outperform state-of-the-art methods.
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…
Method detects communities in networks using matrix factorization.
problem Community detection in complex networks.
method Orthogonal symmetric non-negative matrix tri-factorization of the normalized Laplacian matrix.
result Consistent for community detection in graphs from stochastic block models.
New method for inferring network topology from partial data.
problem Inferring network topology from limited node data.
method Vector autoregressive model and Gaussian mixture algorithm.
result The proposed method converges to the network combination matrix in probability.
Study geometric properties of symmetric matrices with repeated eigenvalues.
problem Investigate geometric properties of symmetric matrices with repeated eigenvalues.
method Explicitly compute the volume of the intersection with the sphere and prove an Eckart-Young-Mirsky-type theorem.
result Prove connections to Real Algebraic Geometry and Random Matrix Theory.
Least squares estimation works well for symmetric positive semidefinite matrices without regularization.
problem Estimation of symmetric positive semidefinite matrices without regularization.
method Simple least squares estimation with extsf{spd} constraint.
result Constrained least squares estimation performs as well as regularization-based approaches.
The paper models financial correlation matrices using permutation invariant Gaussian models and predicts market anomalies.
problem Modeling and predicting financial correlation matrices from high-frequency data.
method Constructing permutation invariant Gaussian matrix models with 4 parameters, using graph theory and polynomial functions.
result The permutation invariant Gaussian matrix model predicts the expectation values of cubic and quartic polynomials with strong evidence of fit.
We define a numerical method that provides a non-parametric estimation of the kernel shape in symmetric multivariate Hawkes processes. This method relies on second order statistical properties of Hawkes processes that relate the covariance matrix of the process to the kernel matrix. The square root of the correlation f…
Improves matrix multiplication throughput for asymmetric bit-width operands.
problem Matrix multiplications between asymmetric bit-width operands, especially 8- and 4-bit, are not efficiently handled by existing SIMD instructions.
method Proposes a new SIMD matrix multiplication instruction that uses mixed precision on inputs (8- and 4-bit) and accumulates into 16-bit output, improving throughput.
result Offers 2x improvement in throughput compared to existing symmetric-operand-size instructions, with negligible overflow.
New algorithm uncovers hierarchical block structure in large matrices.
problem Uncovering hierarchical block structure in symmetric matrices.
method Incremental multiresolution matrix factorization.
result Algorithm scales well to large matrices and uncovers structure one feature at a time.
This work accelerates constrained sampling using large deviation principles.
problem Sampling constrained probability distributions efficiently.
method Large deviation principles applied to skew-reflected non-reversible Langevin dynamics.
result The skew-symmetric matrix accelerates convergence and reduces asymptotic variance.
The paper studies vanishing cycles in matrix singularities.
problem Understanding the topology of singular Milnor fibers of matrix families.
method Definition and analysis of vanishing cycles, proof of conjectures, study of monodromy.
result Proof of an extended Damon-Pike μ=τ conjecture for special matrix families.
NGD improves multivariate Gaussian inference by optimizing Fisher information.
problem Efficiently optimizing multivariate Gaussian models.
method Natural Gradient Descent applied to multivariate Gaussian parameters.
result NGD updates are more efficient for symmetric covariance matrices.
The paper connects Riemannian Gaussian distributions to random matrix theory and diffusion kernels.
problem Analyzing Riemannian Gaussian distributions on symmetric spaces.
method Analytical computation of marginals using orthogonal and skew orthogonal polynomials, and diffusion kernels.
result Riemannian Gaussian distributions are random matrix types, and their probability density functions can be computed analytically.
Unimodular classification of symmetric matrix map-germs.
problem Classifying symmetric matrix map-germs under volume-preserving equivalence.
method Introducing symmetrical quasi-homogeneity and volume-preserving equivalence.
result All simple G-equivalence classes coincide with volume-preserving equivalence classes. A new method for efficiently computing derivatives of skew-symmetric matrix exponentials.
problem Efficient computation of derivatives for skew-symmetric matrices.
method Characterization of invertibility, construction of nearby logarithm, and efficient implementation.
result Explicit formulae for differentiation and its inverse of skew-symmetric matrix exponentials.
Determinants of theta curves and symmetric graphs are studied.
problem Understanding the determinants of theta curves and symmetric graphs.
method Combinatorial approach using Kirchhoff's Matrix Tree Theorem and spanning tree enumeration.
result The determinant of a simple theta curve is the product of the determinants of its constituent knots.
Study Spin(7)-manifolds with a 4-torus action using a symmetric matrix ansatz.
problem Characterize Spin(7)-manifolds with a 4-torus action. method Provide a Gibbons-Hawking type ansatz using a symmetric 4imes4-matrix of functions. result First known Spin(7)-manifolds with a rank 4 symmetry group and full holonomy. Extends knot invariant computation to symmetrically colored sl_N.
problem Computing quantum knot invariants for slN. method Develops symmetrically colored R matrix for slN. result Defines FKslN,sym for positive braid knots. Improved method for computing Fréchet means on SPD matrices.
problem Computing Fréchet means on the manifold of SPD matrices.
method Random matrix theory-based approach for estimating Fréchet means.
result Significantly outperforms state-of-the-art methods in experiments.
Derives a Hamiltonian model for 3D axially symmetric magnetohydrodynamics.
problem Modeling of 3D axially symmetric magnetohydrodynamics.
method Hamiltonian formulation and matrix discretization.
result First discrete model for 3D magnetohydrodynamics compatible with underlying Lie-Poisson structure.
A fast algorithm for generalized matrix regression improves machine learning performance.
problem Efficiently solving generalized matrix regression problems in machine learning.
method Utilizes sketching technique to achieve (1+ε) relative error with sketching sizes of order $\cO(ε^{-1/2})$. result The Fast GMR algorithm achieves better performance in symmetric positive definite matrix approximation and single pass singular value decomposition.
We are concerned with an approximation problem for a symmetric positive semidefinite matrix due to motivation from a class of nonlinear machine learning methods. We discuss an approximation approach that we call {matrix ridge approximation}. In particular, we define the matrix ridge approximation as an incomplete matri…
A scalable distributed S-LSR1 algorithm reduces communication costs.
problem Efficiently scaling S-LSR1 for large-scale distributed optimization.
method Proposes DS-LSR1, a communication-efficient variant of S-LSR1.
result DS-LSR1 scales well in problem dimension and data points.
A new method computes link invariants from diagrams.
problem Computing link invariants efficiently.
method Single symmetric matrix from a link diagram.
result Multivariable Alexander polynomial computation.
Doubly-stochastic normalization improves robustness to heteroskedastic noise.
problem Robustness to heteroskedastic noise in affinity matrix construction.
method Doubly-stochastic normalization of the Gaussian kernel.
result Doubly-stochastic normalization converges to clean matrix with rate m−1/2 under heteroskedastic noise. Paper checks if vector bundle connections are locally metric.
problem Determining locally metric connections in vector bundles.
method Developed an algorithm to check skew symmetry of curvature matrices.
result Algorithm verifies full rank curvature connections are locally metric.
Anosov groups study matrix coefficients and orbit counting in symmetric spaces.
problem Anosov groups and their matrix coefficients in symmetric spaces.
method Asymptotic analysis of matrix coefficients and higher rank measures.
result Asymptotic behavior of matrix coefficients and orbit counting results.
Algorithm completes symmetric tensors from few entries, learns product mixtures.
problem Learning product mixtures over the hypercube from incomplete data.
method Tensor completion algorithm applied to matrix completion for adversarially missing entries.
result Recover distributions with many centers in polynomial/quasi-polynomial time.
New algorithm speeds up group equivariant neural networks computations.
problem Challenging computations in group equivariant neural networks.
method Diagrammatic framework based on category theory for matrix multiplication.
result Exponential improvement in time complexity for matrix multiplication.
Efficiently learns gFM on streaming data with linear convergence.
problem Learning generalized Factorization Machine on streaming data.
method Alternating framework with CI-RIP condition.
result Linear convergence and O(ε) recovery error after retrieving O(k3dlog(1/ε)) training instances. The paper analyzes how over-parameterization affects GD convergence in matrix sensing problems.
problem Matrix sensing problem with over-parameterized gradient descent.
method Analyzes symmetric and asymmetric parameterizations, provides lower bounds and convergence rates.
result Over-parameterization slows down GD convergence, but asymmetric parameterization can speed up convergence.