Newsgroups: comp.ai.jair.announce
Path: cantaloupe.srv.cs.cmu.edu!rochester!udel-eecis!news.mathworks.com!enews.sgi.com!ames!cnn.nas.nasa.gov!eos!kronos.arc.nasa.gov!jair-ed
From: jair-ed@ptolemy.arc.nasa.gov
Subject: New Article, A Formal Framework for ...
Message-ID: <1996Jun27.003134.3756@ptolemy-ethernet.arc.nasa.gov>
Originator: jair-ed@polya.arc.nasa.gov
Lines: 40
Sender: usenet@ptolemy-ethernet.arc.nasa.gov (usenet@ptolemy.arc.nasa.gov)
Nntp-Posting-Host: polya.arc.nasa.gov
Organization: NASA/ARC Computational Sciences Division
Date: Thu, 27 Jun 1996 00:31:34 GMT
Approved: jair-ed@ptolemy.arc.nasa.gov

JAIR is pleased to announce the publication of the following article:

Tadepalli, P. and Natarajan, B.K. (1996)
  "A Formal Framework for Speedup Learning from Problems and Solutions", 
   Volume 4, pages 445-475.

   Available in Postscript (333K) and compressed Postscript (132K).
   For quick access via your WWW browser, use this URL:
     http://www.cs.washington.edu/research/jair/abstracts/tadepalli96a.html
   More detailed instructions are below.

   Abstract: Speedup learning seeks to improve the computational
   efficiency of problem solving with experience. In this paper, we
   develop a formal framework for learning efficient problem solving from
   random problems and their solutions. We apply this framework to two
   different representations of learned knowledge, namely control rules
   and macro-operators, and prove theorems that identify sufficient
   conditions for learning in each representation. Our proofs are
   constructive in that they are accompanied with learning algorithms. 
   Our framework captures both empirical and explanation-based 
   speedup learning in a unified fashion.  We illustrate our framework
   with implementations in two domains: symbolic integration and Eight
   Puzzle. This work integrates many strands of experimental and
   theoretical work in machine learning, including empirical learning of
   control rules, macro-operator learning, Explanation-Based Learning
   (EBL), and Probably Approximately Correct (PAC) Learning.

The article is available via:
   
 -- comp.ai.jair.papers (also see comp.ai.jair.announce)

 -- World Wide Web: The URL for our World Wide Web server is
       http://www.cs.washington.edu/research/jair/home.html
    For direct access to this article and related files try:
       http://www.cs.washington.edu/research/jair/abstracts/tadepalli96a.html

 -- Anonymous FTP from either of the two sites below.

    Carnegie-Mellon University (USA):
	ftp://p.gp.cs.cmu.edu/usr/jair/pub/volume4/tadepalli96a.ps
    The University of Genoa (Italy):
	ftp://ftp.mrg.dist.unige.it/pub/jair/pub/volume4/tadepalli96a.ps

    The compressed PostScript file is named tadepalli96a.ps.Z (132K)

 -- automated email. Send mail to jair@cs.cmu.edu or jair@ftp.mrg.dist.unige.it
    with the subject AUTORESPOND and our automailer will respond. To
    get the Postscript file, use the message body GET volume4/tadepalli96a.ps 
    (Note: Your mailer might find this file too large to handle.) 
    Only one can file be requested in each message.

 -- JAIR Gopher server: At p.gp.cs.cmu.edu, port 70. 

For more information about JAIR, visit our WWW or FTP sites, or
send electronic mail to jair@cs.cmu.edu with the subject AUTORESPOND
and the message body HELP, or contact jair-ed@ptolemy.arc.nasa.gov.



