Sciweavers

1419 search results - page 65 / 284
» Approximation Methods for Supervised Learning
Sort
View
ICML
2009
IEEE
14 years 10 months ago
Deep learning from temporal coherence in video
This work proposes a learning method for deep architectures that takes advantage of sequential data, in particular from the temporal coherence that naturally exists in unlabeled v...
Hossein Mobahi, Ronan Collobert, Jason Weston
KDD
2010
ACM
252views Data Mining» more  KDD 2010»
14 years 1 months ago
Fast query execution for retrieval models based on path-constrained random walks
Many recommendation and retrieval tasks can be represented as proximity queries on a labeled directed graph, with typed nodes representing documents, terms, and metadata, and labe...
Ni Lao, William W. Cohen
IROS
2006
IEEE
148views Robotics» more  IROS 2006»
14 years 4 months ago
Environment Understanding: Robust Feature Extraction from Range Sensor Data
— This paper proposes an approach allowing indoor environment supervised learning to recognize relevant features for environment understanding. Stochastic preprocessing methods i...
Antonio Romeo, Luis Montano
JMLR
2010
136views more  JMLR 2010»
13 years 4 months ago
Approximate Riemannian Conjugate Gradient Learning for Fixed-Form Variational Bayes
Variational Bayesian (VB) methods are typically only applied to models in the conjugate-exponential family using the variational Bayesian expectation maximisation (VB EM) algorith...
Antti Honkela, Tapani Raiko, Mikael Kuusela, Matti...
ESANN
2007
13 years 11 months ago
Replacing eligibility trace for action-value learning with function approximation
The eligibility trace is one of the most used mechanisms to speed up reinforcement learning. Earlier reported experiments seem to indicate that replacing eligibility traces would p...
Kary Främling