Sciweavers

75 search results - page 9 / 15
» Online Learning for Matrix Factorization and Sparse Coding
Sort
View
ICML
2010
IEEE
13 years 8 months ago
A Simple Algorithm for Nuclear Norm Regularized Problems
Optimization problems with a nuclear norm regularization, such as e.g. low norm matrix factorizations, have seen many applications recently. We propose a new approximation algorit...
Martin Jaggi, Marek Sulovský
JMLR
2006
104views more  JMLR 2006»
13 years 7 months ago
Learning Image Components for Object Recognition
In order to perform object recognition it is necessary to learn representations of the underlying components of images. Such components correspond to objects, object-parts, or fea...
Michael W. Spratling
ICANNGA
2007
Springer
191views Algorithms» more  ICANNGA 2007»
14 years 1 months ago
Novel Multi-layer Non-negative Tensor Factorization with Sparsity Constraints
In this paper we present a new method of 3D non-negative tensor factorization (NTF) that is robust in the presence of noise and has many potential applications, including multi-way...
Andrzej Cichocki, Rafal Zdunek, Seungjin Choi, Rob...
PAMI
2012
11 years 10 months ago
Task-Driven Dictionary Learning
—Modeling data with linear combinations of a few elements from a learned dictionary has been the focus of much recent research in machine learning, neuroscience, and signal proce...
Julien Mairal, Francis Bach, Jean Ponce
COLT
2010
Springer
13 years 5 months ago
Learning Rotations with Little Regret
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...
Elad Hazan, Satyen Kale, Manfred K. Warmuth