Princeton University Computer Science Department

Computer Science 511 Theoretical Machine Learning Rob Schapire

Spring 2014

---

Directory
General Information | Schedule & Readings | Assignments | Final Project | blackboard

---

Proposal due:  Wednesday, April 9.
Final report due:  5pm on Tuesday, May 13.

Choosing a topic
Software and data
Writing a final report
What you will be graded on
Books on reserve

The final project for this class is completely open ended.  You can pick just about any topic you wish so long as there is some direct connection to machine learning and its mathematical foundations.  For your project, you can run an experiment, or you can think about a theoretical problem or algorithm, or you can do a blend of both.  You can work individually or with a partner.  Working as a pair is very much encouraged -- you are likely to learn more, have more fun, and accomplish more if working with a classmate.  As further encouragement, students working as a pair will receive a small bonus which will be added to their final project grades.

Please email me (in plain text) a brief paragraph outlining your project as soon as you know what you want to do, but no later than Wednesday, April 9.  Be sure to include name and netid (for both yourself and your partner, if you are working as a pair).  Feel free to come to my office hours or contact me if you want to discuss your ideas, or have questions.

This project is due at 5pm on Tuesday, May 13.  Please make every effort to turn in your project on time.  "Free" late days cannot be used for the final project.  Extensions beyond this due date will only be given for genuine and unforeseen emergencies, such as serious illness or death in the family; furthermore, extensions may require dean's approval.  To avoid last minute problems with laptops, hard drives, etc., be sure to keep your work regularly and frequently backed up as I do not generally consider hardware or computer difficulties to be "emergencies."

I strongly advise starting early on your project.  Running experiments takes time, as does thinking about theoretical problems.

Choosing a topic

For your project, you should start by doing some reading on a topic, and then you might run an experiment, or try to simplify or improve or extend some result, or you might try applying an algorithm to a particular application, or you might think about how two different approaches or algorithms are related to each other.  Or you can do something different from any of these.

Here are examples of possible types of projects:

• Study one of the many advanced topics not covered in this course.  Examples include: reinforcement learning, learning finite automata, PAC-Bayes analysis, bandit algorithms, online convex optimization, active learning.  To get ideas, browse assigned or optional readings, or the chapters of our book that we did not cover, or explore the references given below, particularly links to survey articles.
• Run experiments with a learning algorithm on some datasets.  Measure the error rates on separate test sets.  Compare performance to another learning algorithm, or to a modification of the same algorithm.  Or, compare performance to what is predicted by theory.  For instance, for SVM's, try to measure if fewer support vectors really do mean better performance.  Or compare the learning curves observed on real data for your favorite learning algorithm to what is predicted by the theory.
• Read two papers coming from different communities or on different topics that seem related and try to relate them.  Explore the connections between machine learning and another field, such as information theory, complexity theory, cryptography, game theory, or neuroscience.  For example, see the recent paper by Abernethy, Frongillo, and Wibisono connecting online learning with option pricing.
• Find an open problem, and attempt to make progress on it.  A great place to look for these is the proceedings of recent COLT conferences which every year publishes short open-problem papers (some of which have monetary awards for solving).  See links below to find online proceedings, then scroll down or search in your browser for the word "open".  (Obviously, since these were published a while ago, it is possible that some of these will have already been solved.  But that doesn't mean they can't be the starting point for a project.)
• Think about what the consequences are of changing one of the standard learning models.  Does learning become easier or harder?  What are the general properties of the new model?  Can you think of new algorithms for interesting problems in the new model?
• Create an applet or other graphical program that interactively demonstrates the behavior of a learning algorithm that you have read about.  Or, create an interactive game that uses learning, for instance a game that plays something simple like "rock, paper, scissors" or "matching pennies" against a human.  Online algorithms are especially well suited for this.  See, for instance, this applet.  What insights about the learning algorithm did you gain by playing with your game or demo?  (Be sure to keep the emphasis on machine learning rather than, say, the graphical interface.  Make sure that it is clear that you have learned something about machine learning.)
• Build or apply a machine learning program tailored to a particular application coming from some other field such as natural language processing, bioinformatics or information retrieval.
• Come up with your own idea!  Be original and creative.

Places to look to get ideas for topics include the following.  Note that for some of these links, you will need to be on the Princeton intranet to download entire papers.

• There are many very good survey or overview papers available on a great number of topics in machine learning.  See the excellent collections at Foundations and Trends in Machine Learning, and Morgan & Claypool Synthesis Lectures on Artificial Intelligence and Machine Learning.  See also the very nice survey article by Boucheron, Bousquet and Lugosi that includes several topics that we did not get to cover in this course, but that are highly relevant, such as PAC-Bayes bounds and stability.
• There are several books on reserve at the Engineering library for this course, listed below.
• The conference that comes closest to what we have covered in class is the Conference on Learning Theory (COLT).  Here are links to some of the recent conferences (including online proceedings):  2013, 2012 (need to click on link for JMLR proceedings), 2011, 2010, 2009.
• The main machine learning journals are Journal of Machine Learning Research and Machine Learning.
• Other machine learning conferences include the International Conference on Machine Learning (ICML), Neural Information Processing Systems (NIPS) and Uncertainty in Artificial Intelligence.

If you are doing a theoretical project, it may be that you read a paper, try improving it, and are not able to make progress.  In that case, it is okay to fall back on just explaining the paper as clearly as you can, in your own words.

It is okay to do a project that is related to your primary research.  In this case, you will need to carve out a project that is focused and relevant to machine learning and its mathematical foundations.  Needless to say, turning in a project based on previously completed research would not be appropriate.

Software and data

You may use software that you legitimately find online.  If you do, please note this in your report, and, as with any project, demonstrate in your report that you understand how the underlying learning algorithm works.  If you implement code yourself, be aware that it can be tricky to be sure that a machine learning program is actually working properly.  Be sure that it is carefully tested before running your experiments.  For instance, check the output of the program carefully on tiny datasets where you know what the output should be (for instance, you have computed it by hand, or you have found or implemented another program (say, in another language or using a different technique) that computes it for you).  Also keep an eye out for clues that your program might have problems, for instance, if the results violate proven theorems.  Your report should describe briefly what measures you took to be sure that your program is working properly.

One of the best places for obtaining "real" data is the repository at University of California, Irvine.  Within this repository, there are many, many datasets to choose from.  Some of these datasets have separate test sets.  Others only provide a training set.  In this case, you can randomly partition the dataset into a training set and test set.  If you end up with a rather small test set, you will probably want to repeat this many times to get reliable results.  You can also use synthetic data of your own creation, in which case there is no problem generating a large test set.  Usually, when evaluating a machine learning algorithm, you will want to see how it performs on several datasets.

If you have access to more specialized data (for instance, as part of your regular research), feel free to use it.  However, whatever data you use, it should go without saying that if you plan to use data that is private, confidential, classified, copyrighted, controlled, sensitive, etc., it is your responsibility to be sure that it is legally and ethically okay for you to use the data for the purposes of this project (including possibly sharing the data with the COS511 course staff, should the need arise).  Please do not use any data in any way that might be considered illegal, unethical, immoral or inappropriate.  The same goes for any software that you use.

Writing a final report

In every case, the end result of your project should be a written report clearly and concisely describing what you did, what results you got and what the results mean.  If you are working individually, your report should be 3-5 pages long.  If you are working with a partner, the two of you together should submit a single report, which may be 4-7 pages long.  The report should use 12pt font, 1-inch margins, and single spacing. The page length limits do not include figures or citations.  Papers that vary from these guidelines risk receiving a grade deduction and/or some sections not being read.

Your report must be submitted by 5pm on Tuesday, May 13.  Reports should be submitted electronically using this link.  Note that you will need to log on using your Princeton OIT netid and password.  Submit a single PDF file called "report.pdf". Although it should not be necessary in most cases, if you wish, you can also submit other electronic materials in addition to your report.

Your report should follow the general format of a scholarly paper in this area.  You should write your report as clearly as possible in a manner that would be understandable to a fellow COS511 student.  In other words, you should not assume that the reader has background beyond what has been covered in class (as well as a general computer science background).

Your report should begin by describing the problem you are studying, some background (what has been done before) and the motivation for the problem, i.e., why it is worth studying.  Previous work and outside sources should be cited throughout your report in a scholarly fashion following the style of academic papers in this area.  (See the proceedings of some of the conferences referenced above for examples.)

Next, you should clearly explain what you did, both from a high level, and then in more detail.  For an experimental paper, you should explain the experiments in enough detail that there is a reasonable possibility that a motivated reader would be able to replicate them.  You also should outline some of the theory underlying the algorithms you are studying.  State your results clearly, and think about graphical tools you can use to make your results clearer (a table of numbers is usually less compelling than a graphical representation of the same data).  Look through published papers for ideas.  For a theoretical paper, the learning model and other mathematical details should be explained well enough for the results to be stated with mathematical precision and clarity.

In every case, be sure to explain the meaning of your results.  Don't just give a table of results or a dry mathematical formula.  Explain what the results mean, and what conclusions can be drawn from them.  Again, do all this in a way that would be understandable and interesting to a fellow COS511 student.  What did you expect to find?  What did you find instead?  What are the implications?  If you found something surprising, can you think of how it might be explained?

What you will be graded on

Projects will be graded along the following dimensions:

• originality and creativity
• background material
• theoretical component
• experimental design and execution (only if applicable since this part is not required)
• discussion and interpretation of results
• writing of the final report, including clarity, completeness and conciseness
• overall effort

Projects completed with a partner will receive a final project grade bonus equal to 3% of the total points possible.

Books on reserve

The following books are (or soon will be) on reserve at the Engineering library and/or are available online when logged on to the Princeton intranet.

• Ethem Alpaydin.
  Introduction to Machine Learning.
  MIT Press, 2009. (2nd ed.)
• Christopher M. Bishop.
  Pattern Recognition and Machine Learning.
  Springer, 2006.
• Nicolò Cesa-Bianchi and Gábor Lugosi.
  Prediction, Learning and Games.
  Cambridge University Press, 2007.
• Nello Cristianini and John Shawe-Taylor.
  An Introduction to Support Vector Machines and Other Kernel-based Learning Methods.
  Cambridge University Press, 2000.
• Luc Devroye, László Györfi, Gábor Lugosi.
  A Probabilistic Theory of Pattern Recognition.
  Springer, 1996.
• Richard O. Duda, Peter E. Hart and David G. Stork.
  Pattern Classification.
  Wiley, 2001. (2nd ed.)
• Trevor Hastie, Robert Tibshirani and Jerome Friedman.
  The Elements of Statistical Learning: Data Mining, Inference, and Prediction.
  Springer, 2009. (2nd ed.)
• Michael J. Kearns and Umesh V. Vazirani.
  An Introduction to Computational Learning Theory.
  MIT Press, 1994.
• Tom M. Mitchell.
  Machine Learning.
  McGraw-Hill, 1997.
• Mehryar Mohri, Afshin Rostamizadeh and Ameet Talwalkar.
  Foundations of Machine Learning.
  MIT Press, 2012.
• Robert E. Schapire and Yoav Freund.
  Boosting: Foundations and Algorithms.
  MIT Press, 2012.
• Vladimir N. Vapnik.
  The Nature of Statistical Learning Theory.
  Springer, 1995.
• Vladimir N. Vapnik.
  Statistical Learning Theory.
  Wiley, 1998.