Tuesday’s class will focus on Leslie Valiant’s A Theory of the Learnable, Communications of the ACM, November 1984. Leslie Valiant won the 2010 Turing Award, partly for this work.
Comments Off
Tuesday’s class will focus on Leslie Valiant’s A Theory of the Learnable, Communications of the ACM, November 1984. Leslie Valiant won the 2010 Turing Award, partly for this work.
For tomorrow’s class, we will have updates on each team’s bot plans, and a discussion about how to evaluate bots as you develop one. There won’t be any prepared structure for this, but please come to class with some ideas to discuss about this. Hui Shu will lead Thursday’s class, and will post the topic […] ↓ Read the rest of this entry…
Sorry this is so late. I thought I was on the 14th until Professor Evans corrected me in class. On Tuesday we will be discussing ways to compute epsilon-equilibria for poker. We’ll review the CFR method previously discussed by Samee, then expand on the technique used in the Gilpen paper presented Thursday by Weikeng. The […] ↓ Read the rest of this entry…
On Tuesday April 5th Colin Braley and Samee Zahur will present in class. The title of the presentation is: “Mathematical Tools for Machine Learning and Opponent Modeling” We hope for this class will be more of a generic lecture/discussion on interesting algorithms and mathematical tools in machine learning. While specific applications to poker opponent modeling […] ↓ Read the rest of this entry…
I (Weikeng Qin) and Matthew Yu’s topic would be about state abstraction. Refs include: Billing’s dissertation, Charpter 3. Darse Billings, Neil Burch, Aaron Davidson, Robert Holte, Jonathan Schaeffer, Terence Schauenberg, and Duane Szafron. Approximating Game-Theoretic Optimal Strategies for Full-scale Poker. 2003 International Joint Conference on Artificial Intelligence. (similar to above) Andrew Gilpin et al. Better […] ↓ Read the rest of this entry…
Please check the updated schedule. This goes through the end of the semester, although some things may change. There is one class (26 April) currently “Open”, so if you have ideas for something to do that class or want to volunteer to lead another presentation on a particular topic, please let me know.
Congratulations to Peter Chapman and Yan Huang for winning the Bot Tournament, followed closely by Xiaoyuan Wang and Hui Shu. Honorable mention goes to Samee Zahur and Colin Braley for being the only team to follow the directions completely! Here are the slides summarizing the results: [PPTX]
In Mar 22nd’s class we are going to talk a little more on Adaboost, SVM or other related machine learning techniques. Ben will give you an introduction and I will talk more on applying machine learning techniques to build poker bots. The algorithms we are going to talk about are: SVM, CBR and Bayesian network. […] ↓ Read the rest of this entry…
On March 17th, I will be presenting two machine learning algorithms, Support Vector Machines and Adaptive Boosting. I recommend reading the following papers: Kristin Bennett and Colin Cambpell, Support Vector Machines: Hype or Hallelujah?, SIGKDD Explorations, Volume 2, Number 2, 2000. http://www.sigkdd.org/explorations/issue2-2/bennett.pdf. Yoav Freund and Robert E. Schapire. A Decision-Theoretic Generalization of on-Line Learning and […] ↓ Read the rest of this entry…
Remember there is a make-up class this week Wednesday, 6pm in Olsson 228E.
©2011 cs6501: PoKER | Powered by WordPress with Easel | Subscribe: RSS | Back to Top ↑
Recent Comments