77 search results - page 5 / 16 » Exact Matrix Completion via Convex Optimization |
96
Voted
CORR
2011
Springer
14 years 2 months ago
2011
Springer
We address the problem of minimizing a convex function over the space of large matrices with low rank. While this optimization problem is hard in general, we propose an efficient...
97
Voted
KDD
2007
ACM
15 years 10 months ago
2007
ACM
The kernel function plays a central role in kernel methods. In this paper, we consider the automated learning of the kernel matrix over a convex combination of pre-specified kerne...
108
click to vote
CORR
2011
Springer
14 years 5 months ago
2011
Springer
We consider a class of learning problems regularized by a structured sparsity-inducing norm defined as the sum of 2- or ∞-norms over groups of variables. Whereas much effort ha...
91
Voted
CORR
2011
Springer
14 years 1 months ago
2011
Springer
Statistical dependencies among wavelet coefficients are commonly represented by graphical models such as hidden Markov trees (HMTs). However, in linear inverse problems such as d...
117
Voted
SIAMJO
2011
14 years 1 months ago
2011
Suppose we are given a matrix that is formed by adding an unknown sparse matrix to an unknown low-rank matrix. Our goal is to decompose the given matrix into its sparse and low-ran...