236 search results - page 14 / 48 » Learning How to Propagate Using Random Probing |
NIPS
1996
13 years 9 months ago
1996
Real-valued random hidden variables can be useful for modelling latent structure that explains correlations among observed variables. I propose a simple unit that adds zero-mean G...
ICML
2008
IEEE
14 years 8 months ago
2008
IEEE
In apprenticeship learning, the goal is to learn a policy in a Markov decision process that is at least as good as a policy demonstrated by an expert. The difficulty arises in tha...
JMLR
2010
13 years 2 months ago
2010
Round-based games are an instance of discrete planning problems. Some of the best contemporary game tree search algorithms use random roll-outs as data. Relying on a good policy, ...
ICDM
2003
IEEE
14 years 1 months ago
2003
IEEE
Collaborative Filtering (CF) techniques are becoming increasingly popular with the evolution of the Internet. E-commerce sites use CF systems to suggest products to customers base...
SIGMOD
2009
ACM
14 years 8 months ago
2009
ACM
A growing mount of available text data are being stored in relational databases, giving rise to an increasing need for the RDBMSs to support effective text retrieval. In this pape...