Repository logo
Log in(current)
Repository logoMIT Open ScholarshipDSpace@MIT
  1. Home
  2. Computer Science and Artificial Intelligence Lab (CSAIL)
  3. Artificial Intelligence Lab Publications
  4. AI Technical Reports (1964 - 2004)
  5. Learning World Models in Environments with Manifest Causal Structure

Learning World Models in Environments with Manifest Causal Structure

Thumbnail Image
Download
Name

AITR-1513.pdf

Size

1.69 MB

Format

Adobe PDF

Checksum (MD5)

89521327bd857fdc73fc84c073d5f8ef

Thumbnail Image
Download
Name

AITR-1513.ps

Size

11.84 MB

Format

PostScript

Checksum (MD5)

c4585e659c46e2f4a38f3765097507a6

Author(s)
Bergman, Ruth
Date Issued
May 5, 1995
Series/Report no.
AITR-1513
Abstract
This thesis examines the problem of an autonomous agent learning a causal world model of its environment. Previous approaches to learning causal world models have concentrated on environments that are too "easy" (deterministic finite state machines) or too "hard" (containing much hidden state). We describe a new domain --- environments with manifest causal structure --- for learning. In such environments the agent has an abundance of perceptions of its environment. Specifically, it perceives almost all the relevant information it needs to understand the environment. Many environments of interest have manifest causal structure and we show that an agent can learn the manifest aspects of these environments quickly using straightforward learning techniques. We present a new algorithm to learn a rule-based causal world model from observations in the environment. The learning algorithm includes (1) a low level rule-learning algorithm that converges on a good set of specific rules, (2) a concept learning algorithm that learns concepts by finding completely correlated perceptions, and (3) an algorithm that learns general rules. In addition this thesis examines the problem of finding a good expert from a sequence of experts. Each expert has an "error rate"; we wish to find an expert with a low error rate. However, each expert's error rate and the distribution of error rates are unknown. A new expert-finding algorithm is presented and an upper bound on the expected error rate of the expert is derived.
Subjects
machine learning
intelligent agents
Persistent DSpace Link
http://hdl.handle.net/1721.1/6777
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.