Sciweavers

1419 search results - page 98 / 284
» Approximation Methods for Supervised Learning
Sort
View
105
Voted
IJCAI
2003
15 years 1 months ago
Spectral Learning
We present a simple, easily implemented spectral learning algorithm which applies equally whether we have no supervisory information, pairwise link constraints, or labeled example...
Sepandar D. Kamvar, Dan Klein, Christopher D. Mann...
JMLR
2006
175views more  JMLR 2006»
15 years 14 days ago
Learning Sparse Representations by Non-Negative Matrix Factorization and Sequential Cone Programming
We exploit the biconvex nature of the Euclidean non-negative matrix factorization (NMF) optimization problem to derive optimization schemes based on sequential quadratic and secon...
Matthias Heiler, Christoph Schnörr
103
Voted
IJCNN
2006
IEEE
15 years 6 months ago
Reinforcement Learning for Parameterized Motor Primitives
Abstract— One of the major challenges in both action generation for robotics and in the understanding of human motor control is to learn the “building blocks of movement genera...
Jan Peters, Stefan Schaal
ICPR
2006
IEEE
16 years 1 months ago
Online Learning of Discriminative Patterns from Unlimited Sequences of Candidates
Recent research in object recognition has demonstrated the advantages of representing objects and scenes through localized patterns such as small image templates. In this paper we...
Ilkka Autio, Jussi T. Lindgren
88
Voted
MS
2003
15 years 1 months ago
Information-theoretic Competitive Learning
— In this paper, we propose a new supervised learning method whereby information is controlled by the associated cost in an intermediate layer, and in an output layer, errors bet...
Ryotaro Kamimura