6.435 - Theory of Learning and System Identification - Spring 2007
Description Syllabus References Homeworks Scribing Project Topics

 

  • 2nd Round of scribe assignments.
    • Please check what lecture you're assigned to, and let us know if the assignment no longer suits you.
    • Also let us know if you would like to volunteer for any of the open lectures.

  • Scribe template [LaTeX].

     

  • Lecture 2. Introduction. Risk minimization. [Th 2/8, Douglas Fearing]
  • Lecture 3. Convergence. Non-parametric density estimation. [T 2/13, Sleiman Itani]
  • Lecture 4. Uniform Convergence. Finite parametrizations. [Th 2/15, Rajiv Menjoge]
  • Lecture 5. Annealed entropy. UCEP with indicator funtions. [Th 2/22]
  • Lecture 6. Growth function. VC dimension. [T 2/27, Mac Schwager]
  • Lecture 7. Exchangeability. De Finetti's theorem. [Th 3/1]
  • Lecture 8. Support Vector Machines. Duality. [T 3/6]
  • Lecture 9. Convergence properties of SVMs. Extensions. [Th 3/8, Kostas Bimpikis]
  • Lecture 10. Coding and compression. [T 3/13, Giorgio Magri]
  • Lecture 11. Minimum description length. Model selection. [Th 3/15]
  • Lecture 12. Structured risk minimization and MDL. [T 3/20, Wen Dong]
  • Lecture 13. System identification. ARX model. Persistance of excitation. [T 3/22, Ilan Lobel]
  • Lecture 14. Asymptotic normality. State space models. [T 4/3, Sleiman Itani]
  • Lecture 15. HMMs. Forward-Backward and EM algorithms. [Th 4/5, Rajiv Menjoge]