Sciweavers

1622 search results - page 101 / 325
» Learning a Hidden Matching
Sort
View
ICML
2005
IEEE
16 years 4 months ago
Learning strategies for story comprehension: a reinforcement learning approach
This paper describes the use of machine learning to improve the performance of natural language question answering systems. We present a model for improving story comprehension th...
Eugene Grois, David C. Wilkins
AIIDE
2008
15 years 5 months ago
Combining Model-Based Meta-Reasoning and Reinforcement Learning for Adapting Game-Playing Agents
Human experience with interactive games will be enhanced if the software agents that play the game learn from their failures. Techniques such as reinforcement learning provide one...
Patrick Ulam, Joshua Jones, Ashok K. Goel
ICML
2009
IEEE
16 years 4 months ago
The adaptive k-meteorologists problem and its application to structure learning and feature selection in reinforcement learning
The purpose of this paper is three-fold. First, we formalize and study a problem of learning probabilistic concepts in the recently proposed KWIK framework. We give details of an ...
Carlos Diuk, Lihong Li, Bethany R. Leffler
STOC
2004
ACM
152views Algorithms» more  STOC 2004»
16 years 3 months ago
Exponential separation of quantum and classical one-way communication complexity
Abstract. We give the first exponential separation between quantum and bounded-error randomized one-way communication complexity. Specifically, we define the Hidden Matching Proble...
Ziv Bar-Yossef, T. S. Jayram, Iordanis Kerenidis
138
Voted
ECML
2007
Springer
15 years 9 months ago
Learning to Classify Documents with Only a Small Positive Training Set
Many real-world classification applications fall into the class of positive and unlabeled (PU) learning problems. In many such applications, not only could the negative training ex...
Xiaoli Li, Bing Liu, See-Kiong Ng