Related papers: Generalized Wedderburn Rank Reduction
In this paper, we introduce the dual $r$-rank decomposition of dual matrix, get its existence condition and equivalent form of the decomposition, as well as derive some characterizations of dual Moore-Penrose generalized inverse(DMPGI).…
In this work, we investigate the idea of variance reduction by studying its properties with general adaptive mirror descent algorithms in nonsmooth nonconvex finite-sum optimization problems. We propose a simple yet generalized framework…
A generalization with singular weights of Moore-Penrose generalized inverses of closed range operators in Hilbert spaces is studied using the notion of compatibility of subspaces and positive operators.
The theory of generalized inverses of matrices and operators is closely connected with projections, i.e., idempotent (bounded) linear transformations. We show that a similar situation occurs in any associative ring $\mathcal{R}$ with a unit…
In this paper we introduce a general theory for nonlinear sufficient dimension reduction, and explore its ramifications and scope. This theory subsumes recent work employing reproducing kernel Hilbert spaces, and reveals many parallels…
Conventional ways to solve optimization problems on low-rank matrix sets which appear in great number of applications ignore its underlying structure of an algebraic variety and existence of singular points. This leads to appearance of…
We study the closure of the projection of the (nonconvex) cone of rank restricted positive semidefinite matrices onto subsets of the matrix entries. This defines the feasible sets for semidefinite completion problems with restrictions on…
The reduced-rank vector autoregressive (VAR) model can be interpreted as a supervised factor model, where two factor modelings are simultaneously applied to response and predictor spaces. This article introduces a new model, called vector…
Models in which the covariance matrix has the structure of a sparse matrix plus a low rank perturbation are ubiquitous in data science applications. It is often desirable for algorithms to take advantage of such structures, avoiding costly…
For a given matrix subspace, how can we find a basis that consists of low-rank matrices? This is a generalization of the sparse vector problem. It turns out that when the subspace is spanned by rank-1 matrices, the matrices can be obtained…
We introduce PseudoNet, a new pseudolikelihood-based estimator of the inverse covariance matrix, that has a number of useful statistical and computational properties. We show, through detailed experiments with synthetic and also real-world…
The Gauss-Seidel method has been used for more than 100 years as the standard method for the solution of linear systems of equations under certain restrictions. This method, as well as Cramer and Jacobi, is widely used in education and…
Reduced-rank (RR) regression may be interpreted as a dimensionality reduction technique able to reveal complex relationships among the data parsimoniously. However, RR regression models typically overlook any potential group structure among…
We present a theory for Euclidean dimensionality reduction with subgaussian matrices which unifies several restricted isometry property and Johnson-Lindenstrauss type results obtained earlier for specific data sets. In particular, we…
We present a generalisation of the pseudoinverse operation to pairs of matrices, as opposed to single matrices alone. We note the fact that the Singular Value Decomposition can be used to compute the ordinary Moore-Penrose pseudoinverse. We…
We study the projected gradient descent method on low-rank matrix problems with a strongly convex objective. We use the Burer-Monteiro factorization approach to implicitly enforce low-rankness; such factorization introduces non-convexity in…
Many multivariate data analysis techniques for an $m\times n$ matrix $\m Y$ are related to the model $\m Y = \m M +\m E$, where $\m Y$ is an $m\times n$ matrix of full rank and $\m M$ is an unobserved mean matrix of rank $K< (m\wedge n)$.…
While matrix variate regression models have been studied in many existing works, classical statistical and computational methods for the analysis of the regression coefficient estimation are highly affected by high dimensional and noisy…
We show that the finiteness length of an $S$-arithmetic subgroup $\Gamma$ in a noncommutative isotropic absolutely almost simple group $G$ over a global function field is one less than the sum of the local ranks of $G$ taken over the places…
Recent work in the field of signal processing has shown that the singular value decomposition of a matrix with entries in certain real algebras can be a powerful tool. In this article we show how to generalise the QR decomposition and SVD…