Sciweavers

63 search results - page 8 / 13
» Learning Symbolic Models of Stochastic Domains
Sort
View
IJCAI
2007
15 years 1 months ago
A Fully Connectionist Model Generator for Covered First-Order Logic Programs
We present a fully connectionist system for the learning of first-order logic programs and the generation of corresponding models: Given a program and a set of training examples,...
Sebastian Bader, Pascal Hitzler, Steffen Höll...
DAGSTUHL
2007
15 years 1 months ago
Learning Probabilistic Relational Dynamics for Multiple Tasks
The ways in which an agent’s actions affect the world can often be modeled compactly using a set of relational probabilistic planning rules. This paper addresses the problem of ...
Ashwin Deshpande, Brian Milch, Luke S. Zettlemoyer...
88
Voted
ICML
2005
IEEE
16 years 12 days ago
Learning first-order probabilistic models with combining rules
Many real-world domains exhibit rich relational structure and stochasticity and motivate the development of models that combine predicate logic with probabilities. These models de...
Sriraam Natarajan, Prasad Tadepalli, Eric Altendor...
177
Voted

Publication
233views
13 years 10 months ago
Sparse reward processes
We introduce a class of learning problems where the agent is presented with a series of tasks. Intuitively, if there is relation among those tasks, then the information gained duri...
Christos Dimitrakakis
AAAI
1994
15 years 28 days ago
Learning to Coordinate without Sharing Information
Researchers in the eld of Distributed Arti cial Intelligence (DAI) have been developing e cient mechanisms to coordinate the activities of multiple autonomous agents. The need for...
Sandip Sen, Mahendra Sekaran, John Hale