Sciweavers

1364 search results - page 187 / 273
» Sampling Methods for Unsupervised Learning
Sort
View
NN
2010
Springer
125views Neural Networks» more  NN 2010»
15 years 23 days ago
Parameter-exploring policy gradients
We present a model-free reinforcement learning method for partially observable Markov decision problems. Our method estimates a likelihood gradient by sampling directly in paramet...
Frank Sehnke, Christian Osendorfer, Thomas Rü...
ECCV
2004
Springer
16 years 4 months ago
A Constrained Semi-supervised Learning Approach to Data Association
Data association (obtaining correspondences) is a ubiquitous problem in computer vision. It appears when matching image features across multiple images, matching image features to ...
Hendrik Kück, Nando de Freitas, Peter Carbone...
ML
2006
ACM
113views Machine Learning» more  ML 2006»
15 years 2 months ago
Learning to bid in bridge
Bridge bidding is considered to be one of the most difficult problems for game-playing programs. It involves four agents rather than two, including a cooperative agent. In additio...
Asaf Amit, Shaul Markovitch
WSDM
2012
ACM
214views Data Mining» more  WSDM 2012»
13 years 10 months ago
Selecting actions for resource-bounded information extraction using reinforcement learning
Given a database with missing or uncertain content, our goal is to correct and fill the database by extracting specific information from a large corpus such as the Web, and to d...
Pallika H. Kanani, Andrew K. McCallum
ICML
2004
IEEE
16 years 3 months ago
Bayesian inference for transductive learning of kernel matrix using the Tanner-Wong data augmentation algorithm
In kernel methods, an interesting recent development seeks to learn a good kernel from empirical data automatically. In this paper, by regarding the transductive learning of the k...
Zhihua Zhang, Dit-Yan Yeung, James T. Kwok