RLAI Tea-time talks 2009

	Reinforcement Learning and Artificial Intelligence (RLAI) Laboratory
	Summer Tea-time Talks 2009

On Mondays, Tuesdays and Wednesdays (3 days a week) this summer:

When? 4:00-4:30pm, with tea starting at 3:45pm
Where? CSC 333

Notes:
a) Everyone is welcome!
b) You, either RLAI member or visitor, are strongly encouraged to give a talk. Please let us know.
c)Giving a talk? Please read the Guidelines bellow.

Other talks:
1) LLL on Thursdays at noon.

Schedule (Starting May 11)

May 2009

Date	Time / Location	Tea talk	Tea	Topic/comments
Mon 11	4PM (Tea: 3:45) / CSC 333	Rich	Hamid
Tue 12	4PM (Tea: 3:45) / CSC 333	Shalabh
Wed 13	4PM (Tea: 3:45) / CSC 333	Csaba
Mon 18		Holiday	Barnabas (only Tue, Wed)	Victoria day (holiday)
Tue 19	4PM (Tea: 3:45) / CSC 333	Anna
Wed 20	4PM (Tea: 3:45) / CSC 333	Marc
Mon 25		Canceled	Marc (only Tue, Wed)	Canceled due to DLS talk
Tue 26	4PM (Tea: 3:45) / CSC 333	David
Wed 27	4PM (Tea: 3:45) / CSC 333	Thomas

June 2009

Date	Tea talk	Tea	Topic/comments
Mon 01	Canceled	No tea	No tea talks due to NIPS deadline
Tue 02	Canceled		No tea talks due to NIPS deadline
Thu 04	Canceled		No tea talks due to NIPS deadline
Mon 08	Yasin	Yaoliang
Tue 09	Gabor		Mahdi Milani Fard, Joelle Pineau: MDPs with Non-Deterministic Policies, NIPS 2008, pdf
Wed 10	Hengshuai
Mon 15	Canceled	No tea	ICML/UAI/COLT/MSRL
Tue 16	Canceled		ICML/UAI/COLT/MSRL
Wed 17	Canceled		ICML/UAI/COLT/MSRL
Mon 22	Canceled	Gabor (only Tue, Wed)	Canceled
Tue 23	Eric
Wed 24	Yaoliang		Philip M. Long and Recco A. Servedio: Random Classification Noise Defeats All Convex Potential Boosters, to appear in Machine Learning (preliminary version appeared in ICML'08)
Mon 29	Istvan	Adam (only Mon, Tue)
Tue 30	Michael (Delp)	Adam (only Mon, Tue)

July 2009

Date	Tea talk	Tea	Topic/comments
Wed 01	Holiday		Canada day
Mon 06	Hamid	Hengshuai	Convergent Temporal-Difference Learning with Arbitrary Smooth Function Approximation
Tue 07	Rupam
Wed 08	James
Mon 13	Elliot	Rupam
Tue 14	Chris
Wed 15	Yavar
Mon 20	Vadim	Michael (Delp)	The talk will be based on this paper and is about subgoaling for real-time heuristic search which is a deterministic relative of on-policy value iteration. Slides are here
Tue 21	Jim Kehoe
Wed 22	Adam
Mon 27	Barnabas	Yasin	Paper: Michel Talagrand: The Missing Factor in Hoeffding's Inequalities (Annales de l'institut Henri Poincaré (B) Probabilités et Statistiques, 31 no. 4 (1995), p. 689-702 )
Tue 28	Thomas
Wed 29	Amir Massoud

August 2009

Date	Tea talk	Tea	Topic/comments
Mon 03	Holiday	Chris	Heritage Day (Civic)
Tue 04	David (Pal)		Ttitle: A Simple Proof of Sauer's Lemma
Wed 05	David (Silver)		Canceled
Mon 10	Yuxi	Leah
Tue 11	Hamid
Wed 12	Eric
Mon 17	Marc	Amir massoud	Title: "Transfer Learning for Reinforcement Learning Domains: A Survey" by Taylor and Stone (2009)
Tue 18	Csaba		Canceled
Wed 19	Leah		Talk Canceled-- haveTea+possibly RLAI meeting

The end of summer 2009 tea time talks.
iCore summit: 20th-23th of August

Guidelines

A tea-time talk can either be an overview of a relevant paper or a summary of the presenter's own work
Talks start punctually at 4:00pm, and are limited to 20 minutes + 10 minutes of question time
Presenters should focus on transmitting information as efficiently as possible
It is the presenter's responsibility to pass over disruptive questions if they divert from the talk
It is the listener's responsibility to only ask questions that help clarify rather than disrupt the talk
All subscribers to this list are expected to give one short talk per round.!
Short of ideas? Check out the paper suggestions below (see also previous tea talks)

Organization

These web pages are "self-organizing"
For each new round of talks, all subscribers will be randomly assigned a day to present a talk
Please resolve date conflicts by agreeing to swap with someone else, and then edit the table below
If you have difficult constraints, notify the list to find someone to swap with (click on "notify" at foot of page)
Please select a topic for your talk at least one week in advance, and edit it into the table above
If you are presenting a paper, please provide a link to the paper in the table
Reminders of upcoming talks will be sent out on a weekly basis
Editing open pages such as this is easy but requires Netscape or Mozilla or this Python script (instructions here). You really should learn how to do this, but don't let it slow down getting your information in here. If you don't know how to edit yet, then send your information as a comment to this page, by clicking "Extend this page" at the bottom of this page.
One student per week is in charge of making sure that we still have some tea and cookies, that the kettle is boiling by 3:45, and clearing away at the end of the talk. This responsibility will rotate through the students in order of their presentations, and is marked in square brackets below.

Extend this Page How to edit Style Subscribe Notify Suggest Help This open web page hosted at the University of Alberta. Terms of use 1162/1

Summer Tea-time Talks 2009