Sciweavers

49 search results - page 6 / 10
» Non-iterative generalized low rank approximation of matrices
Sort
View
ICML
2003
IEEE
14 years 8 months ago
Weighted Low-Rank Approximations
We study the common problem of approximating a target matrix with a matrix of lower rank. We provide a simple and efficient (EM) algorithm for solving weighted low-rank approximat...
Nathan Srebro, Tommi Jaakkola
ICML
2007
IEEE
14 years 8 months ago
Winnowing subspaces
We generalize the Winnow algorithm for learning disjunctions to learning subspaces of low rank. Subspaces are represented by symmetric projection matrices. The online algorithm ma...
Manfred K. Warmuth
SIAMJO
2010
246views more  SIAMJO 2010»
13 years 5 months ago
A Singular Value Thresholding Algorithm for Matrix Completion
This paper introduces a novel algorithm to approximate the matrix with minimum nuclear norm among all matrices obeying a set of convex constraints. This problem may be understood a...
Jian-Feng Cai, Emmanuel J. Candès, Zuowei S...
ICASSP
2011
IEEE
12 years 11 months ago
An efficient rank-deficient computation of the Principle of Relevant Information
One of the main difficulties in computing information theoretic learning (ITL) estimators is the computational complexity that grows quadratically with data. Considerable amount ...
Luis Gonzalo Sánchez Giraldo, José C...
SCL
2008
109views more  SCL 2008»
13 years 7 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