Sciweavers

1419 search results - page 90 / 284
» Approximation Methods for Supervised Learning
Sort
View
EMNLP
2008
15 years 3 months ago
Learning Graph Walk Based Similarity Measures for Parsed Text
We consider a parsed text corpus as an instance of a labelled directed graph, where nodes represent words and weighted directed edges represent the syntactic relations between the...
Einat Minkov, William W. Cohen
CVPR
2011
IEEE
14 years 10 months ago
Iterative Quantization: A Procrustean Approach to Learning Binary Codes
This paper addresses the problem of learning similaritypreserving binary codes for efficient retrieval in large-scale image collections. We propose a simple and efficient altern...
Yunchao Gong, Svetlana Lazebnik
ACL
2006
15 years 3 months ago
Learning to Say It Well: Reranking Realizations by Predicted Synthesis Quality
This paper presents a method for adapting a language generator to the strengths and weaknesses of a synthetic voice, thereby improving the naturalness of synthetic speech in a spo...
Crystal Nakatsu, Michael White
ICML
2010
IEEE
15 years 3 months ago
Convergence of Least Squares Temporal Difference Methods Under General Conditions
We consider approximate policy evaluation for finite state and action Markov decision processes (MDP) in the off-policy learning context and with the simulation-based least square...
Huizhen Yu
ICML
2007
IEEE
16 years 3 months ago
Automatic shaping and decomposition of reward functions
This paper investigates the problem of automatically learning how to restructure the reward function of a Markov decision process so as to speed up reinforcement learning. We begi...
Bhaskara Marthi