21 search results - page 2 / 5 » Rigorous Perturbation Bounds of Some Matrix Factorizations |
COLT
2007
Springer
13 years 11 months ago
2007
Springer
We give an algorithm for the on-line learning of permutations. The algorithm maintains its uncertainty about the target permutation as a doubly stochastic weight matrix, and makes...
JAT
2007
13 years 5 months ago
2007
Let A ⊂ L2(R) be at most countable, and p, q ∈ N. We characterize various frame-properties for Gabor systems of the form G(1, p/q,A) = {e2 imxg(x − np/q) : m, n ∈ Z, g ∈...
CORR
2008
Springer
13 years 5 months ago
2008
Springer
We present a convex formulation of dictionary learning for sparse signal decomposition. Convexity is obtained by replacing the usual explicit upper bound on the dictionary size by...
ISSAC
2007
Springer
13 years 11 months ago
2007
Springer
Given a lattice basis of n vectors in Zn, we propose an algorithm using 12n3 + O(n2) floating point operations for checking whether the basis is LLL-reduced. If the basis is redu...
COLT
2010
Springer
13 years 3 months ago
2010
Springer
We describe online algorithms for learning a rotation from pairs of unit vectors in Rn . We show that the expected regret of our online algorithm compared to the best fixed rotati...