Sciweavers

824 search results - page 7 / 165
» Weighted Low-Rank Approximations
Sort
View
SIAMMAX
2010
164views more  SIAMMAX 2010»
13 years 3 months ago
Uniqueness of Low-Rank Matrix Completion by Rigidity Theory
The problem of completing a low-rank matrix from a subset of its entries is often encountered in the analysis of incomplete data sets exhibiting an underlying factor model with app...
Amit Singer, Mihai Cucuringu
JSCIC
2010
102views more  JSCIC 2010»
13 years 3 months 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...
SDM
2007
SIAM
96views Data Mining» more  SDM 2007»
13 years 9 months ago
Higher Order Orthogonal Iteration of Tensors (HOOI) and its Relation to PCA and GLRAM
This paper presents a unified view of a number of dimension reduction techniques under the common framework of tensors. Specifically, it is established that PCA, and the recentl...
Bernard N. Sheehan, Yousef Saad
SCL
2008
109views more  SCL 2008»
13 years 8 months ago
A note on linear function approximation using random projections
ABSTRACT: Linear function approximations based on random projections are proposed and justified for a class of fixed point and minimization problems. KEY WORDS: random projections,...
Kishor Barman, Vivek S. Borkar
CORR
2011
Springer
202views Education» more  CORR 2011»
13 years 2 months 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...