Parisian Master of Research in Computer Science
Master Parisien de Recherche en Informatique (MPRI)

# Differences

This shows you the differences between two versions of the page.

cours:c-2-11 [2016/02/16 21:15]
magniez [Lectures Outline]
cours:c-2-11 [2016/08/02 09:14] (current)
magniez [Lectures Outline]
Line 40: Line 40:
Mid-term exam on December 1st. All handwritten notes are allowed during the exam, as well as course notes provided on this webpage. Mid-term exam on December 1st. All handwritten notes are allowed during the exam, as well as course notes provided on this webpage.
- **Learning Theory** (2 lectures)   - **Learning Theory** (2 lectures)
-    - (08/12 IK) Learning framework, Occam's razor, computational and statistical complexity of learning: [[https://www.dropbox.com/s/3a173q263h7uetf/fourier.pdf?dl=0|notes]] +    - (08/12 IK) Learning framework, Occam's razor, computational and statistical complexity of learning: [[https://www.dropbox.com/s/3a173q263h7uetf/learning.pdf?dl=0|notes]]
-    - (15/12 IK) Learning through the Fourier Expansion, Low-degree Learning, Goldreich-Levin algorithm: [[https://www.dropbox.com/s/a8wjgoo52adwiyc/learning.pdf?dl=0|notes]]+    - (15/12 IK) Learning through the Fourier Expansion, Low-degree Learning, Goldreich-Levin algorithm: [[https://www.dropbox.com/s/a8wjgoo52adwiyc/fourier.pdf?dl=0|notes]]
- **Sublinear algorithms** (4 lectures)   - **Sublinear algorithms** (4 lectures)
- (05/01 FM) Search using random walks (application to st-undirected connectivity, k-SAT): [[https://www.dropbox.com/s/e367j8fkv974e6i/lecture11.pdf?dl=0|notes]]\\ [[https://www.dropbox.com/s/1spagm951esddir/h2.pdf?dl=0|Homework 2]] to do by 01/19     - (05/01 FM) Search using random walks (application to st-undirected connectivity, k-SAT): [[https://www.dropbox.com/s/e367j8fkv974e6i/lecture11.pdf?dl=0|notes]]\\ [[https://www.dropbox.com/s/1spagm951esddir/h2.pdf?dl=0|Homework 2]] to do by 01/19

Universités partenaires
Établissements associés