Sciweavers

30 search results - page 3 / 6
» icml 1999
Sort
View
ICML
2000
IEEE
13 years 9 months ago
A Bayesian Framework for Reinforcement Learning
The reinforcement learning problem can be decomposed into two parallel types of inference: (i) estimating the parameters of a model for the underlying process; (ii) determining be...
Malcolm J. A. Strens
ICML
1999
IEEE
14 years 6 months ago
Abstracting from Robot Sensor Data using Hidden Markov Models
ing from Robot Sensor Data using Hidden Markov Models Laura Firoiu, Paul Cohen Computer Science Department, LGRC University of Massachusetts at Amherst, Box 34610 Amherst, MA 01003...
Laura Firoiu, Paul R. Cohen
ICML
1999
IEEE
14 years 6 months ago
Simple DFA are Polynomially Probably Exactly Learnable from Simple Examples
E cient learning of DFA is a challenging research problem in grammatical inference. Both exact and approximate (in the PAC sense) identi ability of DFA from examples is known to b...
Rajesh Parekh, Vasant Honavar
ICML
1999
IEEE
14 years 6 months ago
Implicit Imitation in Multiagent Reinforcement Learning
Imitation is actively being studied as an effective means of learning in multi-agent environments. It allows an agent to learn how to act well (perhaps optimally) by passively obs...
Bob Price, Craig Boutilier
ICML
1999
IEEE
14 years 6 months ago
Making Better Use of Global Discretization
Before applying learning algorithms to datasets, practitioners often globally discretize any numeric attributes. If the algorithm cannot handle numeric attributes directly, prior ...
Eibe Frank, Ian H. Witten