Sciweavers

49 search results - page 2 / 10
» Non-iterative generalized low rank approximation of matrices
Sort
View
IDEAL
2010
Springer
15 years 3 months ago
Approximating the Covariance Matrix of GMMs with Low-Rank Perturbations
: Covariance matrices capture correlations that are invaluable in modeling real-life datasets. Using all d2 elements of the covariance (in d dimensions) is costly and could result ...
Malik Magdon-Ismail, Jonathan T. Purnell
JSCIC
2010
102views more  JSCIC 2010»
15 years 21 days ago
Hierarchical Matrices in Computations of Electron Dynamics
We discuss the approximation of the meanfield terms appearing in computations of the multi-configuration time-dependent Hartree
Othmar Koch, Christopher Ede, Gerald Jordan, Armin...
SIAMJO
2011
15 years 26 days ago
Recovering Low-Rank and Sparse Components of Matrices from Incomplete and Noisy Observations
Many applications arising in a variety of fields can be well illustrated by the task of recovering the low-rank and sparse components of a given matrix. Recently, it is discovered...
Min Tao, Xiaoming Yuan
NIPS
2004
15 years 7 months ago
Generalization Error Bounds for Collaborative Prediction with Low-Rank Matrices
We prove generalization error bounds for predicting entries in a partially observed matrix by fitting the observed entries with a low-rank matrix. In justifying the analysis appro...
Nathan Srebro, Noga Alon, Tommi Jaakkola
CORR
2011
Springer
202views Education» more  CORR 2011»
15 years 13 days ago
Noisy matrix decomposition via convex relaxation: Optimal rates in high dimensions
We analyze a class of estimators based on a convex relaxation for solving highdimensional matrix decomposition problems. The observations are the noisy realizations of the sum of ...
Alekh Agarwal, Sahand Negahban, Martin J. Wainwrig...