Date: 18-22 January 2016
Teachers: Cyril Cohen, Laurence Rideau, and Laurent Théry
Local contact: Enrico Tassi
https://team.inria.fr/marelle/en/advanced-coq-winter-school-2016/
Date: 18-22 January 2016
Teachers: Cyril Cohen, Laurence Rideau, and Laurent Théry
Local contact: Enrico Tassi
https://team.inria.fr/marelle/en/advanced-coq-winter-school-2016/
For your information, here are the modalities of evaluation for all M2 courses.
CR01: The students are given research articles twice. Each time, they give an oral presentation based on these articles. The first one counts as continuous evaluation (CE), the second one as final evaluation (FE). The final note is given by (CE+2FE)/3.
CR02: There is homework for continuous evaluation (CE). The students are given research articles, they produce a written report and give an oral presentation based on these articles (FE). The final note is given by (CE+2FE)/3.
CR03: There is homework for continuous evaluation (CE). The students are given research articles, they produce a written report and give an oral presentation based on these articles (FE). The final note is given by (CE+2FE)/3.
CR04: There is homework for continuous evaluation (CE). The students choose research articles, they produce a written report and give an oral presentation based on these articles (FE). The final note is given by (CE+FE)/2.
CR05: 3 homeworks for continuous evaluation (CE); written report and give an oral presentation based on a research article for final evaluation (FE). The final note is given by (CE+2FE)/3.
CR06: Two mini-projects counting each for 1/4 of the final grade. One final exam counting for the last half.
CR07: Two homeworks for continuous evaluation (CE1,CE2). The students are given research articles, they produce a written report and give an oral presentation based on these articles (FE). The final note is given by ((CE1+CE2)/2+2FE)/3.
CR08: Grades will be based on a final exam and on the presentation of a research article, each contributing to one half of the grade.
CR09: The students are given research articles, they produce a written report (WR/20) (between 8 and 20 pages). We will do a cross review. One report of another given student report (1 or 2 pages maximum) will be done (RR/20). And student gives an oral presentation based on these articles (OP/5). Questions should be done by students (Q/5). The final note is given by (3WR+3OP+2*(RR+Q))/7
CR10: The students are asked to write a static analyser for a mini language (AS). The students are given research articles, they give an oral presentation based on these articles (FE). The final note is given by (AS+FE)/2.
CR11: There will be a programming project (6pts, due after the mid-term break), a modeling project (7pts, due after the end-of-term break) and a written exam (7pts).
CR12: The final grade for the CR12 course is computed as follows: small exercices to be handed each week, during the first half of the course, count for 1/4 of the grade; a mid term exam counts for 1/4 of the grade; a final exam counts for 1/2 of the grade.
CR13: There is homework for continuous evaluation (CE). The students have also a final evaluation (FE) based on a written exam at the end of the course. The final note is given by max(FE,(CE+2FE)/3).
CR14: There is homework (based on the content of lectures as well as the study of research papers) for continuous evaluation (CE). There is a written exam (2h) for final examination (FE). The final note is given by (CE+2FE)/3.
CR15: The evaluation of the CR15 Complex Networks course will depend on whether the student is involved in the M2 Complex System program or not. If yes then the student’s participation will be mandatory to the TD, which is evaluated through projects during the semester and the final mark will count as 1/3 to the final overall mark. In addition every student has to pass a written exam by the end of the semester for the lecture, which will count with 2/3 weight in the final evaluation. If the student is not involved in the Complex System program only the written exam is mandatory, which result will determine 100% the final mark. On the other hand even these students have the option to participate to the TDs, complete the projects and get a TD mark. In this case the student will have the advantage to gain the better mark gained with or without the TD results.
CR16: The students will be proposed research articles about which they need to produce a report (with some numerical applications of the content of the article) and an oral presentation. The report and presentation are used for the note.
CR17: Two homeworks (counting each for DM/2) and one final exam (DS). The final grade is (DM+2DS)/3.
CR18: The students are given 3 homework assignments for continuous evaluation (CE). At the end of the semester, students are asked to study and orally present research articles (FE). The final note is given by (CE+2FE)/3.
CR19: There is homework for continuous evaluation (CE). The students are given research articles, they produce a written report and have an exam based on these articles (FE). The final note is given by (CE+2FE)/3.
Dates : 7-11 December
Teachers: Joel Ouaknine, Ben Worrell et Stefan Kiefel (Oxford).
Local contact: Pascal Koiran
Title: Probabilistic Techniques and Models in Computer Science
Synopsis (more information here):
— Decision Problems
* Space-bounded interactive protocols
* Reachability and threshold problems for Markov chains
* Connections with number theory
— Stochastic Processes
* Markov-chain Monte Carlo techniques, Coupling
* Martingales, Optional Stopping Theorem, Azuma’s inequality and
applications, Lyapunov functions
* Equivalence of Markov chains, Markov decision processes
* Distance between Markov chains
* Analysis of infinite-state Markov chains
— Data Structures and Algorithms
* Luby’s algorithm
* Count-min filters
* Random rounding, packet routing
— Learning Theory
* Rademacher complexity, VC dimension
* Johnson-Lindenstraus Lemma
Dates: 11-15 January 2016
Teachers: Ciro Cattuto, Laetitia Gauvin et André Panisson (ISI Torino)
Local contact: Márton Karsai (marton.karsai@ens-lyon.fr)
Venue: ENS Lyon, site Monod, Amphi B (entrance from the 4th floor)
Time: 9:30 – 16:45
External participants who has no access to the building should contact Marton Karsai (marton.karsai@ens-lyon.fr) in advance.
The main page of the course can be found here.
The course aims to provide basic skills for analysis and statistical modeling of data, with special attention to machine learning both supervised and unsupervised. An important objective of the course is the operational knowledge of the techniques and algorithms treated, and for this aim the lectures will focus on both theoretical and practical aspects of machine learning, and for the practical part it is required to have a good knowledge of programming, preferentially in Python language. The expected outcomes include (1) understanding the theoretical foundations of machine learning and (2) ability to use some Python libraries for machine learning in the context of simple applications.
Topics will include:
– The major paradigms of learning from data, the learning problem, the feasibility of learning
– The architecture of machine learning algorithms: model structure, scoring, and model selection The theory of generalization, model complexity, the approximationgeneralization tradeoff, bias and variance, the learning curve
– Score functions and optimization techniques. Gradient descent and stochastic gradient descent.
– Validation and CrossValidation: validation set, leaveoneout cross validation, Kfold crossvalidation
– Linear Models: linear classification, linear regression, ordinary least squares, logistic regression, nonlinear transformations
– Nonlinear models for classification: support vector machines, tree models, nearestneighbor methods, Naive Bayes
– Overfitting and Regularization: model complexity and overfitting, commonly used regularizers, Lasso.
– Unsupervised learning: cluster analysis, the Kmeans algorithm, hierarchical clustering
– Feature selection and dimensionality reduction: Singular Value Decomposition, Matrix Factorisation
– Information retrieval, text representation and classification, term weighting
Overview of the theoretical aspects of machine learning will be followed by the application of algorithms in real problems such as: image classification, text mining, spam detection… The exercises will be implemented with the help of an interactive Python environment, with the use of standard tools for data analysis and visualization, such as the Scientific Python stack, ScikitLearn, Pandas and NLTK.
Evaluation: personal projects with oral presentation
Dates: 18 – 22 January 2016
Here are the rules for the Master Sciences, Mention Informatique, Parcours Informatique Fondamentale (sorry, only in French): ReglementMaster
And here are the rules specific to the M2 complex systems program: Rules-M2SC-2015-2016
The pre-course meeting for the M2 is planned Friday September 11 at 9am in Amphi B.
Courses start September 14. Here is the typical timetable for all weeks: EdT-M2-type
Note that the schedule will slightly change from one week to another. Timetables will be posted (and sent by email to students registered to the M2) whenever they are available.
Here is the form to fill for your choices of courses: modules-M2IF
Holidays
Research school, no courses
This page gathers useful informations for students following the first year of Master in Computer Science at École Normale Supérieure de Lyon. See here for a description of the M1 year. Here for the rules of the game.
Courses will start on september the 14th. See here for a schedule of that week. A (mandatory) meeting is organised on september 10th, at 15.30, in Amphi I (slides of the presentation, slides about english & other languages). The organisation of the year, and several other relevant topics, will be discussed. The venue will be announced later. There is no dress code. A meeting of the whole Département d’Informatique will take place on monday, sept. the 14th, at 16.00, in atrium Mérieux (not far from the fountain on the round square next to the Monod site of ENS).
Here is the typical week for the first semester, which will serve as a reference starting on sept. the 14th. Be aware that along the semester, local changes to the schedule may apply: refer to the emails you receive (typically, on thursday or friday for the following week). Here is the schedule for the first week, 14-18 sept. Here is the “fiche de choix de modules”, to be printed, signed with your tutor, and given to D. Hirschkoff.
Midterm exams (beware, this is list is not necessarily exhaustive, and is only there to help you — please refer to the actual course to learn about exams/homeworks/etc.): Information Theory as well as Parallel and Distributed Algorithms and Systems, nov. 9th, Compilers and Program analysis on nov.17th, Performance Evaluation and Networks on nov. 13th nov. 18th, Optimisation&Approximation nov. 20th.
The exams for the first semester will take place in the week jan.25-29. Here is the schedule.
M1 students should validate at least two research schools. See this webpage for a list of the research schools proposed in this academical year. Here is the fiche de choix d’écoles de recherche.
The second semester will last between february 1st and april 26th. The exams will take place between april 27th and may 4th.
The schedule for the first weeks is available here. The plan is to organise, after a couple of weeks, some overlap between courses, in order to have thursday afternoon free, and to gain more flexibility in the handling of the schedule.
Here is the fiche de choix de modules, to be given to D. Hirschkoff for february 16th, at noon.
Partiels (be aware that this list may be non-exhaustive, it contains the information I am aware of): computer algebra march 14th / computational complexity march 22nd / cryptography and security march 18th / april 6th: CGDI project due.
Exams : here is the schedule.
Here are the slides of the meeting about internship that took place on oct. the 6th, 2015 (nota: we are not sure yet about the date for the defense: it could be end of august or beginning of september).
Important dates:
The procedure for the preparation of the internship contract (convention de stage) is described here.
Deadlines and advices for the evaluation of the internship: see here.
For administrative matters, please contact Amel Zagrarni (secrétariat du Département d’Informatique). To discuss scientific/academical matters, as well as your training period, your future, etc., you can contact your tutor (the list of tutors is here), or Daniel Hirschkoff. Your délégués (representants of the students) are Victor Hublitz, Raphaël Monat and Étienne Moutot. Remember that you are supposed to read your email @ens-lyon.fr — in case of a technical problem, get in touch as soon as possible with the Direction des Systèmes Informatiques).
Image processing, digital and computational geometry
Course offered in the second semester of M1.
The objective of this course is to introduce fundamental notions of image processing, digital geometry and computational geometry. The first lectures will be dedicated to image processing (filtering, smoothing, morphological mathematics, ..) and shape representation. Then, we will focus on theoretical and algorithmic issues involved in the analysis of digital shapes. During this analysis of digital geometry processing tools, we will have to present and integrate some tools from various fields: discrete mathematics, combinatorics, arithmetics, computational geometry, ..
Computational Complexity
Course offered in the second semester of M1.
Computational complexity aims to classify computational problems depending on the resources they need. One
studies various modes of computation such as deterministic, randomized, nondeterministic or quantum and compares
resources such as time or space needed to solve algorithmic problems. The objective of this course is to give a
broad understanding of the notions used to classify computational problems. About half of the course is dedicated
to studying basic complexity classes defined using Turing machines. We introduce (or study deeper) notions that are
central in complexity theory: nondeterministic computation (e.g., the class NP), reductions between computational
problems (e.g., NP-completeness) and the technique of diagonalization (e.g., hierarchy theorems). We also study
randomized computation and computation using boolean circuits as well as their relation to basic complexity classes.
We conclude the course by studying the complexity of communication, i.e., trying to evaluate communication
bottlenecks to perform a given computational task between different parties.
Teaching in 2014: Omar Fawzi (lectures) and S ́ebastien Maulat (exercise classes)
One can summarize the most important objectives of the course as follows.
Since 2004, the Ampère excellence scholarships program of ENS de Lyon offers scholarships to International Masters students in sciences.
These scholarships, of 1000€ a month during one or two academic years, allow International students to study at ENS de Lyon, in any scientific Master’s program.
Applicants shall:
be of non-French citizenship
have started their university studies oustide France
be in last year of Bachelors’ degree, or 1st year of Master’s degree (or equivalent)
lodge their application before the deadline
All countries are eligible.
Detailed information may be found on the website of the International office of ENS de Lyon.
There also exist Master’s scholarships funded by Labex MILYON.
Dates: January 12-16, 2015.
Teachers: Michael Bender (Stony Brook University), Martín Farach-Colton (Rutgers and Tokutek), Samuel McCauley (Stony Brook University)
Monday-Thursday:
morning lecture: 9:30am-11:30am
afternoon lecture: 1:30pm-3:30pm.
recitation/homework practice: 4pm-5pm.
Friday:
morning lecture: 9:30am-11:30am
Local contact : Frédéric Vivien.
Registration is free, but the number of participants is limited. Registration includes neither housing nor meals (though for lunch the attendees will be granted access to the student cafeteria). Registration should be made before … (to be decided later) by clicking on this link, filling the form and sending the e-mail message. You will receive a confirmation as soon as possible.
Alternatively, you can copy/paste and fill the form below, then send it by e-mail to nicole.meftah@ens-lyon.fr with the subject line “Registration form — research school 1”
First Name:
Last Name:
Institution:
Position (MSc student, PhD student, researcher, etc.):
E-mail address:
wishes to attend the research school “ER01: Algorithmic Game Theory”, taking place at ENS Lyon, from Jan. 12 to Jan. 16, 2015.
Dates: January 19-23, 2015.
Teachers: Nicolas Schabanel (Université Paris-Diderot), Alain Barrat et Bruno Gonçalves (Université Aix-Marseille)
Local contact : Marton Karsai
Registration is free, but the number of participants is limited. Registration includes neither housing nor meals (though for lunch the attendees will be granted access to the student cafeteria). Registration should be made before … (to be decided later) by clicking on this link, filling the form and sending the e-mail message. You will receive a confirmation as soon as possible.
Alternatively, you can copy/paste and fill the form below, then send it by e-mail to nicole.meftah@ens-lyon.fr with the subject line “Registration form — research school 2”
First Name:
Last Name:
Institution:
Position (MSc student, PhD student, researcher, etc.):
E-mail address:
wishes to attend the research school “ER02: “, taking place at ENS Lyon, from Jan. 19 to Jan. 23, 2015.
Dates: January 26-30, 2015.
Teacher: Fernando Magno Pereira (Univ Mineas Gerais, Brazil)
Local contact : Laure Gonnord
Registration is free, but the number of participants is limited. Registration includes neither housing nor meals (though for lunch the attendees will be granted access to the student cafeteria). Registration should be made before … (to be decided later) by clicking on this link, filling the form and sending the e-mail message. You will receive a confirmation as soon as possible.
Alternatively, you can copy/paste and fill the form below, then send it by e-mail to nicole.meftah@ens-lyon.fr with the subject line “Registration form — research school 3”
First Name:
Last Name:
Institution:
Position (MSc student, PhD student, researcher, etc.):
E-mail address:
wishes to attend the research school “ER03: Static Analysis and Compilation”, taking place at ENS Lyon, from Jan. 26 to Jan. 30, 2015.
Date: January 19-23 2015
Teacher: Yves Berthot (INRIA Sophia-Antipolis)
Please contact Yves Bertot (Yves.Bertot@sophia.inria.fr) to know the registration instructions.
Date: January 26-30 2015
Dedicated webpage (to be updated)
Teachers: Jean-Daniel Boissonat, Clément Maria, Mariette Yvinec (INRIA Sophia-Antipolis)
Please contact Jean-Daniel Boissonat (Jean-Daniel.Boissonnat@inria.fr) to know the registration instructions.
Open assistant professor position (maître de conférences) in Computer Science
The LIP research laboratory and the Computer Science teaching department are recruiting a tenured assistant professor in Computer Science.
The job description is available here.
Ranking of the jury:
(the ranking will become final only after the decision of the administration council of ENS de Lyon)
1- Dagand Pierre-Evariste
2- Fawzi Omar
3- Huguenin Kevin
4- Tzameret Iddo
5- Cohen Cyril
Composition of the selection committee: Anne Benoit, Pascal Bouvry (président), Hubert Comon, Arnaud Durand, Guillaume Hanrot, Sylvain Joubaud, Florence Maraninchi, Antoine Miné, Lucas Nussbaum, Natacha Portier, Damien Stehlé, Laurent Théry.
Teaching contact: damien.stehle@ens-lyon.fr and stephan.thomasse@ens-lyon.fr
Research contact: guillaume.hanrot@ens-lyon.fr and gilles.villard@ens-lyon.fr
[ this translation of the french version of this page is based on work by Raphaël Monat: merci beaucoup! ]
Get quickly in touch with D. Hirschkoff (or your tutor) if you have difficulties during your intenship.
A general remark: you should not suppose that people reading your report/attending your presentation are specialists of the field you worked on during your internship. This should not prevent you from providing technical details, but the latter should be explained. Do not focus on the technical material only. Experience shows that M1 students tend to give too much emphasis on the technique, as if they were talking to their internship supervisor.
1 Report
Format:
20 pages at most. If needed, you include an online appendix, containing proofs, numerical results, an article you wrote with your supervisor, some code…
It is highly recommended that your supervisor proofreads your report (this means that you need to finish writing your draft early, to have time for proofreading and corrections).
Concerning the content:
You need to explain the question you have studied, and the context/reasons of your study.
– Where does the problem you studied come from?
– Why is this question interesting/relevant?
– What was the state-of-the-art at the beginning of your internship?
– Be aware that you need to present relevent related work.
– If you have 10 results, you will not have the space to present everything (or it will be compressed and really difficult to understand). You need to select what you will present.
– If you don’t have any result, you can write about what you tried and why it failed, and how the difficulties were handled, together with your supervisor, along the internship.
It is also interesting to know how your research went:
– What did not work?
– Your interactions with your supervisor
– Your collaborations with other members of the lab
– The initiatives you have taken
This shouldn’t be a signficant part of your report/presentation, but it will help in assessing the quality of your work.
If you have developped non-trivial programs or used some tools, mention them!
– Size of the code
– Tools/languages used
– Expected use of the tool(s)
– Implementation choices
2 Presentation
Rehearse your presentations at least twice! You will be interrupted if you exceed the given presentation time.
Your presentation will be a disaster if you’re interrupted during part 2 / 5 of your presentation. Conversely, if you finish your presentation in 8 minutes, it will also be a disaster.
Put pressure on yourself! Preparing a nice and crystal-clear presentation is a really difficult exercise, needing a lot of preparation.
– You should avoid mentionning too many technical details, you will loose your audience this way. But you need to strike a balance and still mention technical points.
– (Similar to the report) You need to present the question you worked on, and your contributions. Non specialists (i.e, other researchers from the LIP, or other students) should be able to follow your presentation.
Vous pouvez présenter en français ou en anglais, mais ne soyez pas prétentieux, n’optez pour l’anglais que si votre niveau le permet.
3 Technical points
Have a backup of your presentation on a USB stick, in case of technical problems between your computer and the projector.
– You need to have a machine to project your slides. You can share a computer for all presentations of a given session. It is highly recommended to test your projection skills before the presentation day.
– If you are using Beamer, `pdfpc’ is an interesting tool to project your slides
– Use git to version your documents/work. This should prevent ay loss of your work.