Sciweavers

620 search results - page 43 / 124
» Learning with Temporary Memory
Sort
View
KDD
1995
ACM
148views Data Mining» more  KDD 1995»
13 years 12 months ago
Learning Arbiter and Combiner Trees from Partitioned Data for Scaling Machine Learning
Knowledge discovery in databases has become an increasingly important research topic with the advent of wide area network computing. One of the crucial problems we study in this p...
Philip K. Chan, Salvatore J. Stolfo
ECML
2007
Springer
14 years 2 months ago
Policy Gradient Critics
We present Policy Gradient Actor-Critic (PGAC), a new model-free Reinforcement Learning (RL) method for creating limited-memory stochastic policies for Partially Observable Markov ...
Daan Wierstra, Jürgen Schmidhuber
ICMLA
2003
13 years 9 months ago
The Consolidation of Neural Network Task Knowledge
— Fundamental to the problem of lifelong machine learning is how to consolidate the knowledge of a learned task within a long-term memory structure (domain knowledge) without the...
Daniel L. Silver, Peter McCracken
ACCV
2009
Springer
14 years 3 months ago
An Online Framework for Learning Novel Concepts over Multiple Cues
Abstract. We propose an online learning algorithm to tackle the problem of learning under limited computational resources in a teacher-student scenario, over multiple visual cues. ...
Luo Jie, Francesco Orabona, Barbara Caputo
ECML
2005
Springer
14 years 2 months ago
Model-Based Online Learning of POMDPs
Abstract. Learning to act in an unknown partially observable domain is a difficult variant of the reinforcement learning paradigm. Research in the area has focused on model-free m...
Guy Shani, Ronen I. Brafman, Solomon Eyal Shimony