🚀 go-pugleaf

RetroBBS NetNews Server

Inspired by RockSolid Light RIP Retro Guy

Article View: cu.cs.ugrads
Article #103

CS ColloquiumComputer Science Colloquium for Grudic - 4/26/01

#103
From: jane obrecht
Date: Tue, 24 Apr 2001 13:56
53 lines
4252 bytes
University of Colorado at Boulder
Department of Computer Science
ECOT 717 Engineering Center
Campus Box 430
Boulder, Colorado 803090430
(303) 4927514, FAX: (303) 4922844

CS COLLOQUIUM
Fast Reinforcement Learning in Large Continuous Domains
Greg Grudic
University of Pennsylvania
April 26, 2001
3:30  4:30 PM
Engineering Center Classroom 245

Refreshments will be served afterwards in ECOT 831

Reinforcement Learning (RL) is a framework by which an agent autonomously 
learns to improve the rewards it receives from its environment, thus 
conceptually embodying one of the fundamental aims of AI. RL algorithms 
have been shown to be effective on a variety of discrete problem domains, 
where simulation allows millions of learning episodes to be executed. 
However, the application of RL to large continuous problem domains where 
only limited numbers of learning episodes can be afforded, has not met with 
as much success. I propose a set of methods in which the policy definitions 
used to encode how an agent interacts with its environment are represented 
by a finite set of parameters. Policy Gradient (PG) RL is used to 
incrementally modify this parameterized policy along a gradient of improved 
reward. I will describe three new PG algorithms we have developed to make 
RL feasible in high dimensional continuous state spaces: Boundary Localized 
Reinforcement Learning (BLRL), Action Transition Policy Gradient (ATPG), 
and Deterministic Policy Gradient (DPG). These algorithms directly encode 
prior domain knowledge, vastly improving convergence speed, and are all 
theoretically guaranteed to converge to locally optimal control policies. 
The computational feasibility of these algorithms is demonstrated 
experimentally on simulated and real problems taken from robotics. We show 
convergence to locally optimal policies in less than a few hundred 
episodes, unlike other PG algorithms that require orders of magnitude more 
episodes to converge.

Host:  Mike Mozer
------------------------------
http://www.cs.colorado.edu/department/events/colloquia/colloquia.html

Sign Language Interpreters Available Upon Request.  Please contact Jane 
Obrecht, Department of
Computer Science, Engineering  ECOT 722, 303-492-6101, at least five days 
prior to the colloquium.

_______________________________________________
cscolloq mailing list
cscolloq@cs.colorado.edu
http://www.cs.colorado.edu/mailman/listinfo/cscolloq
Technical Details
Message-ID: <988120649.28222@csnews.cs.colorado.edu>
Path: arc1-ca.pugleaf.net!newsfeed.google.com!sn-xit-03!supernews.com!hermes2.visi.com!news-out.visi.com!news-out.visi.com!hermes.visi.com!pulsar.dimensional.com!dimensional.com!coop.net!cs.colorado.edu!csnews!recnews

Show Full Headers
Complete Article Headers
X-Google-Language: ENGLISH,ASCII-7-bit
X-Google-Thread: 11534c,fef1d741cf3ede49,start
X-Google-Attributes: gid11534c,public
X-Google-ArrivalTime: 2001-04-24 11:20:06 PST
Newsgroups: cu.cs.ugrads
X-Sender: obrecht@columbine.cs.colorado.edu
X-Mailer: QUALCOMM Windows Eudora Pro Version 4.2.2 
From: jane obrecht <Jane.Obrecht@colorado.edu>
Mime-Version: 1.0
Content-Type: text/plain; charset="us-ascii"; format=flowed
Subject: CS ColloquiumComputer Science Colloquium for Grudic - 4/26/01
Errors-To: cscolloq-admin@cs.colorado.edu
X-BeenThere: cscolloq@cs.colorado.edu
X-Mailman-Version: 2.0.2
Precedence: bulk
Reply-To: Jane.Obrecht@colorado.edu
List-Help: <mailto:cscolloq-request@cs.colorado.edu?subject=help>
List-Post: <mailto:cscolloq@cs.colorado.edu>
List-Subscribe: <http://www.cs.colorado.edu/mailman/listinfo/cscolloq>,
 <mailto:cscolloq-request@cs.colorado.edu?subject=subscribe>
List-Id: CS Colloquium announcements <cscolloq.cs.colorado.edu>
List-Unsubscribe: <http://www.cs.colorado.edu/mailman/listinfo/cscolloq>,
 <mailto:cscolloq-request@cs.colorado.edu?subject=unsubscribe>
List-Archive: <http://www.cs.colorado.edu/pipermail/cscolloq/>
Date: 24 Apr 2001 07:56:36 -0600
Message-ID: <988120649.28222@csnews.cs.colorado.edu>
Sender: news
Distribution: co
X-Note1: message-id generated by recnews
X-Note2: mail msgid was   <4.2.2.20010424075525.013f1008@columbine.cs.colorado.edu>
Originator: daemon@csnews.cs.colorado.edu
NNTP-Posting-Host: 128.138.243.75
X-Trace: 24 Apr 2001 07:57:29 -0700, 128.138.243.75
Lines: 53
Path: arc1-ca.pugleaf.net!newsfeed.google.com!sn-xit-03!supernews.com!hermes2.visi.com!news-out.visi.com!news-out.visi.com!hermes.visi.com!pulsar.dimensional.com!dimensional.com!coop.net!cs.colorado.edu!csnews!recnews