Related papers: Generalized Wedderburn Rank Reduction
Adaptive nuclear-norm penalization is proposed for low-rank matrix approximation, by which we develop a new reduced-rank estimation method for the general high-dimensional multivariate regression problems. The adaptive nuclear norm of a…
The well-known M-P (Moore-Penrose) pseudoinverse is used in several linear-algebra applications; for example, to compute least-squares solutions of inconsistent systems of linear equations. It is uniquely characterized by four properties,…
Some general problems of Jacobian computations in non-full rank matrices are discussed in this work. In particular, the Jacobian of the Moore-Penrose inverse derived via matrix differential calculus is revisited. Then the Jacobian in the…
We propose and analyse a reduced-rank method for solving least-squares regression problems with infinite dimensional output. We derive learning bounds for our method, and study under which setting statistical performance is improved in…
A new generalized matrix inverse is derived which is consistent with respect to arbitrary nonsingular diagonal transformations, e.g., it preserves units associated with variables under state space transformations, thus providing a general…
In this paper, we introduce new representation and characterization of the weighted core inverse of matrices. Several properties of these inverses and their interconnections with other generalized inverses are also explored. Through…
Matrix factorization is a well-studied task in machine learning for compactly representing large, noisy data. In our approach, instead of using the traditional concept of matrix rank, we define a new notion of link-rank based on a…
Positive semi-definite matrices commonly occur as normal matrices of least squares problems in statistics or as kernel matrices in machine learning and approximation theory. They are typically large and dense. Thus algorithms to solve…
The singular value decomposition is widely used to approximate data matrices with lower rank matrices. Feng and He [Ann. Appl. Stat. 3 (2009) 1634-1654] developed tests on dimensionality of the mean structure of a data matrix based on the…
Low-rank approximation of a matrix by means of structured random sampling has been consistently efficient in its extensive empirical studies around the globe, but adequate formal support for this empirical phenomenon has been missing so…
In this paper, we derive high-dimensional asymptotic properties of the Moore-Penrose inverse and, as a byproduct, of various ridge-type inverses of the sample covariance matrix. In particular, the analytical expressions of the asymptotic…
Many neural learning algorithms require to solve large least square systems in order to obtain synaptic weights. Moore-Penrose inverse matrices allow for solving such systems, even with rank deficiency, and they provide minimum-norm vectors…
We consider the problem of finding nonzero eigenvalues and the corresponding eigenvectors of a matrix $AA^{\top}$, where $A$ is a special incidence matrix; This matrix can equivalently be defined based on a match relation between some…
We consider the problem of recovering low-rank matrices from random rank-one measurements, which spans numerous applications including covariance sketching, phase retrieval, quantum state tomography, and learning shallow polynomial neural…
In this article, we present a combinatorial formula for computing the Wedderburn decomposition of the rational group algebra associated with an ordinary metacyclic $p$-group $G$, where $p$ is any prime. We also provide a formula for…
This paper studies the set of $n\times n$ matrices for which all row and column sums equal zero. By representing these matrices in a lower dimensional space, it is shown that this set is closed under addition and multiplication, and…
In this paper will be considered standard forms of generalized inverses for matrices in the shape of block representations {1, 2, 3, 4, 5, 5^k}-inverse. Especially will be considered Moore-Penrose inverse and the group inverse. Results from…
We consider a generalization of low-rank matrix completion to the case where the data belongs to an algebraic variety, i.e. each data point is a solution to a system of polynomial equations. In this case the original matrix is possibly…
We propose an approach to multivariate nonparametric regression that generalizes reduced rank regression for linear models. An additive model is estimated for each dimension of a $q$-dimensional response, with a shared $p$-dimensional…
We introduce a new concept of rank - relative rank associated to a filtered collection of polynomials. When the filtration is trivial our relative rank coincides with Schmidt rank (also called strength). We also introduce the notion of…