Sciweavers

3837 search results - page 41 / 768
» Learning Approximate Consistencies
Sort
View
ML
2012
ACM
385views Machine Learning» more  ML 2012»
13 years 11 months ago
An alternative view of variational Bayes and asymptotic approximations of free energy
Bayesian learning, widely used in many applied data-modeling problems, is often accomplished with approximation schemes because it requires intractable computation of the posterio...
Kazuho Watanabe
ICML
2001
IEEE
16 years 4 months ago
Off-Policy Temporal Difference Learning with Function Approximation
We introduce the first algorithm for off-policy temporal-difference learning that is stable with linear function approximation. Off-policy learning is of interest because it forms...
Doina Precup, Richard S. Sutton, Sanjoy Dasgupta
NIPS
2008
15 years 5 months ago
An interior-point stochastic approximation method and an L1-regularized delta rule
The stochastic approximation method is behind the solution to many important, actively-studied problems in machine learning. Despite its farreaching application, there is almost n...
Peter Carbonetto, Mark Schmidt, Nando de Freitas
ISVC
2007
Springer
15 years 10 months ago
Boosting with Temporal Consistent Learners: An Application to Human Activity Recognition
We present a novel boosting algorithm where temporal consistency is addressed in a short-term way. Although temporal correlation of observed data may be an important cue for classi...
Pedro Canotilho Ribeiro, Plinio Moreno, José...
IJCNN
2006
IEEE
15 years 10 months ago
A Comparison between Recursive Neural Networks and Graph Neural Networks
— Recursive Neural Networks (RNNs) and Graph Neural Networks (GNNs) are two connectionist models that can directly process graphs. RNNs and GNNs exploit a similar processing fram...
Vincenzo Di Massa, Gabriele Monfardini, Lorenzo Sa...