<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
	<id>http://www.lptms.universite-paris-saclay.fr//wiki-cours/api.php?action=feedcontributions&amp;feedformat=atom&amp;user=Alberto</id>
	<title>Wiki Cours - User contributions [en]</title>
	<link rel="self" type="application/atom+xml" href="http://www.lptms.universite-paris-saclay.fr//wiki-cours/api.php?action=feedcontributions&amp;feedformat=atom&amp;user=Alberto"/>
	<link rel="alternate" type="text/html" href="http://www.lptms.universite-paris-saclay.fr//wiki-cours/index.php/Special:Contributions/Alberto"/>
	<updated>2026-05-27T04:17:17Z</updated>
	<subtitle>User contributions</subtitle>
	<generator>MediaWiki 1.43.6</generator>
	<entry>
		<id>http://www.lptms.universite-paris-saclay.fr//wiki-cours/index.php?title=CoDaDri2&amp;diff=1839</id>
		<title>CoDaDri2</title>
		<link rel="alternate" type="text/html" href="http://www.lptms.universite-paris-saclay.fr//wiki-cours/index.php?title=CoDaDri2&amp;diff=1839"/>
		<updated>2022-10-01T08:51:35Z</updated>

		<summary type="html">&lt;p&gt;Alberto: /* Grading */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&lt;br /&gt;
This is the official page for the year 2022-2023 of the Computational and Data-Driven Physics (CoDaDri) course.&lt;br /&gt;
== Breaking news ==&lt;br /&gt;
&lt;br /&gt;
* MCQ of last year (2021/2022) can be found [https://drive.google.com/file/d/1wQQ8uhYvuYoxNvfr-O6QnyJwSEbYAoLF/view?usp=sharing here] (Google Colab/Jupyter Notebook). The solutions will be posted next week.&lt;br /&gt;
&lt;br /&gt;
== Course description ==&lt;br /&gt;
&lt;br /&gt;
Modern physics is characterized by an increasing complexity of systems under investigation, in&lt;br /&gt;
domains as diverse as condensed matter, astrophysics, biophysics, etc. Establishing adequate&lt;br /&gt;
models to describe these systems and being able to make quantitative predictions from those models&lt;br /&gt;
is extremely challenging. The goal of the course is to provide the tools and concepts necessary to tackle those systems.&lt;br /&gt;
&lt;br /&gt;
We will first cover many algorithms used in many-body problems and complex systems, with special emphasis on Monte Carlo methods, molecular dynamics, and optimization in complex landscapes. &lt;br /&gt;
&lt;br /&gt;
Second, we will provide statistical inference and machine learning tools to harness the growing availability of experimental data to design accurate models of the underlying, complex, strongly non-homogeneous and interacting systems. &lt;br /&gt;
&lt;br /&gt;
Each theoretical lecture will be followed by a tutorial illustrating the concepts with practical applications&lt;br /&gt;
borrowed from various domains of physics. We will focus on methods and algorithms and physics, not&lt;br /&gt;
on programming and heavy numerics!  You will have to hand in 3 homeworks.&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!-- *[https://drive.google.com/file/d/11w7KI5Pi59VWLX1mqiQ8ZyY8YQHRUeMz/view?usp=sharing Preliminary version of the book: Information, Inference, Networks: From statistical physics to big biological data] --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== The Team ==&lt;br /&gt;
&lt;br /&gt;
* [http://lptms.u-psud.fr/alberto_rosso/ Alberto Rosso] (Computational physics)&lt;br /&gt;
* [http://www.phys.ens.fr/~monasson/ Rémi Monasson] (Data-driven physics)&lt;br /&gt;
*  [http://www.lps.ens.fr/~cocco/ Simona Cocco]  &amp;amp; [https://www.cpht.polytechnique.fr/?q=en/node/110 Michel Ferrero] (Tutorials)&lt;br /&gt;
* [https://github.com/Schimmenti Vincenzo Maria Schimmenti] (Tutor)&lt;br /&gt;
&lt;br /&gt;
== Where and When ==&lt;br /&gt;
&lt;br /&gt;
* Lectures on Fridays: 14:00-16:00&lt;br /&gt;
* Tutorials on Fridays: 16:00-18:00&lt;br /&gt;
* JUSSIEU salle 24.34.201. &lt;br /&gt;
Don&#039;t be scared by the long number: it means that our new room is located in the corridor on the second floor, between tower 24 and tower 34 of Jussieu campus.&lt;br /&gt;
&lt;br /&gt;
== Slack ==&lt;br /&gt;
&lt;br /&gt;
If you have questions or want to discuss topics related to the lecture, to the exercises or to the homeworks, you can use the&lt;br /&gt;
[https://computational-prb2883.slack.com/ssb/redirect Computational and Data Driven Physics Slack]. In order to join the Slack&lt;br /&gt;
use the following [https://join.slack.com/t/computational-prb2883/shared_invite/zt-1fbx1i96a-CRDyBiOr~cn0LCdJZv~fEw invitation link].&lt;br /&gt;
&lt;br /&gt;
== Computer Requirements ==&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;No previous experience in programming is required.&#039;&#039;&#039; &amp;lt;br&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Programming Language: Python&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
For practical installation, we recommand either to use  Anaconda (See [[Memento Python]]) or use google colab. &amp;lt;br&amp;gt;&lt;br /&gt;
The [https://colab.research.google.com Colab platform] from Google is quite good way to use powerful computer without buying one: It requires no specific hardware or software, and even allows you to use GPU computing for free,  all by writting a jupyter notebook that you can then share.&lt;br /&gt;
&lt;br /&gt;
== Grading ==&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Computational Physics:&#039;&#039;&#039;&lt;br /&gt;
* Homework 1: 5 points &lt;br /&gt;
* Homework 2: 5 points&lt;br /&gt;
* Multiple Choice Questions: 10 points&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Data Driven Physics:&#039;&#039;&#039;&lt;br /&gt;
* Homework 3: 5 points&lt;br /&gt;
* Final exam in January: 15 points&lt;br /&gt;
&lt;br /&gt;
== Schedule Computational Physics ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 2, 2022 &#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1X9h3lKD0OZLTKtxb7DWPfynY42rRuE7j/view?usp=sharing Lecture 1]   Introduction to Monte Carlo&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1gf7oRQIpvSvMScyJa5hexB9CCZvdozPs#scrollTo=lDznlLouvlFx Tutorial 1] Markov matrices ([https://colab.research.google.com/drive/1x9iEHG_F522uFCvD_jGdvHaMETAHfO6-#scrollTo=eSu-nLZ6vm8X solutions])&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1g7HXFUBQUBF0fhy5h2jYbfIAVBTqvb7-#scrollTo=U9LFX8OFhHOG Homework 1] (deadline September 23)&lt;br /&gt;
&lt;br /&gt;
* Introductory notebooks: [https://colab.research.google.com/drive/1Ovrh1JjLzMMnxtasDgR1j84CHGU6hMxA python], [https://colab.research.google.com/drive/14PWu-C171pYhV8ven-Txc4wz5Tv1DCsK numpy] and [https://colab.research.google.com/drive/1fPjwrdxQPSyfXniyAHmyOcF_gK2fqjts matplotlib]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 9, 2022&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/15wrgivn6FSnuBUnMwjjhadmD-g1fkS7T/view?usp=sharing Lecture 2] Basic Sampling&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1C93cApFZNJKQXi9YiBdKkXNBus88iZ9z#scrollTo=FEQYvp4cfvS0 Averages and error bars]&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1tjqbjAi50C4qOqVRtTxEkTeTb10qpTms#scrollTo=uYpaubGkvogU Tutorial 2] Thumb rule ([https://colab.research.google.com/drive/1aWVtz4ZGcpIarWiRVAnxrp1t0GDOqZxu#scrollTo=f7ohlMuZvqTr solutions])&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 16, 2022&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1eY5cuNcJqYw7df0PBkxq03tEnqzTOC-5/view?usp=sharing Lecture 3 ]: Importance sampling&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1iaOGxdVgk--kWUFcMDHs0zvPhsOyhB_c Tutorial 3]: Faster than the clock algorithms ([https://colab.research.google.com/drive/1bHPnJpBd5ExqKF4G5BuV_FHPE4r0_AY2#scrollTo=fQnz_gOeq40e solutions])&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 23, 2022&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1DijhG_856OAuj42WqY1UM47APmMy3A8B/view?usp=sharing Lecture 4]: Ising model and phase transitions &lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1sRUEs768Z6PKdJ3k7MixYeFGlufgjFrG Tutorial 4]: Ising model and phase transitions ([https://colab.research.google.com/drive/1KAQRog_YlAjKZ_hL1FMYurWdPBLNUocI solutions])&lt;br /&gt;
&lt;br /&gt;
* Send your copy of Homework 1 to numphys.icfp  at   gmail.com  Thanks!&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1EPgj3la7vxDIqSQYNlOFz4rR0vHXAeae Homework 2] (deadline October 21)&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 30, 2022&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1PTya42ZS2kU87A-BxQFFIUDTs_k47men?usp=sharing Lecture 5]: Optimization &amp;amp; Dijkstra algorithm&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1ieT5BlfJsOehsa8r-LHGsFsn1dwYnawT Tutorial 5]: Simulated annealing ([https://colab.research.google.com/drive/1JNVl42KNASZiwTtqYo71z_vggjbGfKul solutions])&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 7, 2022&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Test: Multiple Choice Questions.  For each question you have 4 choices: 3 wrong and 1 correct: If you check the correct one you get a point. If you are wrong you loose 1/4 of a point.  No answer given: zero points.&lt;br /&gt;
&lt;br /&gt;
== Schedule Data-driven Physics ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 14, 2022&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 7: Introduction to Bayesian inference&lt;br /&gt;
&lt;br /&gt;
* Tutorial 7: Bayesian inference and single-particle tracking. [https://drive.google.com/file/d/1q9Quq5mvJ4Avv2qWgzTocU-DVIxJIVWi/view?usp=sharing Questions]. [https://drive.google.com/file/d/1xYb4wfNBysse6Q7frTw_V9TPdUQU5lUx/view?usp=sharing Data]. [https://drive.google.com/file/d/1Ba_kRo3_XMIaDLNYZlbZEw-wGXKS-29I/view?usp=sharing Starting Notebook]. [https://colab.research.google.com/drive/1VePL9X1JT6yl8LmROeZyMyf4Epcu3yOL#scrollTo=1XQNGa_fyEkJ Google colab version].&lt;br /&gt;
&amp;lt;!-- Solutions [https://drive.google.com/file/d/1Q9IjVUeL7AA8uWk8DX9Vy9vuUQ21RYh2/view?usp=sharing]. Notebook [https://drive.google.com/file/d/1ZJmpdaTQVUttEaaI1ch-reFfZGI93454/view?usp=sharing]&lt;br /&gt;
--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 21, 2022&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 8: Asymptotic inference and information. Extra material: Proof of Cramer-Rao bound [https://drive.google.com/file/d/10Ph_iP6AIQ3ps9v3FwRBO9j6-qV7oKV9/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
* Tutorial 8: [https://drive.google.com/file/d/12cG4HBvzs9Oe1mbfuEYyRDmTEamW71pR/view?usp=sharing Questions]. [https://drive.google.com/file/d/1AL8sRtnqYUI8NbubfglgLazknaVIUJEo/view?usp=sharing Data ] [https://drive.google.com/file/d/1DTLzXLZUEPzoU2SsDMcAe8GaoYX8E5gH/view?usp=sharing Starting Notebook]. &lt;br /&gt;
&amp;lt;!-- [https://drive.google.com/file/d/1QpMaM5ACmKUlFAyGvRnHvFVtQoEAF7-9/view?usp=sharing Bibliography] [https://drive.google.com/file/d/1p9v1PkJhwS8Ofg4RiC1nsFJAe8Mb_6WF/view?usp=sharing Solutions].  [https://drive.google.com/file/d/19erJJ4Gjw77n57VrnqaQPCxIh_-NScYT/view?usp=sharing Notebook]. --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
* Send your copy of Homework 2 to numphys.icfp  at   gmail.com  Thanks!&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 28, 2022&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 9: High-dimensional inference and Principal Component Analysis. Extra material: Handwritten notes on the derivation of Marcenko-Pastur spectral density [https://drive.google.com/file/d/10Yytv9itdWDDHTsM2lQHwQDMbcf-oVnd/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
* Tutorial 9: [https://drive.google.com/file/d/10y7m1mPf5R5zZN6661Eei92IUNhBL_Zu/view?usp=sharing  Replay of the neuronal activity during sleep after a task].[https://drive.google.com/file/d/11fO26XB6Ri3HDVBvtdBkYxcTRLk1iv5F/view?usp=sharing Data ]. [https://drive.google.com/file/d/1-MFN2ERs_eNs4w6XnLjfzsu2F9REluSt/view?usp=sharing Initial Notebook]. [https://drive.google.com/file/d/11ev4Zwn6DPYLwhMsLyp8S0aQFVu77Ou3/view?usp=sharing Biblio].&lt;br /&gt;
&amp;lt;!-- [https://drive.google.com/file/d/11E75QwrJgDKrutGj9t5NJTRkGtuRgoBI/view?usp=sharing Solutions]. [https://drive.google.com/file/d/1-39oZNNB-35zM4V2tLWtubQnZTdMLtIz/view?usp=sharing Notebook] --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, November 25, 2022&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 10: Priors, regularisation, sparsity&lt;br /&gt;
&lt;br /&gt;
* Tutorial 10: [https://drive.google.com/file/d/14kaGKRm7uciT7uLVMW_Vqzr8ha-V-Ra2/view?usp=sharing Bayesian Inference and Priors for the analysis of gravitational waves]. [https://drive.google.com/file/d/16UTmpwKm-7UMcIbca8IIGsO-aCmcwKuD/view?usp=sharing Starting notebook on artificial data]. [https://drive.google.com/file/d/1CyiDlXs6ez9-7gnyeBU0YRgV7Nt5ibkn/view?usp=sharing Biblio][https://colab.research.google.com/drive/1pFMOawozlYOIpy0jQWkTfoq-tFp3uvhw?usp=sharing#scrollTo=6picRNBipcYN Notebook on real data] &lt;br /&gt;
[https://drive.google.com/file/d/161ZLuq5s2RpHDJWELFSKXqlf-qwrVrxA/view?usp=sharing Notebook on Artificial data] &amp;lt;!--[https://drive.google.com/file/d/17qhYN8EFpcoCUHOM_juBvEGpu61GgJRx/view?usp=sharing Corrections ] --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, December 2, 2022&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 11: Probabilistic graphical models&lt;br /&gt;
&lt;br /&gt;
* Tutorial 11:[https://drive.google.com/file/d/1A5pcJICHkmHZYoa2uoAGSAWp-_ZOaIEf/view?usp=sharing Analysis of protein sequence data to infer protein structure] [https://drive.google.com/file/d/1COKr5pNoBRFwwnj7TWPQSU8mEWKvsLud/view?usp=sharing Starting notebook and data] &amp;lt;!--[https://drive.google.com/file/d/1CQw1PQ6RSS6nuGxhkwOqe7LJHpOPIaVp/view?usp=sharing Biblio][https://drive.google.com/file/d/1CslX27bTp5gyhXV4ciFE8s1zMnBgJ-1O/view?usp=sharing Solutions] [https://drive.google.com/file/d/19X59x3TdIsJaccTZE71gCbZxFbOzlhj4/view?usp=sharing Final notebook] --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, December 9, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 12: Hidden Markov Models. Extra material: Pedagogical introduction to Kalman filters [https://drive.google.com/file/d/0B4HvoS7Zt11LZUxVLTkyVXRQRUE/view?usp=sharing&amp;amp;resourcekey=0-CzsYaRIrPP2sN-UmwfiLHQ]&lt;br /&gt;
&lt;br /&gt;
* Tutorial 12: &lt;br /&gt;
[https://drive.google.com/file/d/1FLbWZRWJ1JILZV41RjwVKR7mOhNMhLV9/view?usp=sharing Hidden Markov Models Hidden  for identification of recombinations in SARS-CoV-2 viral genomes] [https://drive.google.com/file/d/1FCAg0ihMWoAk-_dtt5ORncjVjkVu-m4D/view?usp=sharing Starting Notebook and Data]&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--[https://drive.google.com/file/d/1HMREe6ge7_K-lOKC4f2FwL7vnEa1_8Yf/view?usp=sharing Bibliography] [https://drive.google.com/file/d/1FLDBJmNtXogHiO5VfScGiePTCxMFy1KZ/view?usp=sharing Final Notebook] [https://drive.google.com/file/d/1FBQaNJ2RhjwW_VSut2oC7mZYl5F8RWfS/view?usp=sharing Solutions] --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, December 16, 2022&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 13: Unsupervised learning and representations&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1p2c35gHMr4_Ptdmwsh3jGJz__9NNIgLw Tutorial 13]: How restricted Boltzmann machines learn &amp;lt;!-- ([https://colab.research.google.com/drive/1gnaK_vmTESTV3Ex_A1gqcee6Q58iKyld solutions]) --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!-- &#039;&#039;&#039;Final examination of the data-driven course (January 7, 2022)&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Example of exam: On-line Principal Component Analysis [https://drive.google.com/file/d/1BbRY4b3OCVYAtYH4m6ry19KcA2gkp3pH/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
* On-line version of the book [https://drive.google.com/file/d/161YHZA7i2YU-8emy6IPUFhsOXzFRxSRS/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
* Examination repository [https://drive.google.com/file/d/19DNkNBed0Ir5a9N048ZFV4_xF0KG3kcy/view?usp=sharing] --&amp;gt;&lt;/div&gt;</summary>
		<author><name>Alberto</name></author>
	</entry>
	<entry>
		<id>http://www.lptms.universite-paris-saclay.fr//wiki-cours/index.php?title=CoDaDri2&amp;diff=1828</id>
		<title>CoDaDri2</title>
		<link rel="alternate" type="text/html" href="http://www.lptms.universite-paris-saclay.fr//wiki-cours/index.php?title=CoDaDri2&amp;diff=1828"/>
		<updated>2022-09-23T12:00:03Z</updated>

		<summary type="html">&lt;p&gt;Alberto: /* Schedule Data-driven Physics */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&amp;lt;!-- This is a comment&lt;br /&gt;
=Breaking news:=&lt;br /&gt;
&lt;br /&gt;
* Update with course schedule&lt;br /&gt;
&lt;br /&gt;
= Computational and Data Driven Physics =&lt;br /&gt;
--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
This is the official page for the year 2022-2023 of the Computational and Data-Driven Physics (CoDaDri) course.&lt;br /&gt;
== Course description ==&lt;br /&gt;
&lt;br /&gt;
Modern physics is characterized by an increasing complexity of systems under investigation, in&lt;br /&gt;
domains as diverse as condensed matter, astrophysics, biophysics, etc. Establishing adequate&lt;br /&gt;
models to describe these systems and being able to make quantitative predictions from those models&lt;br /&gt;
is extremely challenging. The goal of the course is to provide the tools and concepts necessary to tackle those systems.&lt;br /&gt;
&lt;br /&gt;
We will first cover many algorithms used in many-body problems and complex systems, with special emphasis on Monte Carlo methods, molecular dynamics, and optimization in complex landscapes. &lt;br /&gt;
&lt;br /&gt;
Second, we will provide statistical inference and machine learning tools to harness the growing availability of experimental data to design accurate models of the underlying, complex, strongly non-homogeneous and interacting systems. &lt;br /&gt;
&lt;br /&gt;
Each theoretical lecture will be followed by a tutorial illustrating the concepts with practical applications&lt;br /&gt;
borrowed from various domains of physics. We will focus on methods and algorithms and physics, not&lt;br /&gt;
on programming and heavy numerics!  You will have to hand in 3 homeworks.&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!-- *[https://drive.google.com/file/d/11w7KI5Pi59VWLX1mqiQ8ZyY8YQHRUeMz/view?usp=sharing Preliminary version of the book: Information, Inference, Networks: From statistical physics to big biological data] --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== The Team ==&lt;br /&gt;
&lt;br /&gt;
* [http://lptms.u-psud.fr/alberto_rosso/ Alberto Rosso] (Computational physics)&lt;br /&gt;
* [http://www.phys.ens.fr/~monasson/ Rémi Monasson] (Data-driven physics)&lt;br /&gt;
*  [http://www.lps.ens.fr/~cocco/ Simona Cocco]  &amp;amp; [https://www.cpht.polytechnique.fr/?q=en/node/110 Michel Ferrero] (Tutorials)&lt;br /&gt;
* [https://github.com/Schimmenti Vincenzo Maria Schimmenti] (Tutor)&lt;br /&gt;
&lt;br /&gt;
== Where and When ==&lt;br /&gt;
&lt;br /&gt;
* Lectures on Fridays: 14:00-16:00&lt;br /&gt;
* Tutorials on Fridays: 16:00-18:00&lt;br /&gt;
* JUSSIEU salle 24.34.201. &lt;br /&gt;
Don&#039;t be scared by the long number: it means that our new room is located in the corridor on the second floor, between tower 24 and tower 34 of Jussieu campus.&lt;br /&gt;
&lt;br /&gt;
== Slack ==&lt;br /&gt;
&lt;br /&gt;
If you have questions or want to discuss topics related to the lecture, to the exercises or to the homeworks, you can use the&lt;br /&gt;
[https://computational-prb2883.slack.com/ssb/redirect Computational and Data Driven Physics Slack]. In order to join the Slack&lt;br /&gt;
use the following [https://join.slack.com/t/computational-prb2883/shared_invite/zt-1fbx1i96a-CRDyBiOr~cn0LCdJZv~fEw invitation link].&lt;br /&gt;
&lt;br /&gt;
== Computer Requirements ==&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;No previous experience in programming is required.&#039;&#039;&#039; &amp;lt;br&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Programming Language: Python&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
For practical installation, we recommand either to use  Anaconda (See [[Memento Python]]) or use google colab. &amp;lt;br&amp;gt;&lt;br /&gt;
The [https://colab.research.google.com Colab platform] from Google is quite good way to use powerful computer without buying one: It requires no specific hardware or software, and even allows you to use GPU computing for free,  all by writting a jupyter notebook that you can then share.&lt;br /&gt;
&lt;br /&gt;
== Grading ==&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Computational Physics:&#039;&#039;&#039;&lt;br /&gt;
* Homework 1: 5 points &lt;br /&gt;
* Homework 2: 5 points&lt;br /&gt;
* Multiple Choice Questions in November: 10 points&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Data Driven Physics:&#039;&#039;&#039;&lt;br /&gt;
* Homework 3: 5 points&lt;br /&gt;
* Final exam in January: 15 points&lt;br /&gt;
&lt;br /&gt;
== Schedule Computational Physics ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 2, 2022 &#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1X9h3lKD0OZLTKtxb7DWPfynY42rRuE7j/view?usp=sharing Lecture 1]   Introduction to Monte Carlo&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1gf7oRQIpvSvMScyJa5hexB9CCZvdozPs#scrollTo=lDznlLouvlFx Tutorial 1] Markov matrices ([https://colab.research.google.com/drive/1x9iEHG_F522uFCvD_jGdvHaMETAHfO6-#scrollTo=eSu-nLZ6vm8X solutions])&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1g7HXFUBQUBF0fhy5h2jYbfIAVBTqvb7-#scrollTo=U9LFX8OFhHOG Homework 1] (deadline September 23)&lt;br /&gt;
&lt;br /&gt;
* Introductory notebooks: [https://colab.research.google.com/drive/1Ovrh1JjLzMMnxtasDgR1j84CHGU6hMxA python], [https://colab.research.google.com/drive/14PWu-C171pYhV8ven-Txc4wz5Tv1DCsK numpy] and [https://colab.research.google.com/drive/1fPjwrdxQPSyfXniyAHmyOcF_gK2fqjts matplotlib]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 9, 2022&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/15wrgivn6FSnuBUnMwjjhadmD-g1fkS7T/view?usp=sharing Lecture 2] Basic Sampling&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1C93cApFZNJKQXi9YiBdKkXNBus88iZ9z#scrollTo=FEQYvp4cfvS0 Averages and error bars]&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1tjqbjAi50C4qOqVRtTxEkTeTb10qpTms#scrollTo=uYpaubGkvogU Tutorial 2] Thumb rule ([https://colab.research.google.com/drive/1aWVtz4ZGcpIarWiRVAnxrp1t0GDOqZxu#scrollTo=f7ohlMuZvqTr solutions])&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 16, 2022&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1eY5cuNcJqYw7df0PBkxq03tEnqzTOC-5/view?usp=sharing Lecture 3 ]: Importance sampling&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1iaOGxdVgk--kWUFcMDHs0zvPhsOyhB_c Tutorial 3]: Faster than the clock algorithms ([https://colab.research.google.com/drive/1bHPnJpBd5ExqKF4G5BuV_FHPE4r0_AY2#scrollTo=fQnz_gOeq40e solutions])&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 23, 2022&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1DijhG_856OAuj42WqY1UM47APmMy3A8B/view?usp=sharing Lecture 4]: Ising model and phase transitions &lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1sRUEs768Z6PKdJ3k7MixYeFGlufgjFrG Tutorial 4]: Ising model and phase transitions &amp;lt;!-- ([https://colab.research.google.com/drive/1KAQRog_YlAjKZ_hL1FMYurWdPBLNUocI solutions]) --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
* Send your copy of Homework 1 to numphys.icfp  at   gmail.com  Thanks!&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1EPgj3la7vxDIqSQYNlOFz4rR0vHXAeae Homework 2] (deadline October 14)&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 30, 2022&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1PTya42ZS2kU87A-BxQFFIUDTs_k47men?usp=sharing Lecture 5]: Optimization &amp;amp; Dijkstra algorithm&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1ieT5BlfJsOehsa8r-LHGsFsn1dwYnawT Tutorial 5]: Simulated annealing &amp;lt;!-- ([https://colab.research.google.com/drive/1JNVl42KNASZiwTtqYo71z_vggjbGfKul solutions]) --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 7, 2022&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Test: Multiple Choice Questions.  For each question you have 4 choices: 3 wrong and 1 correct: If you check the correct one you get a point. If you are wrong you loose 1/4 of a point.  No answer given: zero points.&lt;br /&gt;
&lt;br /&gt;
== Schedule Data-driven Physics ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 14, 2022&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 7: Introduction to Bayesian inference&lt;br /&gt;
&lt;br /&gt;
* Tutorial 7: Bayesian inference and single-particle tracking. [https://drive.google.com/file/d/1q9Quq5mvJ4Avv2qWgzTocU-DVIxJIVWi/view?usp=sharing Questions]. [https://drive.google.com/file/d/1xYb4wfNBysse6Q7frTw_V9TPdUQU5lUx/view?usp=sharing Data]. [https://drive.google.com/file/d/1Ba_kRo3_XMIaDLNYZlbZEw-wGXKS-29I/view?usp=sharing Starting Notebook]. [https://colab.research.google.com/drive/1VePL9X1JT6yl8LmROeZyMyf4Epcu3yOL#scrollTo=1XQNGa_fyEkJ Google colab version].&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!-- Solutions [https://drive.google.com/file/d/1Q9IjVUeL7AA8uWk8DX9Vy9vuUQ21RYh2/view?usp=sharing]. Notebook [https://drive.google.com/file/d/1ZJmpdaTQVUttEaaI1ch-reFfZGI93454/view?usp=sharing]&lt;br /&gt;
--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 21, 2022&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 8: Asymptotic inference and information. Extra material: Proof of Cramer-Rao bound [https://drive.google.com/file/d/10Ph_iP6AIQ3ps9v3FwRBO9j6-qV7oKV9/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
* Tutorial 8: [https://drive.google.com/file/d/12cG4HBvzs9Oe1mbfuEYyRDmTEamW71pR/view?usp=sharing Questions]. [https://drive.google.com/file/d/1AL8sRtnqYUI8NbubfglgLazknaVIUJEo/view?usp=sharing Data ] [https://drive.google.com/file/d/1DTLzXLZUEPzoU2SsDMcAe8GaoYX8E5gH/view?usp=sharing Starting Notebook]. &lt;br /&gt;
&lt;br /&gt;
&amp;lt;!-- [https://drive.google.com/file/d/1QpMaM5ACmKUlFAyGvRnHvFVtQoEAF7-9/view?usp=sharing Bibliography] [https://drive.google.com/file/d/1p9v1PkJhwS8Ofg4RiC1nsFJAe8Mb_6WF/view?usp=sharing Solutions].  [https://drive.google.com/file/d/19erJJ4Gjw77n57VrnqaQPCxIh_-NScYT/view?usp=sharing Notebook]. --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* Send your copy of Homework 2 to numphys.icfp  at   gmail.com  Thanks!&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 28, 2022&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 9: High-dimensional inference and Principal Component Analysis. Extra material: Handwritten notes on the derivation of Marcenko-Pastur spectral density [https://drive.google.com/file/d/10Yytv9itdWDDHTsM2lQHwQDMbcf-oVnd/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
* Tutorial 9: [https://drive.google.com/file/d/10y7m1mPf5R5zZN6661Eei92IUNhBL_Zu/view?usp=sharing  Replay of the neuronal activity during sleep after a task].[https://drive.google.com/file/d/11fO26XB6Ri3HDVBvtdBkYxcTRLk1iv5F/view?usp=sharing Data ]. [https://drive.google.com/file/d/1-MFN2ERs_eNs4w6XnLjfzsu2F9REluSt/view?usp=sharing Initial Notebook]. [https://drive.google.com/file/d/11ev4Zwn6DPYLwhMsLyp8S0aQFVu77Ou3/view?usp=sharing Biblio].&lt;br /&gt;
&amp;lt;!-- [https://drive.google.com/file/d/11E75QwrJgDKrutGj9t5NJTRkGtuRgoBI/view?usp=sharing Solutions]. [https://drive.google.com/file/d/1-39oZNNB-35zM4V2tLWtubQnZTdMLtIz/view?usp=sharing Notebook] --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, November 25, 2022&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 10: Priors, regularisation, sparsity&lt;br /&gt;
&lt;br /&gt;
* Tutorial 10: [https://drive.google.com/file/d/14kaGKRm7uciT7uLVMW_Vqzr8ha-V-Ra2/view?usp=sharing Bayesian Inference and Priors for the analysis of gravitational waves]. [https://drive.google.com/file/d/16UTmpwKm-7UMcIbca8IIGsO-aCmcwKuD/view?usp=sharing Starting notebook on artificial data]. [https://drive.google.com/file/d/1CyiDlXs6ez9-7gnyeBU0YRgV7Nt5ibkn/view?usp=sharing Biblio][https://colab.research.google.com/drive/1pFMOawozlYOIpy0jQWkTfoq-tFp3uvhw?usp=sharing#scrollTo=6picRNBipcYN Notebook on real data] &lt;br /&gt;
[https://drive.google.com/file/d/161ZLuq5s2RpHDJWELFSKXqlf-qwrVrxA/view?usp=sharing Notebook on Artificial data] &amp;lt;!--[https://drive.google.com/file/d/17qhYN8EFpcoCUHOM_juBvEGpu61GgJRx/view?usp=sharing Corrections ] --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, December 2, 2022&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 11: Probabilistic graphical models&lt;br /&gt;
&lt;br /&gt;
* Tutorial 11:[https://drive.google.com/file/d/1A5pcJICHkmHZYoa2uoAGSAWp-_ZOaIEf/view?usp=sharing Analysis of protein sequence data to infer protein structure] [https://drive.google.com/file/d/1COKr5pNoBRFwwnj7TWPQSU8mEWKvsLud/view?usp=sharing Starting notebook and data] &amp;lt;!--[https://drive.google.com/file/d/1CQw1PQ6RSS6nuGxhkwOqe7LJHpOPIaVp/view?usp=sharing Biblio][https://drive.google.com/file/d/1CslX27bTp5gyhXV4ciFE8s1zMnBgJ-1O/view?usp=sharing Solutions] [https://drive.google.com/file/d/19X59x3TdIsJaccTZE71gCbZxFbOzlhj4/view?usp=sharing Final notebook] --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, December 9, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 12: Hidden Markov Models. Extra material: Pedagogical introduction to Kalman filters [https://drive.google.com/file/d/0B4HvoS7Zt11LZUxVLTkyVXRQRUE/view?usp=sharing&amp;amp;resourcekey=0-CzsYaRIrPP2sN-UmwfiLHQ]&lt;br /&gt;
&lt;br /&gt;
* Tutorial 12: &lt;br /&gt;
[https://drive.google.com/file/d/1FLbWZRWJ1JILZV41RjwVKR7mOhNMhLV9/view?usp=sharing Hidden Markov Models Hidden  for identification of recombinations in SARS-CoV-2 viral genomes] [https://drive.google.com/file/d/1FCAg0ihMWoAk-_dtt5ORncjVjkVu-m4D/view?usp=sharing Starting Notebook and Data]&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--[https://drive.google.com/file/d/1HMREe6ge7_K-lOKC4f2FwL7vnEa1_8Yf/view?usp=sharing Bibliography] [https://drive.google.com/file/d/1FLDBJmNtXogHiO5VfScGiePTCxMFy1KZ/view?usp=sharing Final Notebook] [https://drive.google.com/file/d/1FBQaNJ2RhjwW_VSut2oC7mZYl5F8RWfS/view?usp=sharing Solutions] --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, December 16, 2022&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 13: Unsupervised learning and representations&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1p2c35gHMr4_Ptdmwsh3jGJz__9NNIgLw Tutorial 13]: How restricted Boltzmann machines learn ([https://colab.research.google.com/drive/1gnaK_vmTESTV3Ex_A1gqcee6Q58iKyld solutions])&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!-- &#039;&#039;&#039;Final examination of the data-driven course (January 7, 2022)&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Example of exam: On-line Principal Component Analysis [https://drive.google.com/file/d/1BbRY4b3OCVYAtYH4m6ry19KcA2gkp3pH/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
* On-line version of the book [https://drive.google.com/file/d/161YHZA7i2YU-8emy6IPUFhsOXzFRxSRS/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
* Examination repository [https://drive.google.com/file/d/19DNkNBed0Ir5a9N048ZFV4_xF0KG3kcy/view?usp=sharing] --&amp;gt;&lt;/div&gt;</summary>
		<author><name>Alberto</name></author>
	</entry>
	<entry>
		<id>http://www.lptms.universite-paris-saclay.fr//wiki-cours/index.php?title=CoDaDri2&amp;diff=1826</id>
		<title>CoDaDri2</title>
		<link rel="alternate" type="text/html" href="http://www.lptms.universite-paris-saclay.fr//wiki-cours/index.php?title=CoDaDri2&amp;diff=1826"/>
		<updated>2022-09-16T09:39:49Z</updated>

		<summary type="html">&lt;p&gt;Alberto: /* Where and When */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&amp;lt;!-- This is a comment&lt;br /&gt;
=Breaking news:=&lt;br /&gt;
&lt;br /&gt;
* Update with course schedule&lt;br /&gt;
&lt;br /&gt;
= Computational and Data Driven Physics =&lt;br /&gt;
--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
This is the official page for the year 2022-2023 of the Computational and Data-Driven Physics (CoDaDri) course.&lt;br /&gt;
== Course description ==&lt;br /&gt;
&lt;br /&gt;
Modern physics is characterized by an increasing complexity of systems under investigation, in&lt;br /&gt;
domains as diverse as condensed matter, astrophysics, biophysics, etc. Establishing adequate&lt;br /&gt;
models to describe these systems and being able to make quantitative predictions from those models&lt;br /&gt;
is extremely challenging. The goal of the course is to provide the tools and concepts necessary to tackle those systems.&lt;br /&gt;
&lt;br /&gt;
We will first cover many algorithms used in many-body problems and complex systems, with special emphasis on Monte Carlo methods, molecular dynamics, and optimization in complex landscapes. &lt;br /&gt;
&lt;br /&gt;
Second, we will provide statistical inference and machine learning tools to harness the growing availability of experimental data to design accurate models of the underlying, complex, strongly non-homogeneous and interacting systems. &lt;br /&gt;
&lt;br /&gt;
Each theoretical lecture will be followed by a tutorial illustrating the concepts with practical applications&lt;br /&gt;
borrowed from various domains of physics. We will focus on methods and algorithms and physics, not&lt;br /&gt;
on programming and heavy numerics!  You will have to hand in 3 homeworks.&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!-- *[https://drive.google.com/file/d/11w7KI5Pi59VWLX1mqiQ8ZyY8YQHRUeMz/view?usp=sharing Preliminary version of the book: Information, Inference, Networks: From statistical physics to big biological data] --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== The Team ==&lt;br /&gt;
&lt;br /&gt;
* [http://lptms.u-psud.fr/alberto_rosso/ Alberto Rosso] (Computational physics)&lt;br /&gt;
* [http://www.phys.ens.fr/~monasson/ Rémi Monasson] (Data-driven physics)&lt;br /&gt;
*  [http://www.lps.ens.fr/~cocco/ Simona Cocco]  &amp;amp; [https://www.cpht.polytechnique.fr/?q=en/node/110 Michel Ferrero] (Tutorials)&lt;br /&gt;
* [https://github.com/Schimmenti Vincenzo Maria Schimmenti] (Tutor)&lt;br /&gt;
&lt;br /&gt;
== Where and When ==&lt;br /&gt;
&lt;br /&gt;
* Lectures on Fridays: 14:00-16:00&lt;br /&gt;
* Tutorials on Fridays: 16:00-18:00&lt;br /&gt;
* JUSSIEU salle 24.34.201. &lt;br /&gt;
Don&#039;t be scared by the long number: it means that our new room is located in the corridor on the second floor, between tower 24 and tower 34 of Jussieu campus.&lt;br /&gt;
&lt;br /&gt;
== Slack ==&lt;br /&gt;
&lt;br /&gt;
If you have questions or want to discuss topics related to the lecture, to the exercises or to the homeworks, you can use the&lt;br /&gt;
[https://computational-prb2883.slack.com/ssb/redirect Computational and Data Driven Physics Slack]. In order to join the Slack&lt;br /&gt;
use the following [https://join.slack.com/t/computational-prb2883/shared_invite/zt-1fbx1i96a-CRDyBiOr~cn0LCdJZv~fEw invitation link].&lt;br /&gt;
&lt;br /&gt;
== Computer Requirements ==&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;No previous experience in programming is required.&#039;&#039;&#039; &amp;lt;br&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Programming Language: Python&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
For practical installation, we recommand either to use  Anaconda (See [[Memento Python]]) or use google colab. &amp;lt;br&amp;gt;&lt;br /&gt;
The [https://colab.research.google.com Colab platform] from Google is quite good way to use powerful computer without buying one: It requires no specific hardware or software, and even allows you to use GPU computing for free,  all by writting a jupyter notebook that you can then share.&lt;br /&gt;
&lt;br /&gt;
== Grading ==&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Computational Physics:&#039;&#039;&#039;&lt;br /&gt;
* Homework 1: 5 points &lt;br /&gt;
* Homework 2: 5 points&lt;br /&gt;
* Multiple Choice Questions in November: 10 points&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Data Driven Physics:&#039;&#039;&#039;&lt;br /&gt;
* Homework 3: 5 points&lt;br /&gt;
* Final exam in January: 15 points&lt;br /&gt;
&lt;br /&gt;
== Schedule Computational Physics ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 2, 2022 &#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1X9h3lKD0OZLTKtxb7DWPfynY42rRuE7j/view?usp=sharing Lecture 1]   Introduction to Monte Carlo&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1gf7oRQIpvSvMScyJa5hexB9CCZvdozPs#scrollTo=lDznlLouvlFx Tutorial 1] Markov matrices ([https://colab.research.google.com/drive/1x9iEHG_F522uFCvD_jGdvHaMETAHfO6-#scrollTo=eSu-nLZ6vm8X solutions])&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1g7HXFUBQUBF0fhy5h2jYbfIAVBTqvb7-#scrollTo=U9LFX8OFhHOG Homework 1] (deadline September 23)&lt;br /&gt;
&lt;br /&gt;
* Introductory notebooks: [https://colab.research.google.com/drive/1Ovrh1JjLzMMnxtasDgR1j84CHGU6hMxA python], [https://colab.research.google.com/drive/14PWu-C171pYhV8ven-Txc4wz5Tv1DCsK numpy] and [https://colab.research.google.com/drive/1fPjwrdxQPSyfXniyAHmyOcF_gK2fqjts matplotlib]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 9, 2022&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/15wrgivn6FSnuBUnMwjjhadmD-g1fkS7T/view?usp=sharing Lecture 2] Basic Sampling&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1C93cApFZNJKQXi9YiBdKkXNBus88iZ9z#scrollTo=FEQYvp4cfvS0 Averages and error bars]&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1tjqbjAi50C4qOqVRtTxEkTeTb10qpTms#scrollTo=uYpaubGkvogU Tutorial 2] Thumb rule ([https://colab.research.google.com/drive/1aWVtz4ZGcpIarWiRVAnxrp1t0GDOqZxu#scrollTo=f7ohlMuZvqTr solutions])&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 16, 2022&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1eY5cuNcJqYw7df0PBkxq03tEnqzTOC-5/view?usp=sharing Lecture 3 ]: Importance sampling&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1iaOGxdVgk--kWUFcMDHs0zvPhsOyhB_c Tutorial 3]: Faster than the clock algorithms &amp;lt;!--([https://colab.research.google.com/drive/1bHPnJpBd5ExqKF4G5BuV_FHPE4r0_AY2#scrollTo=fQnz_gOeq40e solutions])--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 23, 2022&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1DijhG_856OAuj42WqY1UM47APmMy3A8B/view?usp=sharing Lecture 4]: Ising model and phase transitions &lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1sRUEs768Z6PKdJ3k7MixYeFGlufgjFrG Tutorial 4]: Ising model and phase transitions &amp;lt;!-- ([https://colab.research.google.com/drive/1KAQRog_YlAjKZ_hL1FMYurWdPBLNUocI solutions]) --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
* Send your copy of Homework 1 to numphys.icfp  at   gmail.com  Thanks!&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1EPgj3la7vxDIqSQYNlOFz4rR0vHXAeae Homework 2] (deadline October 14)&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 30, 2022&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1PTya42ZS2kU87A-BxQFFIUDTs_k47men?usp=sharing Lecture 5]: Optimization &amp;amp; Dijkstra algorithm&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1ieT5BlfJsOehsa8r-LHGsFsn1dwYnawT Tutorial 5]: Simulated annealing &amp;lt;!-- ([https://colab.research.google.com/drive/1JNVl42KNASZiwTtqYo71z_vggjbGfKul solutions]) --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 7, 2022&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Test: Multiple Choice Questions.  For each question you have 4 choices: 3 wrong and 1 correct: If you check the correct one you get a point. If you are wrong you loose 1/4 of a point.  No answer given: zero points.&lt;br /&gt;
&lt;br /&gt;
== Schedule Data-driven Physics ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 14, 2022&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 7: Introduction to Bayesian inference&lt;br /&gt;
&lt;br /&gt;
* Tutorial 7: Bayesian inference and single-particle tracking. [https://drive.google.com/file/d/1q9Quq5mvJ4Avv2qWgzTocU-DVIxJIVWi/view?usp=sharing Questions]. [https://drive.google.com/file/d/1xYb4wfNBysse6Q7frTw_V9TPdUQU5lUx/view?usp=sharing Data]. [https://drive.google.com/file/d/1Ba_kRo3_XMIaDLNYZlbZEw-wGXKS-29I/view?usp=sharing Starting Notebook]. [https://colab.research.google.com/drive/1VePL9X1JT6yl8LmROeZyMyf4Epcu3yOL#scrollTo=1XQNGa_fyEkJ Google colab version].&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!-- Solutions [https://drive.google.com/file/d/1Q9IjVUeL7AA8uWk8DX9Vy9vuUQ21RYh2/view?usp=sharing]. Notebook [https://drive.google.com/file/d/1ZJmpdaTQVUttEaaI1ch-reFfZGI93454/view?usp=sharing]&lt;br /&gt;
--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
* Send your copy of Homework 2 to numphys.icfp  at   gmail.com  Thanks!&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 21, 2022&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 8: Asymptotic inference and information. Extra material: Proof of Cramer-Rao bound [https://drive.google.com/file/d/10Ph_iP6AIQ3ps9v3FwRBO9j6-qV7oKV9/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
* Tutorial 8: [https://drive.google.com/file/d/12cG4HBvzs9Oe1mbfuEYyRDmTEamW71pR/view?usp=sharing Questions]. [https://drive.google.com/file/d/1AL8sRtnqYUI8NbubfglgLazknaVIUJEo/view?usp=sharing Data ] [https://drive.google.com/file/d/1DTLzXLZUEPzoU2SsDMcAe8GaoYX8E5gH/view?usp=sharing Starting Notebook]. &lt;br /&gt;
&lt;br /&gt;
&amp;lt;!-- [https://drive.google.com/file/d/1QpMaM5ACmKUlFAyGvRnHvFVtQoEAF7-9/view?usp=sharing Bibliography] [https://drive.google.com/file/d/1p9v1PkJhwS8Ofg4RiC1nsFJAe8Mb_6WF/view?usp=sharing Solutions].  [https://drive.google.com/file/d/19erJJ4Gjw77n57VrnqaQPCxIh_-NScYT/view?usp=sharing Notebook]. --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 28, 2022&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 9: High-dimensional inference and Principal Component Analysis. Extra material: Handwritten notes on the derivation of Marcenko-Pastur spectral density [https://drive.google.com/file/d/10Yytv9itdWDDHTsM2lQHwQDMbcf-oVnd/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
* Tutorial 9: [https://drive.google.com/file/d/10y7m1mPf5R5zZN6661Eei92IUNhBL_Zu/view?usp=sharing  Replay of the neuronal activity during sleep after a task].[https://drive.google.com/file/d/11fO26XB6Ri3HDVBvtdBkYxcTRLk1iv5F/view?usp=sharing Data ]. [https://drive.google.com/file/d/1-MFN2ERs_eNs4w6XnLjfzsu2F9REluSt/view?usp=sharing Initial Notebook]. [https://drive.google.com/file/d/11ev4Zwn6DPYLwhMsLyp8S0aQFVu77Ou3/view?usp=sharing Biblio].&lt;br /&gt;
&amp;lt;!-- [https://drive.google.com/file/d/11E75QwrJgDKrutGj9t5NJTRkGtuRgoBI/view?usp=sharing Solutions]. [https://drive.google.com/file/d/1-39oZNNB-35zM4V2tLWtubQnZTdMLtIz/view?usp=sharing Notebook] --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, November 25, 2022&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 10: Priors, regularisation, sparsity&lt;br /&gt;
&lt;br /&gt;
* Tutorial 10: [https://drive.google.com/file/d/14kaGKRm7uciT7uLVMW_Vqzr8ha-V-Ra2/view?usp=sharing Bayesian Inference and Priors for the analysis of gravitational waves]. [https://drive.google.com/file/d/16UTmpwKm-7UMcIbca8IIGsO-aCmcwKuD/view?usp=sharing Starting notebook on artificial data]. [https://drive.google.com/file/d/1CyiDlXs6ez9-7gnyeBU0YRgV7Nt5ibkn/view?usp=sharing Biblio][https://colab.research.google.com/drive/1pFMOawozlYOIpy0jQWkTfoq-tFp3uvhw?usp=sharing#scrollTo=6picRNBipcYN Notebook on real data] &lt;br /&gt;
[https://drive.google.com/file/d/161ZLuq5s2RpHDJWELFSKXqlf-qwrVrxA/view?usp=sharing Notebook on Artificial data] &amp;lt;!--[https://drive.google.com/file/d/17qhYN8EFpcoCUHOM_juBvEGpu61GgJRx/view?usp=sharing Corrections ] --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, December 2, 2022&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 11: Probabilistic graphical models&lt;br /&gt;
&lt;br /&gt;
* Tutorial 11:[https://drive.google.com/file/d/1A5pcJICHkmHZYoa2uoAGSAWp-_ZOaIEf/view?usp=sharing Analysis of protein sequence data to infer protein structure] [https://drive.google.com/file/d/1COKr5pNoBRFwwnj7TWPQSU8mEWKvsLud/view?usp=sharing Starting notebook and data] &amp;lt;!--[https://drive.google.com/file/d/1CQw1PQ6RSS6nuGxhkwOqe7LJHpOPIaVp/view?usp=sharing Biblio][https://drive.google.com/file/d/1CslX27bTp5gyhXV4ciFE8s1zMnBgJ-1O/view?usp=sharing Solutions] [https://drive.google.com/file/d/19X59x3TdIsJaccTZE71gCbZxFbOzlhj4/view?usp=sharing Final notebook] --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, December 9, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 12: Hidden Markov Models. Extra material: Pedagogical introduction to Kalman filters [https://drive.google.com/file/d/0B4HvoS7Zt11LZUxVLTkyVXRQRUE/view?usp=sharing&amp;amp;resourcekey=0-CzsYaRIrPP2sN-UmwfiLHQ]&lt;br /&gt;
&lt;br /&gt;
* Tutorial 12: &lt;br /&gt;
[https://drive.google.com/file/d/1FLbWZRWJ1JILZV41RjwVKR7mOhNMhLV9/view?usp=sharing Hidden Markov Models Hidden  for identification of recombinations in SARS-CoV-2 viral genomes] [https://drive.google.com/file/d/1FCAg0ihMWoAk-_dtt5ORncjVjkVu-m4D/view?usp=sharing Starting Notebook and Data]&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--[https://drive.google.com/file/d/1HMREe6ge7_K-lOKC4f2FwL7vnEa1_8Yf/view?usp=sharing Bibliography] [https://drive.google.com/file/d/1FLDBJmNtXogHiO5VfScGiePTCxMFy1KZ/view?usp=sharing Final Notebook] [https://drive.google.com/file/d/1FBQaNJ2RhjwW_VSut2oC7mZYl5F8RWfS/view?usp=sharing Solutions] --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, December 16, 2022&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 13: Unsupervised learning and representations&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1p2c35gHMr4_Ptdmwsh3jGJz__9NNIgLw Tutorial 13]: How restricted Boltzmann machines learn ([https://colab.research.google.com/drive/1gnaK_vmTESTV3Ex_A1gqcee6Q58iKyld solutions])&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!-- &#039;&#039;&#039;Final examination of the data-driven course (January 7, 2022)&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Example of exam: On-line Principal Component Analysis [https://drive.google.com/file/d/1BbRY4b3OCVYAtYH4m6ry19KcA2gkp3pH/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
* On-line version of the book [https://drive.google.com/file/d/161YHZA7i2YU-8emy6IPUFhsOXzFRxSRS/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
* Examination repository [https://drive.google.com/file/d/19DNkNBed0Ir5a9N048ZFV4_xF0KG3kcy/view?usp=sharing] --&amp;gt;&lt;/div&gt;</summary>
		<author><name>Alberto</name></author>
	</entry>
	<entry>
		<id>http://www.lptms.universite-paris-saclay.fr//wiki-cours/index.php?title=CoDaDri2&amp;diff=1808</id>
		<title>CoDaDri2</title>
		<link rel="alternate" type="text/html" href="http://www.lptms.universite-paris-saclay.fr//wiki-cours/index.php?title=CoDaDri2&amp;diff=1808"/>
		<updated>2022-09-07T10:55:44Z</updated>

		<summary type="html">&lt;p&gt;Alberto: /* Where and When */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&amp;lt;!-- This is a comment&lt;br /&gt;
=Breaking news:=&lt;br /&gt;
&lt;br /&gt;
* Update with course schedule&lt;br /&gt;
&lt;br /&gt;
= Computational and Data Driven Physics =&lt;br /&gt;
--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
This is the official page for the year 2022-2023 of the Computational and Data-Driven Physics (CoDaDri) course.&lt;br /&gt;
== Course description ==&lt;br /&gt;
&lt;br /&gt;
Modern physics is characterized by an increasing complexity of systems under investigation, in&lt;br /&gt;
domains as diverse as condensed matter, astrophysics, biophysics, etc. Establishing adequate&lt;br /&gt;
models to describe these systems and being able to make quantitative predictions from those models&lt;br /&gt;
is extremely challenging. The goal of the course is to provide the tools and concepts necessary to tackle those systems.&lt;br /&gt;
&lt;br /&gt;
We will first cover many algorithms used in many-body problems and complex systems, with special emphasis on Monte Carlo methods, molecular dynamics, and optimization in complex landscapes. &lt;br /&gt;
&lt;br /&gt;
Second, we will provide statistical inference and machine learning tools to harness the growing availability of experimental data to design accurate models of the underlying, complex, strongly non-homogeneous and interacting systems. &lt;br /&gt;
&lt;br /&gt;
Each theoretical lecture will be followed by a tutorial illustrating the concepts with practical applications&lt;br /&gt;
borrowed from various domains of physics. We will focus on methods and algorithms and physics, not&lt;br /&gt;
on programming and heavy numerics!  You will have to hand in 3 homeworks.&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!-- *[https://drive.google.com/file/d/11w7KI5Pi59VWLX1mqiQ8ZyY8YQHRUeMz/view?usp=sharing Preliminary version of the book: Information, Inference, Networks: From statistical physics to big biological data] --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== The Team ==&lt;br /&gt;
&lt;br /&gt;
* [http://lptms.u-psud.fr/alberto_rosso/ Alberto Rosso] (Computational physics)&lt;br /&gt;
* [http://www.phys.ens.fr/~monasson/ Rémi Monasson] (Data-driven physics)&lt;br /&gt;
*  [http://www.lps.ens.fr/~cocco/ Simona Cocco]  &amp;amp; [https://www.cpht.polytechnique.fr/?q=en/node/110 Michel Ferrero] (Tutorials)&lt;br /&gt;
* [https://github.com/Schimmenti Vincenzo Maria Schimmenti] (Tutor)&lt;br /&gt;
&lt;br /&gt;
== Where and When ==&lt;br /&gt;
&lt;br /&gt;
* Lectures on Fridays: 14:00-16:00&lt;br /&gt;
* Tutorials on Fridays: 16:00-18:00&lt;br /&gt;
* JUSSIEU salle 54.55.205. &lt;br /&gt;
Don&#039;t be scared by the long number: it means that our new room is located in the corridor on the second floor, between tower 54 and tower 55 of Jussieu campus.&lt;br /&gt;
&lt;br /&gt;
== Slack ==&lt;br /&gt;
&lt;br /&gt;
If you have questions or want to discuss topics related to the lecture, to the exercises or to the homeworks, you can use the&lt;br /&gt;
[https://computational-prb2883.slack.com/ssb/redirect Computational and Data Driven Physics Slack]. In order to join the Slack&lt;br /&gt;
use the following [https://join.slack.com/t/computational-prb2883/shared_invite/zt-1fbx1i96a-CRDyBiOr~cn0LCdJZv~fEw invitation link].&lt;br /&gt;
&lt;br /&gt;
== Computer Requirements ==&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;No previous experience in programming is required.&#039;&#039;&#039; &amp;lt;br&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Programming Language: Python&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
For practical installation, we recommand either to use  Anaconda (See [[Memento Python]]) or use google colab. &amp;lt;br&amp;gt;&lt;br /&gt;
The [https://colab.research.google.com Colab platform] from Google is quite good way to use powerful computer without buying one: It requires no specific hardware or software, and even allows you to use GPU computing for free,  all by writting a jupyter notebook that you can then share.&lt;br /&gt;
&lt;br /&gt;
== Grading ==&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Computational Physics:&#039;&#039;&#039;&lt;br /&gt;
* Homework 1: 5 points &lt;br /&gt;
* Homework 2: 5 points&lt;br /&gt;
* Multiple Choice Questions in November: 10 points&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Data Driven Physics:&#039;&#039;&#039;&lt;br /&gt;
* Homework 3: 5 points&lt;br /&gt;
* Final exam in January: 15 points&lt;br /&gt;
&lt;br /&gt;
== Schedule Computational Physics ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 2, 2022 &#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1X9h3lKD0OZLTKtxb7DWPfynY42rRuE7j/view?usp=sharing Lecture 1]   Introduction to Monte Carlo&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1gf7oRQIpvSvMScyJa5hexB9CCZvdozPs#scrollTo=lDznlLouvlFx Tutorial 1] Markov matrices ([https://colab.research.google.com/drive/1x9iEHG_F522uFCvD_jGdvHaMETAHfO6-#scrollTo=eSu-nLZ6vm8X solutions])&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1g7HXFUBQUBF0fhy5h2jYbfIAVBTqvb7-#scrollTo=U9LFX8OFhHOG Homework 1] (deadline September 23)&lt;br /&gt;
&lt;br /&gt;
* Introductory notebooks: [https://colab.research.google.com/drive/1Ovrh1JjLzMMnxtasDgR1j84CHGU6hMxA python], [https://colab.research.google.com/drive/14PWu-C171pYhV8ven-Txc4wz5Tv1DCsK numpy] and [https://colab.research.google.com/drive/1fPjwrdxQPSyfXniyAHmyOcF_gK2fqjts matplotlib]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 9, 2022&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/15wrgivn6FSnuBUnMwjjhadmD-g1fkS7T/view?usp=sharing Lecture 2] Basic Sampling&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1tjqbjAi50C4qOqVRtTxEkTeTb10qpTms#scrollTo=uYpaubGkvogU Tutorial 2] Thumb rule &amp;lt;!-- ([https://colab.research.google.com/drive/1aWVtz4ZGcpIarWiRVAnxrp1t0GDOqZxu#scrollTo=f7ohlMuZvqTr solutions]) --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 16, 2022&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1eY5cuNcJqYw7df0PBkxq03tEnqzTOC-5/view?usp=sharing Lecture 3 ]: Importance sampling&lt;br /&gt;
&lt;br /&gt;
*  [https://drive.google.com/file/d/1ALR_QKLXdHby54xNux39NUOk4L-Ne1EW/view?usp=sharing  Tutorial 3]: Errors and Precision&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 23, 2022&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1DijhG_856OAuj42WqY1UM47APmMy3A8B/view?usp=sharing Lecture 4]: Ising model and phase transitions &lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1sRUEs768Z6PKdJ3k7MixYeFGlufgjFrG Tutorial 4]: Ising model and phase transitions &amp;lt;!-- ([https://colab.research.google.com/drive/1KAQRog_YlAjKZ_hL1FMYurWdPBLNUocI solutions]) --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
* Send your copy of Homework 1 to numphys.icfp  at   gmail.com  Thanks!&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1EPgj3la7vxDIqSQYNlOFz4rR0vHXAeae Homework 2] (deadline October 14)&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 30, 2022&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1PTya42ZS2kU87A-BxQFFIUDTs_k47men?usp=sharing Lecture 5]: Optimization &amp;amp; Dijkstra algorithm&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1ieT5BlfJsOehsa8r-LHGsFsn1dwYnawT Tutorial 5]: Simulated annealing &amp;lt;!-- ([https://colab.research.google.com/drive/1JNVl42KNASZiwTtqYo71z_vggjbGfKul solutions]) --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 7, 2022&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Test: Multiple Choice Questions.  For each question you have 4 choices: 3 wrong and 1 correct: If you check the correct one you get a point. If you are wrong you loose 1/4 of a point.  No answer given: zero points.&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1iaOGxdVgk--kWUFcMDHs0zvPhsOyhB_c Tutorial 6]: Faster than the clock algorithms &amp;lt;!--([https://colab.research.google.com/drive/1bHPnJpBd5ExqKF4G5BuV_FHPE4r0_AY2#scrollTo=fQnz_gOeq40e solutions])--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== Schedule Data-driven Physics ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 14, 2022&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 7: Introduction to Bayesian inference&lt;br /&gt;
&lt;br /&gt;
* Tutorial 7: Bayesian inference and single-particle tracking. [https://drive.google.com/file/d/1q9Quq5mvJ4Avv2qWgzTocU-DVIxJIVWi/view?usp=sharing Questions]. [https://drive.google.com/file/d/1xYb4wfNBysse6Q7frTw_V9TPdUQU5lUx/view?usp=sharing Data]. [https://drive.google.com/file/d/1Ba_kRo3_XMIaDLNYZlbZEw-wGXKS-29I/view?usp=sharing Starting Notebook]. [https://colab.research.google.com/drive/1VePL9X1JT6yl8LmROeZyMyf4Epcu3yOL#scrollTo=1XQNGa_fyEkJ Google colab version]. Solutions [https://drive.google.com/file/d/1Q9IjVUeL7AA8uWk8DX9Vy9vuUQ21RYh2/view?usp=sharing]. Notebook [https://drive.google.com/file/d/1ZJmpdaTQVUttEaaI1ch-reFfZGI93454/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
* Send your copy of Homework 2 to numphys.icfp  at   gmail.com  Thanks!&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 21, 2022&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 8: Asymptotic inference and information. Extra material: Proof of Cramer-Rao bound [https://drive.google.com/file/d/10Ph_iP6AIQ3ps9v3FwRBO9j6-qV7oKV9/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
* Tutorial 8: [https://drive.google.com/file/d/12cG4HBvzs9Oe1mbfuEYyRDmTEamW71pR/view?usp=sharing Questions]. [https://drive.google.com/file/d/1AL8sRtnqYUI8NbubfglgLazknaVIUJEo/view?usp=sharing Data ] [https://drive.google.com/file/d/1DTLzXLZUEPzoU2SsDMcAe8GaoYX8E5gH/view?usp=sharing Starting Notebook]. [https://drive.google.com/file/d/1QpMaM5ACmKUlFAyGvRnHvFVtQoEAF7-9/view?usp=sharing Bibliography] [https://drive.google.com/file/d/1p9v1PkJhwS8Ofg4RiC1nsFJAe8Mb_6WF/view?usp=sharing Solutions].  [https://drive.google.com/file/d/19erJJ4Gjw77n57VrnqaQPCxIh_-NScYT/view?usp=sharing Notebook].&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 28, 2022&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 9: High-dimensional inference and Principal Component Analysis. Extra material: Handwritten notes on the derivation of Marcenko-Pastur spectral density [https://drive.google.com/file/d/10Yytv9itdWDDHTsM2lQHwQDMbcf-oVnd/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
* Tutorial 9: [https://drive.google.com/file/d/10y7m1mPf5R5zZN6661Eei92IUNhBL_Zu/view?usp=sharing  Replay of the neuronal activity during sleep after a task].[https://drive.google.com/file/d/11fO26XB6Ri3HDVBvtdBkYxcTRLk1iv5F/view?usp=sharing Data ]. [https://drive.google.com/file/d/1-MFN2ERs_eNs4w6XnLjfzsu2F9REluSt/view?usp=sharing Initial Notebook]. [https://drive.google.com/file/d/11ev4Zwn6DPYLwhMsLyp8S0aQFVu77Ou3/view?usp=sharing Biblio]. &lt;br /&gt;
[https://drive.google.com/file/d/11E75QwrJgDKrutGj9t5NJTRkGtuRgoBI/view?usp=sharing Solutions]. [https://drive.google.com/file/d/1-39oZNNB-35zM4V2tLWtubQnZTdMLtIz/view?usp=sharing Notebook]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, November 25, 2022&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 10: Priors, regularisation, sparsity&lt;br /&gt;
&lt;br /&gt;
* Tutorial 10: [https://drive.google.com/file/d/14kaGKRm7uciT7uLVMW_Vqzr8ha-V-Ra2/view?usp=sharing Bayesian Inference and Priors for the analysis of gravitational waves]. [https://drive.google.com/file/d/16UTmpwKm-7UMcIbca8IIGsO-aCmcwKuD/view?usp=sharing Starting notebook on artificial data]. [https://drive.google.com/file/d/1CyiDlXs6ez9-7gnyeBU0YRgV7Nt5ibkn/view?usp=sharing Biblio][https://colab.research.google.com/drive/1pFMOawozlYOIpy0jQWkTfoq-tFp3uvhw?usp=sharing#scrollTo=6picRNBipcYN Notebook on real data] &lt;br /&gt;
[https://drive.google.com/file/d/161ZLuq5s2RpHDJWELFSKXqlf-qwrVrxA/view?usp=sharing Notebook on Artificial data] [https://drive.google.com/file/d/17qhYN8EFpcoCUHOM_juBvEGpu61GgJRx/view?usp=sharing Corrections ]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, December 2, 2022&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 11: Probabilistic graphical models&lt;br /&gt;
&lt;br /&gt;
* Tutorial 11:[https://drive.google.com/file/d/1A5pcJICHkmHZYoa2uoAGSAWp-_ZOaIEf/view?usp=sharing Analysis of protein sequence data to infer protein structure] [https://drive.google.com/file/d/1COKr5pNoBRFwwnj7TWPQSU8mEWKvsLud/view?usp=sharing Starting notebook and data] [https://drive.google.com/file/d/1CQw1PQ6RSS6nuGxhkwOqe7LJHpOPIaVp/view?usp=sharing Biblio][https://drive.google.com/file/d/1CslX27bTp5gyhXV4ciFE8s1zMnBgJ-1O/view?usp=sharing Solutions] [https://drive.google.com/file/d/19X59x3TdIsJaccTZE71gCbZxFbOzlhj4/view?usp=sharing Final notebook]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, December 9, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 12: Hidden Markov Models. Extra material: Pedagogical introduction to Kalman filters [https://drive.google.com/file/d/0B4HvoS7Zt11LZUxVLTkyVXRQRUE/view?usp=sharing&amp;amp;resourcekey=0-CzsYaRIrPP2sN-UmwfiLHQ]&lt;br /&gt;
&lt;br /&gt;
* Tutorial 12: &lt;br /&gt;
[https://drive.google.com/file/d/1FLbWZRWJ1JILZV41RjwVKR7mOhNMhLV9/view?usp=sharing Hidden Markov Models Hidden  for identification of recombinations in SARS-CoV-2 viral genomes] [https://drive.google.com/file/d/1FCAg0ihMWoAk-_dtt5ORncjVjkVu-m4D/view?usp=sharing Starting Notebook and Data][https://drive.google.com/file/d/1HMREe6ge7_K-lOKC4f2FwL7vnEa1_8Yf/view?usp=sharing Bibliography] [https://drive.google.com/file/d/1FLDBJmNtXogHiO5VfScGiePTCxMFy1KZ/view?usp=sharing Final Notebook] [https://drive.google.com/file/d/1FBQaNJ2RhjwW_VSut2oC7mZYl5F8RWfS/view?usp=sharing Solutions]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, December 16, 2022&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 13: Unsupervised learning and representations&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1p2c35gHMr4_Ptdmwsh3jGJz__9NNIgLw Tutorial 13]: How restricted Boltzmann machines learn ([https://colab.research.google.com/drive/1gnaK_vmTESTV3Ex_A1gqcee6Q58iKyld solutions])&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!-- &#039;&#039;&#039;Final examination of the data-driven course (January 7, 2022)&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Example of exam: On-line Principal Component Analysis [https://drive.google.com/file/d/1BbRY4b3OCVYAtYH4m6ry19KcA2gkp3pH/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
* On-line version of the book [https://drive.google.com/file/d/161YHZA7i2YU-8emy6IPUFhsOXzFRxSRS/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
* Examination repository [https://drive.google.com/file/d/19DNkNBed0Ir5a9N048ZFV4_xF0KG3kcy/view?usp=sharing] --&amp;gt;&lt;/div&gt;</summary>
		<author><name>Alberto</name></author>
	</entry>
	<entry>
		<id>http://www.lptms.universite-paris-saclay.fr//wiki-cours/index.php?title=CoDaDri2&amp;diff=1807</id>
		<title>CoDaDri2</title>
		<link rel="alternate" type="text/html" href="http://www.lptms.universite-paris-saclay.fr//wiki-cours/index.php?title=CoDaDri2&amp;diff=1807"/>
		<updated>2022-09-07T10:33:53Z</updated>

		<summary type="html">&lt;p&gt;Alberto: /* Where and When */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&amp;lt;!-- This is a comment&lt;br /&gt;
=Breaking news:=&lt;br /&gt;
&lt;br /&gt;
* Update with course schedule&lt;br /&gt;
&lt;br /&gt;
= Computational and Data Driven Physics =&lt;br /&gt;
--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
This is the official page for the year 2022-2023 of the Computational and Data-Driven Physics (CoDaDri) course.&lt;br /&gt;
== Course description ==&lt;br /&gt;
&lt;br /&gt;
Modern physics is characterized by an increasing complexity of systems under investigation, in&lt;br /&gt;
domains as diverse as condensed matter, astrophysics, biophysics, etc. Establishing adequate&lt;br /&gt;
models to describe these systems and being able to make quantitative predictions from those models&lt;br /&gt;
is extremely challenging. The goal of the course is to provide the tools and concepts necessary to tackle those systems.&lt;br /&gt;
&lt;br /&gt;
We will first cover many algorithms used in many-body problems and complex systems, with special emphasis on Monte Carlo methods, molecular dynamics, and optimization in complex landscapes. &lt;br /&gt;
&lt;br /&gt;
Second, we will provide statistical inference and machine learning tools to harness the growing availability of experimental data to design accurate models of the underlying, complex, strongly non-homogeneous and interacting systems. &lt;br /&gt;
&lt;br /&gt;
Each theoretical lecture will be followed by a tutorial illustrating the concepts with practical applications&lt;br /&gt;
borrowed from various domains of physics. We will focus on methods and algorithms and physics, not&lt;br /&gt;
on programming and heavy numerics!  You will have to hand in 3 homeworks.&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!-- *[https://drive.google.com/file/d/11w7KI5Pi59VWLX1mqiQ8ZyY8YQHRUeMz/view?usp=sharing Preliminary version of the book: Information, Inference, Networks: From statistical physics to big biological data] --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== The Team ==&lt;br /&gt;
&lt;br /&gt;
* [http://lptms.u-psud.fr/alberto_rosso/ Alberto Rosso] (Computational physics)&lt;br /&gt;
* [http://www.phys.ens.fr/~monasson/ Rémi Monasson] (Data-driven physics)&lt;br /&gt;
*  [http://www.lps.ens.fr/~cocco/ Simona Cocco]  &amp;amp; [https://www.cpht.polytechnique.fr/?q=en/node/110 Michel Ferrero] (Tutorials)&lt;br /&gt;
* [https://github.com/Schimmenti Vincenzo Maria Schimmenti] (Tutor)&lt;br /&gt;
&lt;br /&gt;
== Where and When ==&lt;br /&gt;
&lt;br /&gt;
* Lectures on Fridays: 14:00-16:00&lt;br /&gt;
* Tutorials on Fridays: 16:00-18:00&lt;br /&gt;
* JUSSIEU salle 54.55.205. &lt;br /&gt;
Don&#039;t be scared by the long number: it means that our new room is located in the corridor at the second floor, between tower 54 and tower 55 of Jussieu campus.&lt;br /&gt;
&lt;br /&gt;
== Slack ==&lt;br /&gt;
&lt;br /&gt;
If you have questions or want to discuss topics related to the lecture, to the exercises or to the homeworks, you can use the&lt;br /&gt;
[https://computational-prb2883.slack.com/ssb/redirect Computational and Data Driven Physics Slack]. In order to join the Slack&lt;br /&gt;
use the following [https://join.slack.com/t/computational-prb2883/shared_invite/zt-1fbx1i96a-CRDyBiOr~cn0LCdJZv~fEw invitation link].&lt;br /&gt;
&lt;br /&gt;
== Computer Requirements ==&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;No previous experience in programming is required.&#039;&#039;&#039; &amp;lt;br&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Programming Language: Python&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
For practical installation, we recommand either to use  Anaconda (See [[Memento Python]]) or use google colab. &amp;lt;br&amp;gt;&lt;br /&gt;
The [https://colab.research.google.com Colab platform] from Google is quite good way to use powerful computer without buying one: It requires no specific hardware or software, and even allows you to use GPU computing for free,  all by writting a jupyter notebook that you can then share.&lt;br /&gt;
&lt;br /&gt;
== Grading ==&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Computational Physics:&#039;&#039;&#039;&lt;br /&gt;
* Homework 1: 5 points &lt;br /&gt;
* Homework 2: 5 points&lt;br /&gt;
* Multiple Choice Questions in November: 10 points&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Data Driven Physics:&#039;&#039;&#039;&lt;br /&gt;
* Homework 3: 5 points&lt;br /&gt;
* Final exam in January: 15 points&lt;br /&gt;
&lt;br /&gt;
== Schedule Computational Physics ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 2, 2022 &#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1X9h3lKD0OZLTKtxb7DWPfynY42rRuE7j/view?usp=sharing Lecture 1]   Introduction to Monte Carlo&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1gf7oRQIpvSvMScyJa5hexB9CCZvdozPs#scrollTo=lDznlLouvlFx Tutorial 1] Markov matrices ([https://colab.research.google.com/drive/1x9iEHG_F522uFCvD_jGdvHaMETAHfO6-#scrollTo=eSu-nLZ6vm8X solutions])&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1g7HXFUBQUBF0fhy5h2jYbfIAVBTqvb7-#scrollTo=U9LFX8OFhHOG Homework 1] (deadline September 23)&lt;br /&gt;
&lt;br /&gt;
* Introductory notebooks: [https://colab.research.google.com/drive/1Ovrh1JjLzMMnxtasDgR1j84CHGU6hMxA python], [https://colab.research.google.com/drive/14PWu-C171pYhV8ven-Txc4wz5Tv1DCsK numpy] and [https://colab.research.google.com/drive/1fPjwrdxQPSyfXniyAHmyOcF_gK2fqjts matplotlib]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 9, 2022&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/15wrgivn6FSnuBUnMwjjhadmD-g1fkS7T/view?usp=sharing Lecture 2] Basic Sampling&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1tjqbjAi50C4qOqVRtTxEkTeTb10qpTms#scrollTo=uYpaubGkvogU Tutorial 2] Thumb rule &amp;lt;!-- ([https://colab.research.google.com/drive/1aWVtz4ZGcpIarWiRVAnxrp1t0GDOqZxu#scrollTo=f7ohlMuZvqTr solutions]) --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 16, 2022&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1eY5cuNcJqYw7df0PBkxq03tEnqzTOC-5/view?usp=sharing Lecture 3 ]: Importance sampling&lt;br /&gt;
&lt;br /&gt;
*  [https://drive.google.com/file/d/1ALR_QKLXdHby54xNux39NUOk4L-Ne1EW/view?usp=sharing  Tutorial 3]: Errors and Precision&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 23, 2022&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1DijhG_856OAuj42WqY1UM47APmMy3A8B/view?usp=sharing Lecture 4]: Ising model and phase transitions &lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1sRUEs768Z6PKdJ3k7MixYeFGlufgjFrG Tutorial 4]: Ising model and phase transitions &amp;lt;!-- ([https://colab.research.google.com/drive/1KAQRog_YlAjKZ_hL1FMYurWdPBLNUocI solutions]) --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
* Send your copy of Homework 1 to numphys.icfp  at   gmail.com  Thanks!&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1EPgj3la7vxDIqSQYNlOFz4rR0vHXAeae Homework 2] (deadline October 14)&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 30, 2022&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1PTya42ZS2kU87A-BxQFFIUDTs_k47men?usp=sharing Lecture 5]: Optimization &amp;amp; Dijkstra algorithm&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1ieT5BlfJsOehsa8r-LHGsFsn1dwYnawT Tutorial 5]: Simulated annealing &amp;lt;!-- ([https://colab.research.google.com/drive/1JNVl42KNASZiwTtqYo71z_vggjbGfKul solutions]) --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 7, 2022&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Test: Multiple Choice Questions.  For each question you have 4 choices: 3 wrong and 1 correct: If you check the correct one you get a point. If you are wrong you loose 1/4 of a point.  No answer given: zero points.&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1iaOGxdVgk--kWUFcMDHs0zvPhsOyhB_c Tutorial 6]: Faster than the clock algorithms &amp;lt;!--([https://colab.research.google.com/drive/1bHPnJpBd5ExqKF4G5BuV_FHPE4r0_AY2#scrollTo=fQnz_gOeq40e solutions])--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== Schedule Data-driven Physics ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 14, 2022&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 7: Introduction to Bayesian inference&lt;br /&gt;
&lt;br /&gt;
* Tutorial 7: Bayesian inference and single-particle tracking. [https://drive.google.com/file/d/1q9Quq5mvJ4Avv2qWgzTocU-DVIxJIVWi/view?usp=sharing Questions]. [https://drive.google.com/file/d/1xYb4wfNBysse6Q7frTw_V9TPdUQU5lUx/view?usp=sharing Data]. [https://drive.google.com/file/d/1Ba_kRo3_XMIaDLNYZlbZEw-wGXKS-29I/view?usp=sharing Starting Notebook]. [https://colab.research.google.com/drive/1VePL9X1JT6yl8LmROeZyMyf4Epcu3yOL#scrollTo=1XQNGa_fyEkJ Google colab version]. Solutions [https://drive.google.com/file/d/1Q9IjVUeL7AA8uWk8DX9Vy9vuUQ21RYh2/view?usp=sharing]. Notebook [https://drive.google.com/file/d/1ZJmpdaTQVUttEaaI1ch-reFfZGI93454/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
* Send your copy of Homework 2 to numphys.icfp  at   gmail.com  Thanks!&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 21, 2022&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 8: Asymptotic inference and information. Extra material: Proof of Cramer-Rao bound [https://drive.google.com/file/d/10Ph_iP6AIQ3ps9v3FwRBO9j6-qV7oKV9/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
* Tutorial 8: [https://drive.google.com/file/d/12cG4HBvzs9Oe1mbfuEYyRDmTEamW71pR/view?usp=sharing Questions]. [https://drive.google.com/file/d/1AL8sRtnqYUI8NbubfglgLazknaVIUJEo/view?usp=sharing Data ] [https://drive.google.com/file/d/1DTLzXLZUEPzoU2SsDMcAe8GaoYX8E5gH/view?usp=sharing Starting Notebook]. [https://drive.google.com/file/d/1QpMaM5ACmKUlFAyGvRnHvFVtQoEAF7-9/view?usp=sharing Bibliography] [https://drive.google.com/file/d/1p9v1PkJhwS8Ofg4RiC1nsFJAe8Mb_6WF/view?usp=sharing Solutions].  [https://drive.google.com/file/d/19erJJ4Gjw77n57VrnqaQPCxIh_-NScYT/view?usp=sharing Notebook].&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 28, 2022&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 9: High-dimensional inference and Principal Component Analysis. Extra material: Handwritten notes on the derivation of Marcenko-Pastur spectral density [https://drive.google.com/file/d/10Yytv9itdWDDHTsM2lQHwQDMbcf-oVnd/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
* Tutorial 9: [https://drive.google.com/file/d/10y7m1mPf5R5zZN6661Eei92IUNhBL_Zu/view?usp=sharing  Replay of the neuronal activity during sleep after a task].[https://drive.google.com/file/d/11fO26XB6Ri3HDVBvtdBkYxcTRLk1iv5F/view?usp=sharing Data ]. [https://drive.google.com/file/d/1-MFN2ERs_eNs4w6XnLjfzsu2F9REluSt/view?usp=sharing Initial Notebook]. [https://drive.google.com/file/d/11ev4Zwn6DPYLwhMsLyp8S0aQFVu77Ou3/view?usp=sharing Biblio]. &lt;br /&gt;
[https://drive.google.com/file/d/11E75QwrJgDKrutGj9t5NJTRkGtuRgoBI/view?usp=sharing Solutions]. [https://drive.google.com/file/d/1-39oZNNB-35zM4V2tLWtubQnZTdMLtIz/view?usp=sharing Notebook]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, November 25, 2022&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 10: Priors, regularisation, sparsity&lt;br /&gt;
&lt;br /&gt;
* Tutorial 10: [https://drive.google.com/file/d/14kaGKRm7uciT7uLVMW_Vqzr8ha-V-Ra2/view?usp=sharing Bayesian Inference and Priors for the analysis of gravitational waves]. [https://drive.google.com/file/d/16UTmpwKm-7UMcIbca8IIGsO-aCmcwKuD/view?usp=sharing Starting notebook on artificial data]. [https://drive.google.com/file/d/1CyiDlXs6ez9-7gnyeBU0YRgV7Nt5ibkn/view?usp=sharing Biblio][https://colab.research.google.com/drive/1pFMOawozlYOIpy0jQWkTfoq-tFp3uvhw?usp=sharing#scrollTo=6picRNBipcYN Notebook on real data] &lt;br /&gt;
[https://drive.google.com/file/d/161ZLuq5s2RpHDJWELFSKXqlf-qwrVrxA/view?usp=sharing Notebook on Artificial data] [https://drive.google.com/file/d/17qhYN8EFpcoCUHOM_juBvEGpu61GgJRx/view?usp=sharing Corrections ]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, December 2, 2022&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 11: Probabilistic graphical models&lt;br /&gt;
&lt;br /&gt;
* Tutorial 11:[https://drive.google.com/file/d/1A5pcJICHkmHZYoa2uoAGSAWp-_ZOaIEf/view?usp=sharing Analysis of protein sequence data to infer protein structure] [https://drive.google.com/file/d/1COKr5pNoBRFwwnj7TWPQSU8mEWKvsLud/view?usp=sharing Starting notebook and data] [https://drive.google.com/file/d/1CQw1PQ6RSS6nuGxhkwOqe7LJHpOPIaVp/view?usp=sharing Biblio][https://drive.google.com/file/d/1CslX27bTp5gyhXV4ciFE8s1zMnBgJ-1O/view?usp=sharing Solutions] [https://drive.google.com/file/d/19X59x3TdIsJaccTZE71gCbZxFbOzlhj4/view?usp=sharing Final notebook]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, December 9, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 12: Hidden Markov Models. Extra material: Pedagogical introduction to Kalman filters [https://drive.google.com/file/d/0B4HvoS7Zt11LZUxVLTkyVXRQRUE/view?usp=sharing&amp;amp;resourcekey=0-CzsYaRIrPP2sN-UmwfiLHQ]&lt;br /&gt;
&lt;br /&gt;
* Tutorial 12: &lt;br /&gt;
[https://drive.google.com/file/d/1FLbWZRWJ1JILZV41RjwVKR7mOhNMhLV9/view?usp=sharing Hidden Markov Models Hidden  for identification of recombinations in SARS-CoV-2 viral genomes] [https://drive.google.com/file/d/1FCAg0ihMWoAk-_dtt5ORncjVjkVu-m4D/view?usp=sharing Starting Notebook and Data][https://drive.google.com/file/d/1HMREe6ge7_K-lOKC4f2FwL7vnEa1_8Yf/view?usp=sharing Bibliography] [https://drive.google.com/file/d/1FLDBJmNtXogHiO5VfScGiePTCxMFy1KZ/view?usp=sharing Final Notebook] [https://drive.google.com/file/d/1FBQaNJ2RhjwW_VSut2oC7mZYl5F8RWfS/view?usp=sharing Solutions]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, December 16, 2022&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 13: Unsupervised learning and representations&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1p2c35gHMr4_Ptdmwsh3jGJz__9NNIgLw Tutorial 13]: How restricted Boltzmann machines learn ([https://colab.research.google.com/drive/1gnaK_vmTESTV3Ex_A1gqcee6Q58iKyld solutions])&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!-- &#039;&#039;&#039;Final examination of the data-driven course (January 7, 2022)&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Example of exam: On-line Principal Component Analysis [https://drive.google.com/file/d/1BbRY4b3OCVYAtYH4m6ry19KcA2gkp3pH/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
* On-line version of the book [https://drive.google.com/file/d/161YHZA7i2YU-8emy6IPUFhsOXzFRxSRS/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
* Examination repository [https://drive.google.com/file/d/19DNkNBed0Ir5a9N048ZFV4_xF0KG3kcy/view?usp=sharing] --&amp;gt;&lt;/div&gt;</summary>
		<author><name>Alberto</name></author>
	</entry>
	<entry>
		<id>http://www.lptms.universite-paris-saclay.fr//wiki-cours/index.php?title=CoDaDri2&amp;diff=1803</id>
		<title>CoDaDri2</title>
		<link rel="alternate" type="text/html" href="http://www.lptms.universite-paris-saclay.fr//wiki-cours/index.php?title=CoDaDri2&amp;diff=1803"/>
		<updated>2022-09-02T10:33:51Z</updated>

		<summary type="html">&lt;p&gt;Alberto: /* Schedule Computational Physics */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&amp;lt;!-- This is a comment&lt;br /&gt;
=Breaking news:=&lt;br /&gt;
&lt;br /&gt;
* Update with course schedule&lt;br /&gt;
&lt;br /&gt;
= Computational and Data Driven Physics =&lt;br /&gt;
--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
This is the official page for the year 2022-2023 of the Computational and Data-Driven Physics (CoDaDri) course.&lt;br /&gt;
== Course description ==&lt;br /&gt;
&lt;br /&gt;
Modern physics is characterized by an increasing complexity of systems under investigation, in&lt;br /&gt;
domains as diverse as condensed matter, astrophysics, biophysics, etc. Establishing adequate&lt;br /&gt;
models to describe these systems and being able to make quantitative predictions from those models&lt;br /&gt;
is extremely challenging. The goal of the course is to provide the tools and concepts necessary to tackle those systems.&lt;br /&gt;
&lt;br /&gt;
We will first cover many algorithms used in many-body problems and complex systems, with special emphasis on Monte Carlo methods, molecular dynamics, and optimization in complex landscapes. &lt;br /&gt;
&lt;br /&gt;
Second, we will provide statistical inference and machine learning tools to harness the growing availability of experimental data to design accurate models of the underlying, complex, strongly non-homogeneous and interacting systems. &lt;br /&gt;
&lt;br /&gt;
Each theoretical lecture will be followed by a tutorial illustrating the concepts with practical applications&lt;br /&gt;
borrowed from various domains of physics. We will focus on methods and algorithms and physics, not&lt;br /&gt;
on programming and heavy numerics!  You will have to hand in 3 homeworks.&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!-- *[https://drive.google.com/file/d/11w7KI5Pi59VWLX1mqiQ8ZyY8YQHRUeMz/view?usp=sharing Preliminary version of the book: Information, Inference, Networks: From statistical physics to big biological data] --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== The Team ==&lt;br /&gt;
&lt;br /&gt;
* [http://lptms.u-psud.fr/alberto_rosso/ Alberto Rosso] (Computational physics)&lt;br /&gt;
* [http://www.phys.ens.fr/~monasson/ Rémi Monasson] (Data-driven physics)&lt;br /&gt;
*  [http://www.lps.ens.fr/~cocco/ Simona Cocco]  &amp;amp; [https://www.cpht.polytechnique.fr/?q=en/node/110 Michel Ferrero] (Tutorials)&lt;br /&gt;
* [https://github.com/Schimmenti Vincenzo Maria Schimmenti] (Tutor)&lt;br /&gt;
&lt;br /&gt;
== Where and When ==&lt;br /&gt;
&lt;br /&gt;
* Lectures on Fridays: 14:00-16:00&lt;br /&gt;
* Tutorials on Fridays: 16:00-18:00&lt;br /&gt;
* CONDORCET salle 304 A&lt;br /&gt;
&lt;br /&gt;
== Slack ==&lt;br /&gt;
&lt;br /&gt;
If you have questions or want to discuss topics related to the lecture, to the exercises or to the homeworks, you can use the&lt;br /&gt;
[https://computational-prb2883.slack.com/ssb/redirect Computational and Data Driven Physics Slack]. In order to join the Slack&lt;br /&gt;
use the following [https://join.slack.com/t/computational-prb2883/shared_invite/zt-1fbx1i96a-CRDyBiOr~cn0LCdJZv~fEw invitation link].&lt;br /&gt;
&lt;br /&gt;
== Computer Requirements ==&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;No previous experience in programming is required.&#039;&#039;&#039; &amp;lt;br&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Programming Language: Python&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
For practical installation, we recommand either to use  Anaconda (See [[Memento Python]]) or use google colab. &amp;lt;br&amp;gt;&lt;br /&gt;
The [https://colab.research.google.com Colab platform] from Google is quite good way to use powerful computer without buying one: It requires no specific hardware or software, and even allows you to use GPU computing for free,  all by writting a jupyter notebook that you can then share.&lt;br /&gt;
&lt;br /&gt;
== Grading ==&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Computational Physics:&#039;&#039;&#039;&lt;br /&gt;
* Homework 1: 5 points &lt;br /&gt;
* Homework 2: 5 points&lt;br /&gt;
* Multiple Choice Questions in November: 10 points&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Data Driven Physics:&#039;&#039;&#039;&lt;br /&gt;
* Homework 3: 5 points&lt;br /&gt;
* Final exam in January: 15 points&lt;br /&gt;
&lt;br /&gt;
== Schedule Computational Physics ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 2, 2022 &#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1X9h3lKD0OZLTKtxb7DWPfynY42rRuE7j/view?usp=sharing Lecture 1]   Introduction to Monte Carlo&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1gf7oRQIpvSvMScyJa5hexB9CCZvdozPs#scrollTo=lDznlLouvlFx Tutorial 1] Markov matrices &amp;lt;!-- ([https://colab.research.google.com/drive/1x9iEHG_F522uFCvD_jGdvHaMETAHfO6-#scrollTo=eSu-nLZ6vm8X solutions]) --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1g7HXFUBQUBF0fhy5h2jYbfIAVBTqvb7-#scrollTo=U9LFX8OFhHOG Homework 1] (deadline September 23)&lt;br /&gt;
&lt;br /&gt;
* Introductory notebooks: [https://colab.research.google.com/drive/1Ovrh1JjLzMMnxtasDgR1j84CHGU6hMxA python], [https://colab.research.google.com/drive/14PWu-C171pYhV8ven-Txc4wz5Tv1DCsK numpy] and [https://colab.research.google.com/drive/1fPjwrdxQPSyfXniyAHmyOcF_gK2fqjts matplotlib]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 9, 2022&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/15wrgivn6FSnuBUnMwjjhadmD-g1fkS7T/view?usp=sharing Lecture 2] Basic Sampling&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1tjqbjAi50C4qOqVRtTxEkTeTb10qpTms#scrollTo=uYpaubGkvogU Tutorial 2] Thumb rule &amp;lt;!-- ([https://colab.research.google.com/drive/1aWVtz4ZGcpIarWiRVAnxrp1t0GDOqZxu#scrollTo=f7ohlMuZvqTr solutions]) --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 16, 2022&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1eY5cuNcJqYw7df0PBkxq03tEnqzTOC-5/view?usp=sharing Lecture 3 ]: Importance sampling&lt;br /&gt;
&lt;br /&gt;
*  [https://drive.google.com/file/d/1ALR_QKLXdHby54xNux39NUOk4L-Ne1EW/view?usp=sharing  Tutorial 3]: Errors and Precision&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 23, 2022&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1DijhG_856OAuj42WqY1UM47APmMy3A8B/view?usp=sharing Lecture 4]: Ising model and phase transitions &lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1sRUEs768Z6PKdJ3k7MixYeFGlufgjFrG Tutorial 4]: Ising model and phase transitions &amp;lt;!-- ([https://colab.research.google.com/drive/1KAQRog_YlAjKZ_hL1FMYurWdPBLNUocI solutions]) --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
* Send your copy of Homework 1 to numphys.icfp  at   gmail.com  Thanks!&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1EPgj3la7vxDIqSQYNlOFz4rR0vHXAeae Homework 2] (deadline October 14)&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 30, 2022&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1PTya42ZS2kU87A-BxQFFIUDTs_k47men?usp=sharing Lecture 5]: Optimization &amp;amp; Dijkstra algorithm&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1ieT5BlfJsOehsa8r-LHGsFsn1dwYnawT Tutorial 5]: Simulated annealing &amp;lt;!-- ([https://colab.research.google.com/drive/1JNVl42KNASZiwTtqYo71z_vggjbGfKul solutions]) --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 7, 2022&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Test: Multiple Choice Questions.  For each question you have 4 choices: 3 wrong and 1 correct: If you check the correct one you get a point. If you are wrong you loose 1/4 of a point.  No answer given: zero points.&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1iaOGxdVgk--kWUFcMDHs0zvPhsOyhB_c Tutorial 6]: Faster than the clock algorithms &amp;lt;!--([https://colab.research.google.com/drive/1bHPnJpBd5ExqKF4G5BuV_FHPE4r0_AY2#scrollTo=fQnz_gOeq40e solutions])--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== Schedule Data-driven Physics ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 14, 2022&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 7: Introduction to Bayesian inference&lt;br /&gt;
&lt;br /&gt;
* Tutorial 7: Bayesian inference and single-particle tracking. [https://drive.google.com/file/d/1q9Quq5mvJ4Avv2qWgzTocU-DVIxJIVWi/view?usp=sharing Questions]. [https://drive.google.com/file/d/1xYb4wfNBysse6Q7frTw_V9TPdUQU5lUx/view?usp=sharing Data]. [https://drive.google.com/file/d/1Ba_kRo3_XMIaDLNYZlbZEw-wGXKS-29I/view?usp=sharing Starting Notebook]. [https://colab.research.google.com/drive/1VePL9X1JT6yl8LmROeZyMyf4Epcu3yOL#scrollTo=1XQNGa_fyEkJ Google colab version]. Solutions [https://drive.google.com/file/d/1Q9IjVUeL7AA8uWk8DX9Vy9vuUQ21RYh2/view?usp=sharing]. Notebook [https://drive.google.com/file/d/1ZJmpdaTQVUttEaaI1ch-reFfZGI93454/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
* Send your copy of Homework 2 to numphys.icfp  at   gmail.com  Thanks!&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 21, 2022&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 8: Asymptotic inference and information. Extra material: Proof of Cramer-Rao bound [https://drive.google.com/file/d/10Ph_iP6AIQ3ps9v3FwRBO9j6-qV7oKV9/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
* Tutorial 8: [https://drive.google.com/file/d/12cG4HBvzs9Oe1mbfuEYyRDmTEamW71pR/view?usp=sharing Questions]. [https://drive.google.com/file/d/1AL8sRtnqYUI8NbubfglgLazknaVIUJEo/view?usp=sharing Data ] [https://drive.google.com/file/d/1DTLzXLZUEPzoU2SsDMcAe8GaoYX8E5gH/view?usp=sharing Starting Notebook]. [https://drive.google.com/file/d/1QpMaM5ACmKUlFAyGvRnHvFVtQoEAF7-9/view?usp=sharing Bibliography] [https://drive.google.com/file/d/1p9v1PkJhwS8Ofg4RiC1nsFJAe8Mb_6WF/view?usp=sharing Solutions].  [https://drive.google.com/file/d/19erJJ4Gjw77n57VrnqaQPCxIh_-NScYT/view?usp=sharing Notebook].&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 28, 2022&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 9: High-dimensional inference and Principal Component Analysis. Extra material: Handwritten notes on the derivation of Marcenko-Pastur spectral density [https://drive.google.com/file/d/10Yytv9itdWDDHTsM2lQHwQDMbcf-oVnd/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
* Tutorial 9: [https://drive.google.com/file/d/10y7m1mPf5R5zZN6661Eei92IUNhBL_Zu/view?usp=sharing  Replay of the neuronal activity during sleep after a task].[https://drive.google.com/file/d/11fO26XB6Ri3HDVBvtdBkYxcTRLk1iv5F/view?usp=sharing Data ]. [https://drive.google.com/file/d/1-MFN2ERs_eNs4w6XnLjfzsu2F9REluSt/view?usp=sharing Initial Notebook]. [https://drive.google.com/file/d/11ev4Zwn6DPYLwhMsLyp8S0aQFVu77Ou3/view?usp=sharing Biblio]. &lt;br /&gt;
[https://drive.google.com/file/d/11E75QwrJgDKrutGj9t5NJTRkGtuRgoBI/view?usp=sharing Solutions]. [https://drive.google.com/file/d/1-39oZNNB-35zM4V2tLWtubQnZTdMLtIz/view?usp=sharing Notebook]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, November 25, 2022&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 10: Priors, regularisation, sparsity&lt;br /&gt;
&lt;br /&gt;
* Tutorial 10: [https://drive.google.com/file/d/14kaGKRm7uciT7uLVMW_Vqzr8ha-V-Ra2/view?usp=sharing Bayesian Inference and Priors for the analysis of gravitational waves]. [https://drive.google.com/file/d/16UTmpwKm-7UMcIbca8IIGsO-aCmcwKuD/view?usp=sharing Starting notebook on artificial data]. [https://drive.google.com/file/d/1CyiDlXs6ez9-7gnyeBU0YRgV7Nt5ibkn/view?usp=sharing Biblio][https://colab.research.google.com/drive/1pFMOawozlYOIpy0jQWkTfoq-tFp3uvhw?usp=sharing#scrollTo=6picRNBipcYN Notebook on real data] &lt;br /&gt;
[https://drive.google.com/file/d/161ZLuq5s2RpHDJWELFSKXqlf-qwrVrxA/view?usp=sharing Notebook on Artificial data] [https://drive.google.com/file/d/17qhYN8EFpcoCUHOM_juBvEGpu61GgJRx/view?usp=sharing Corrections ]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, December 2, 2022&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 11: Probabilistic graphical models&lt;br /&gt;
&lt;br /&gt;
* Tutorial 11:[https://drive.google.com/file/d/1A5pcJICHkmHZYoa2uoAGSAWp-_ZOaIEf/view?usp=sharing Analysis of protein sequence data to infer protein structure] [https://drive.google.com/file/d/1COKr5pNoBRFwwnj7TWPQSU8mEWKvsLud/view?usp=sharing Starting notebook and data] [https://drive.google.com/file/d/1CQw1PQ6RSS6nuGxhkwOqe7LJHpOPIaVp/view?usp=sharing Biblio][https://drive.google.com/file/d/1CslX27bTp5gyhXV4ciFE8s1zMnBgJ-1O/view?usp=sharing Solutions] [https://drive.google.com/file/d/19X59x3TdIsJaccTZE71gCbZxFbOzlhj4/view?usp=sharing Final notebook]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, December 9, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 12: Hidden Markov Models. Extra material: Pedagogical introduction to Kalman filters [https://drive.google.com/file/d/0B4HvoS7Zt11LZUxVLTkyVXRQRUE/view?usp=sharing&amp;amp;resourcekey=0-CzsYaRIrPP2sN-UmwfiLHQ]&lt;br /&gt;
&lt;br /&gt;
* Tutorial 12: &lt;br /&gt;
[https://drive.google.com/file/d/1FLbWZRWJ1JILZV41RjwVKR7mOhNMhLV9/view?usp=sharing Hidden Markov Models Hidden  for identification of recombinations in SARS-CoV-2 viral genomes] [https://drive.google.com/file/d/1FCAg0ihMWoAk-_dtt5ORncjVjkVu-m4D/view?usp=sharing Starting Notebook and Data][https://drive.google.com/file/d/1HMREe6ge7_K-lOKC4f2FwL7vnEa1_8Yf/view?usp=sharing Bibliography] [https://drive.google.com/file/d/1FLDBJmNtXogHiO5VfScGiePTCxMFy1KZ/view?usp=sharing Final Notebook] [https://drive.google.com/file/d/1FBQaNJ2RhjwW_VSut2oC7mZYl5F8RWfS/view?usp=sharing Solutions]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, December 16, 2022&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 13: Unsupervised learning and representations&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1p2c35gHMr4_Ptdmwsh3jGJz__9NNIgLw Tutorial 13]: How restricted Boltzmann machines learn ([https://colab.research.google.com/drive/1gnaK_vmTESTV3Ex_A1gqcee6Q58iKyld solutions])&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!-- &#039;&#039;&#039;Final examination of the data-driven course (January 7, 2022)&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Example of exam: On-line Principal Component Analysis [https://drive.google.com/file/d/1BbRY4b3OCVYAtYH4m6ry19KcA2gkp3pH/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
* On-line version of the book [https://drive.google.com/file/d/161YHZA7i2YU-8emy6IPUFhsOXzFRxSRS/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
* Examination repository [https://drive.google.com/file/d/19DNkNBed0Ir5a9N048ZFV4_xF0KG3kcy/view?usp=sharing] --&amp;gt;&lt;/div&gt;</summary>
		<author><name>Alberto</name></author>
	</entry>
	<entry>
		<id>http://www.lptms.universite-paris-saclay.fr//wiki-cours/index.php?title=CoDaDri2&amp;diff=1802</id>
		<title>CoDaDri2</title>
		<link rel="alternate" type="text/html" href="http://www.lptms.universite-paris-saclay.fr//wiki-cours/index.php?title=CoDaDri2&amp;diff=1802"/>
		<updated>2022-09-02T10:31:35Z</updated>

		<summary type="html">&lt;p&gt;Alberto: /* Schedule Computational Physics */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&amp;lt;!-- This is a comment&lt;br /&gt;
=Breaking news:=&lt;br /&gt;
&lt;br /&gt;
* Update with course schedule&lt;br /&gt;
&lt;br /&gt;
= Computational and Data Driven Physics =&lt;br /&gt;
--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
This is the official page for the year 2022-2023 of the Computational and Data-Driven Physics (CoDaDri) course.&lt;br /&gt;
== Course description ==&lt;br /&gt;
&lt;br /&gt;
Modern physics is characterized by an increasing complexity of systems under investigation, in&lt;br /&gt;
domains as diverse as condensed matter, astrophysics, biophysics, etc. Establishing adequate&lt;br /&gt;
models to describe these systems and being able to make quantitative predictions from those models&lt;br /&gt;
is extremely challenging. The goal of the course is to provide the tools and concepts necessary to tackle those systems.&lt;br /&gt;
&lt;br /&gt;
We will first cover many algorithms used in many-body problems and complex systems, with special emphasis on Monte Carlo methods, molecular dynamics, and optimization in complex landscapes. &lt;br /&gt;
&lt;br /&gt;
Second, we will provide statistical inference and machine learning tools to harness the growing availability of experimental data to design accurate models of the underlying, complex, strongly non-homogeneous and interacting systems. &lt;br /&gt;
&lt;br /&gt;
Each theoretical lecture will be followed by a tutorial illustrating the concepts with practical applications&lt;br /&gt;
borrowed from various domains of physics. We will focus on methods and algorithms and physics, not&lt;br /&gt;
on programming and heavy numerics!  You will have to hand in 3 homeworks.&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!-- *[https://drive.google.com/file/d/11w7KI5Pi59VWLX1mqiQ8ZyY8YQHRUeMz/view?usp=sharing Preliminary version of the book: Information, Inference, Networks: From statistical physics to big biological data] --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== The Team ==&lt;br /&gt;
&lt;br /&gt;
* [http://lptms.u-psud.fr/alberto_rosso/ Alberto Rosso] (Computational physics)&lt;br /&gt;
* [http://www.phys.ens.fr/~monasson/ Rémi Monasson] (Data-driven physics)&lt;br /&gt;
*  [http://www.lps.ens.fr/~cocco/ Simona Cocco]  &amp;amp; [https://www.cpht.polytechnique.fr/?q=en/node/110 Michel Ferrero] (Tutorials)&lt;br /&gt;
* [https://github.com/Schimmenti Vincenzo Maria Schimmenti] (Tutor)&lt;br /&gt;
&lt;br /&gt;
== Where and When ==&lt;br /&gt;
&lt;br /&gt;
* Lectures on Fridays: 14:00-16:00&lt;br /&gt;
* Tutorials on Fridays: 16:00-18:00&lt;br /&gt;
* CONDORCET salle 304 A&lt;br /&gt;
&lt;br /&gt;
== Slack ==&lt;br /&gt;
&lt;br /&gt;
If you have questions or want to discuss topics related to the lecture, to the exercises or to the homeworks, you can use the&lt;br /&gt;
[https://computational-prb2883.slack.com/ssb/redirect Computational and Data Driven Physics Slack]. In order to join the Slack&lt;br /&gt;
use the following [https://join.slack.com/t/computational-prb2883/shared_invite/zt-1fbx1i96a-CRDyBiOr~cn0LCdJZv~fEw invitation link].&lt;br /&gt;
&lt;br /&gt;
== Computer Requirements ==&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;No previous experience in programming is required.&#039;&#039;&#039; &amp;lt;br&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Programming Language: Python&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
For practical installation, we recommand either to use  Anaconda (See [[Memento Python]]) or use google colab. &amp;lt;br&amp;gt;&lt;br /&gt;
The [https://colab.research.google.com Colab platform] from Google is quite good way to use powerful computer without buying one: It requires no specific hardware or software, and even allows you to use GPU computing for free,  all by writting a jupyter notebook that you can then share.&lt;br /&gt;
&lt;br /&gt;
== Grading ==&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Computational Physics:&#039;&#039;&#039;&lt;br /&gt;
* Homework 1: 5 points &lt;br /&gt;
* Homework 2: 5 points&lt;br /&gt;
* Multiple Choice Questions in November: 10 points&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Data Driven Physics:&#039;&#039;&#039;&lt;br /&gt;
* Homework 3: 5 points&lt;br /&gt;
* Final exam in January: 15 points&lt;br /&gt;
&lt;br /&gt;
== Schedule Computational Physics ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 2, 2022 &#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1X9h3lKD0OZLTKtxb7DWPfynY42rRuE7j/view?usp=sharing Lecture 1]   Introduction to Monte Carlo&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1gf7oRQIpvSvMScyJa5hexB9CCZvdozPs#scrollTo=lDznlLouvlFx Tutorial 1] Markov matrices &amp;lt;!-- ([https://colab.research.google.com/drive/1x9iEHG_F522uFCvD_jGdvHaMETAHfO6-#scrollTo=eSu-nLZ6vm8X solutions]) --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1g7HXFUBQUBF0fhy5h2jYbfIAVBTqvb7-#scrollTo=U9LFX8OFhHOG Homework 1] (deadline September 23)&lt;br /&gt;
&lt;br /&gt;
* Introductory notebooks: [https://colab.research.google.com/drive/1Ovrh1JjLzMMnxtasDgR1j84CHGU6hMxA python], [https://colab.research.google.com/drive/14PWu-C171pYhV8ven-Txc4wz5Tv1DCsK numpy] and [https://colab.research.google.com/drive/1fPjwrdxQPSyfXniyAHmyOcF_gK2fqjts matplotlib]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 9, 2022&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/15wrgivn6FSnuBUnMwjjhadmD-g1fkS7T/view?usp=sharing Lecture 2] Basic Sampling&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1tjqbjAi50C4qOqVRtTxEkTeTb10qpTms#scrollTo=uYpaubGkvogU Tutorial 2] Thumb rule &amp;lt;!-- ([https://colab.research.google.com/drive/1aWVtz4ZGcpIarWiRVAnxrp1t0GDOqZxu#scrollTo=f7ohlMuZvqTr solutions]) --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 16, 2022&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1eY5cuNcJqYw7df0PBkxq03tEnqzTOC-5/view?usp=sharing Lecture 3 ]: Importance sampling&lt;br /&gt;
&lt;br /&gt;
*  [https://drive.google.com/file/d/1ALR_QKLXdHby54xNux39NUOk4L-Ne1EW/view?usp=sharing  Tutorial 3]: Errors and Precision&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 23, 2022&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1DijhG_856OAuj42WqY1UM47APmMy3A8B/view?usp=sharing Lecture 4]: Ising model and phase transitions &lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1sRUEs768Z6PKdJ3k7MixYeFGlufgjFrG Tutorial 4]: Ising model and phase transitions &amp;lt;!-- ([https://colab.research.google.com/drive/1KAQRog_YlAjKZ_hL1FMYurWdPBLNUocI solutions]) --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
* Send your copy of Homework 1 to numphys.icfp  at   gmail.com  Thanks!&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1EPgj3la7vxDIqSQYNlOFz4rR0vHXAeae Homework 2] (deadline October 14)&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 30, 2022&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1PTya42ZS2kU87A-BxQFFIUDTs_k47men?usp=sharing Lecture 5]: Optimization &amp;amp; Dijkstra algorithm&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1ieT5BlfJsOehsa8r-LHGsFsn1dwYnawT Tutorial 5]: Simulated annealing &amp;lt;!-- ([https://colab.research.google.com/drive/1JNVl42KNASZiwTtqYo71z_vggjbGfKul solutions]) --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 7, 2022&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Test: &lt;br /&gt;
&lt;br /&gt;
 Multiple Choice Questions.  For each question you have 4 choices: 3 wrong and 1 correct: If you check the correct one you get a point. If you are wrong you loose 1/4 of a point.  No answer given: zero points.&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1iaOGxdVgk--kWUFcMDHs0zvPhsOyhB_c Tutorial 6]: Faster than the clock algorithms &amp;lt;!--([https://colab.research.google.com/drive/1bHPnJpBd5ExqKF4G5BuV_FHPE4r0_AY2#scrollTo=fQnz_gOeq40e solutions])--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== Schedule Data-driven Physics ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 14, 2022&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 7: Introduction to Bayesian inference&lt;br /&gt;
&lt;br /&gt;
* Tutorial 7: Bayesian inference and single-particle tracking. [https://drive.google.com/file/d/1q9Quq5mvJ4Avv2qWgzTocU-DVIxJIVWi/view?usp=sharing Questions]. [https://drive.google.com/file/d/1xYb4wfNBysse6Q7frTw_V9TPdUQU5lUx/view?usp=sharing Data]. [https://drive.google.com/file/d/1Ba_kRo3_XMIaDLNYZlbZEw-wGXKS-29I/view?usp=sharing Starting Notebook]. [https://colab.research.google.com/drive/1VePL9X1JT6yl8LmROeZyMyf4Epcu3yOL#scrollTo=1XQNGa_fyEkJ Google colab version]. Solutions [https://drive.google.com/file/d/1Q9IjVUeL7AA8uWk8DX9Vy9vuUQ21RYh2/view?usp=sharing]. Notebook [https://drive.google.com/file/d/1ZJmpdaTQVUttEaaI1ch-reFfZGI93454/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
* Send your copy of Homework 2 to numphys.icfp  at   gmail.com  Thanks!&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 21, 2022&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 8: Asymptotic inference and information. Extra material: Proof of Cramer-Rao bound [https://drive.google.com/file/d/10Ph_iP6AIQ3ps9v3FwRBO9j6-qV7oKV9/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
* Tutorial 8: [https://drive.google.com/file/d/12cG4HBvzs9Oe1mbfuEYyRDmTEamW71pR/view?usp=sharing Questions]. [https://drive.google.com/file/d/1AL8sRtnqYUI8NbubfglgLazknaVIUJEo/view?usp=sharing Data ] [https://drive.google.com/file/d/1DTLzXLZUEPzoU2SsDMcAe8GaoYX8E5gH/view?usp=sharing Starting Notebook]. [https://drive.google.com/file/d/1QpMaM5ACmKUlFAyGvRnHvFVtQoEAF7-9/view?usp=sharing Bibliography] [https://drive.google.com/file/d/1p9v1PkJhwS8Ofg4RiC1nsFJAe8Mb_6WF/view?usp=sharing Solutions].  [https://drive.google.com/file/d/19erJJ4Gjw77n57VrnqaQPCxIh_-NScYT/view?usp=sharing Notebook].&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 28, 2022&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 9: High-dimensional inference and Principal Component Analysis. Extra material: Handwritten notes on the derivation of Marcenko-Pastur spectral density [https://drive.google.com/file/d/10Yytv9itdWDDHTsM2lQHwQDMbcf-oVnd/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
* Tutorial 9: [https://drive.google.com/file/d/10y7m1mPf5R5zZN6661Eei92IUNhBL_Zu/view?usp=sharing  Replay of the neuronal activity during sleep after a task].[https://drive.google.com/file/d/11fO26XB6Ri3HDVBvtdBkYxcTRLk1iv5F/view?usp=sharing Data ]. [https://drive.google.com/file/d/1-MFN2ERs_eNs4w6XnLjfzsu2F9REluSt/view?usp=sharing Initial Notebook]. [https://drive.google.com/file/d/11ev4Zwn6DPYLwhMsLyp8S0aQFVu77Ou3/view?usp=sharing Biblio]. &lt;br /&gt;
[https://drive.google.com/file/d/11E75QwrJgDKrutGj9t5NJTRkGtuRgoBI/view?usp=sharing Solutions]. [https://drive.google.com/file/d/1-39oZNNB-35zM4V2tLWtubQnZTdMLtIz/view?usp=sharing Notebook]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, November 25, 2022&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 10: Priors, regularisation, sparsity&lt;br /&gt;
&lt;br /&gt;
* Tutorial 10: [https://drive.google.com/file/d/14kaGKRm7uciT7uLVMW_Vqzr8ha-V-Ra2/view?usp=sharing Bayesian Inference and Priors for the analysis of gravitational waves]. [https://drive.google.com/file/d/16UTmpwKm-7UMcIbca8IIGsO-aCmcwKuD/view?usp=sharing Starting notebook on artificial data]. [https://drive.google.com/file/d/1CyiDlXs6ez9-7gnyeBU0YRgV7Nt5ibkn/view?usp=sharing Biblio][https://colab.research.google.com/drive/1pFMOawozlYOIpy0jQWkTfoq-tFp3uvhw?usp=sharing#scrollTo=6picRNBipcYN Notebook on real data] &lt;br /&gt;
[https://drive.google.com/file/d/161ZLuq5s2RpHDJWELFSKXqlf-qwrVrxA/view?usp=sharing Notebook on Artificial data] [https://drive.google.com/file/d/17qhYN8EFpcoCUHOM_juBvEGpu61GgJRx/view?usp=sharing Corrections ]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, December 2, 2022&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 11: Probabilistic graphical models&lt;br /&gt;
&lt;br /&gt;
* Tutorial 11:[https://drive.google.com/file/d/1A5pcJICHkmHZYoa2uoAGSAWp-_ZOaIEf/view?usp=sharing Analysis of protein sequence data to infer protein structure] [https://drive.google.com/file/d/1COKr5pNoBRFwwnj7TWPQSU8mEWKvsLud/view?usp=sharing Starting notebook and data] [https://drive.google.com/file/d/1CQw1PQ6RSS6nuGxhkwOqe7LJHpOPIaVp/view?usp=sharing Biblio][https://drive.google.com/file/d/1CslX27bTp5gyhXV4ciFE8s1zMnBgJ-1O/view?usp=sharing Solutions] [https://drive.google.com/file/d/19X59x3TdIsJaccTZE71gCbZxFbOzlhj4/view?usp=sharing Final notebook]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, December 9, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 12: Hidden Markov Models. Extra material: Pedagogical introduction to Kalman filters [https://drive.google.com/file/d/0B4HvoS7Zt11LZUxVLTkyVXRQRUE/view?usp=sharing&amp;amp;resourcekey=0-CzsYaRIrPP2sN-UmwfiLHQ]&lt;br /&gt;
&lt;br /&gt;
* Tutorial 12: &lt;br /&gt;
[https://drive.google.com/file/d/1FLbWZRWJ1JILZV41RjwVKR7mOhNMhLV9/view?usp=sharing Hidden Markov Models Hidden  for identification of recombinations in SARS-CoV-2 viral genomes] [https://drive.google.com/file/d/1FCAg0ihMWoAk-_dtt5ORncjVjkVu-m4D/view?usp=sharing Starting Notebook and Data][https://drive.google.com/file/d/1HMREe6ge7_K-lOKC4f2FwL7vnEa1_8Yf/view?usp=sharing Bibliography] [https://drive.google.com/file/d/1FLDBJmNtXogHiO5VfScGiePTCxMFy1KZ/view?usp=sharing Final Notebook] [https://drive.google.com/file/d/1FBQaNJ2RhjwW_VSut2oC7mZYl5F8RWfS/view?usp=sharing Solutions]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, December 16, 2022&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 13: Unsupervised learning and representations&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1p2c35gHMr4_Ptdmwsh3jGJz__9NNIgLw Tutorial 13]: How restricted Boltzmann machines learn ([https://colab.research.google.com/drive/1gnaK_vmTESTV3Ex_A1gqcee6Q58iKyld solutions])&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!-- &#039;&#039;&#039;Final examination of the data-driven course (January 7, 2022)&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Example of exam: On-line Principal Component Analysis [https://drive.google.com/file/d/1BbRY4b3OCVYAtYH4m6ry19KcA2gkp3pH/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
* On-line version of the book [https://drive.google.com/file/d/161YHZA7i2YU-8emy6IPUFhsOXzFRxSRS/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
* Examination repository [https://drive.google.com/file/d/19DNkNBed0Ir5a9N048ZFV4_xF0KG3kcy/view?usp=sharing] --&amp;gt;&lt;/div&gt;</summary>
		<author><name>Alberto</name></author>
	</entry>
	<entry>
		<id>http://www.lptms.universite-paris-saclay.fr//wiki-cours/index.php?title=CoDaDri&amp;diff=1801</id>
		<title>CoDaDri</title>
		<link rel="alternate" type="text/html" href="http://www.lptms.universite-paris-saclay.fr//wiki-cours/index.php?title=CoDaDri&amp;diff=1801"/>
		<updated>2022-09-02T09:34:01Z</updated>

		<summary type="html">&lt;p&gt;Alberto: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&amp;lt;!--  =Breaking news:=&lt;br /&gt;
&lt;br /&gt;
* Homework 1 has been evaluated and sent to you. If you did not receive it, please contact us. &lt;br /&gt;
* Here you find the MCQ proposed last year &lt;br /&gt;
[https://colab.research.google.com/drive/1Ru_-IQ001XEJd9VAn4nvbBNI_3XA9QSK?usp=sharing The Quiz]&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;The Solution&#039;&#039;&#039; [https://colab.research.google.com/drive/1Faovrt0q5kRVtVsF9afr4iMXww_Wk53_?usp=sharing]  --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
= Computational and Data Driven Physics =&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Modern physics is characterized by an increasing complexity of systems under investigation, in&lt;br /&gt;
domains as diverse as condensed matter, astrophysics, biophysics, etc. Establishing adequate&lt;br /&gt;
models to describe these systems and being able to make quantitative predictions from those models&lt;br /&gt;
is extremely challenging. The goal of the course is to provide the tools and concepts necessary to tackle those systems.&lt;br /&gt;
&lt;br /&gt;
== Course description ==&lt;br /&gt;
&lt;br /&gt;
We will first cover many algorithms used in many-body problems and complex systems, with special emphasis on Monte Carlo methods, molecular dynamics, and optimization in complex landscapes. &lt;br /&gt;
&lt;br /&gt;
Second, we will provide statistical inference and machine learning tools to harness the growing availability of experimental data to design accurate models of the underlying, complex, strongly non-homogeneous and interacting systems. &lt;br /&gt;
&lt;br /&gt;
Each theoretical lecture will be followed by a tutorial illustrating the concepts with practical applications&lt;br /&gt;
borrowed from various domains of physics. We will focus on methods and algorithms and physics, not&lt;br /&gt;
on programming and heavy numerics!  You will have to hand in 3 homeworks.&lt;br /&gt;
&lt;br /&gt;
*[https://drive.google.com/file/d/11w7KI5Pi59VWLX1mqiQ8ZyY8YQHRUeMz/view?usp=sharing Preliminary version of the book: Information, Inference, Networks: From statistical physics to big biological data]&lt;br /&gt;
&lt;br /&gt;
== The Team ==&lt;br /&gt;
&lt;br /&gt;
* [http://lptms.u-psud.fr/alberto_rosso/ Alberto Rosso] (Computational physics)&lt;br /&gt;
* [http://www.phys.ens.fr/~monasson/ Rémi Monasson] (Data-driven physics)&lt;br /&gt;
*  [http://www.lps.ens.fr/~cocco/ Simona Cocco] &amp;amp; [https://www.pct.espci.fr/~david/ David Lacoste] &amp;amp; [https://www.cpht.polytechnique.fr/?q=en/node/110 Michel Ferrero] (Tutorials)&lt;br /&gt;
&lt;br /&gt;
== Where and When ==&lt;br /&gt;
&lt;br /&gt;
* Lectures on Fridays: 14:00-16:00&lt;br /&gt;
* Tutorials on Fridays: 16:00-18:00&lt;br /&gt;
* ENS, 29 rue D&#039;Ulm, salle Borel + Djebar&lt;br /&gt;
&lt;br /&gt;
== Slack ==&lt;br /&gt;
&lt;br /&gt;
If you have questions or want to discuss topics related to the lecture, to the exercises or to the homeworks, you can use the&lt;br /&gt;
[http://computational-ozw2847.slack.com Computational and Data Driven Physics Slack]. In order to join the Slack&lt;br /&gt;
use the following [https://join.slack.com/t/computational-ozw2847/shared_invite/zt-vegija8y-cx_vbF2BI6FJewx4W6coSA invitation link].&lt;br /&gt;
&lt;br /&gt;
== Computer Requirements ==&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;No previous experience in programming is required.&#039;&#039;&#039; &amp;lt;br&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Programming Language: Python&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
For practical installation, we recommand either to use  Anaconda (See [[Memento Python]]) or use google colab. &amp;lt;br&amp;gt;&lt;br /&gt;
The Collaboratory platform from Google is quite good way to use powerful computer without buying one: It requires no specific hardware or software, and even allows you to use GPU computing for free,  all by writting a jupyter notebook that you can then share.&lt;br /&gt;
&lt;br /&gt;
== Grading ==&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Computational Physics:&#039;&#039;&#039;&lt;br /&gt;
* Homework 1: 5 points &lt;br /&gt;
* Homework 2: 5 points&lt;br /&gt;
* Multiple Choice Questions in November: 10 points&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Data Driven Physics:&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Final exam in January: 20 points&lt;br /&gt;
&lt;br /&gt;
  == Schedule ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!-- &#039;&#039;&#039;Friday, September 3, 2021 &#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1X9h3lKD0OZLTKtxb7DWPfynY42rRuE7j/view?usp=sharing Lecture 1]   Introduction to Monte Carlo&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1sIv3qOdyE-XYkjYC-dkNsR72f4BgaQ_y/view?usp=sharing Tutorial 1] Markov Matrix&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 10, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Introductory notebooks: [https://colab.research.google.com/drive/1Ovrh1JjLzMMnxtasDgR1j84CHGU6hMxA python], [https://colab.research.google.com/drive/14PWu-C171pYhV8ven-Txc4wz5Tv1DCsK numpy] and [https://colab.research.google.com/drive/1fPjwrdxQPSyfXniyAHmyOcF_gK2fqjts matplotlib]&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1gf7oRQIpvSvMScyJa5hexB9CCZvdozPs#scrollTo=lDznlLouvlFx Tutorial 2] - Markov matrices ([https://colab.research.google.com/drive/1x9iEHG_F522uFCvD_jGdvHaMETAHfO6-#scrollTo=eSu-nLZ6vm8X solutions])&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1tjqbjAi50C4qOqVRtTxEkTeTb10qpTms#scrollTo=uYpaubGkvogU Tutorial 3] - Thumb rule ([https://colab.research.google.com/drive/1aWVtz4ZGcpIarWiRVAnxrp1t0GDOqZxu#scrollTo=f7ohlMuZvqTr solutions])&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1g7HXFUBQUBF0fhy5h2jYbfIAVBTqvb7-#scrollTo=U9LFX8OFhHOG Homework 1] (deadline October 1) --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
* [https://colab.research.google.com/drive/1aMo4Ur-0_b4dGhdIfxAmCC2ci1rOda_v?usp=sharing Tutorial 2] Markov matrix [https://colab.research.google.com/drive/1Q5ajzxRGXBBorA9cQ9o8V5VUVJhUXpPS?usp=sharing problems]&lt;br /&gt;
* [https://colab.research.google.com/drive/1k60-ChM3aUWjGsiRsf2Idx9jxHHtwyAb?usp=sharing Tutorial 3] Thumb rule [https://colab.research.google.com/drive/1fdKJlp0lD4k530oRuu50_Hm_T8t3jixa?usp=sharing problems]&lt;br /&gt;
--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!-- &#039;&#039;&#039;Friday, September 17, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/15wrgivn6FSnuBUnMwjjhadmD-g1fkS7T/view?usp=sharing Lecture 2] Basic Sampling&lt;br /&gt;
&lt;br /&gt;
*  [https://drive.google.com/file/d/1ALR_QKLXdHby54xNux39NUOk4L-Ne1EW/view?usp=sharing  Lecture 3]: Errors and Precision&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 24, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1DijhG_856OAuj42WqY1UM47APmMy3A8B/view?usp=sharing Lecture 4]: Ising model and phase transitions &lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1sRUEs768Z6PKdJ3k7MixYeFGlufgjFrG Tutorial 4]: Ising model and phase transitions ([https://colab.research.google.com/drive/1KAQRog_YlAjKZ_hL1FMYurWdPBLNUocI solutions]) --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
* [https://colab.research.google.com/drive/1nU4E_pFWjSFPNigzy8-LcJpef26IKY6x?usp=sharing Tutorial 4]: Ising model and phase transitions [https://colab.research.google.com/drive/1AEUX3U7hxDR_YYy8ld3knTEVR1KYa9SP?usp=sharing problems] &lt;br /&gt;
--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&#039;&#039;&#039;Friday, October 1, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1PTya42ZS2kU87A-BxQFFIUDTs_k47men?usp=sharing Lecture 5]: Optimization &amp;amp; Dijkstra algorithm&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1ieT5BlfJsOehsa8r-LHGsFsn1dwYnawT Tutorial 5]: Simulated annealing ([https://colab.research.google.com/drive/1JNVl42KNASZiwTtqYo71z_vggjbGfKul solutions]) --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
* [https://colab.research.google.com/drive/1p0ooWAXF9KNh-FztMHmVoA9yBzYOM8PC?usp=sharing Tutorial 5]: Simulated annealing [https://colab.research.google.com/drive/1txJGpzreHurWux7ev6sDsX8TjzpeQhZZ?usp=sharing problems]&lt;br /&gt;
--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!-- * Send your copy of Homework 1 to numphys.icfp  at   gmail.com  Thanks!&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1EPgj3la7vxDIqSQYNlOFz4rR0vHXAeae Homework 2] (deadline October 22)&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 8, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 6: Introduction to Bayesian inference&lt;br /&gt;
&lt;br /&gt;
* Tutorial 6: Bayesian inference and single-particle tracking. [https://drive.google.com/file/d/1q9Quq5mvJ4Avv2qWgzTocU-DVIxJIVWi/view?usp=sharing Questions]. [https://drive.google.com/file/d/1xYb4wfNBysse6Q7frTw_V9TPdUQU5lUx/view?usp=sharing Data]. [https://drive.google.com/file/d/1Ba_kRo3_XMIaDLNYZlbZEw-wGXKS-29I/view?usp=sharing Starting Notebook]. [https://colab.research.google.com/drive/1VePL9X1JT6yl8LmROeZyMyf4Epcu3yOL#scrollTo=1XQNGa_fyEkJ Google colab version]. Solutions [https://drive.google.com/file/d/1Q9IjVUeL7AA8uWk8DX9Vy9vuUQ21RYh2/view?usp=sharing]. Notebook [https://drive.google.com/file/d/1ZJmpdaTQVUttEaaI1ch-reFfZGI93454/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 15, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1eY5cuNcJqYw7df0PBkxq03tEnqzTOC-5/view?usp=sharing Lecture 7]: Importance sampling&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1iaOGxdVgk--kWUFcMDHs0zvPhsOyhB_c Tutorial 7]: Faster than the clock algorithms ([https://colab.research.google.com/drive/1bHPnJpBd5ExqKF4G5BuV_FHPE4r0_AY2#scrollTo=fQnz_gOeq40e solutions]) --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
* [https://colab.research.google.com/drive/1KyT442vB4EuGKBy_Xj3j8cLtMMl4gbac?usp=sharing Tutorial 6]: Faster than the clock algorithms [https://colab.research.google.com/drive/1C-ieAwaAKwkX5MFm8aX2kNO2GNeO9CdY?usp=sharing problems]&lt;br /&gt;
--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--  &#039;&#039;&#039;Friday, October 22, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 8: Asymptotic inference and information. Extra material: Proof of Cramer-Rao bound [https://drive.google.com/file/d/10Ph_iP6AIQ3ps9v3FwRBO9j6-qV7oKV9/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
* Tutorial 8: [https://drive.google.com/file/d/12cG4HBvzs9Oe1mbfuEYyRDmTEamW71pR/view?usp=sharing Questions]. [https://drive.google.com/file/d/1AL8sRtnqYUI8NbubfglgLazknaVIUJEo/view?usp=sharing Data ] [https://drive.google.com/file/d/1DTLzXLZUEPzoU2SsDMcAe8GaoYX8E5gH/view?usp=sharing Starting Notebook]. [https://drive.google.com/file/d/1QpMaM5ACmKUlFAyGvRnHvFVtQoEAF7-9/view?usp=sharing Bibliography] [https://drive.google.com/file/d/1p9v1PkJhwS8Ofg4RiC1nsFJAe8Mb_6WF/view?usp=sharing Solutions].  [https://drive.google.com/file/d/19erJJ4Gjw77n57VrnqaQPCxIh_-NScYT/view?usp=sharing Notebook].&lt;br /&gt;
&lt;br /&gt;
* Send your copy of Homework 2 to numphys.icfp  at   gmail.com  Thanks!&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 29, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 9: High-dimensional inference and Principal Component Analysis. Extra material: Handwritten notes on the derivation of Marcenko-Pastur spectral density [https://drive.google.com/file/d/10Yytv9itdWDDHTsM2lQHwQDMbcf-oVnd/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
* Tutorial 9: [https://drive.google.com/file/d/10y7m1mPf5R5zZN6661Eei92IUNhBL_Zu/view?usp=sharing  Replay of the neuronal activity during sleep after a task].[https://drive.google.com/file/d/11fO26XB6Ri3HDVBvtdBkYxcTRLk1iv5F/view?usp=sharing Data ]. [https://drive.google.com/file/d/1-MFN2ERs_eNs4w6XnLjfzsu2F9REluSt/view?usp=sharing Initial Notebook]. [https://drive.google.com/file/d/11ev4Zwn6DPYLwhMsLyp8S0aQFVu77Ou3/view?usp=sharing Biblio]. &lt;br /&gt;
[https://drive.google.com/file/d/11E75QwrJgDKrutGj9t5NJTRkGtuRgoBI/view?usp=sharing Solutions]. [https://drive.google.com/file/d/1-39oZNNB-35zM4V2tLWtubQnZTdMLtIz/view?usp=sharing Notebook]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, November 12, 2021, 2 pm: The Quiz.&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
The MCQ is composed of 19 questions (one of them counts for two).  For each question you have 4 choices: 3 wrong and 1 correct: If you check the correct one you get a point. If you are wrong you loose 1/4 of a point.  No answer given: zero points.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
MCQ Solution (correct answers in bold):[https://drive.google.com/file/d/1WWcqxFzmCJp2ZXC02a70a1o17pGupdyZ/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, November 26, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 10: Priors, regularisation, sparsity&lt;br /&gt;
&lt;br /&gt;
* Tutorial 10: [https://drive.google.com/file/d/14kaGKRm7uciT7uLVMW_Vqzr8ha-V-Ra2/view?usp=sharing Bayesian Inference and Priors for the analysis of gravitational waves]. [https://drive.google.com/file/d/16UTmpwKm-7UMcIbca8IIGsO-aCmcwKuD/view?usp=sharing Starting notebook on artificial data]. [https://drive.google.com/file/d/1CyiDlXs6ez9-7gnyeBU0YRgV7Nt5ibkn/view?usp=sharing Biblio][https://colab.research.google.com/drive/1pFMOawozlYOIpy0jQWkTfoq-tFp3uvhw?usp=sharing#scrollTo=6picRNBipcYN Notebook on real data] &lt;br /&gt;
[https://drive.google.com/file/d/161ZLuq5s2RpHDJWELFSKXqlf-qwrVrxA/view?usp=sharing Notebook on Artificial data] [https://drive.google.com/file/d/17qhYN8EFpcoCUHOM_juBvEGpu61GgJRx/view?usp=sharing Corrections ]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, December 3, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 11: Probabilistic graphical models&lt;br /&gt;
&lt;br /&gt;
* Tutorial 11:[https://drive.google.com/file/d/1A5pcJICHkmHZYoa2uoAGSAWp-_ZOaIEf/view?usp=sharing Analysis of protein sequence data to infer protein structure] [https://drive.google.com/file/d/1COKr5pNoBRFwwnj7TWPQSU8mEWKvsLud/view?usp=sharing Starting notebook and data] [https://drive.google.com/file/d/1CQw1PQ6RSS6nuGxhkwOqe7LJHpOPIaVp/view?usp=sharing Biblio][https://drive.google.com/file/d/1CslX27bTp5gyhXV4ciFE8s1zMnBgJ-1O/view?usp=sharing Solutions] [https://drive.google.com/file/d/19X59x3TdIsJaccTZE71gCbZxFbOzlhj4/view?usp=sharing Final notebook]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, December 10, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 12: Hidden Markov Models. Extra material: Pedagogical introduction to Kalman filters [https://drive.google.com/file/d/0B4HvoS7Zt11LZUxVLTkyVXRQRUE/view?usp=sharing&amp;amp;resourcekey=0-CzsYaRIrPP2sN-UmwfiLHQ]&lt;br /&gt;
&lt;br /&gt;
* Tutorial 12: &lt;br /&gt;
[https://drive.google.com/file/d/1FLbWZRWJ1JILZV41RjwVKR7mOhNMhLV9/view?usp=sharing Hidden Markov Models Hidden  for identification of recombinations in SARS-CoV-2 viral genomes] [https://drive.google.com/file/d/1FCAg0ihMWoAk-_dtt5ORncjVjkVu-m4D/view?usp=sharing Starting Notebook and Data][https://drive.google.com/file/d/1HMREe6ge7_K-lOKC4f2FwL7vnEa1_8Yf/view?usp=sharing Bibliography] [https://drive.google.com/file/d/1FLDBJmNtXogHiO5VfScGiePTCxMFy1KZ/view?usp=sharing Final Notebook] [https://drive.google.com/file/d/1FBQaNJ2RhjwW_VSut2oC7mZYl5F8RWfS/view?usp=sharing Solutions]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, December 17, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 13: Unsupervised learning and representations&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1p2c35gHMr4_Ptdmwsh3jGJz__9NNIgLw Tutorial 13]: How restricted Boltzmann machines learn ([https://colab.research.google.com/drive/1gnaK_vmTESTV3Ex_A1gqcee6Q58iKyld solutions])&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Final examination of the data-driven course (January 7, 2022)&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Example of exam: On-line Principal Component Analysis [https://drive.google.com/file/d/1BbRY4b3OCVYAtYH4m6ry19KcA2gkp3pH/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
* On-line version of the book [https://drive.google.com/file/d/161YHZA7i2YU-8emy6IPUFhsOXzFRxSRS/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
* Examination repository [https://drive.google.com/file/d/19DNkNBed0Ir5a9N048ZFV4_xF0KG3kcy/view?usp=sharing]&lt;br /&gt;
--&amp;gt;&lt;/div&gt;</summary>
		<author><name>Alberto</name></author>
	</entry>
	<entry>
		<id>http://www.lptms.universite-paris-saclay.fr//wiki-cours/index.php?title=CoDaDri&amp;diff=1800</id>
		<title>CoDaDri</title>
		<link rel="alternate" type="text/html" href="http://www.lptms.universite-paris-saclay.fr//wiki-cours/index.php?title=CoDaDri&amp;diff=1800"/>
		<updated>2022-09-02T09:30:52Z</updated>

		<summary type="html">&lt;p&gt;Alberto: /* Schedule */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&amp;lt;!--  =Breaking news:=&lt;br /&gt;
&lt;br /&gt;
* Homework 1 has been evaluated and sent to you. If you did not receive it, please contact us. &lt;br /&gt;
* Here you find the MCQ proposed last year &lt;br /&gt;
[https://colab.research.google.com/drive/1Ru_-IQ001XEJd9VAn4nvbBNI_3XA9QSK?usp=sharing The Quiz]&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;The Solution&#039;&#039;&#039; [https://colab.research.google.com/drive/1Faovrt0q5kRVtVsF9afr4iMXww_Wk53_?usp=sharing]  --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
= Computational and Data Driven Physics =&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Modern physics is characterized by an increasing complexity of systems under investigation, in&lt;br /&gt;
domains as diverse as condensed matter, astrophysics, biophysics, etc. Establishing adequate&lt;br /&gt;
models to describe these systems and being able to make quantitative predictions from those models&lt;br /&gt;
is extremely challenging. The goal of the course is to provide the tools and concepts necessary to tackle those systems.&lt;br /&gt;
&lt;br /&gt;
== Course description ==&lt;br /&gt;
&lt;br /&gt;
We will first cover many algorithms used in many-body problems and complex systems, with special emphasis on Monte Carlo methods, molecular dynamics, and optimization in complex landscapes. &lt;br /&gt;
&lt;br /&gt;
Second, we will provide statistical inference and machine learning tools to harness the growing availability of experimental data to design accurate models of the underlying, complex, strongly non-homogeneous and interacting systems. &lt;br /&gt;
&lt;br /&gt;
Each theoretical lecture will be followed by a tutorial illustrating the concepts with practical applications&lt;br /&gt;
borrowed from various domains of physics. We will focus on methods and algorithms and physics, not&lt;br /&gt;
on programming and heavy numerics!  You will have to hand in 3 homeworks.&lt;br /&gt;
&lt;br /&gt;
*[https://drive.google.com/file/d/11w7KI5Pi59VWLX1mqiQ8ZyY8YQHRUeMz/view?usp=sharing Preliminary version of the book: Information, Inference, Networks: From statistical physics to big biological data]&lt;br /&gt;
&lt;br /&gt;
== The Team ==&lt;br /&gt;
&lt;br /&gt;
* [http://lptms.u-psud.fr/alberto_rosso/ Alberto Rosso] (Computational physics)&lt;br /&gt;
* [http://www.phys.ens.fr/~monasson/ Rémi Monasson] (Data-driven physics)&lt;br /&gt;
*  [http://www.lps.ens.fr/~cocco/ Simona Cocco] &amp;amp; [https://www.pct.espci.fr/~david/ David Lacoste] &amp;amp; [https://www.cpht.polytechnique.fr/?q=en/node/110 Michel Ferrero] (Tutorials)&lt;br /&gt;
&lt;br /&gt;
== Where and When ==&lt;br /&gt;
&lt;br /&gt;
* Lectures on Fridays: 14:00-16:00&lt;br /&gt;
* Tutorials on Fridays: 16:00-18:00&lt;br /&gt;
* ENS, 29 rue D&#039;Ulm, salle Borel + Djebar&lt;br /&gt;
&lt;br /&gt;
== Slack ==&lt;br /&gt;
&lt;br /&gt;
If you have questions or want to discuss topics related to the lecture, to the exercises or to the homeworks, you can use the&lt;br /&gt;
[http://computational-ozw2847.slack.com Computational and Data Driven Physics Slack]. In order to join the Slack&lt;br /&gt;
use the following [https://join.slack.com/t/computational-ozw2847/shared_invite/zt-vegija8y-cx_vbF2BI6FJewx4W6coSA invitation link].&lt;br /&gt;
&lt;br /&gt;
== Computer Requirements ==&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;No previous experience in programming is required.&#039;&#039;&#039; &amp;lt;br&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Programming Language: Python&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
For practical installation, we recommand either to use  Anaconda (See [[Memento Python]]) or use google colab. &amp;lt;br&amp;gt;&lt;br /&gt;
The Collaboratory platform from Google is quite good way to use powerful computer without buying one: It requires no specific hardware or software, and even allows you to use GPU computing for free,  all by writting a jupyter notebook that you can then share.&lt;br /&gt;
&lt;br /&gt;
== Grading ==&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Computational Physics:&#039;&#039;&#039;&lt;br /&gt;
* Homework 1: 5 points &lt;br /&gt;
* Homework 2: 5 points&lt;br /&gt;
* Multiple Choice Questions in November: 10 points&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Data Driven Physics:&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Final exam in January: 20 points&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--  == Schedule ==&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 3, 2021 &#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1X9h3lKD0OZLTKtxb7DWPfynY42rRuE7j/view?usp=sharing Lecture 1]   Introduction to Monte Carlo&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1sIv3qOdyE-XYkjYC-dkNsR72f4BgaQ_y/view?usp=sharing Tutorial 1] Markov Matrix&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 10, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Introductory notebooks: [https://colab.research.google.com/drive/1Ovrh1JjLzMMnxtasDgR1j84CHGU6hMxA python], [https://colab.research.google.com/drive/14PWu-C171pYhV8ven-Txc4wz5Tv1DCsK numpy] and [https://colab.research.google.com/drive/1fPjwrdxQPSyfXniyAHmyOcF_gK2fqjts matplotlib]&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1gf7oRQIpvSvMScyJa5hexB9CCZvdozPs#scrollTo=lDznlLouvlFx Tutorial 2] - Markov matrices ([https://colab.research.google.com/drive/1x9iEHG_F522uFCvD_jGdvHaMETAHfO6-#scrollTo=eSu-nLZ6vm8X solutions])&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1tjqbjAi50C4qOqVRtTxEkTeTb10qpTms#scrollTo=uYpaubGkvogU Tutorial 3] - Thumb rule ([https://colab.research.google.com/drive/1aWVtz4ZGcpIarWiRVAnxrp1t0GDOqZxu#scrollTo=f7ohlMuZvqTr solutions])&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1g7HXFUBQUBF0fhy5h2jYbfIAVBTqvb7-#scrollTo=U9LFX8OFhHOG Homework 1] (deadline October 1)&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
* [https://colab.research.google.com/drive/1aMo4Ur-0_b4dGhdIfxAmCC2ci1rOda_v?usp=sharing Tutorial 2] Markov matrix [https://colab.research.google.com/drive/1Q5ajzxRGXBBorA9cQ9o8V5VUVJhUXpPS?usp=sharing problems]&lt;br /&gt;
* [https://colab.research.google.com/drive/1k60-ChM3aUWjGsiRsf2Idx9jxHHtwyAb?usp=sharing Tutorial 3] Thumb rule [https://colab.research.google.com/drive/1fdKJlp0lD4k530oRuu50_Hm_T8t3jixa?usp=sharing problems]&lt;br /&gt;
--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 17, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/15wrgivn6FSnuBUnMwjjhadmD-g1fkS7T/view?usp=sharing Lecture 2] Basic Sampling&lt;br /&gt;
&lt;br /&gt;
*  [https://drive.google.com/file/d/1ALR_QKLXdHby54xNux39NUOk4L-Ne1EW/view?usp=sharing  Lecture 3]: Errors and Precision&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 24, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1DijhG_856OAuj42WqY1UM47APmMy3A8B/view?usp=sharing Lecture 4]: Ising model and phase transitions &lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1sRUEs768Z6PKdJ3k7MixYeFGlufgjFrG Tutorial 4]: Ising model and phase transitions ([https://colab.research.google.com/drive/1KAQRog_YlAjKZ_hL1FMYurWdPBLNUocI solutions])&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
* [https://colab.research.google.com/drive/1nU4E_pFWjSFPNigzy8-LcJpef26IKY6x?usp=sharing Tutorial 4]: Ising model and phase transitions [https://colab.research.google.com/drive/1AEUX3U7hxDR_YYy8ld3knTEVR1KYa9SP?usp=sharing problems] &lt;br /&gt;
--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 1, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1PTya42ZS2kU87A-BxQFFIUDTs_k47men?usp=sharing Lecture 5]: Optimization &amp;amp; Dijkstra algorithm&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1ieT5BlfJsOehsa8r-LHGsFsn1dwYnawT Tutorial 5]: Simulated annealing ([https://colab.research.google.com/drive/1JNVl42KNASZiwTtqYo71z_vggjbGfKul solutions])&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
* [https://colab.research.google.com/drive/1p0ooWAXF9KNh-FztMHmVoA9yBzYOM8PC?usp=sharing Tutorial 5]: Simulated annealing [https://colab.research.google.com/drive/1txJGpzreHurWux7ev6sDsX8TjzpeQhZZ?usp=sharing problems]&lt;br /&gt;
--&amp;gt;&lt;br /&gt;
* Send your copy of Homework 1 to numphys.icfp  at   gmail.com  Thanks!&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1EPgj3la7vxDIqSQYNlOFz4rR0vHXAeae Homework 2] (deadline October 22)&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 8, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 6: Introduction to Bayesian inference&lt;br /&gt;
&lt;br /&gt;
* Tutorial 6: Bayesian inference and single-particle tracking. [https://drive.google.com/file/d/1q9Quq5mvJ4Avv2qWgzTocU-DVIxJIVWi/view?usp=sharing Questions]. [https://drive.google.com/file/d/1xYb4wfNBysse6Q7frTw_V9TPdUQU5lUx/view?usp=sharing Data]. [https://drive.google.com/file/d/1Ba_kRo3_XMIaDLNYZlbZEw-wGXKS-29I/view?usp=sharing Starting Notebook]. [https://colab.research.google.com/drive/1VePL9X1JT6yl8LmROeZyMyf4Epcu3yOL#scrollTo=1XQNGa_fyEkJ Google colab version]. Solutions [https://drive.google.com/file/d/1Q9IjVUeL7AA8uWk8DX9Vy9vuUQ21RYh2/view?usp=sharing]. Notebook [https://drive.google.com/file/d/1ZJmpdaTQVUttEaaI1ch-reFfZGI93454/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 15, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1eY5cuNcJqYw7df0PBkxq03tEnqzTOC-5/view?usp=sharing Lecture 7]: Importance sampling&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1iaOGxdVgk--kWUFcMDHs0zvPhsOyhB_c Tutorial 7]: Faster than the clock algorithms ([https://colab.research.google.com/drive/1bHPnJpBd5ExqKF4G5BuV_FHPE4r0_AY2#scrollTo=fQnz_gOeq40e solutions])&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
* [https://colab.research.google.com/drive/1KyT442vB4EuGKBy_Xj3j8cLtMMl4gbac?usp=sharing Tutorial 6]: Faster than the clock algorithms [https://colab.research.google.com/drive/1C-ieAwaAKwkX5MFm8aX2kNO2GNeO9CdY?usp=sharing problems]&lt;br /&gt;
--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 22, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 8: Asymptotic inference and information. Extra material: Proof of Cramer-Rao bound [https://drive.google.com/file/d/10Ph_iP6AIQ3ps9v3FwRBO9j6-qV7oKV9/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
* Tutorial 8: [https://drive.google.com/file/d/12cG4HBvzs9Oe1mbfuEYyRDmTEamW71pR/view?usp=sharing Questions]. [https://drive.google.com/file/d/1AL8sRtnqYUI8NbubfglgLazknaVIUJEo/view?usp=sharing Data ] [https://drive.google.com/file/d/1DTLzXLZUEPzoU2SsDMcAe8GaoYX8E5gH/view?usp=sharing Starting Notebook]. [https://drive.google.com/file/d/1QpMaM5ACmKUlFAyGvRnHvFVtQoEAF7-9/view?usp=sharing Bibliography] [https://drive.google.com/file/d/1p9v1PkJhwS8Ofg4RiC1nsFJAe8Mb_6WF/view?usp=sharing Solutions].  [https://drive.google.com/file/d/19erJJ4Gjw77n57VrnqaQPCxIh_-NScYT/view?usp=sharing Notebook].&lt;br /&gt;
&lt;br /&gt;
* Send your copy of Homework 2 to numphys.icfp  at   gmail.com  Thanks!&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 29, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 9: High-dimensional inference and Principal Component Analysis. Extra material: Handwritten notes on the derivation of Marcenko-Pastur spectral density [https://drive.google.com/file/d/10Yytv9itdWDDHTsM2lQHwQDMbcf-oVnd/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
* Tutorial 9: [https://drive.google.com/file/d/10y7m1mPf5R5zZN6661Eei92IUNhBL_Zu/view?usp=sharing  Replay of the neuronal activity during sleep after a task].[https://drive.google.com/file/d/11fO26XB6Ri3HDVBvtdBkYxcTRLk1iv5F/view?usp=sharing Data ]. [https://drive.google.com/file/d/1-MFN2ERs_eNs4w6XnLjfzsu2F9REluSt/view?usp=sharing Initial Notebook]. [https://drive.google.com/file/d/11ev4Zwn6DPYLwhMsLyp8S0aQFVu77Ou3/view?usp=sharing Biblio]. &lt;br /&gt;
[https://drive.google.com/file/d/11E75QwrJgDKrutGj9t5NJTRkGtuRgoBI/view?usp=sharing Solutions]. [https://drive.google.com/file/d/1-39oZNNB-35zM4V2tLWtubQnZTdMLtIz/view?usp=sharing Notebook]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, November 12, 2021, 2 pm: The Quiz.&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
The MCQ is composed of 19 questions (one of them counts for two).  For each question you have 4 choices: 3 wrong and 1 correct: If you check the correct one you get a point. If you are wrong you loose 1/4 of a point.  No answer given: zero points.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
MCQ Solution (correct answers in bold):[https://drive.google.com/file/d/1WWcqxFzmCJp2ZXC02a70a1o17pGupdyZ/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, November 26, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 10: Priors, regularisation, sparsity&lt;br /&gt;
&lt;br /&gt;
* Tutorial 10: [https://drive.google.com/file/d/14kaGKRm7uciT7uLVMW_Vqzr8ha-V-Ra2/view?usp=sharing Bayesian Inference and Priors for the analysis of gravitational waves]. [https://drive.google.com/file/d/16UTmpwKm-7UMcIbca8IIGsO-aCmcwKuD/view?usp=sharing Starting notebook on artificial data]. [https://drive.google.com/file/d/1CyiDlXs6ez9-7gnyeBU0YRgV7Nt5ibkn/view?usp=sharing Biblio][https://colab.research.google.com/drive/1pFMOawozlYOIpy0jQWkTfoq-tFp3uvhw?usp=sharing#scrollTo=6picRNBipcYN Notebook on real data] &lt;br /&gt;
[https://drive.google.com/file/d/161ZLuq5s2RpHDJWELFSKXqlf-qwrVrxA/view?usp=sharing Notebook on Artificial data] [https://drive.google.com/file/d/17qhYN8EFpcoCUHOM_juBvEGpu61GgJRx/view?usp=sharing Corrections ]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, December 3, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 11: Probabilistic graphical models&lt;br /&gt;
&lt;br /&gt;
* Tutorial 11:[https://drive.google.com/file/d/1A5pcJICHkmHZYoa2uoAGSAWp-_ZOaIEf/view?usp=sharing Analysis of protein sequence data to infer protein structure] [https://drive.google.com/file/d/1COKr5pNoBRFwwnj7TWPQSU8mEWKvsLud/view?usp=sharing Starting notebook and data] [https://drive.google.com/file/d/1CQw1PQ6RSS6nuGxhkwOqe7LJHpOPIaVp/view?usp=sharing Biblio][https://drive.google.com/file/d/1CslX27bTp5gyhXV4ciFE8s1zMnBgJ-1O/view?usp=sharing Solutions] [https://drive.google.com/file/d/19X59x3TdIsJaccTZE71gCbZxFbOzlhj4/view?usp=sharing Final notebook]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, December 10, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 12: Hidden Markov Models. Extra material: Pedagogical introduction to Kalman filters [https://drive.google.com/file/d/0B4HvoS7Zt11LZUxVLTkyVXRQRUE/view?usp=sharing&amp;amp;resourcekey=0-CzsYaRIrPP2sN-UmwfiLHQ]&lt;br /&gt;
&lt;br /&gt;
* Tutorial 12: &lt;br /&gt;
[https://drive.google.com/file/d/1FLbWZRWJ1JILZV41RjwVKR7mOhNMhLV9/view?usp=sharing Hidden Markov Models Hidden  for identification of recombinations in SARS-CoV-2 viral genomes] [https://drive.google.com/file/d/1FCAg0ihMWoAk-_dtt5ORncjVjkVu-m4D/view?usp=sharing Starting Notebook and Data][https://drive.google.com/file/d/1HMREe6ge7_K-lOKC4f2FwL7vnEa1_8Yf/view?usp=sharing Bibliography] [https://drive.google.com/file/d/1FLDBJmNtXogHiO5VfScGiePTCxMFy1KZ/view?usp=sharing Final Notebook] [https://drive.google.com/file/d/1FBQaNJ2RhjwW_VSut2oC7mZYl5F8RWfS/view?usp=sharing Solutions]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, December 17, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 13: Unsupervised learning and representations&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1p2c35gHMr4_Ptdmwsh3jGJz__9NNIgLw Tutorial 13]: How restricted Boltzmann machines learn ([https://colab.research.google.com/drive/1gnaK_vmTESTV3Ex_A1gqcee6Q58iKyld solutions])&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Final examination of the data-driven course (January 7, 2022)&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Example of exam: On-line Principal Component Analysis [https://drive.google.com/file/d/1BbRY4b3OCVYAtYH4m6ry19KcA2gkp3pH/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
* On-line version of the book [https://drive.google.com/file/d/161YHZA7i2YU-8emy6IPUFhsOXzFRxSRS/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
* Examination repository [https://drive.google.com/file/d/19DNkNBed0Ir5a9N048ZFV4_xF0KG3kcy/view?usp=sharing]&lt;br /&gt;
--&amp;gt;&lt;/div&gt;</summary>
		<author><name>Alberto</name></author>
	</entry>
	<entry>
		<id>http://www.lptms.universite-paris-saclay.fr//wiki-cours/index.php?title=CoDaDri&amp;diff=1799</id>
		<title>CoDaDri</title>
		<link rel="alternate" type="text/html" href="http://www.lptms.universite-paris-saclay.fr//wiki-cours/index.php?title=CoDaDri&amp;diff=1799"/>
		<updated>2022-09-02T09:30:10Z</updated>

		<summary type="html">&lt;p&gt;Alberto: /* Schedule */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&amp;lt;!--  =Breaking news:=&lt;br /&gt;
&lt;br /&gt;
* Homework 1 has been evaluated and sent to you. If you did not receive it, please contact us. &lt;br /&gt;
* Here you find the MCQ proposed last year &lt;br /&gt;
[https://colab.research.google.com/drive/1Ru_-IQ001XEJd9VAn4nvbBNI_3XA9QSK?usp=sharing The Quiz]&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;The Solution&#039;&#039;&#039; [https://colab.research.google.com/drive/1Faovrt0q5kRVtVsF9afr4iMXww_Wk53_?usp=sharing]  --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
= Computational and Data Driven Physics =&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Modern physics is characterized by an increasing complexity of systems under investigation, in&lt;br /&gt;
domains as diverse as condensed matter, astrophysics, biophysics, etc. Establishing adequate&lt;br /&gt;
models to describe these systems and being able to make quantitative predictions from those models&lt;br /&gt;
is extremely challenging. The goal of the course is to provide the tools and concepts necessary to tackle those systems.&lt;br /&gt;
&lt;br /&gt;
== Course description ==&lt;br /&gt;
&lt;br /&gt;
We will first cover many algorithms used in many-body problems and complex systems, with special emphasis on Monte Carlo methods, molecular dynamics, and optimization in complex landscapes. &lt;br /&gt;
&lt;br /&gt;
Second, we will provide statistical inference and machine learning tools to harness the growing availability of experimental data to design accurate models of the underlying, complex, strongly non-homogeneous and interacting systems. &lt;br /&gt;
&lt;br /&gt;
Each theoretical lecture will be followed by a tutorial illustrating the concepts with practical applications&lt;br /&gt;
borrowed from various domains of physics. We will focus on methods and algorithms and physics, not&lt;br /&gt;
on programming and heavy numerics!  You will have to hand in 3 homeworks.&lt;br /&gt;
&lt;br /&gt;
*[https://drive.google.com/file/d/11w7KI5Pi59VWLX1mqiQ8ZyY8YQHRUeMz/view?usp=sharing Preliminary version of the book: Information, Inference, Networks: From statistical physics to big biological data]&lt;br /&gt;
&lt;br /&gt;
== The Team ==&lt;br /&gt;
&lt;br /&gt;
* [http://lptms.u-psud.fr/alberto_rosso/ Alberto Rosso] (Computational physics)&lt;br /&gt;
* [http://www.phys.ens.fr/~monasson/ Rémi Monasson] (Data-driven physics)&lt;br /&gt;
*  [http://www.lps.ens.fr/~cocco/ Simona Cocco] &amp;amp; [https://www.pct.espci.fr/~david/ David Lacoste] &amp;amp; [https://www.cpht.polytechnique.fr/?q=en/node/110 Michel Ferrero] (Tutorials)&lt;br /&gt;
&lt;br /&gt;
== Where and When ==&lt;br /&gt;
&lt;br /&gt;
* Lectures on Fridays: 14:00-16:00&lt;br /&gt;
* Tutorials on Fridays: 16:00-18:00&lt;br /&gt;
* ENS, 29 rue D&#039;Ulm, salle Borel + Djebar&lt;br /&gt;
&lt;br /&gt;
== Slack ==&lt;br /&gt;
&lt;br /&gt;
If you have questions or want to discuss topics related to the lecture, to the exercises or to the homeworks, you can use the&lt;br /&gt;
[http://computational-ozw2847.slack.com Computational and Data Driven Physics Slack]. In order to join the Slack&lt;br /&gt;
use the following [https://join.slack.com/t/computational-ozw2847/shared_invite/zt-vegija8y-cx_vbF2BI6FJewx4W6coSA invitation link].&lt;br /&gt;
&lt;br /&gt;
== Computer Requirements ==&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;No previous experience in programming is required.&#039;&#039;&#039; &amp;lt;br&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Programming Language: Python&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
For practical installation, we recommand either to use  Anaconda (See [[Memento Python]]) or use google colab. &amp;lt;br&amp;gt;&lt;br /&gt;
The Collaboratory platform from Google is quite good way to use powerful computer without buying one: It requires no specific hardware or software, and even allows you to use GPU computing for free,  all by writting a jupyter notebook that you can then share.&lt;br /&gt;
&lt;br /&gt;
== Grading ==&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Computational Physics:&#039;&#039;&#039;&lt;br /&gt;
* Homework 1: 5 points &lt;br /&gt;
* Homework 2: 5 points&lt;br /&gt;
* Multiple Choice Questions in November: 10 points&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Data Driven Physics:&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Final exam in January: 20 points&lt;br /&gt;
&lt;br /&gt;
== Schedule ==&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
&#039;&#039;&#039;Friday, September 3, 2021 &#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1X9h3lKD0OZLTKtxb7DWPfynY42rRuE7j/view?usp=sharing Lecture 1]   Introduction to Monte Carlo&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1sIv3qOdyE-XYkjYC-dkNsR72f4BgaQ_y/view?usp=sharing Tutorial 1] Markov Matrix&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 10, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Introductory notebooks: [https://colab.research.google.com/drive/1Ovrh1JjLzMMnxtasDgR1j84CHGU6hMxA python], [https://colab.research.google.com/drive/14PWu-C171pYhV8ven-Txc4wz5Tv1DCsK numpy] and [https://colab.research.google.com/drive/1fPjwrdxQPSyfXniyAHmyOcF_gK2fqjts matplotlib]&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1gf7oRQIpvSvMScyJa5hexB9CCZvdozPs#scrollTo=lDznlLouvlFx Tutorial 2] - Markov matrices ([https://colab.research.google.com/drive/1x9iEHG_F522uFCvD_jGdvHaMETAHfO6-#scrollTo=eSu-nLZ6vm8X solutions])&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1tjqbjAi50C4qOqVRtTxEkTeTb10qpTms#scrollTo=uYpaubGkvogU Tutorial 3] - Thumb rule ([https://colab.research.google.com/drive/1aWVtz4ZGcpIarWiRVAnxrp1t0GDOqZxu#scrollTo=f7ohlMuZvqTr solutions])&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1g7HXFUBQUBF0fhy5h2jYbfIAVBTqvb7-#scrollTo=U9LFX8OFhHOG Homework 1] (deadline October 1)&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
* [https://colab.research.google.com/drive/1aMo4Ur-0_b4dGhdIfxAmCC2ci1rOda_v?usp=sharing Tutorial 2] Markov matrix [https://colab.research.google.com/drive/1Q5ajzxRGXBBorA9cQ9o8V5VUVJhUXpPS?usp=sharing problems]&lt;br /&gt;
* [https://colab.research.google.com/drive/1k60-ChM3aUWjGsiRsf2Idx9jxHHtwyAb?usp=sharing Tutorial 3] Thumb rule [https://colab.research.google.com/drive/1fdKJlp0lD4k530oRuu50_Hm_T8t3jixa?usp=sharing problems]&lt;br /&gt;
--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 17, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/15wrgivn6FSnuBUnMwjjhadmD-g1fkS7T/view?usp=sharing Lecture 2] Basic Sampling&lt;br /&gt;
&lt;br /&gt;
*  [https://drive.google.com/file/d/1ALR_QKLXdHby54xNux39NUOk4L-Ne1EW/view?usp=sharing  Lecture 3]: Errors and Precision&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 24, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1DijhG_856OAuj42WqY1UM47APmMy3A8B/view?usp=sharing Lecture 4]: Ising model and phase transitions &lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1sRUEs768Z6PKdJ3k7MixYeFGlufgjFrG Tutorial 4]: Ising model and phase transitions ([https://colab.research.google.com/drive/1KAQRog_YlAjKZ_hL1FMYurWdPBLNUocI solutions])&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
* [https://colab.research.google.com/drive/1nU4E_pFWjSFPNigzy8-LcJpef26IKY6x?usp=sharing Tutorial 4]: Ising model and phase transitions [https://colab.research.google.com/drive/1AEUX3U7hxDR_YYy8ld3knTEVR1KYa9SP?usp=sharing problems] &lt;br /&gt;
--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 1, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1PTya42ZS2kU87A-BxQFFIUDTs_k47men?usp=sharing Lecture 5]: Optimization &amp;amp; Dijkstra algorithm&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1ieT5BlfJsOehsa8r-LHGsFsn1dwYnawT Tutorial 5]: Simulated annealing ([https://colab.research.google.com/drive/1JNVl42KNASZiwTtqYo71z_vggjbGfKul solutions])&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
* [https://colab.research.google.com/drive/1p0ooWAXF9KNh-FztMHmVoA9yBzYOM8PC?usp=sharing Tutorial 5]: Simulated annealing [https://colab.research.google.com/drive/1txJGpzreHurWux7ev6sDsX8TjzpeQhZZ?usp=sharing problems]&lt;br /&gt;
--&amp;gt;&lt;br /&gt;
* Send your copy of Homework 1 to numphys.icfp  at   gmail.com  Thanks!&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1EPgj3la7vxDIqSQYNlOFz4rR0vHXAeae Homework 2] (deadline October 22)&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 8, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 6: Introduction to Bayesian inference&lt;br /&gt;
&lt;br /&gt;
* Tutorial 6: Bayesian inference and single-particle tracking. [https://drive.google.com/file/d/1q9Quq5mvJ4Avv2qWgzTocU-DVIxJIVWi/view?usp=sharing Questions]. [https://drive.google.com/file/d/1xYb4wfNBysse6Q7frTw_V9TPdUQU5lUx/view?usp=sharing Data]. [https://drive.google.com/file/d/1Ba_kRo3_XMIaDLNYZlbZEw-wGXKS-29I/view?usp=sharing Starting Notebook]. [https://colab.research.google.com/drive/1VePL9X1JT6yl8LmROeZyMyf4Epcu3yOL#scrollTo=1XQNGa_fyEkJ Google colab version]. Solutions [https://drive.google.com/file/d/1Q9IjVUeL7AA8uWk8DX9Vy9vuUQ21RYh2/view?usp=sharing]. Notebook [https://drive.google.com/file/d/1ZJmpdaTQVUttEaaI1ch-reFfZGI93454/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 15, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1eY5cuNcJqYw7df0PBkxq03tEnqzTOC-5/view?usp=sharing Lecture 7]: Importance sampling&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1iaOGxdVgk--kWUFcMDHs0zvPhsOyhB_c Tutorial 7]: Faster than the clock algorithms ([https://colab.research.google.com/drive/1bHPnJpBd5ExqKF4G5BuV_FHPE4r0_AY2#scrollTo=fQnz_gOeq40e solutions])&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
* [https://colab.research.google.com/drive/1KyT442vB4EuGKBy_Xj3j8cLtMMl4gbac?usp=sharing Tutorial 6]: Faster than the clock algorithms [https://colab.research.google.com/drive/1C-ieAwaAKwkX5MFm8aX2kNO2GNeO9CdY?usp=sharing problems]&lt;br /&gt;
--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 22, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 8: Asymptotic inference and information. Extra material: Proof of Cramer-Rao bound [https://drive.google.com/file/d/10Ph_iP6AIQ3ps9v3FwRBO9j6-qV7oKV9/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
* Tutorial 8: [https://drive.google.com/file/d/12cG4HBvzs9Oe1mbfuEYyRDmTEamW71pR/view?usp=sharing Questions]. [https://drive.google.com/file/d/1AL8sRtnqYUI8NbubfglgLazknaVIUJEo/view?usp=sharing Data ] [https://drive.google.com/file/d/1DTLzXLZUEPzoU2SsDMcAe8GaoYX8E5gH/view?usp=sharing Starting Notebook]. [https://drive.google.com/file/d/1QpMaM5ACmKUlFAyGvRnHvFVtQoEAF7-9/view?usp=sharing Bibliography] [https://drive.google.com/file/d/1p9v1PkJhwS8Ofg4RiC1nsFJAe8Mb_6WF/view?usp=sharing Solutions].  [https://drive.google.com/file/d/19erJJ4Gjw77n57VrnqaQPCxIh_-NScYT/view?usp=sharing Notebook].&lt;br /&gt;
&lt;br /&gt;
* Send your copy of Homework 2 to numphys.icfp  at   gmail.com  Thanks!&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 29, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 9: High-dimensional inference and Principal Component Analysis. Extra material: Handwritten notes on the derivation of Marcenko-Pastur spectral density [https://drive.google.com/file/d/10Yytv9itdWDDHTsM2lQHwQDMbcf-oVnd/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
* Tutorial 9: [https://drive.google.com/file/d/10y7m1mPf5R5zZN6661Eei92IUNhBL_Zu/view?usp=sharing  Replay of the neuronal activity during sleep after a task].[https://drive.google.com/file/d/11fO26XB6Ri3HDVBvtdBkYxcTRLk1iv5F/view?usp=sharing Data ]. [https://drive.google.com/file/d/1-MFN2ERs_eNs4w6XnLjfzsu2F9REluSt/view?usp=sharing Initial Notebook]. [https://drive.google.com/file/d/11ev4Zwn6DPYLwhMsLyp8S0aQFVu77Ou3/view?usp=sharing Biblio]. &lt;br /&gt;
[https://drive.google.com/file/d/11E75QwrJgDKrutGj9t5NJTRkGtuRgoBI/view?usp=sharing Solutions]. [https://drive.google.com/file/d/1-39oZNNB-35zM4V2tLWtubQnZTdMLtIz/view?usp=sharing Notebook]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, November 12, 2021, 2 pm: The Quiz.&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
The MCQ is composed of 19 questions (one of them counts for two).  For each question you have 4 choices: 3 wrong and 1 correct: If you check the correct one you get a point. If you are wrong you loose 1/4 of a point.  No answer given: zero points.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
MCQ Solution (correct answers in bold):[https://drive.google.com/file/d/1WWcqxFzmCJp2ZXC02a70a1o17pGupdyZ/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, November 26, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 10: Priors, regularisation, sparsity&lt;br /&gt;
&lt;br /&gt;
* Tutorial 10: [https://drive.google.com/file/d/14kaGKRm7uciT7uLVMW_Vqzr8ha-V-Ra2/view?usp=sharing Bayesian Inference and Priors for the analysis of gravitational waves]. [https://drive.google.com/file/d/16UTmpwKm-7UMcIbca8IIGsO-aCmcwKuD/view?usp=sharing Starting notebook on artificial data]. [https://drive.google.com/file/d/1CyiDlXs6ez9-7gnyeBU0YRgV7Nt5ibkn/view?usp=sharing Biblio][https://colab.research.google.com/drive/1pFMOawozlYOIpy0jQWkTfoq-tFp3uvhw?usp=sharing#scrollTo=6picRNBipcYN Notebook on real data] &lt;br /&gt;
[https://drive.google.com/file/d/161ZLuq5s2RpHDJWELFSKXqlf-qwrVrxA/view?usp=sharing Notebook on Artificial data] [https://drive.google.com/file/d/17qhYN8EFpcoCUHOM_juBvEGpu61GgJRx/view?usp=sharing Corrections ]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, December 3, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 11: Probabilistic graphical models&lt;br /&gt;
&lt;br /&gt;
* Tutorial 11:[https://drive.google.com/file/d/1A5pcJICHkmHZYoa2uoAGSAWp-_ZOaIEf/view?usp=sharing Analysis of protein sequence data to infer protein structure] [https://drive.google.com/file/d/1COKr5pNoBRFwwnj7TWPQSU8mEWKvsLud/view?usp=sharing Starting notebook and data] [https://drive.google.com/file/d/1CQw1PQ6RSS6nuGxhkwOqe7LJHpOPIaVp/view?usp=sharing Biblio][https://drive.google.com/file/d/1CslX27bTp5gyhXV4ciFE8s1zMnBgJ-1O/view?usp=sharing Solutions] [https://drive.google.com/file/d/19X59x3TdIsJaccTZE71gCbZxFbOzlhj4/view?usp=sharing Final notebook]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, December 10, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 12: Hidden Markov Models. Extra material: Pedagogical introduction to Kalman filters [https://drive.google.com/file/d/0B4HvoS7Zt11LZUxVLTkyVXRQRUE/view?usp=sharing&amp;amp;resourcekey=0-CzsYaRIrPP2sN-UmwfiLHQ]&lt;br /&gt;
&lt;br /&gt;
* Tutorial 12: &lt;br /&gt;
[https://drive.google.com/file/d/1FLbWZRWJ1JILZV41RjwVKR7mOhNMhLV9/view?usp=sharing Hidden Markov Models Hidden  for identification of recombinations in SARS-CoV-2 viral genomes] [https://drive.google.com/file/d/1FCAg0ihMWoAk-_dtt5ORncjVjkVu-m4D/view?usp=sharing Starting Notebook and Data][https://drive.google.com/file/d/1HMREe6ge7_K-lOKC4f2FwL7vnEa1_8Yf/view?usp=sharing Bibliography] [https://drive.google.com/file/d/1FLDBJmNtXogHiO5VfScGiePTCxMFy1KZ/view?usp=sharing Final Notebook] [https://drive.google.com/file/d/1FBQaNJ2RhjwW_VSut2oC7mZYl5F8RWfS/view?usp=sharing Solutions]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, December 17, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 13: Unsupervised learning and representations&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1p2c35gHMr4_Ptdmwsh3jGJz__9NNIgLw Tutorial 13]: How restricted Boltzmann machines learn ([https://colab.research.google.com/drive/1gnaK_vmTESTV3Ex_A1gqcee6Q58iKyld solutions])&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Final examination of the data-driven course (January 7, 2022)&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Example of exam: On-line Principal Component Analysis [https://drive.google.com/file/d/1BbRY4b3OCVYAtYH4m6ry19KcA2gkp3pH/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
* On-line version of the book [https://drive.google.com/file/d/161YHZA7i2YU-8emy6IPUFhsOXzFRxSRS/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
* Examination repository [https://drive.google.com/file/d/19DNkNBed0Ir5a9N048ZFV4_xF0KG3kcy/view?usp=sharing]&lt;br /&gt;
--&amp;gt;&lt;/div&gt;</summary>
		<author><name>Alberto</name></author>
	</entry>
	<entry>
		<id>http://www.lptms.universite-paris-saclay.fr//wiki-cours/index.php?title=CoDaDri&amp;diff=1798</id>
		<title>CoDaDri</title>
		<link rel="alternate" type="text/html" href="http://www.lptms.universite-paris-saclay.fr//wiki-cours/index.php?title=CoDaDri&amp;diff=1798"/>
		<updated>2022-09-02T09:28:57Z</updated>

		<summary type="html">&lt;p&gt;Alberto: /* Breaking news: */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&amp;lt;!--  =Breaking news:=&lt;br /&gt;
&lt;br /&gt;
* Homework 1 has been evaluated and sent to you. If you did not receive it, please contact us. &lt;br /&gt;
* Here you find the MCQ proposed last year &lt;br /&gt;
[https://colab.research.google.com/drive/1Ru_-IQ001XEJd9VAn4nvbBNI_3XA9QSK?usp=sharing The Quiz]&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;The Solution&#039;&#039;&#039; [https://colab.research.google.com/drive/1Faovrt0q5kRVtVsF9afr4iMXww_Wk53_?usp=sharing]  --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
= Computational and Data Driven Physics =&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Modern physics is characterized by an increasing complexity of systems under investigation, in&lt;br /&gt;
domains as diverse as condensed matter, astrophysics, biophysics, etc. Establishing adequate&lt;br /&gt;
models to describe these systems and being able to make quantitative predictions from those models&lt;br /&gt;
is extremely challenging. The goal of the course is to provide the tools and concepts necessary to tackle those systems.&lt;br /&gt;
&lt;br /&gt;
== Course description ==&lt;br /&gt;
&lt;br /&gt;
We will first cover many algorithms used in many-body problems and complex systems, with special emphasis on Monte Carlo methods, molecular dynamics, and optimization in complex landscapes. &lt;br /&gt;
&lt;br /&gt;
Second, we will provide statistical inference and machine learning tools to harness the growing availability of experimental data to design accurate models of the underlying, complex, strongly non-homogeneous and interacting systems. &lt;br /&gt;
&lt;br /&gt;
Each theoretical lecture will be followed by a tutorial illustrating the concepts with practical applications&lt;br /&gt;
borrowed from various domains of physics. We will focus on methods and algorithms and physics, not&lt;br /&gt;
on programming and heavy numerics!  You will have to hand in 3 homeworks.&lt;br /&gt;
&lt;br /&gt;
*[https://drive.google.com/file/d/11w7KI5Pi59VWLX1mqiQ8ZyY8YQHRUeMz/view?usp=sharing Preliminary version of the book: Information, Inference, Networks: From statistical physics to big biological data]&lt;br /&gt;
&lt;br /&gt;
== The Team ==&lt;br /&gt;
&lt;br /&gt;
* [http://lptms.u-psud.fr/alberto_rosso/ Alberto Rosso] (Computational physics)&lt;br /&gt;
* [http://www.phys.ens.fr/~monasson/ Rémi Monasson] (Data-driven physics)&lt;br /&gt;
*  [http://www.lps.ens.fr/~cocco/ Simona Cocco] &amp;amp; [https://www.pct.espci.fr/~david/ David Lacoste] &amp;amp; [https://www.cpht.polytechnique.fr/?q=en/node/110 Michel Ferrero] (Tutorials)&lt;br /&gt;
&lt;br /&gt;
== Where and When ==&lt;br /&gt;
&lt;br /&gt;
* Lectures on Fridays: 14:00-16:00&lt;br /&gt;
* Tutorials on Fridays: 16:00-18:00&lt;br /&gt;
* ENS, 29 rue D&#039;Ulm, salle Borel + Djebar&lt;br /&gt;
&lt;br /&gt;
== Slack ==&lt;br /&gt;
&lt;br /&gt;
If you have questions or want to discuss topics related to the lecture, to the exercises or to the homeworks, you can use the&lt;br /&gt;
[http://computational-ozw2847.slack.com Computational and Data Driven Physics Slack]. In order to join the Slack&lt;br /&gt;
use the following [https://join.slack.com/t/computational-ozw2847/shared_invite/zt-vegija8y-cx_vbF2BI6FJewx4W6coSA invitation link].&lt;br /&gt;
&lt;br /&gt;
== Computer Requirements ==&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;No previous experience in programming is required.&#039;&#039;&#039; &amp;lt;br&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Programming Language: Python&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
For practical installation, we recommand either to use  Anaconda (See [[Memento Python]]) or use google colab. &amp;lt;br&amp;gt;&lt;br /&gt;
The Collaboratory platform from Google is quite good way to use powerful computer without buying one: It requires no specific hardware or software, and even allows you to use GPU computing for free,  all by writting a jupyter notebook that you can then share.&lt;br /&gt;
&lt;br /&gt;
== Grading ==&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Computational Physics:&#039;&#039;&#039;&lt;br /&gt;
* Homework 1: 5 points &lt;br /&gt;
* Homework 2: 5 points&lt;br /&gt;
* Multiple Choice Questions in November: 10 points&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Data Driven Physics:&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Final exam in January: 20 points&lt;br /&gt;
&lt;br /&gt;
== Schedule ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 3, 2021 &#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1X9h3lKD0OZLTKtxb7DWPfynY42rRuE7j/view?usp=sharing Lecture 1]   Introduction to Monte Carlo&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1sIv3qOdyE-XYkjYC-dkNsR72f4BgaQ_y/view?usp=sharing Tutorial 1] Markov Matrix&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 10, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Introductory notebooks: [https://colab.research.google.com/drive/1Ovrh1JjLzMMnxtasDgR1j84CHGU6hMxA python], [https://colab.research.google.com/drive/14PWu-C171pYhV8ven-Txc4wz5Tv1DCsK numpy] and [https://colab.research.google.com/drive/1fPjwrdxQPSyfXniyAHmyOcF_gK2fqjts matplotlib]&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1gf7oRQIpvSvMScyJa5hexB9CCZvdozPs#scrollTo=lDznlLouvlFx Tutorial 2] - Markov matrices ([https://colab.research.google.com/drive/1x9iEHG_F522uFCvD_jGdvHaMETAHfO6-#scrollTo=eSu-nLZ6vm8X solutions])&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1tjqbjAi50C4qOqVRtTxEkTeTb10qpTms#scrollTo=uYpaubGkvogU Tutorial 3] - Thumb rule ([https://colab.research.google.com/drive/1aWVtz4ZGcpIarWiRVAnxrp1t0GDOqZxu#scrollTo=f7ohlMuZvqTr solutions])&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1g7HXFUBQUBF0fhy5h2jYbfIAVBTqvb7-#scrollTo=U9LFX8OFhHOG Homework 1] (deadline October 1)&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
* [https://colab.research.google.com/drive/1aMo4Ur-0_b4dGhdIfxAmCC2ci1rOda_v?usp=sharing Tutorial 2] Markov matrix [https://colab.research.google.com/drive/1Q5ajzxRGXBBorA9cQ9o8V5VUVJhUXpPS?usp=sharing problems]&lt;br /&gt;
* [https://colab.research.google.com/drive/1k60-ChM3aUWjGsiRsf2Idx9jxHHtwyAb?usp=sharing Tutorial 3] Thumb rule [https://colab.research.google.com/drive/1fdKJlp0lD4k530oRuu50_Hm_T8t3jixa?usp=sharing problems]&lt;br /&gt;
--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 17, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/15wrgivn6FSnuBUnMwjjhadmD-g1fkS7T/view?usp=sharing Lecture 2] Basic Sampling&lt;br /&gt;
&lt;br /&gt;
*  [https://drive.google.com/file/d/1ALR_QKLXdHby54xNux39NUOk4L-Ne1EW/view?usp=sharing  Lecture 3]: Errors and Precision&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 24, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1DijhG_856OAuj42WqY1UM47APmMy3A8B/view?usp=sharing Lecture 4]: Ising model and phase transitions &lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1sRUEs768Z6PKdJ3k7MixYeFGlufgjFrG Tutorial 4]: Ising model and phase transitions ([https://colab.research.google.com/drive/1KAQRog_YlAjKZ_hL1FMYurWdPBLNUocI solutions])&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
* [https://colab.research.google.com/drive/1nU4E_pFWjSFPNigzy8-LcJpef26IKY6x?usp=sharing Tutorial 4]: Ising model and phase transitions [https://colab.research.google.com/drive/1AEUX3U7hxDR_YYy8ld3knTEVR1KYa9SP?usp=sharing problems] &lt;br /&gt;
--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 1, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1PTya42ZS2kU87A-BxQFFIUDTs_k47men?usp=sharing Lecture 5]: Optimization &amp;amp; Dijkstra algorithm&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1ieT5BlfJsOehsa8r-LHGsFsn1dwYnawT Tutorial 5]: Simulated annealing ([https://colab.research.google.com/drive/1JNVl42KNASZiwTtqYo71z_vggjbGfKul solutions])&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
* [https://colab.research.google.com/drive/1p0ooWAXF9KNh-FztMHmVoA9yBzYOM8PC?usp=sharing Tutorial 5]: Simulated annealing [https://colab.research.google.com/drive/1txJGpzreHurWux7ev6sDsX8TjzpeQhZZ?usp=sharing problems]&lt;br /&gt;
--&amp;gt;&lt;br /&gt;
* Send your copy of Homework 1 to numphys.icfp  at   gmail.com  Thanks!&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1EPgj3la7vxDIqSQYNlOFz4rR0vHXAeae Homework 2] (deadline October 22)&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 8, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 6: Introduction to Bayesian inference&lt;br /&gt;
&lt;br /&gt;
* Tutorial 6: Bayesian inference and single-particle tracking. [https://drive.google.com/file/d/1q9Quq5mvJ4Avv2qWgzTocU-DVIxJIVWi/view?usp=sharing Questions]. [https://drive.google.com/file/d/1xYb4wfNBysse6Q7frTw_V9TPdUQU5lUx/view?usp=sharing Data]. [https://drive.google.com/file/d/1Ba_kRo3_XMIaDLNYZlbZEw-wGXKS-29I/view?usp=sharing Starting Notebook]. [https://colab.research.google.com/drive/1VePL9X1JT6yl8LmROeZyMyf4Epcu3yOL#scrollTo=1XQNGa_fyEkJ Google colab version]. Solutions [https://drive.google.com/file/d/1Q9IjVUeL7AA8uWk8DX9Vy9vuUQ21RYh2/view?usp=sharing]. Notebook [https://drive.google.com/file/d/1ZJmpdaTQVUttEaaI1ch-reFfZGI93454/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 15, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1eY5cuNcJqYw7df0PBkxq03tEnqzTOC-5/view?usp=sharing Lecture 7]: Importance sampling&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1iaOGxdVgk--kWUFcMDHs0zvPhsOyhB_c Tutorial 7]: Faster than the clock algorithms ([https://colab.research.google.com/drive/1bHPnJpBd5ExqKF4G5BuV_FHPE4r0_AY2#scrollTo=fQnz_gOeq40e solutions])&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
* [https://colab.research.google.com/drive/1KyT442vB4EuGKBy_Xj3j8cLtMMl4gbac?usp=sharing Tutorial 6]: Faster than the clock algorithms [https://colab.research.google.com/drive/1C-ieAwaAKwkX5MFm8aX2kNO2GNeO9CdY?usp=sharing problems]&lt;br /&gt;
--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 22, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 8: Asymptotic inference and information. Extra material: Proof of Cramer-Rao bound [https://drive.google.com/file/d/10Ph_iP6AIQ3ps9v3FwRBO9j6-qV7oKV9/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
* Tutorial 8: [https://drive.google.com/file/d/12cG4HBvzs9Oe1mbfuEYyRDmTEamW71pR/view?usp=sharing Questions]. [https://drive.google.com/file/d/1AL8sRtnqYUI8NbubfglgLazknaVIUJEo/view?usp=sharing Data ] [https://drive.google.com/file/d/1DTLzXLZUEPzoU2SsDMcAe8GaoYX8E5gH/view?usp=sharing Starting Notebook]. [https://drive.google.com/file/d/1QpMaM5ACmKUlFAyGvRnHvFVtQoEAF7-9/view?usp=sharing Bibliography] [https://drive.google.com/file/d/1p9v1PkJhwS8Ofg4RiC1nsFJAe8Mb_6WF/view?usp=sharing Solutions].  [https://drive.google.com/file/d/19erJJ4Gjw77n57VrnqaQPCxIh_-NScYT/view?usp=sharing Notebook].&lt;br /&gt;
&lt;br /&gt;
* Send your copy of Homework 2 to numphys.icfp  at   gmail.com  Thanks!&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 29, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 9: High-dimensional inference and Principal Component Analysis. Extra material: Handwritten notes on the derivation of Marcenko-Pastur spectral density [https://drive.google.com/file/d/10Yytv9itdWDDHTsM2lQHwQDMbcf-oVnd/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
* Tutorial 9: [https://drive.google.com/file/d/10y7m1mPf5R5zZN6661Eei92IUNhBL_Zu/view?usp=sharing  Replay of the neuronal activity during sleep after a task].[https://drive.google.com/file/d/11fO26XB6Ri3HDVBvtdBkYxcTRLk1iv5F/view?usp=sharing Data ]. [https://drive.google.com/file/d/1-MFN2ERs_eNs4w6XnLjfzsu2F9REluSt/view?usp=sharing Initial Notebook]. [https://drive.google.com/file/d/11ev4Zwn6DPYLwhMsLyp8S0aQFVu77Ou3/view?usp=sharing Biblio]. &lt;br /&gt;
[https://drive.google.com/file/d/11E75QwrJgDKrutGj9t5NJTRkGtuRgoBI/view?usp=sharing Solutions]. [https://drive.google.com/file/d/1-39oZNNB-35zM4V2tLWtubQnZTdMLtIz/view?usp=sharing Notebook]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, November 12, 2021, 2 pm: The Quiz.&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
The MCQ is composed of 19 questions (one of them counts for two).  For each question you have 4 choices: 3 wrong and 1 correct: If you check the correct one you get a point. If you are wrong you loose 1/4 of a point.  No answer given: zero points.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
MCQ Solution (correct answers in bold):[https://drive.google.com/file/d/1WWcqxFzmCJp2ZXC02a70a1o17pGupdyZ/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, November 26, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 10: Priors, regularisation, sparsity&lt;br /&gt;
&lt;br /&gt;
* Tutorial 10: [https://drive.google.com/file/d/14kaGKRm7uciT7uLVMW_Vqzr8ha-V-Ra2/view?usp=sharing Bayesian Inference and Priors for the analysis of gravitational waves]. [https://drive.google.com/file/d/16UTmpwKm-7UMcIbca8IIGsO-aCmcwKuD/view?usp=sharing Starting notebook on artificial data]. [https://drive.google.com/file/d/1CyiDlXs6ez9-7gnyeBU0YRgV7Nt5ibkn/view?usp=sharing Biblio][https://colab.research.google.com/drive/1pFMOawozlYOIpy0jQWkTfoq-tFp3uvhw?usp=sharing#scrollTo=6picRNBipcYN Notebook on real data] &lt;br /&gt;
[https://drive.google.com/file/d/161ZLuq5s2RpHDJWELFSKXqlf-qwrVrxA/view?usp=sharing Notebook on Artificial data] [https://drive.google.com/file/d/17qhYN8EFpcoCUHOM_juBvEGpu61GgJRx/view?usp=sharing Corrections ]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, December 3, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 11: Probabilistic graphical models&lt;br /&gt;
&lt;br /&gt;
* Tutorial 11:[https://drive.google.com/file/d/1A5pcJICHkmHZYoa2uoAGSAWp-_ZOaIEf/view?usp=sharing Analysis of protein sequence data to infer protein structure] [https://drive.google.com/file/d/1COKr5pNoBRFwwnj7TWPQSU8mEWKvsLud/view?usp=sharing Starting notebook and data] [https://drive.google.com/file/d/1CQw1PQ6RSS6nuGxhkwOqe7LJHpOPIaVp/view?usp=sharing Biblio][https://drive.google.com/file/d/1CslX27bTp5gyhXV4ciFE8s1zMnBgJ-1O/view?usp=sharing Solutions] [https://drive.google.com/file/d/19X59x3TdIsJaccTZE71gCbZxFbOzlhj4/view?usp=sharing Final notebook]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, December 10, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 12: Hidden Markov Models. Extra material: Pedagogical introduction to Kalman filters [https://drive.google.com/file/d/0B4HvoS7Zt11LZUxVLTkyVXRQRUE/view?usp=sharing&amp;amp;resourcekey=0-CzsYaRIrPP2sN-UmwfiLHQ]&lt;br /&gt;
&lt;br /&gt;
* Tutorial 12: &lt;br /&gt;
[https://drive.google.com/file/d/1FLbWZRWJ1JILZV41RjwVKR7mOhNMhLV9/view?usp=sharing Hidden Markov Models Hidden  for identification of recombinations in SARS-CoV-2 viral genomes] [https://drive.google.com/file/d/1FCAg0ihMWoAk-_dtt5ORncjVjkVu-m4D/view?usp=sharing Starting Notebook and Data][https://drive.google.com/file/d/1HMREe6ge7_K-lOKC4f2FwL7vnEa1_8Yf/view?usp=sharing Bibliography] [https://drive.google.com/file/d/1FLDBJmNtXogHiO5VfScGiePTCxMFy1KZ/view?usp=sharing Final Notebook] [https://drive.google.com/file/d/1FBQaNJ2RhjwW_VSut2oC7mZYl5F8RWfS/view?usp=sharing Solutions]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, December 17, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 13: Unsupervised learning and representations&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1p2c35gHMr4_Ptdmwsh3jGJz__9NNIgLw Tutorial 13]: How restricted Boltzmann machines learn ([https://colab.research.google.com/drive/1gnaK_vmTESTV3Ex_A1gqcee6Q58iKyld solutions])&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Final examination of the data-driven course (January 7, 2022)&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Example of exam: On-line Principal Component Analysis [https://drive.google.com/file/d/1BbRY4b3OCVYAtYH4m6ry19KcA2gkp3pH/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
* On-line version of the book [https://drive.google.com/file/d/161YHZA7i2YU-8emy6IPUFhsOXzFRxSRS/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
* Examination repository [https://drive.google.com/file/d/19DNkNBed0Ir5a9N048ZFV4_xF0KG3kcy/view?usp=sharing]&lt;/div&gt;</summary>
		<author><name>Alberto</name></author>
	</entry>
	<entry>
		<id>http://www.lptms.universite-paris-saclay.fr//wiki-cours/index.php?title=CoDaDri2&amp;diff=1797</id>
		<title>CoDaDri2</title>
		<link rel="alternate" type="text/html" href="http://www.lptms.universite-paris-saclay.fr//wiki-cours/index.php?title=CoDaDri2&amp;diff=1797"/>
		<updated>2022-09-01T17:12:37Z</updated>

		<summary type="html">&lt;p&gt;Alberto: /* Where and When */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&amp;lt;!-- This is a comment&lt;br /&gt;
=Breaking news:=&lt;br /&gt;
&lt;br /&gt;
* Update with course schedule&lt;br /&gt;
&lt;br /&gt;
= Computational and Data Driven Physics =&lt;br /&gt;
--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
This is the official page for the year 2022-2023 of the Computational and Data-Driven Physics (CoDaDri) course.&lt;br /&gt;
== Course description ==&lt;br /&gt;
&lt;br /&gt;
Modern physics is characterized by an increasing complexity of systems under investigation, in&lt;br /&gt;
domains as diverse as condensed matter, astrophysics, biophysics, etc. Establishing adequate&lt;br /&gt;
models to describe these systems and being able to make quantitative predictions from those models&lt;br /&gt;
is extremely challenging. The goal of the course is to provide the tools and concepts necessary to tackle those systems.&lt;br /&gt;
&lt;br /&gt;
We will first cover many algorithms used in many-body problems and complex systems, with special emphasis on Monte Carlo methods, molecular dynamics, and optimization in complex landscapes. &lt;br /&gt;
&lt;br /&gt;
Second, we will provide statistical inference and machine learning tools to harness the growing availability of experimental data to design accurate models of the underlying, complex, strongly non-homogeneous and interacting systems. &lt;br /&gt;
&lt;br /&gt;
Each theoretical lecture will be followed by a tutorial illustrating the concepts with practical applications&lt;br /&gt;
borrowed from various domains of physics. We will focus on methods and algorithms and physics, not&lt;br /&gt;
on programming and heavy numerics!  You will have to hand in 3 homeworks.&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!-- *[https://drive.google.com/file/d/11w7KI5Pi59VWLX1mqiQ8ZyY8YQHRUeMz/view?usp=sharing Preliminary version of the book: Information, Inference, Networks: From statistical physics to big biological data] --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== The Team ==&lt;br /&gt;
&lt;br /&gt;
* [http://lptms.u-psud.fr/alberto_rosso/ Alberto Rosso] (Computational physics)&lt;br /&gt;
* [http://www.phys.ens.fr/~monasson/ Rémi Monasson] (Data-driven physics)&lt;br /&gt;
*  [http://www.lps.ens.fr/~cocco/ Simona Cocco]  &amp;amp; [https://www.cpht.polytechnique.fr/?q=en/node/110 Michel Ferrero] (Tutorials)&lt;br /&gt;
* [https://github.com/Schimmenti Vincenzo Maria Schimmenti] (Tutor)&lt;br /&gt;
&lt;br /&gt;
== Where and When ==&lt;br /&gt;
&lt;br /&gt;
* Lectures on Fridays: 14:00-16:00&lt;br /&gt;
* Tutorials on Fridays: 16:00-18:00&lt;br /&gt;
* CONDORCET salle 304 A&lt;br /&gt;
&lt;br /&gt;
== Slack ==&lt;br /&gt;
&lt;br /&gt;
If you have questions or want to discuss topics related to the lecture, to the exercises or to the homeworks, you can use the&lt;br /&gt;
[https://computational-prb2883.slack.com/ssb/redirect Computational and Data Driven Physics Slack]. In order to join the Slack&lt;br /&gt;
use the following [https://join.slack.com/t/computational-prb2883/shared_invite/zt-1fbx1i96a-CRDyBiOr~cn0LCdJZv~fEw invitation link].&lt;br /&gt;
&lt;br /&gt;
== Computer Requirements ==&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;No previous experience in programming is required.&#039;&#039;&#039; &amp;lt;br&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Programming Language: Python&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
For practical installation, we recommand either to use  Anaconda (See [[Memento Python]]) or use google colab. &amp;lt;br&amp;gt;&lt;br /&gt;
The [https://colab.research.google.com Colab platform] from Google is quite good way to use powerful computer without buying one: It requires no specific hardware or software, and even allows you to use GPU computing for free,  all by writting a jupyter notebook that you can then share.&lt;br /&gt;
&lt;br /&gt;
== Grading ==&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Computational Physics:&#039;&#039;&#039;&lt;br /&gt;
* Homework 1: 5 points &lt;br /&gt;
* Homework 2: 5 points&lt;br /&gt;
* Multiple Choice Questions in November: 10 points&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Data Driven Physics:&#039;&#039;&#039;&lt;br /&gt;
* Homework 3: 5 points&lt;br /&gt;
* Final exam in January: 15 points&lt;br /&gt;
&lt;br /&gt;
== Schedule Computational Physics ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 2, 2022 &#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1X9h3lKD0OZLTKtxb7DWPfynY42rRuE7j/view?usp=sharing Lecture 1]   Introduction to Monte Carlo&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1gf7oRQIpvSvMScyJa5hexB9CCZvdozPs#scrollTo=lDznlLouvlFx Tutorial 1] Markov matrices &amp;lt;!-- ([https://colab.research.google.com/drive/1x9iEHG_F522uFCvD_jGdvHaMETAHfO6-#scrollTo=eSu-nLZ6vm8X solutions]) --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1g7HXFUBQUBF0fhy5h2jYbfIAVBTqvb7-#scrollTo=U9LFX8OFhHOG Homework 1] (deadline September 23)&lt;br /&gt;
&lt;br /&gt;
* Introductory notebooks: [https://colab.research.google.com/drive/1Ovrh1JjLzMMnxtasDgR1j84CHGU6hMxA python], [https://colab.research.google.com/drive/14PWu-C171pYhV8ven-Txc4wz5Tv1DCsK numpy] and [https://colab.research.google.com/drive/1fPjwrdxQPSyfXniyAHmyOcF_gK2fqjts matplotlib]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 9, 2022&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/15wrgivn6FSnuBUnMwjjhadmD-g1fkS7T/view?usp=sharing Lecture 2] Basic Sampling&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1tjqbjAi50C4qOqVRtTxEkTeTb10qpTms#scrollTo=uYpaubGkvogU Tutorial 2] Thumb rule &amp;lt;!-- ([https://colab.research.google.com/drive/1aWVtz4ZGcpIarWiRVAnxrp1t0GDOqZxu#scrollTo=f7ohlMuZvqTr solutions]) --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 16, 2022&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1eY5cuNcJqYw7df0PBkxq03tEnqzTOC-5/view?usp=sharing Lecture 3 ]: Importance sampling&lt;br /&gt;
&lt;br /&gt;
*  [https://drive.google.com/file/d/1ALR_QKLXdHby54xNux39NUOk4L-Ne1EW/view?usp=sharing  Tutorial 3]: Errors and Precision&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 23, 2022&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1DijhG_856OAuj42WqY1UM47APmMy3A8B/view?usp=sharing Lecture 4]: Ising model and phase transitions &lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1sRUEs768Z6PKdJ3k7MixYeFGlufgjFrG Tutorial 4]: Ising model and phase transitions &amp;lt;!-- ([https://colab.research.google.com/drive/1KAQRog_YlAjKZ_hL1FMYurWdPBLNUocI solutions]) --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
* Send your copy of Homework 1 to numphys.icfp  at   gmail.com  Thanks!&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1EPgj3la7vxDIqSQYNlOFz4rR0vHXAeae Homework 2] (deadline October 14)&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 30, 2022&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1PTya42ZS2kU87A-BxQFFIUDTs_k47men?usp=sharing Lecture 5]: Optimization &amp;amp; Dijkstra algorithm&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1ieT5BlfJsOehsa8r-LHGsFsn1dwYnawT Tutorial 5]: Simulated annealing &amp;lt;!-- ([https://colab.research.google.com/drive/1JNVl42KNASZiwTtqYo71z_vggjbGfKul solutions]) --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 7, 2022&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Test: &lt;br /&gt;
&lt;br /&gt;
The MCQ is composed of 19 questions (one of them counts for two).  For each question you have 4 choices: 3 wrong and 1 correct: If you check the correct one you get a point. If you are wrong you loose 1/4 of a point.  No answer given: zero points.&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1iaOGxdVgk--kWUFcMDHs0zvPhsOyhB_c Tutorial 6]: Faster than the clock algorithms &amp;lt;!--([https://colab.research.google.com/drive/1bHPnJpBd5ExqKF4G5BuV_FHPE4r0_AY2#scrollTo=fQnz_gOeq40e solutions])--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== Schedule Data-driven Physics ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 14, 2022&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 7: Introduction to Bayesian inference&lt;br /&gt;
&lt;br /&gt;
* Tutorial 7: Bayesian inference and single-particle tracking. [https://drive.google.com/file/d/1q9Quq5mvJ4Avv2qWgzTocU-DVIxJIVWi/view?usp=sharing Questions]. [https://drive.google.com/file/d/1xYb4wfNBysse6Q7frTw_V9TPdUQU5lUx/view?usp=sharing Data]. [https://drive.google.com/file/d/1Ba_kRo3_XMIaDLNYZlbZEw-wGXKS-29I/view?usp=sharing Starting Notebook]. [https://colab.research.google.com/drive/1VePL9X1JT6yl8LmROeZyMyf4Epcu3yOL#scrollTo=1XQNGa_fyEkJ Google colab version]. Solutions [https://drive.google.com/file/d/1Q9IjVUeL7AA8uWk8DX9Vy9vuUQ21RYh2/view?usp=sharing]. Notebook [https://drive.google.com/file/d/1ZJmpdaTQVUttEaaI1ch-reFfZGI93454/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
* Send your copy of Homework 2 to numphys.icfp  at   gmail.com  Thanks!&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 21, 2022&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 8: Asymptotic inference and information. Extra material: Proof of Cramer-Rao bound [https://drive.google.com/file/d/10Ph_iP6AIQ3ps9v3FwRBO9j6-qV7oKV9/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
* Tutorial 8: [https://drive.google.com/file/d/12cG4HBvzs9Oe1mbfuEYyRDmTEamW71pR/view?usp=sharing Questions]. [https://drive.google.com/file/d/1AL8sRtnqYUI8NbubfglgLazknaVIUJEo/view?usp=sharing Data ] [https://drive.google.com/file/d/1DTLzXLZUEPzoU2SsDMcAe8GaoYX8E5gH/view?usp=sharing Starting Notebook]. [https://drive.google.com/file/d/1QpMaM5ACmKUlFAyGvRnHvFVtQoEAF7-9/view?usp=sharing Bibliography] [https://drive.google.com/file/d/1p9v1PkJhwS8Ofg4RiC1nsFJAe8Mb_6WF/view?usp=sharing Solutions].  [https://drive.google.com/file/d/19erJJ4Gjw77n57VrnqaQPCxIh_-NScYT/view?usp=sharing Notebook].&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 28, 2022&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 9: High-dimensional inference and Principal Component Analysis. Extra material: Handwritten notes on the derivation of Marcenko-Pastur spectral density [https://drive.google.com/file/d/10Yytv9itdWDDHTsM2lQHwQDMbcf-oVnd/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
* Tutorial 9: [https://drive.google.com/file/d/10y7m1mPf5R5zZN6661Eei92IUNhBL_Zu/view?usp=sharing  Replay of the neuronal activity during sleep after a task].[https://drive.google.com/file/d/11fO26XB6Ri3HDVBvtdBkYxcTRLk1iv5F/view?usp=sharing Data ]. [https://drive.google.com/file/d/1-MFN2ERs_eNs4w6XnLjfzsu2F9REluSt/view?usp=sharing Initial Notebook]. [https://drive.google.com/file/d/11ev4Zwn6DPYLwhMsLyp8S0aQFVu77Ou3/view?usp=sharing Biblio]. &lt;br /&gt;
[https://drive.google.com/file/d/11E75QwrJgDKrutGj9t5NJTRkGtuRgoBI/view?usp=sharing Solutions]. [https://drive.google.com/file/d/1-39oZNNB-35zM4V2tLWtubQnZTdMLtIz/view?usp=sharing Notebook]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, November 25, 2022&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 10: Priors, regularisation, sparsity&lt;br /&gt;
&lt;br /&gt;
* Tutorial 10: [https://drive.google.com/file/d/14kaGKRm7uciT7uLVMW_Vqzr8ha-V-Ra2/view?usp=sharing Bayesian Inference and Priors for the analysis of gravitational waves]. [https://drive.google.com/file/d/16UTmpwKm-7UMcIbca8IIGsO-aCmcwKuD/view?usp=sharing Starting notebook on artificial data]. [https://drive.google.com/file/d/1CyiDlXs6ez9-7gnyeBU0YRgV7Nt5ibkn/view?usp=sharing Biblio][https://colab.research.google.com/drive/1pFMOawozlYOIpy0jQWkTfoq-tFp3uvhw?usp=sharing#scrollTo=6picRNBipcYN Notebook on real data] &lt;br /&gt;
[https://drive.google.com/file/d/161ZLuq5s2RpHDJWELFSKXqlf-qwrVrxA/view?usp=sharing Notebook on Artificial data] [https://drive.google.com/file/d/17qhYN8EFpcoCUHOM_juBvEGpu61GgJRx/view?usp=sharing Corrections ]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, December 2, 2022&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 11: Probabilistic graphical models&lt;br /&gt;
&lt;br /&gt;
* Tutorial 11:[https://drive.google.com/file/d/1A5pcJICHkmHZYoa2uoAGSAWp-_ZOaIEf/view?usp=sharing Analysis of protein sequence data to infer protein structure] [https://drive.google.com/file/d/1COKr5pNoBRFwwnj7TWPQSU8mEWKvsLud/view?usp=sharing Starting notebook and data] [https://drive.google.com/file/d/1CQw1PQ6RSS6nuGxhkwOqe7LJHpOPIaVp/view?usp=sharing Biblio][https://drive.google.com/file/d/1CslX27bTp5gyhXV4ciFE8s1zMnBgJ-1O/view?usp=sharing Solutions] [https://drive.google.com/file/d/19X59x3TdIsJaccTZE71gCbZxFbOzlhj4/view?usp=sharing Final notebook]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, December 9, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 12: Hidden Markov Models. Extra material: Pedagogical introduction to Kalman filters [https://drive.google.com/file/d/0B4HvoS7Zt11LZUxVLTkyVXRQRUE/view?usp=sharing&amp;amp;resourcekey=0-CzsYaRIrPP2sN-UmwfiLHQ]&lt;br /&gt;
&lt;br /&gt;
* Tutorial 12: &lt;br /&gt;
[https://drive.google.com/file/d/1FLbWZRWJ1JILZV41RjwVKR7mOhNMhLV9/view?usp=sharing Hidden Markov Models Hidden  for identification of recombinations in SARS-CoV-2 viral genomes] [https://drive.google.com/file/d/1FCAg0ihMWoAk-_dtt5ORncjVjkVu-m4D/view?usp=sharing Starting Notebook and Data][https://drive.google.com/file/d/1HMREe6ge7_K-lOKC4f2FwL7vnEa1_8Yf/view?usp=sharing Bibliography] [https://drive.google.com/file/d/1FLDBJmNtXogHiO5VfScGiePTCxMFy1KZ/view?usp=sharing Final Notebook] [https://drive.google.com/file/d/1FBQaNJ2RhjwW_VSut2oC7mZYl5F8RWfS/view?usp=sharing Solutions]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, December 16, 2022&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 13: Unsupervised learning and representations&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1p2c35gHMr4_Ptdmwsh3jGJz__9NNIgLw Tutorial 13]: How restricted Boltzmann machines learn ([https://colab.research.google.com/drive/1gnaK_vmTESTV3Ex_A1gqcee6Q58iKyld solutions])&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!-- &#039;&#039;&#039;Final examination of the data-driven course (January 7, 2022)&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Example of exam: On-line Principal Component Analysis [https://drive.google.com/file/d/1BbRY4b3OCVYAtYH4m6ry19KcA2gkp3pH/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
* On-line version of the book [https://drive.google.com/file/d/161YHZA7i2YU-8emy6IPUFhsOXzFRxSRS/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
* Examination repository [https://drive.google.com/file/d/19DNkNBed0Ir5a9N048ZFV4_xF0KG3kcy/view?usp=sharing] --&amp;gt;&lt;/div&gt;</summary>
		<author><name>Alberto</name></author>
	</entry>
	<entry>
		<id>http://www.lptms.universite-paris-saclay.fr//wiki-cours/index.php?title=CoDaDri2&amp;diff=1765</id>
		<title>CoDaDri2</title>
		<link rel="alternate" type="text/html" href="http://www.lptms.universite-paris-saclay.fr//wiki-cours/index.php?title=CoDaDri2&amp;diff=1765"/>
		<updated>2022-06-22T13:49:28Z</updated>

		<summary type="html">&lt;p&gt;Alberto: /* Schedule */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;=Breaking news:=&lt;br /&gt;
&lt;br /&gt;
* Update with course schedule&lt;br /&gt;
&lt;br /&gt;
= Computational and Data Driven Physics =&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Modern physics is characterized by an increasing complexity of systems under investigation, in&lt;br /&gt;
domains as diverse as condensed matter, astrophysics, biophysics, etc. Establishing adequate&lt;br /&gt;
models to describe these systems and being able to make quantitative predictions from those models&lt;br /&gt;
is extremely challenging. The goal of the course is to provide the tools and concepts necessary to tackle those systems.&lt;br /&gt;
&lt;br /&gt;
== Course description ==&lt;br /&gt;
&lt;br /&gt;
We will first cover many algorithms used in many-body problems and complex systems, with special emphasis on Monte Carlo methods, molecular dynamics, and optimization in complex landscapes. &lt;br /&gt;
&lt;br /&gt;
Second, we will provide statistical inference and machine learning tools to harness the growing availability of experimental data to design accurate models of the underlying, complex, strongly non-homogeneous and interacting systems. &lt;br /&gt;
&lt;br /&gt;
Each theoretical lecture will be followed by a tutorial illustrating the concepts with practical applications&lt;br /&gt;
borrowed from various domains of physics. We will focus on methods and algorithms and physics, not&lt;br /&gt;
on programming and heavy numerics!  You will have to hand in 3 homeworks.&lt;br /&gt;
&lt;br /&gt;
*[https://drive.google.com/file/d/11w7KI5Pi59VWLX1mqiQ8ZyY8YQHRUeMz/view?usp=sharing Preliminary version of the book: Information, Inference, Networks: From statistical physics to big biological data]&lt;br /&gt;
&lt;br /&gt;
== The Team ==&lt;br /&gt;
&lt;br /&gt;
* [http://lptms.u-psud.fr/alberto_rosso/ Alberto Rosso] (Computational physics)&lt;br /&gt;
* [http://www.phys.ens.fr/~monasson/ Rémi Monasson] (Data-driven physics)&lt;br /&gt;
*  [http://www.lps.ens.fr/~cocco/ Simona Cocco]  &amp;amp; [https://www.cpht.polytechnique.fr/?q=en/node/110 Michel Ferrero] (Tutorials)&lt;br /&gt;
* [ Vincenzo Maria Schimmenti] (Tutor)&lt;br /&gt;
&lt;br /&gt;
== Where and When ==&lt;br /&gt;
&lt;br /&gt;
* Lectures on Fridays: 14:00-16:00&lt;br /&gt;
* Tutorials on Fridays: 16:00-18:00&lt;br /&gt;
* ENS, 29 rue D&#039;Ulm, salle Borel + Djebar&lt;br /&gt;
&lt;br /&gt;
== Slack ==&lt;br /&gt;
&lt;br /&gt;
If you have questions or want to discuss topics related to the lecture, to the exercises or to the homeworks, you can use the&lt;br /&gt;
[XXX Computational and Data Driven Physics Slack]. In order to join the Slack&lt;br /&gt;
use the following [XXX invitation link].&lt;br /&gt;
&lt;br /&gt;
== Computer Requirements ==&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;No previous experience in programming is required.&#039;&#039;&#039; &amp;lt;br&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Programming Language: Python&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
For practical installation, we recommand either to use  Anaconda (See [[Memento Python]]) or use google colab. &amp;lt;br&amp;gt;&lt;br /&gt;
The Collaboratory platform from Google is quite good way to use powerful computer without buying one: It requires no specific hardware or software, and even allows you to use GPU computing for free,  all by writting a jupyter notebook that you can then share.&lt;br /&gt;
&lt;br /&gt;
== Grading ==&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Computational Physics:&#039;&#039;&#039;&lt;br /&gt;
* Homework 1: 5 points &lt;br /&gt;
* Homework 2: 5 points&lt;br /&gt;
* Multiple Choice Questions in November: 10 points&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Data Driven Physics:&#039;&#039;&#039;&lt;br /&gt;
* Homework 3: 5 points&lt;br /&gt;
* Final exam in January: 15 points&lt;br /&gt;
&lt;br /&gt;
== Schedule ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 2, 2022 &#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1X9h3lKD0OZLTKtxb7DWPfynY42rRuE7j/view?usp=sharing Lecture 1]   Introduction to Monte Carlo&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1sIv3qOdyE-XYkjYC-dkNsR72f4BgaQ_y/view?usp=sharing Tutorial 1] Markov Matrix&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1g7HXFUBQUBF0fhy5h2jYbfIAVBTqvb7-#scrollTo=U9LFX8OFhHOG Homework 1] (deadline September 23)&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 9, 2022&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/15wrgivn6FSnuBUnMwjjhadmD-g1fkS7T/view?usp=sharing Lecture 2] Basic Sampling&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1gf7oRQIpvSvMScyJa5hexB9CCZvdozPs#scrollTo=lDznlLouvlFx Tutorial 2] [https://colab.research.google.com/drive/1tjqbjAi50C4qOqVRtTxEkTeTb10qpTms#scrollTo=uYpaubGkvogU Tutorial 2 b]  - Markov matrices &amp;amp;  Thumb rule ([https://colab.research.google.com/drive/1x9iEHG_F522uFCvD_jGdvHaMETAHfO6-#scrollTo=eSu-nLZ6vm8X solutions]) ([https://colab.research.google.com/drive/1aWVtz4ZGcpIarWiRVAnxrp1t0GDOqZxu#scrollTo=f7ohlMuZvqTr solutionsB])&lt;br /&gt;
&lt;br /&gt;
* Introductory notebooks: [https://colab.research.google.com/drive/1Ovrh1JjLzMMnxtasDgR1j84CHGU6hMxA python], [https://colab.research.google.com/drive/14PWu-C171pYhV8ven-Txc4wz5Tv1DCsK numpy] and [https://colab.research.google.com/drive/1fPjwrdxQPSyfXniyAHmyOcF_gK2fqjts matplotlib]&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
* [https://colab.research.google.com/drive/1aMo4Ur-0_b4dGhdIfxAmCC2ci1rOda_v?usp=sharing Tutorial 2] Markov matrix [https://colab.research.google.com/drive/1Q5ajzxRGXBBorA9cQ9o8V5VUVJhUXpPS?usp=sharing problems]&lt;br /&gt;
* [https://colab.research.google.com/drive/1k60-ChM3aUWjGsiRsf2Idx9jxHHtwyAb?usp=sharing Tutorial 3] Thumb rule [https://colab.research.google.com/drive/1fdKJlp0lD4k530oRuu50_Hm_T8t3jixa?usp=sharing problems]&lt;br /&gt;
--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 16, 2022&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1eY5cuNcJqYw7df0PBkxq03tEnqzTOC-5/view?usp=sharing Lecture 3 ]: Importance sampling&lt;br /&gt;
&lt;br /&gt;
*  [https://drive.google.com/file/d/1ALR_QKLXdHby54xNux39NUOk4L-Ne1EW/view?usp=sharing  Tutorial 3]: Errors and Precision&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 23, 2022&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1DijhG_856OAuj42WqY1UM47APmMy3A8B/view?usp=sharing Lecture 4]: Ising model and phase transitions &lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1sRUEs768Z6PKdJ3k7MixYeFGlufgjFrG Tutorial 4]: Ising model and phase transitions ([https://colab.research.google.com/drive/1KAQRog_YlAjKZ_hL1FMYurWdPBLNUocI solutions])&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
* [https://colab.research.google.com/drive/1nU4E_pFWjSFPNigzy8-LcJpef26IKY6x?usp=sharing Tutorial 4]: Ising model and phase transitions [https://colab.research.google.com/drive/1AEUX3U7hxDR_YYy8ld3knTEVR1KYa9SP?usp=sharing problems] &lt;br /&gt;
--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
* Send your copy of Homework 1 to numphys.icfp  at   gmail.com  Thanks!&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1EPgj3la7vxDIqSQYNlOFz4rR0vHXAeae Homework 2] (deadline October 14)&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 30, 2022&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1PTya42ZS2kU87A-BxQFFIUDTs_k47men?usp=sharing Lecture 5]: Optimization &amp;amp; Dijkstra algorithm&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1ieT5BlfJsOehsa8r-LHGsFsn1dwYnawT Tutorial 5]: Simulated annealing ([https://colab.research.google.com/drive/1JNVl42KNASZiwTtqYo71z_vggjbGfKul solutions])&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
* [https://colab.research.google.com/drive/1p0ooWAXF9KNh-FztMHmVoA9yBzYOM8PC?usp=sharing Tutorial 5]: Simulated annealing [https://colab.research.google.com/drive/1txJGpzreHurWux7ev6sDsX8TjzpeQhZZ?usp=sharing problems]&lt;br /&gt;
--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 7, 2022&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Test: &lt;br /&gt;
&lt;br /&gt;
The MCQ is composed of 19 questions (one of them counts for two).  For each question you have 4 choices: 3 wrong and 1 correct: If you check the correct one you get a point. If you are wrong you loose 1/4 of a point.  No answer given: zero points.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1iaOGxdVgk--kWUFcMDHs0zvPhsOyhB_c Tutorial 6]: Faster than the clock algorithms ([https://colab.research.google.com/drive/1bHPnJpBd5ExqKF4G5BuV_FHPE4r0_AY2#scrollTo=fQnz_gOeq40e solutions])&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
* [https://colab.research.google.com/drive/1KyT442vB4EuGKBy_Xj3j8cLtMMl4gbac?usp=sharing Tutorial 6]: Faster than the clock algorithms [https://colab.research.google.com/drive/1C-ieAwaAKwkX5MFm8aX2kNO2GNeO9CdY?usp=sharing problems]&lt;br /&gt;
--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 14, 2022&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 7: Introduction to Bayesian inference&lt;br /&gt;
&lt;br /&gt;
* Tutorial 7: Bayesian inference and single-particle tracking. [https://drive.google.com/file/d/1q9Quq5mvJ4Avv2qWgzTocU-DVIxJIVWi/view?usp=sharing Questions]. [https://drive.google.com/file/d/1xYb4wfNBysse6Q7frTw_V9TPdUQU5lUx/view?usp=sharing Data]. [https://drive.google.com/file/d/1Ba_kRo3_XMIaDLNYZlbZEw-wGXKS-29I/view?usp=sharing Starting Notebook]. [https://colab.research.google.com/drive/1VePL9X1JT6yl8LmROeZyMyf4Epcu3yOL#scrollTo=1XQNGa_fyEkJ Google colab version]. Solutions [https://drive.google.com/file/d/1Q9IjVUeL7AA8uWk8DX9Vy9vuUQ21RYh2/view?usp=sharing]. Notebook [https://drive.google.com/file/d/1ZJmpdaTQVUttEaaI1ch-reFfZGI93454/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
* Send your copy of Homework 2 to numphys.icfp  at   gmail.com  Thanks!&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 21, 2022&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 8: Asymptotic inference and information. Extra material: Proof of Cramer-Rao bound [https://drive.google.com/file/d/10Ph_iP6AIQ3ps9v3FwRBO9j6-qV7oKV9/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
* Tutorial 8: [https://drive.google.com/file/d/12cG4HBvzs9Oe1mbfuEYyRDmTEamW71pR/view?usp=sharing Questions]. [https://drive.google.com/file/d/1AL8sRtnqYUI8NbubfglgLazknaVIUJEo/view?usp=sharing Data ] [https://drive.google.com/file/d/1DTLzXLZUEPzoU2SsDMcAe8GaoYX8E5gH/view?usp=sharing Starting Notebook]. [https://drive.google.com/file/d/1QpMaM5ACmKUlFAyGvRnHvFVtQoEAF7-9/view?usp=sharing Bibliography] [https://drive.google.com/file/d/1p9v1PkJhwS8Ofg4RiC1nsFJAe8Mb_6WF/view?usp=sharing Solutions].  [https://drive.google.com/file/d/19erJJ4Gjw77n57VrnqaQPCxIh_-NScYT/view?usp=sharing Notebook].&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 28, 2022&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 9: High-dimensional inference and Principal Component Analysis. Extra material: Handwritten notes on the derivation of Marcenko-Pastur spectral density [https://drive.google.com/file/d/10Yytv9itdWDDHTsM2lQHwQDMbcf-oVnd/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
* Tutorial 9: [https://drive.google.com/file/d/10y7m1mPf5R5zZN6661Eei92IUNhBL_Zu/view?usp=sharing  Replay of the neuronal activity during sleep after a task].[https://drive.google.com/file/d/11fO26XB6Ri3HDVBvtdBkYxcTRLk1iv5F/view?usp=sharing Data ]. [https://drive.google.com/file/d/1-MFN2ERs_eNs4w6XnLjfzsu2F9REluSt/view?usp=sharing Initial Notebook]. [https://drive.google.com/file/d/11ev4Zwn6DPYLwhMsLyp8S0aQFVu77Ou3/view?usp=sharing Biblio]. &lt;br /&gt;
[https://drive.google.com/file/d/11E75QwrJgDKrutGj9t5NJTRkGtuRgoBI/view?usp=sharing Solutions]. [https://drive.google.com/file/d/1-39oZNNB-35zM4V2tLWtubQnZTdMLtIz/view?usp=sharing Notebook]&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, November 25, 2022&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 10: Priors, regularisation, sparsity&lt;br /&gt;
&lt;br /&gt;
* Tutorial 10: [https://drive.google.com/file/d/14kaGKRm7uciT7uLVMW_Vqzr8ha-V-Ra2/view?usp=sharing Bayesian Inference and Priors for the analysis of gravitational waves]. [https://drive.google.com/file/d/16UTmpwKm-7UMcIbca8IIGsO-aCmcwKuD/view?usp=sharing Starting notebook on artificial data]. [https://drive.google.com/file/d/1CyiDlXs6ez9-7gnyeBU0YRgV7Nt5ibkn/view?usp=sharing Biblio][https://colab.research.google.com/drive/1pFMOawozlYOIpy0jQWkTfoq-tFp3uvhw?usp=sharing#scrollTo=6picRNBipcYN Notebook on real data] &lt;br /&gt;
[https://drive.google.com/file/d/161ZLuq5s2RpHDJWELFSKXqlf-qwrVrxA/view?usp=sharing Notebook on Artificial data] [https://drive.google.com/file/d/17qhYN8EFpcoCUHOM_juBvEGpu61GgJRx/view?usp=sharing Corrections ]&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, December 2, 2022&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 11: Probabilistic graphical models&lt;br /&gt;
&lt;br /&gt;
* Tutorial 11:[https://drive.google.com/file/d/1A5pcJICHkmHZYoa2uoAGSAWp-_ZOaIEf/view?usp=sharing Analysis of protein sequence data to infer protein structure] [https://drive.google.com/file/d/1COKr5pNoBRFwwnj7TWPQSU8mEWKvsLud/view?usp=sharing Starting notebook and data] [https://drive.google.com/file/d/1CQw1PQ6RSS6nuGxhkwOqe7LJHpOPIaVp/view?usp=sharing Biblio][https://drive.google.com/file/d/1CslX27bTp5gyhXV4ciFE8s1zMnBgJ-1O/view?usp=sharing Solutions] [https://drive.google.com/file/d/19X59x3TdIsJaccTZE71gCbZxFbOzlhj4/view?usp=sharing Final notebook]&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, December 9, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 12: Hidden Markov Models. Extra material: Pedagogical introduction to Kalman filters [https://drive.google.com/file/d/0B4HvoS7Zt11LZUxVLTkyVXRQRUE/view?usp=sharing&amp;amp;resourcekey=0-CzsYaRIrPP2sN-UmwfiLHQ]&lt;br /&gt;
&lt;br /&gt;
* Tutorial 12: &lt;br /&gt;
[https://drive.google.com/file/d/1FLbWZRWJ1JILZV41RjwVKR7mOhNMhLV9/view?usp=sharing Hidden Markov Models Hidden  for identification of recombinations in SARS-CoV-2 viral genomes] [https://drive.google.com/file/d/1FCAg0ihMWoAk-_dtt5ORncjVjkVu-m4D/view?usp=sharing Starting Notebook and Data][https://drive.google.com/file/d/1HMREe6ge7_K-lOKC4f2FwL7vnEa1_8Yf/view?usp=sharing Bibliography] [https://drive.google.com/file/d/1FLDBJmNtXogHiO5VfScGiePTCxMFy1KZ/view?usp=sharing Final Notebook] [https://drive.google.com/file/d/1FBQaNJ2RhjwW_VSut2oC7mZYl5F8RWfS/view?usp=sharing Solutions]&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, December 16, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 13: Unsupervised learning and representations&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1p2c35gHMr4_Ptdmwsh3jGJz__9NNIgLw Tutorial 13]: How restricted Boltzmann machines learn ([https://colab.research.google.com/drive/1gnaK_vmTESTV3Ex_A1gqcee6Q58iKyld solutions])&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Final examination of the data-driven course (January 7, 2022)&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Example of exam: On-line Principal Component Analysis [https://drive.google.com/file/d/1BbRY4b3OCVYAtYH4m6ry19KcA2gkp3pH/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
* On-line version of the book [https://drive.google.com/file/d/161YHZA7i2YU-8emy6IPUFhsOXzFRxSRS/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
* Examination repository [https://drive.google.com/file/d/19DNkNBed0Ir5a9N048ZFV4_xF0KG3kcy/view?usp=sharing]&lt;/div&gt;</summary>
		<author><name>Alberto</name></author>
	</entry>
	<entry>
		<id>http://www.lptms.universite-paris-saclay.fr//wiki-cours/index.php?title=CoDaDri2&amp;diff=1764</id>
		<title>CoDaDri2</title>
		<link rel="alternate" type="text/html" href="http://www.lptms.universite-paris-saclay.fr//wiki-cours/index.php?title=CoDaDri2&amp;diff=1764"/>
		<updated>2022-06-22T13:48:20Z</updated>

		<summary type="html">&lt;p&gt;Alberto: /* Grading */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;=Breaking news:=&lt;br /&gt;
&lt;br /&gt;
* Update with course schedule&lt;br /&gt;
&lt;br /&gt;
= Computational and Data Driven Physics =&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Modern physics is characterized by an increasing complexity of systems under investigation, in&lt;br /&gt;
domains as diverse as condensed matter, astrophysics, biophysics, etc. Establishing adequate&lt;br /&gt;
models to describe these systems and being able to make quantitative predictions from those models&lt;br /&gt;
is extremely challenging. The goal of the course is to provide the tools and concepts necessary to tackle those systems.&lt;br /&gt;
&lt;br /&gt;
== Course description ==&lt;br /&gt;
&lt;br /&gt;
We will first cover many algorithms used in many-body problems and complex systems, with special emphasis on Monte Carlo methods, molecular dynamics, and optimization in complex landscapes. &lt;br /&gt;
&lt;br /&gt;
Second, we will provide statistical inference and machine learning tools to harness the growing availability of experimental data to design accurate models of the underlying, complex, strongly non-homogeneous and interacting systems. &lt;br /&gt;
&lt;br /&gt;
Each theoretical lecture will be followed by a tutorial illustrating the concepts with practical applications&lt;br /&gt;
borrowed from various domains of physics. We will focus on methods and algorithms and physics, not&lt;br /&gt;
on programming and heavy numerics!  You will have to hand in 3 homeworks.&lt;br /&gt;
&lt;br /&gt;
*[https://drive.google.com/file/d/11w7KI5Pi59VWLX1mqiQ8ZyY8YQHRUeMz/view?usp=sharing Preliminary version of the book: Information, Inference, Networks: From statistical physics to big biological data]&lt;br /&gt;
&lt;br /&gt;
== The Team ==&lt;br /&gt;
&lt;br /&gt;
* [http://lptms.u-psud.fr/alberto_rosso/ Alberto Rosso] (Computational physics)&lt;br /&gt;
* [http://www.phys.ens.fr/~monasson/ Rémi Monasson] (Data-driven physics)&lt;br /&gt;
*  [http://www.lps.ens.fr/~cocco/ Simona Cocco]  &amp;amp; [https://www.cpht.polytechnique.fr/?q=en/node/110 Michel Ferrero] (Tutorials)&lt;br /&gt;
* [ Vincenzo Maria Schimmenti] (Tutor)&lt;br /&gt;
&lt;br /&gt;
== Where and When ==&lt;br /&gt;
&lt;br /&gt;
* Lectures on Fridays: 14:00-16:00&lt;br /&gt;
* Tutorials on Fridays: 16:00-18:00&lt;br /&gt;
* ENS, 29 rue D&#039;Ulm, salle Borel + Djebar&lt;br /&gt;
&lt;br /&gt;
== Slack ==&lt;br /&gt;
&lt;br /&gt;
If you have questions or want to discuss topics related to the lecture, to the exercises or to the homeworks, you can use the&lt;br /&gt;
[XXX Computational and Data Driven Physics Slack]. In order to join the Slack&lt;br /&gt;
use the following [XXX invitation link].&lt;br /&gt;
&lt;br /&gt;
== Computer Requirements ==&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;No previous experience in programming is required.&#039;&#039;&#039; &amp;lt;br&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Programming Language: Python&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
For practical installation, we recommand either to use  Anaconda (See [[Memento Python]]) or use google colab. &amp;lt;br&amp;gt;&lt;br /&gt;
The Collaboratory platform from Google is quite good way to use powerful computer without buying one: It requires no specific hardware or software, and even allows you to use GPU computing for free,  all by writting a jupyter notebook that you can then share.&lt;br /&gt;
&lt;br /&gt;
== Grading ==&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Computational Physics:&#039;&#039;&#039;&lt;br /&gt;
* Homework 1: 5 points &lt;br /&gt;
* Homework 2: 5 points&lt;br /&gt;
* Multiple Choice Questions in November: 10 points&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Data Driven Physics:&#039;&#039;&#039;&lt;br /&gt;
* Homework 3: 5 points&lt;br /&gt;
* Final exam in January: 15 points&lt;br /&gt;
&lt;br /&gt;
== Schedule ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 2, 2022 &#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1X9h3lKD0OZLTKtxb7DWPfynY42rRuE7j/view?usp=sharing Lecture 1]   Introduction to Monte Carlo&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1sIv3qOdyE-XYkjYC-dkNsR72f4BgaQ_y/view?usp=sharing Tutorial 1] Markov Matrix&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1g7HXFUBQUBF0fhy5h2jYbfIAVBTqvb7-#scrollTo=U9LFX8OFhHOG Homework 1] (deadline September 23)&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 9, 2022&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/15wrgivn6FSnuBUnMwjjhadmD-g1fkS7T/view?usp=sharing Lecture 2] Basic Sampling&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1gf7oRQIpvSvMScyJa5hexB9CCZvdozPs#scrollTo=lDznlLouvlFx Tutorial 2] [https://colab.research.google.com/drive/1tjqbjAi50C4qOqVRtTxEkTeTb10qpTms#scrollTo=uYpaubGkvogU Tutorial 2 b]  - Markov matrices &amp;amp;  Thumb rule ([https://colab.research.google.com/drive/1x9iEHG_F522uFCvD_jGdvHaMETAHfO6-#scrollTo=eSu-nLZ6vm8X solutions]) ([https://colab.research.google.com/drive/1aWVtz4ZGcpIarWiRVAnxrp1t0GDOqZxu#scrollTo=f7ohlMuZvqTr solutionsB])&lt;br /&gt;
&lt;br /&gt;
* Introductory notebooks: [https://colab.research.google.com/drive/1Ovrh1JjLzMMnxtasDgR1j84CHGU6hMxA python], [https://colab.research.google.com/drive/14PWu-C171pYhV8ven-Txc4wz5Tv1DCsK numpy] and [https://colab.research.google.com/drive/1fPjwrdxQPSyfXniyAHmyOcF_gK2fqjts matplotlib]&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
* [https://colab.research.google.com/drive/1aMo4Ur-0_b4dGhdIfxAmCC2ci1rOda_v?usp=sharing Tutorial 2] Markov matrix [https://colab.research.google.com/drive/1Q5ajzxRGXBBorA9cQ9o8V5VUVJhUXpPS?usp=sharing problems]&lt;br /&gt;
* [https://colab.research.google.com/drive/1k60-ChM3aUWjGsiRsf2Idx9jxHHtwyAb?usp=sharing Tutorial 3] Thumb rule [https://colab.research.google.com/drive/1fdKJlp0lD4k530oRuu50_Hm_T8t3jixa?usp=sharing problems]&lt;br /&gt;
--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 16, 2022&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1eY5cuNcJqYw7df0PBkxq03tEnqzTOC-5/view?usp=sharing Lecture 3 ]: Importance sampling&lt;br /&gt;
&lt;br /&gt;
*  [https://drive.google.com/file/d/1ALR_QKLXdHby54xNux39NUOk4L-Ne1EW/view?usp=sharing  Tutorial 3]: Errors and Precision&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 23, 2022&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1DijhG_856OAuj42WqY1UM47APmMy3A8B/view?usp=sharing Lecture 4]: Ising model and phase transitions &lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1sRUEs768Z6PKdJ3k7MixYeFGlufgjFrG Tutorial 4]: Ising model and phase transitions ([https://colab.research.google.com/drive/1KAQRog_YlAjKZ_hL1FMYurWdPBLNUocI solutions])&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
* [https://colab.research.google.com/drive/1nU4E_pFWjSFPNigzy8-LcJpef26IKY6x?usp=sharing Tutorial 4]: Ising model and phase transitions [https://colab.research.google.com/drive/1AEUX3U7hxDR_YYy8ld3knTEVR1KYa9SP?usp=sharing problems] &lt;br /&gt;
--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
* Send your copy of Homework 1 to numphys.icfp  at   gmail.com  Thanks!&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1EPgj3la7vxDIqSQYNlOFz4rR0vHXAeae Homework 2] (deadline October 7)&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 30, 2022&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1PTya42ZS2kU87A-BxQFFIUDTs_k47men?usp=sharing Lecture 5]: Optimization &amp;amp; Dijkstra algorithm&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1ieT5BlfJsOehsa8r-LHGsFsn1dwYnawT Tutorial 5]: Simulated annealing ([https://colab.research.google.com/drive/1JNVl42KNASZiwTtqYo71z_vggjbGfKul solutions])&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
* [https://colab.research.google.com/drive/1p0ooWAXF9KNh-FztMHmVoA9yBzYOM8PC?usp=sharing Tutorial 5]: Simulated annealing [https://colab.research.google.com/drive/1txJGpzreHurWux7ev6sDsX8TjzpeQhZZ?usp=sharing problems]&lt;br /&gt;
--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 7, 2022&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Test: &lt;br /&gt;
&lt;br /&gt;
The MCQ is composed of 19 questions (one of them counts for two).  For each question you have 4 choices: 3 wrong and 1 correct: If you check the correct one you get a point. If you are wrong you loose 1/4 of a point.  No answer given: zero points.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1iaOGxdVgk--kWUFcMDHs0zvPhsOyhB_c Tutorial 6]: Faster than the clock algorithms ([https://colab.research.google.com/drive/1bHPnJpBd5ExqKF4G5BuV_FHPE4r0_AY2#scrollTo=fQnz_gOeq40e solutions])&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
* [https://colab.research.google.com/drive/1KyT442vB4EuGKBy_Xj3j8cLtMMl4gbac?usp=sharing Tutorial 6]: Faster than the clock algorithms [https://colab.research.google.com/drive/1C-ieAwaAKwkX5MFm8aX2kNO2GNeO9CdY?usp=sharing problems]&lt;br /&gt;
--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
* Send your copy of Homework 2 to numphys.icfp  at   gmail.com  Thanks!&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 14, 2022&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 7: Introduction to Bayesian inference&lt;br /&gt;
&lt;br /&gt;
* Tutorial 7: Bayesian inference and single-particle tracking. [https://drive.google.com/file/d/1q9Quq5mvJ4Avv2qWgzTocU-DVIxJIVWi/view?usp=sharing Questions]. [https://drive.google.com/file/d/1xYb4wfNBysse6Q7frTw_V9TPdUQU5lUx/view?usp=sharing Data]. [https://drive.google.com/file/d/1Ba_kRo3_XMIaDLNYZlbZEw-wGXKS-29I/view?usp=sharing Starting Notebook]. [https://colab.research.google.com/drive/1VePL9X1JT6yl8LmROeZyMyf4Epcu3yOL#scrollTo=1XQNGa_fyEkJ Google colab version]. Solutions [https://drive.google.com/file/d/1Q9IjVUeL7AA8uWk8DX9Vy9vuUQ21RYh2/view?usp=sharing]. Notebook [https://drive.google.com/file/d/1ZJmpdaTQVUttEaaI1ch-reFfZGI93454/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 21, 2022&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 8: Asymptotic inference and information. Extra material: Proof of Cramer-Rao bound [https://drive.google.com/file/d/10Ph_iP6AIQ3ps9v3FwRBO9j6-qV7oKV9/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
* Tutorial 8: [https://drive.google.com/file/d/12cG4HBvzs9Oe1mbfuEYyRDmTEamW71pR/view?usp=sharing Questions]. [https://drive.google.com/file/d/1AL8sRtnqYUI8NbubfglgLazknaVIUJEo/view?usp=sharing Data ] [https://drive.google.com/file/d/1DTLzXLZUEPzoU2SsDMcAe8GaoYX8E5gH/view?usp=sharing Starting Notebook]. [https://drive.google.com/file/d/1QpMaM5ACmKUlFAyGvRnHvFVtQoEAF7-9/view?usp=sharing Bibliography] [https://drive.google.com/file/d/1p9v1PkJhwS8Ofg4RiC1nsFJAe8Mb_6WF/view?usp=sharing Solutions].  [https://drive.google.com/file/d/19erJJ4Gjw77n57VrnqaQPCxIh_-NScYT/view?usp=sharing Notebook].&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 28, 2022&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 9: High-dimensional inference and Principal Component Analysis. Extra material: Handwritten notes on the derivation of Marcenko-Pastur spectral density [https://drive.google.com/file/d/10Yytv9itdWDDHTsM2lQHwQDMbcf-oVnd/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
* Tutorial 9: [https://drive.google.com/file/d/10y7m1mPf5R5zZN6661Eei92IUNhBL_Zu/view?usp=sharing  Replay of the neuronal activity during sleep after a task].[https://drive.google.com/file/d/11fO26XB6Ri3HDVBvtdBkYxcTRLk1iv5F/view?usp=sharing Data ]. [https://drive.google.com/file/d/1-MFN2ERs_eNs4w6XnLjfzsu2F9REluSt/view?usp=sharing Initial Notebook]. [https://drive.google.com/file/d/11ev4Zwn6DPYLwhMsLyp8S0aQFVu77Ou3/view?usp=sharing Biblio]. &lt;br /&gt;
[https://drive.google.com/file/d/11E75QwrJgDKrutGj9t5NJTRkGtuRgoBI/view?usp=sharing Solutions]. [https://drive.google.com/file/d/1-39oZNNB-35zM4V2tLWtubQnZTdMLtIz/view?usp=sharing Notebook]&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, November 25, 2022&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 10: Priors, regularisation, sparsity&lt;br /&gt;
&lt;br /&gt;
* Tutorial 10: [https://drive.google.com/file/d/14kaGKRm7uciT7uLVMW_Vqzr8ha-V-Ra2/view?usp=sharing Bayesian Inference and Priors for the analysis of gravitational waves]. [https://drive.google.com/file/d/16UTmpwKm-7UMcIbca8IIGsO-aCmcwKuD/view?usp=sharing Starting notebook on artificial data]. [https://drive.google.com/file/d/1CyiDlXs6ez9-7gnyeBU0YRgV7Nt5ibkn/view?usp=sharing Biblio][https://colab.research.google.com/drive/1pFMOawozlYOIpy0jQWkTfoq-tFp3uvhw?usp=sharing#scrollTo=6picRNBipcYN Notebook on real data] &lt;br /&gt;
[https://drive.google.com/file/d/161ZLuq5s2RpHDJWELFSKXqlf-qwrVrxA/view?usp=sharing Notebook on Artificial data] [https://drive.google.com/file/d/17qhYN8EFpcoCUHOM_juBvEGpu61GgJRx/view?usp=sharing Corrections ]&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, December 2, 2022&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 11: Probabilistic graphical models&lt;br /&gt;
&lt;br /&gt;
* Tutorial 11:[https://drive.google.com/file/d/1A5pcJICHkmHZYoa2uoAGSAWp-_ZOaIEf/view?usp=sharing Analysis of protein sequence data to infer protein structure] [https://drive.google.com/file/d/1COKr5pNoBRFwwnj7TWPQSU8mEWKvsLud/view?usp=sharing Starting notebook and data] [https://drive.google.com/file/d/1CQw1PQ6RSS6nuGxhkwOqe7LJHpOPIaVp/view?usp=sharing Biblio][https://drive.google.com/file/d/1CslX27bTp5gyhXV4ciFE8s1zMnBgJ-1O/view?usp=sharing Solutions] [https://drive.google.com/file/d/19X59x3TdIsJaccTZE71gCbZxFbOzlhj4/view?usp=sharing Final notebook]&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, December 9, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 12: Hidden Markov Models. Extra material: Pedagogical introduction to Kalman filters [https://drive.google.com/file/d/0B4HvoS7Zt11LZUxVLTkyVXRQRUE/view?usp=sharing&amp;amp;resourcekey=0-CzsYaRIrPP2sN-UmwfiLHQ]&lt;br /&gt;
&lt;br /&gt;
* Tutorial 12: &lt;br /&gt;
[https://drive.google.com/file/d/1FLbWZRWJ1JILZV41RjwVKR7mOhNMhLV9/view?usp=sharing Hidden Markov Models Hidden  for identification of recombinations in SARS-CoV-2 viral genomes] [https://drive.google.com/file/d/1FCAg0ihMWoAk-_dtt5ORncjVjkVu-m4D/view?usp=sharing Starting Notebook and Data][https://drive.google.com/file/d/1HMREe6ge7_K-lOKC4f2FwL7vnEa1_8Yf/view?usp=sharing Bibliography] [https://drive.google.com/file/d/1FLDBJmNtXogHiO5VfScGiePTCxMFy1KZ/view?usp=sharing Final Notebook] [https://drive.google.com/file/d/1FBQaNJ2RhjwW_VSut2oC7mZYl5F8RWfS/view?usp=sharing Solutions]&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, December 16, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 13: Unsupervised learning and representations&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1p2c35gHMr4_Ptdmwsh3jGJz__9NNIgLw Tutorial 13]: How restricted Boltzmann machines learn ([https://colab.research.google.com/drive/1gnaK_vmTESTV3Ex_A1gqcee6Q58iKyld solutions])&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Final examination of the data-driven course (January 7, 2022)&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Example of exam: On-line Principal Component Analysis [https://drive.google.com/file/d/1BbRY4b3OCVYAtYH4m6ry19KcA2gkp3pH/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
* On-line version of the book [https://drive.google.com/file/d/161YHZA7i2YU-8emy6IPUFhsOXzFRxSRS/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
* Examination repository [https://drive.google.com/file/d/19DNkNBed0Ir5a9N048ZFV4_xF0KG3kcy/view?usp=sharing]&lt;/div&gt;</summary>
		<author><name>Alberto</name></author>
	</entry>
	<entry>
		<id>http://www.lptms.universite-paris-saclay.fr//wiki-cours/index.php?title=CoDaDri2&amp;diff=1763</id>
		<title>CoDaDri2</title>
		<link rel="alternate" type="text/html" href="http://www.lptms.universite-paris-saclay.fr//wiki-cours/index.php?title=CoDaDri2&amp;diff=1763"/>
		<updated>2022-06-22T13:40:15Z</updated>

		<summary type="html">&lt;p&gt;Alberto: /* Schedule */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;=Breaking news:=&lt;br /&gt;
&lt;br /&gt;
* Update with course schedule&lt;br /&gt;
&lt;br /&gt;
= Computational and Data Driven Physics =&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Modern physics is characterized by an increasing complexity of systems under investigation, in&lt;br /&gt;
domains as diverse as condensed matter, astrophysics, biophysics, etc. Establishing adequate&lt;br /&gt;
models to describe these systems and being able to make quantitative predictions from those models&lt;br /&gt;
is extremely challenging. The goal of the course is to provide the tools and concepts necessary to tackle those systems.&lt;br /&gt;
&lt;br /&gt;
== Course description ==&lt;br /&gt;
&lt;br /&gt;
We will first cover many algorithms used in many-body problems and complex systems, with special emphasis on Monte Carlo methods, molecular dynamics, and optimization in complex landscapes. &lt;br /&gt;
&lt;br /&gt;
Second, we will provide statistical inference and machine learning tools to harness the growing availability of experimental data to design accurate models of the underlying, complex, strongly non-homogeneous and interacting systems. &lt;br /&gt;
&lt;br /&gt;
Each theoretical lecture will be followed by a tutorial illustrating the concepts with practical applications&lt;br /&gt;
borrowed from various domains of physics. We will focus on methods and algorithms and physics, not&lt;br /&gt;
on programming and heavy numerics!  You will have to hand in 3 homeworks.&lt;br /&gt;
&lt;br /&gt;
*[https://drive.google.com/file/d/11w7KI5Pi59VWLX1mqiQ8ZyY8YQHRUeMz/view?usp=sharing Preliminary version of the book: Information, Inference, Networks: From statistical physics to big biological data]&lt;br /&gt;
&lt;br /&gt;
== The Team ==&lt;br /&gt;
&lt;br /&gt;
* [http://lptms.u-psud.fr/alberto_rosso/ Alberto Rosso] (Computational physics)&lt;br /&gt;
* [http://www.phys.ens.fr/~monasson/ Rémi Monasson] (Data-driven physics)&lt;br /&gt;
*  [http://www.lps.ens.fr/~cocco/ Simona Cocco]  &amp;amp; [https://www.cpht.polytechnique.fr/?q=en/node/110 Michel Ferrero] (Tutorials)&lt;br /&gt;
* [ Vincenzo Maria Schimmenti] (Tutor)&lt;br /&gt;
&lt;br /&gt;
== Where and When ==&lt;br /&gt;
&lt;br /&gt;
* Lectures on Fridays: 14:00-16:00&lt;br /&gt;
* Tutorials on Fridays: 16:00-18:00&lt;br /&gt;
* ENS, 29 rue D&#039;Ulm, salle Borel + Djebar&lt;br /&gt;
&lt;br /&gt;
== Slack ==&lt;br /&gt;
&lt;br /&gt;
If you have questions or want to discuss topics related to the lecture, to the exercises or to the homeworks, you can use the&lt;br /&gt;
[XXX Computational and Data Driven Physics Slack]. In order to join the Slack&lt;br /&gt;
use the following [XXX invitation link].&lt;br /&gt;
&lt;br /&gt;
== Computer Requirements ==&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;No previous experience in programming is required.&#039;&#039;&#039; &amp;lt;br&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Programming Language: Python&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
For practical installation, we recommand either to use  Anaconda (See [[Memento Python]]) or use google colab. &amp;lt;br&amp;gt;&lt;br /&gt;
The Collaboratory platform from Google is quite good way to use powerful computer without buying one: It requires no specific hardware or software, and even allows you to use GPU computing for free,  all by writting a jupyter notebook that you can then share.&lt;br /&gt;
&lt;br /&gt;
== Grading ==&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Computational Physics:&#039;&#039;&#039;&lt;br /&gt;
* Homework 1: 5 points &lt;br /&gt;
* Homework 2: 5 points&lt;br /&gt;
* Multiple Choice Questions in November: 10 points&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Data Driven Physics:&#039;&#039;&#039;&lt;br /&gt;
* Homework 3: 5 points&lt;br /&gt;
* Final exam in January: 15 points&lt;br /&gt;
&lt;br /&gt;
== Schedule ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 2, 2022 &#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1X9h3lKD0OZLTKtxb7DWPfynY42rRuE7j/view?usp=sharing Lecture 1]   Introduction to Monte Carlo&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1sIv3qOdyE-XYkjYC-dkNsR72f4BgaQ_y/view?usp=sharing Tutorial 1] Markov Matrix&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1g7HXFUBQUBF0fhy5h2jYbfIAVBTqvb7-#scrollTo=U9LFX8OFhHOG Homework 1] (deadline September 23)&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 9, 2022&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/15wrgivn6FSnuBUnMwjjhadmD-g1fkS7T/view?usp=sharing Lecture 2] Basic Sampling&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1gf7oRQIpvSvMScyJa5hexB9CCZvdozPs#scrollTo=lDznlLouvlFx Tutorial 2] [https://colab.research.google.com/drive/1tjqbjAi50C4qOqVRtTxEkTeTb10qpTms#scrollTo=uYpaubGkvogU Tutorial 2 b]  - Markov matrices &amp;amp;  Thumb rule ([https://colab.research.google.com/drive/1x9iEHG_F522uFCvD_jGdvHaMETAHfO6-#scrollTo=eSu-nLZ6vm8X solutions]) ([https://colab.research.google.com/drive/1aWVtz4ZGcpIarWiRVAnxrp1t0GDOqZxu#scrollTo=f7ohlMuZvqTr solutionsB])&lt;br /&gt;
&lt;br /&gt;
* Introductory notebooks: [https://colab.research.google.com/drive/1Ovrh1JjLzMMnxtasDgR1j84CHGU6hMxA python], [https://colab.research.google.com/drive/14PWu-C171pYhV8ven-Txc4wz5Tv1DCsK numpy] and [https://colab.research.google.com/drive/1fPjwrdxQPSyfXniyAHmyOcF_gK2fqjts matplotlib]&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
* [https://colab.research.google.com/drive/1aMo4Ur-0_b4dGhdIfxAmCC2ci1rOda_v?usp=sharing Tutorial 2] Markov matrix [https://colab.research.google.com/drive/1Q5ajzxRGXBBorA9cQ9o8V5VUVJhUXpPS?usp=sharing problems]&lt;br /&gt;
* [https://colab.research.google.com/drive/1k60-ChM3aUWjGsiRsf2Idx9jxHHtwyAb?usp=sharing Tutorial 3] Thumb rule [https://colab.research.google.com/drive/1fdKJlp0lD4k530oRuu50_Hm_T8t3jixa?usp=sharing problems]&lt;br /&gt;
--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 16, 2022&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1eY5cuNcJqYw7df0PBkxq03tEnqzTOC-5/view?usp=sharing Lecture 3 ]: Importance sampling&lt;br /&gt;
&lt;br /&gt;
*  [https://drive.google.com/file/d/1ALR_QKLXdHby54xNux39NUOk4L-Ne1EW/view?usp=sharing  Tutorial 3]: Errors and Precision&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 23, 2022&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1DijhG_856OAuj42WqY1UM47APmMy3A8B/view?usp=sharing Lecture 4]: Ising model and phase transitions &lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1sRUEs768Z6PKdJ3k7MixYeFGlufgjFrG Tutorial 4]: Ising model and phase transitions ([https://colab.research.google.com/drive/1KAQRog_YlAjKZ_hL1FMYurWdPBLNUocI solutions])&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
* [https://colab.research.google.com/drive/1nU4E_pFWjSFPNigzy8-LcJpef26IKY6x?usp=sharing Tutorial 4]: Ising model and phase transitions [https://colab.research.google.com/drive/1AEUX3U7hxDR_YYy8ld3knTEVR1KYa9SP?usp=sharing problems] &lt;br /&gt;
--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
* Send your copy of Homework 1 to numphys.icfp  at   gmail.com  Thanks!&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1EPgj3la7vxDIqSQYNlOFz4rR0vHXAeae Homework 2] (deadline October 7)&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 30, 2022&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1PTya42ZS2kU87A-BxQFFIUDTs_k47men?usp=sharing Lecture 5]: Optimization &amp;amp; Dijkstra algorithm&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1ieT5BlfJsOehsa8r-LHGsFsn1dwYnawT Tutorial 5]: Simulated annealing ([https://colab.research.google.com/drive/1JNVl42KNASZiwTtqYo71z_vggjbGfKul solutions])&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
* [https://colab.research.google.com/drive/1p0ooWAXF9KNh-FztMHmVoA9yBzYOM8PC?usp=sharing Tutorial 5]: Simulated annealing [https://colab.research.google.com/drive/1txJGpzreHurWux7ev6sDsX8TjzpeQhZZ?usp=sharing problems]&lt;br /&gt;
--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 7, 2022&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Test: &lt;br /&gt;
&lt;br /&gt;
The MCQ is composed of 19 questions (one of them counts for two).  For each question you have 4 choices: 3 wrong and 1 correct: If you check the correct one you get a point. If you are wrong you loose 1/4 of a point.  No answer given: zero points.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1iaOGxdVgk--kWUFcMDHs0zvPhsOyhB_c Tutorial 6]: Faster than the clock algorithms ([https://colab.research.google.com/drive/1bHPnJpBd5ExqKF4G5BuV_FHPE4r0_AY2#scrollTo=fQnz_gOeq40e solutions])&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
* [https://colab.research.google.com/drive/1KyT442vB4EuGKBy_Xj3j8cLtMMl4gbac?usp=sharing Tutorial 6]: Faster than the clock algorithms [https://colab.research.google.com/drive/1C-ieAwaAKwkX5MFm8aX2kNO2GNeO9CdY?usp=sharing problems]&lt;br /&gt;
--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
* Send your copy of Homework 2 to numphys.icfp  at   gmail.com  Thanks!&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 14, 2022&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 7: Introduction to Bayesian inference&lt;br /&gt;
&lt;br /&gt;
* Tutorial 7: Bayesian inference and single-particle tracking. [https://drive.google.com/file/d/1q9Quq5mvJ4Avv2qWgzTocU-DVIxJIVWi/view?usp=sharing Questions]. [https://drive.google.com/file/d/1xYb4wfNBysse6Q7frTw_V9TPdUQU5lUx/view?usp=sharing Data]. [https://drive.google.com/file/d/1Ba_kRo3_XMIaDLNYZlbZEw-wGXKS-29I/view?usp=sharing Starting Notebook]. [https://colab.research.google.com/drive/1VePL9X1JT6yl8LmROeZyMyf4Epcu3yOL#scrollTo=1XQNGa_fyEkJ Google colab version]. Solutions [https://drive.google.com/file/d/1Q9IjVUeL7AA8uWk8DX9Vy9vuUQ21RYh2/view?usp=sharing]. Notebook [https://drive.google.com/file/d/1ZJmpdaTQVUttEaaI1ch-reFfZGI93454/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 21, 2022&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 8: Asymptotic inference and information. Extra material: Proof of Cramer-Rao bound [https://drive.google.com/file/d/10Ph_iP6AIQ3ps9v3FwRBO9j6-qV7oKV9/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
* Tutorial 8: [https://drive.google.com/file/d/12cG4HBvzs9Oe1mbfuEYyRDmTEamW71pR/view?usp=sharing Questions]. [https://drive.google.com/file/d/1AL8sRtnqYUI8NbubfglgLazknaVIUJEo/view?usp=sharing Data ] [https://drive.google.com/file/d/1DTLzXLZUEPzoU2SsDMcAe8GaoYX8E5gH/view?usp=sharing Starting Notebook]. [https://drive.google.com/file/d/1QpMaM5ACmKUlFAyGvRnHvFVtQoEAF7-9/view?usp=sharing Bibliography] [https://drive.google.com/file/d/1p9v1PkJhwS8Ofg4RiC1nsFJAe8Mb_6WF/view?usp=sharing Solutions].  [https://drive.google.com/file/d/19erJJ4Gjw77n57VrnqaQPCxIh_-NScYT/view?usp=sharing Notebook].&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 28, 2022&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 9: High-dimensional inference and Principal Component Analysis. Extra material: Handwritten notes on the derivation of Marcenko-Pastur spectral density [https://drive.google.com/file/d/10Yytv9itdWDDHTsM2lQHwQDMbcf-oVnd/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
* Tutorial 9: [https://drive.google.com/file/d/10y7m1mPf5R5zZN6661Eei92IUNhBL_Zu/view?usp=sharing  Replay of the neuronal activity during sleep after a task].[https://drive.google.com/file/d/11fO26XB6Ri3HDVBvtdBkYxcTRLk1iv5F/view?usp=sharing Data ]. [https://drive.google.com/file/d/1-MFN2ERs_eNs4w6XnLjfzsu2F9REluSt/view?usp=sharing Initial Notebook]. [https://drive.google.com/file/d/11ev4Zwn6DPYLwhMsLyp8S0aQFVu77Ou3/view?usp=sharing Biblio]. &lt;br /&gt;
[https://drive.google.com/file/d/11E75QwrJgDKrutGj9t5NJTRkGtuRgoBI/view?usp=sharing Solutions]. [https://drive.google.com/file/d/1-39oZNNB-35zM4V2tLWtubQnZTdMLtIz/view?usp=sharing Notebook]&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, November 25, 2022&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 10: Priors, regularisation, sparsity&lt;br /&gt;
&lt;br /&gt;
* Tutorial 10: [https://drive.google.com/file/d/14kaGKRm7uciT7uLVMW_Vqzr8ha-V-Ra2/view?usp=sharing Bayesian Inference and Priors for the analysis of gravitational waves]. [https://drive.google.com/file/d/16UTmpwKm-7UMcIbca8IIGsO-aCmcwKuD/view?usp=sharing Starting notebook on artificial data]. [https://drive.google.com/file/d/1CyiDlXs6ez9-7gnyeBU0YRgV7Nt5ibkn/view?usp=sharing Biblio][https://colab.research.google.com/drive/1pFMOawozlYOIpy0jQWkTfoq-tFp3uvhw?usp=sharing#scrollTo=6picRNBipcYN Notebook on real data] &lt;br /&gt;
[https://drive.google.com/file/d/161ZLuq5s2RpHDJWELFSKXqlf-qwrVrxA/view?usp=sharing Notebook on Artificial data] [https://drive.google.com/file/d/17qhYN8EFpcoCUHOM_juBvEGpu61GgJRx/view?usp=sharing Corrections ]&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, December 2, 2022&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 11: Probabilistic graphical models&lt;br /&gt;
&lt;br /&gt;
* Tutorial 11:[https://drive.google.com/file/d/1A5pcJICHkmHZYoa2uoAGSAWp-_ZOaIEf/view?usp=sharing Analysis of protein sequence data to infer protein structure] [https://drive.google.com/file/d/1COKr5pNoBRFwwnj7TWPQSU8mEWKvsLud/view?usp=sharing Starting notebook and data] [https://drive.google.com/file/d/1CQw1PQ6RSS6nuGxhkwOqe7LJHpOPIaVp/view?usp=sharing Biblio][https://drive.google.com/file/d/1CslX27bTp5gyhXV4ciFE8s1zMnBgJ-1O/view?usp=sharing Solutions] [https://drive.google.com/file/d/19X59x3TdIsJaccTZE71gCbZxFbOzlhj4/view?usp=sharing Final notebook]&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, December 9, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 12: Hidden Markov Models. Extra material: Pedagogical introduction to Kalman filters [https://drive.google.com/file/d/0B4HvoS7Zt11LZUxVLTkyVXRQRUE/view?usp=sharing&amp;amp;resourcekey=0-CzsYaRIrPP2sN-UmwfiLHQ]&lt;br /&gt;
&lt;br /&gt;
* Tutorial 12: &lt;br /&gt;
[https://drive.google.com/file/d/1FLbWZRWJ1JILZV41RjwVKR7mOhNMhLV9/view?usp=sharing Hidden Markov Models Hidden  for identification of recombinations in SARS-CoV-2 viral genomes] [https://drive.google.com/file/d/1FCAg0ihMWoAk-_dtt5ORncjVjkVu-m4D/view?usp=sharing Starting Notebook and Data][https://drive.google.com/file/d/1HMREe6ge7_K-lOKC4f2FwL7vnEa1_8Yf/view?usp=sharing Bibliography] [https://drive.google.com/file/d/1FLDBJmNtXogHiO5VfScGiePTCxMFy1KZ/view?usp=sharing Final Notebook] [https://drive.google.com/file/d/1FBQaNJ2RhjwW_VSut2oC7mZYl5F8RWfS/view?usp=sharing Solutions]&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, December 16, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 13: Unsupervised learning and representations&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1p2c35gHMr4_Ptdmwsh3jGJz__9NNIgLw Tutorial 13]: How restricted Boltzmann machines learn ([https://colab.research.google.com/drive/1gnaK_vmTESTV3Ex_A1gqcee6Q58iKyld solutions])&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Final examination of the data-driven course (January 7, 2022)&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Example of exam: On-line Principal Component Analysis [https://drive.google.com/file/d/1BbRY4b3OCVYAtYH4m6ry19KcA2gkp3pH/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
* On-line version of the book [https://drive.google.com/file/d/161YHZA7i2YU-8emy6IPUFhsOXzFRxSRS/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
* Examination repository [https://drive.google.com/file/d/19DNkNBed0Ir5a9N048ZFV4_xF0KG3kcy/view?usp=sharing]&lt;/div&gt;</summary>
		<author><name>Alberto</name></author>
	</entry>
	<entry>
		<id>http://www.lptms.universite-paris-saclay.fr//wiki-cours/index.php?title=CoDaDri2&amp;diff=1762</id>
		<title>CoDaDri2</title>
		<link rel="alternate" type="text/html" href="http://www.lptms.universite-paris-saclay.fr//wiki-cours/index.php?title=CoDaDri2&amp;diff=1762"/>
		<updated>2022-06-22T13:21:37Z</updated>

		<summary type="html">&lt;p&gt;Alberto: /* Schedule */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;=Breaking news:=&lt;br /&gt;
&lt;br /&gt;
* Update with course schedule&lt;br /&gt;
&lt;br /&gt;
= Computational and Data Driven Physics =&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Modern physics is characterized by an increasing complexity of systems under investigation, in&lt;br /&gt;
domains as diverse as condensed matter, astrophysics, biophysics, etc. Establishing adequate&lt;br /&gt;
models to describe these systems and being able to make quantitative predictions from those models&lt;br /&gt;
is extremely challenging. The goal of the course is to provide the tools and concepts necessary to tackle those systems.&lt;br /&gt;
&lt;br /&gt;
== Course description ==&lt;br /&gt;
&lt;br /&gt;
We will first cover many algorithms used in many-body problems and complex systems, with special emphasis on Monte Carlo methods, molecular dynamics, and optimization in complex landscapes. &lt;br /&gt;
&lt;br /&gt;
Second, we will provide statistical inference and machine learning tools to harness the growing availability of experimental data to design accurate models of the underlying, complex, strongly non-homogeneous and interacting systems. &lt;br /&gt;
&lt;br /&gt;
Each theoretical lecture will be followed by a tutorial illustrating the concepts with practical applications&lt;br /&gt;
borrowed from various domains of physics. We will focus on methods and algorithms and physics, not&lt;br /&gt;
on programming and heavy numerics!  You will have to hand in 3 homeworks.&lt;br /&gt;
&lt;br /&gt;
*[https://drive.google.com/file/d/11w7KI5Pi59VWLX1mqiQ8ZyY8YQHRUeMz/view?usp=sharing Preliminary version of the book: Information, Inference, Networks: From statistical physics to big biological data]&lt;br /&gt;
&lt;br /&gt;
== The Team ==&lt;br /&gt;
&lt;br /&gt;
* [http://lptms.u-psud.fr/alberto_rosso/ Alberto Rosso] (Computational physics)&lt;br /&gt;
* [http://www.phys.ens.fr/~monasson/ Rémi Monasson] (Data-driven physics)&lt;br /&gt;
*  [http://www.lps.ens.fr/~cocco/ Simona Cocco]  &amp;amp; [https://www.cpht.polytechnique.fr/?q=en/node/110 Michel Ferrero] (Tutorials)&lt;br /&gt;
* [ Vincenzo Maria Schimmenti] (Tutor)&lt;br /&gt;
&lt;br /&gt;
== Where and When ==&lt;br /&gt;
&lt;br /&gt;
* Lectures on Fridays: 14:00-16:00&lt;br /&gt;
* Tutorials on Fridays: 16:00-18:00&lt;br /&gt;
* ENS, 29 rue D&#039;Ulm, salle Borel + Djebar&lt;br /&gt;
&lt;br /&gt;
== Slack ==&lt;br /&gt;
&lt;br /&gt;
If you have questions or want to discuss topics related to the lecture, to the exercises or to the homeworks, you can use the&lt;br /&gt;
[XXX Computational and Data Driven Physics Slack]. In order to join the Slack&lt;br /&gt;
use the following [XXX invitation link].&lt;br /&gt;
&lt;br /&gt;
== Computer Requirements ==&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;No previous experience in programming is required.&#039;&#039;&#039; &amp;lt;br&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Programming Language: Python&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
For practical installation, we recommand either to use  Anaconda (See [[Memento Python]]) or use google colab. &amp;lt;br&amp;gt;&lt;br /&gt;
The Collaboratory platform from Google is quite good way to use powerful computer without buying one: It requires no specific hardware or software, and even allows you to use GPU computing for free,  all by writting a jupyter notebook that you can then share.&lt;br /&gt;
&lt;br /&gt;
== Grading ==&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Computational Physics:&#039;&#039;&#039;&lt;br /&gt;
* Homework 1: 5 points &lt;br /&gt;
* Homework 2: 5 points&lt;br /&gt;
* Multiple Choice Questions in November: 10 points&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Data Driven Physics:&#039;&#039;&#039;&lt;br /&gt;
* Homework 3: 5 points&lt;br /&gt;
* Final exam in January: 15 points&lt;br /&gt;
&lt;br /&gt;
== Schedule ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 2, 2022 &#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1X9h3lKD0OZLTKtxb7DWPfynY42rRuE7j/view?usp=sharing Lecture 1]   Introduction to Monte Carlo&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1sIv3qOdyE-XYkjYC-dkNsR72f4BgaQ_y/view?usp=sharing Tutorial 1] Markov Matrix&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 9, 2022&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/15wrgivn6FSnuBUnMwjjhadmD-g1fkS7T/view?usp=sharing Lecture 2] Basic Sampling&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1gf7oRQIpvSvMScyJa5hexB9CCZvdozPs#scrollTo=lDznlLouvlFx Tutorial 2] [https://colab.research.google.com/drive/1tjqbjAi50C4qOqVRtTxEkTeTb10qpTms#scrollTo=uYpaubGkvogU Tutorial 2 b]  - Markov matrices &amp;amp;  Thumb rule ([https://colab.research.google.com/drive/1x9iEHG_F522uFCvD_jGdvHaMETAHfO6-#scrollTo=eSu-nLZ6vm8X solutions]) ([https://colab.research.google.com/drive/1aWVtz4ZGcpIarWiRVAnxrp1t0GDOqZxu#scrollTo=f7ohlMuZvqTr solutionsB])&lt;br /&gt;
&lt;br /&gt;
* Introductory notebooks: [https://colab.research.google.com/drive/1Ovrh1JjLzMMnxtasDgR1j84CHGU6hMxA python], [https://colab.research.google.com/drive/14PWu-C171pYhV8ven-Txc4wz5Tv1DCsK numpy] and [https://colab.research.google.com/drive/1fPjwrdxQPSyfXniyAHmyOcF_gK2fqjts matplotlib]&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1g7HXFUBQUBF0fhy5h2jYbfIAVBTqvb7-#scrollTo=U9LFX8OFhHOG Homework 1] (deadline October 1)&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
* [https://colab.research.google.com/drive/1aMo4Ur-0_b4dGhdIfxAmCC2ci1rOda_v?usp=sharing Tutorial 2] Markov matrix [https://colab.research.google.com/drive/1Q5ajzxRGXBBorA9cQ9o8V5VUVJhUXpPS?usp=sharing problems]&lt;br /&gt;
* [https://colab.research.google.com/drive/1k60-ChM3aUWjGsiRsf2Idx9jxHHtwyAb?usp=sharing Tutorial 3] Thumb rule [https://colab.research.google.com/drive/1fdKJlp0lD4k530oRuu50_Hm_T8t3jixa?usp=sharing problems]&lt;br /&gt;
--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 16, 2022&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1eY5cuNcJqYw7df0PBkxq03tEnqzTOC-5/view?usp=sharing Lecture 3 ]: Importance sampling&lt;br /&gt;
&lt;br /&gt;
*  [https://drive.google.com/file/d/1ALR_QKLXdHby54xNux39NUOk4L-Ne1EW/view?usp=sharing  Tutorial 3]: Errors and Precision&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 23, 2022&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1DijhG_856OAuj42WqY1UM47APmMy3A8B/view?usp=sharing Lecture 4]: Ising model and phase transitions &lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1sRUEs768Z6PKdJ3k7MixYeFGlufgjFrG Tutorial 4]: Ising model and phase transitions ([https://colab.research.google.com/drive/1KAQRog_YlAjKZ_hL1FMYurWdPBLNUocI solutions])&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
* [https://colab.research.google.com/drive/1nU4E_pFWjSFPNigzy8-LcJpef26IKY6x?usp=sharing Tutorial 4]: Ising model and phase transitions [https://colab.research.google.com/drive/1AEUX3U7hxDR_YYy8ld3knTEVR1KYa9SP?usp=sharing problems] &lt;br /&gt;
--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 30, 2022&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1PTya42ZS2kU87A-BxQFFIUDTs_k47men?usp=sharing Lecture 5]: Optimization &amp;amp; Dijkstra algorithm&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1ieT5BlfJsOehsa8r-LHGsFsn1dwYnawT Tutorial 5]: Simulated annealing ([https://colab.research.google.com/drive/1JNVl42KNASZiwTtqYo71z_vggjbGfKul solutions])&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
* [https://colab.research.google.com/drive/1p0ooWAXF9KNh-FztMHmVoA9yBzYOM8PC?usp=sharing Tutorial 5]: Simulated annealing [https://colab.research.google.com/drive/1txJGpzreHurWux7ev6sDsX8TjzpeQhZZ?usp=sharing problems]&lt;br /&gt;
--&amp;gt;&lt;br /&gt;
* Send your copy of Homework 1 to numphys.icfp  at   gmail.com  Thanks!&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1EPgj3la7vxDIqSQYNlOFz4rR0vHXAeae Homework 2] (deadline October 22)&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 7, 2022&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Test: &lt;br /&gt;
&lt;br /&gt;
The MCQ is composed of 19 questions (one of them counts for two).  For each question you have 4 choices: 3 wrong and 1 correct: If you check the correct one you get a point. If you are wrong you loose 1/4 of a point.  No answer given: zero points.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1iaOGxdVgk--kWUFcMDHs0zvPhsOyhB_c Tutorial 6]: Faster than the clock algorithms ([https://colab.research.google.com/drive/1bHPnJpBd5ExqKF4G5BuV_FHPE4r0_AY2#scrollTo=fQnz_gOeq40e solutions])&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
* [https://colab.research.google.com/drive/1KyT442vB4EuGKBy_Xj3j8cLtMMl4gbac?usp=sharing Tutorial 6]: Faster than the clock algorithms [https://colab.research.google.com/drive/1C-ieAwaAKwkX5MFm8aX2kNO2GNeO9CdY?usp=sharing problems]&lt;br /&gt;
--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 14, 2022&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 7: Introduction to Bayesian inference&lt;br /&gt;
&lt;br /&gt;
* Tutorial 7: Bayesian inference and single-particle tracking. [https://drive.google.com/file/d/1q9Quq5mvJ4Avv2qWgzTocU-DVIxJIVWi/view?usp=sharing Questions]. [https://drive.google.com/file/d/1xYb4wfNBysse6Q7frTw_V9TPdUQU5lUx/view?usp=sharing Data]. [https://drive.google.com/file/d/1Ba_kRo3_XMIaDLNYZlbZEw-wGXKS-29I/view?usp=sharing Starting Notebook]. [https://colab.research.google.com/drive/1VePL9X1JT6yl8LmROeZyMyf4Epcu3yOL#scrollTo=1XQNGa_fyEkJ Google colab version]. Solutions [https://drive.google.com/file/d/1Q9IjVUeL7AA8uWk8DX9Vy9vuUQ21RYh2/view?usp=sharing]. Notebook [https://drive.google.com/file/d/1ZJmpdaTQVUttEaaI1ch-reFfZGI93454/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 21, 2022&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 8: Asymptotic inference and information. Extra material: Proof of Cramer-Rao bound [https://drive.google.com/file/d/10Ph_iP6AIQ3ps9v3FwRBO9j6-qV7oKV9/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
* Tutorial 8: [https://drive.google.com/file/d/12cG4HBvzs9Oe1mbfuEYyRDmTEamW71pR/view?usp=sharing Questions]. [https://drive.google.com/file/d/1AL8sRtnqYUI8NbubfglgLazknaVIUJEo/view?usp=sharing Data ] [https://drive.google.com/file/d/1DTLzXLZUEPzoU2SsDMcAe8GaoYX8E5gH/view?usp=sharing Starting Notebook]. [https://drive.google.com/file/d/1QpMaM5ACmKUlFAyGvRnHvFVtQoEAF7-9/view?usp=sharing Bibliography] [https://drive.google.com/file/d/1p9v1PkJhwS8Ofg4RiC1nsFJAe8Mb_6WF/view?usp=sharing Solutions].  [https://drive.google.com/file/d/19erJJ4Gjw77n57VrnqaQPCxIh_-NScYT/view?usp=sharing Notebook].&lt;br /&gt;
&lt;br /&gt;
* Send your copy of Homework 2 to numphys.icfp  at   gmail.com  Thanks!&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 28, 2022&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 9: High-dimensional inference and Principal Component Analysis. Extra material: Handwritten notes on the derivation of Marcenko-Pastur spectral density [https://drive.google.com/file/d/10Yytv9itdWDDHTsM2lQHwQDMbcf-oVnd/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
* Tutorial 9: [https://drive.google.com/file/d/10y7m1mPf5R5zZN6661Eei92IUNhBL_Zu/view?usp=sharing  Replay of the neuronal activity during sleep after a task].[https://drive.google.com/file/d/11fO26XB6Ri3HDVBvtdBkYxcTRLk1iv5F/view?usp=sharing Data ]. [https://drive.google.com/file/d/1-MFN2ERs_eNs4w6XnLjfzsu2F9REluSt/view?usp=sharing Initial Notebook]. [https://drive.google.com/file/d/11ev4Zwn6DPYLwhMsLyp8S0aQFVu77Ou3/view?usp=sharing Biblio]. &lt;br /&gt;
[https://drive.google.com/file/d/11E75QwrJgDKrutGj9t5NJTRkGtuRgoBI/view?usp=sharing Solutions]. [https://drive.google.com/file/d/1-39oZNNB-35zM4V2tLWtubQnZTdMLtIz/view?usp=sharing Notebook]&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, November 25, 2022&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 10: Priors, regularisation, sparsity&lt;br /&gt;
&lt;br /&gt;
* Tutorial 10: [https://drive.google.com/file/d/14kaGKRm7uciT7uLVMW_Vqzr8ha-V-Ra2/view?usp=sharing Bayesian Inference and Priors for the analysis of gravitational waves]. [https://drive.google.com/file/d/16UTmpwKm-7UMcIbca8IIGsO-aCmcwKuD/view?usp=sharing Starting notebook on artificial data]. [https://drive.google.com/file/d/1CyiDlXs6ez9-7gnyeBU0YRgV7Nt5ibkn/view?usp=sharing Biblio][https://colab.research.google.com/drive/1pFMOawozlYOIpy0jQWkTfoq-tFp3uvhw?usp=sharing#scrollTo=6picRNBipcYN Notebook on real data] &lt;br /&gt;
[https://drive.google.com/file/d/161ZLuq5s2RpHDJWELFSKXqlf-qwrVrxA/view?usp=sharing Notebook on Artificial data] [https://drive.google.com/file/d/17qhYN8EFpcoCUHOM_juBvEGpu61GgJRx/view?usp=sharing Corrections ]&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, December 2, 2022&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 11: Probabilistic graphical models&lt;br /&gt;
&lt;br /&gt;
* Tutorial 11:[https://drive.google.com/file/d/1A5pcJICHkmHZYoa2uoAGSAWp-_ZOaIEf/view?usp=sharing Analysis of protein sequence data to infer protein structure] [https://drive.google.com/file/d/1COKr5pNoBRFwwnj7TWPQSU8mEWKvsLud/view?usp=sharing Starting notebook and data] [https://drive.google.com/file/d/1CQw1PQ6RSS6nuGxhkwOqe7LJHpOPIaVp/view?usp=sharing Biblio][https://drive.google.com/file/d/1CslX27bTp5gyhXV4ciFE8s1zMnBgJ-1O/view?usp=sharing Solutions] [https://drive.google.com/file/d/19X59x3TdIsJaccTZE71gCbZxFbOzlhj4/view?usp=sharing Final notebook]&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, December 9, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 12: Hidden Markov Models. Extra material: Pedagogical introduction to Kalman filters [https://drive.google.com/file/d/0B4HvoS7Zt11LZUxVLTkyVXRQRUE/view?usp=sharing&amp;amp;resourcekey=0-CzsYaRIrPP2sN-UmwfiLHQ]&lt;br /&gt;
&lt;br /&gt;
* Tutorial 12: &lt;br /&gt;
[https://drive.google.com/file/d/1FLbWZRWJ1JILZV41RjwVKR7mOhNMhLV9/view?usp=sharing Hidden Markov Models Hidden  for identification of recombinations in SARS-CoV-2 viral genomes] [https://drive.google.com/file/d/1FCAg0ihMWoAk-_dtt5ORncjVjkVu-m4D/view?usp=sharing Starting Notebook and Data][https://drive.google.com/file/d/1HMREe6ge7_K-lOKC4f2FwL7vnEa1_8Yf/view?usp=sharing Bibliography] [https://drive.google.com/file/d/1FLDBJmNtXogHiO5VfScGiePTCxMFy1KZ/view?usp=sharing Final Notebook] [https://drive.google.com/file/d/1FBQaNJ2RhjwW_VSut2oC7mZYl5F8RWfS/view?usp=sharing Solutions]&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, December 16, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 13: Unsupervised learning and representations&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1p2c35gHMr4_Ptdmwsh3jGJz__9NNIgLw Tutorial 13]: How restricted Boltzmann machines learn ([https://colab.research.google.com/drive/1gnaK_vmTESTV3Ex_A1gqcee6Q58iKyld solutions])&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Final examination of the data-driven course (January 7, 2022)&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Example of exam: On-line Principal Component Analysis [https://drive.google.com/file/d/1BbRY4b3OCVYAtYH4m6ry19KcA2gkp3pH/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
* On-line version of the book [https://drive.google.com/file/d/161YHZA7i2YU-8emy6IPUFhsOXzFRxSRS/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
* Examination repository [https://drive.google.com/file/d/19DNkNBed0Ir5a9N048ZFV4_xF0KG3kcy/view?usp=sharing]&lt;/div&gt;</summary>
		<author><name>Alberto</name></author>
	</entry>
	<entry>
		<id>http://www.lptms.universite-paris-saclay.fr//wiki-cours/index.php?title=CoDaDri2&amp;diff=1761</id>
		<title>CoDaDri2</title>
		<link rel="alternate" type="text/html" href="http://www.lptms.universite-paris-saclay.fr//wiki-cours/index.php?title=CoDaDri2&amp;diff=1761"/>
		<updated>2022-06-22T13:07:16Z</updated>

		<summary type="html">&lt;p&gt;Alberto: /* Schedule */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;=Breaking news:=&lt;br /&gt;
&lt;br /&gt;
* Update with course schedule&lt;br /&gt;
&lt;br /&gt;
= Computational and Data Driven Physics =&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Modern physics is characterized by an increasing complexity of systems under investigation, in&lt;br /&gt;
domains as diverse as condensed matter, astrophysics, biophysics, etc. Establishing adequate&lt;br /&gt;
models to describe these systems and being able to make quantitative predictions from those models&lt;br /&gt;
is extremely challenging. The goal of the course is to provide the tools and concepts necessary to tackle those systems.&lt;br /&gt;
&lt;br /&gt;
== Course description ==&lt;br /&gt;
&lt;br /&gt;
We will first cover many algorithms used in many-body problems and complex systems, with special emphasis on Monte Carlo methods, molecular dynamics, and optimization in complex landscapes. &lt;br /&gt;
&lt;br /&gt;
Second, we will provide statistical inference and machine learning tools to harness the growing availability of experimental data to design accurate models of the underlying, complex, strongly non-homogeneous and interacting systems. &lt;br /&gt;
&lt;br /&gt;
Each theoretical lecture will be followed by a tutorial illustrating the concepts with practical applications&lt;br /&gt;
borrowed from various domains of physics. We will focus on methods and algorithms and physics, not&lt;br /&gt;
on programming and heavy numerics!  You will have to hand in 3 homeworks.&lt;br /&gt;
&lt;br /&gt;
*[https://drive.google.com/file/d/11w7KI5Pi59VWLX1mqiQ8ZyY8YQHRUeMz/view?usp=sharing Preliminary version of the book: Information, Inference, Networks: From statistical physics to big biological data]&lt;br /&gt;
&lt;br /&gt;
== The Team ==&lt;br /&gt;
&lt;br /&gt;
* [http://lptms.u-psud.fr/alberto_rosso/ Alberto Rosso] (Computational physics)&lt;br /&gt;
* [http://www.phys.ens.fr/~monasson/ Rémi Monasson] (Data-driven physics)&lt;br /&gt;
*  [http://www.lps.ens.fr/~cocco/ Simona Cocco]  &amp;amp; [https://www.cpht.polytechnique.fr/?q=en/node/110 Michel Ferrero] (Tutorials)&lt;br /&gt;
* [ Vincenzo Maria Schimmenti] (Tutor)&lt;br /&gt;
&lt;br /&gt;
== Where and When ==&lt;br /&gt;
&lt;br /&gt;
* Lectures on Fridays: 14:00-16:00&lt;br /&gt;
* Tutorials on Fridays: 16:00-18:00&lt;br /&gt;
* ENS, 29 rue D&#039;Ulm, salle Borel + Djebar&lt;br /&gt;
&lt;br /&gt;
== Slack ==&lt;br /&gt;
&lt;br /&gt;
If you have questions or want to discuss topics related to the lecture, to the exercises or to the homeworks, you can use the&lt;br /&gt;
[XXX Computational and Data Driven Physics Slack]. In order to join the Slack&lt;br /&gt;
use the following [XXX invitation link].&lt;br /&gt;
&lt;br /&gt;
== Computer Requirements ==&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;No previous experience in programming is required.&#039;&#039;&#039; &amp;lt;br&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Programming Language: Python&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
For practical installation, we recommand either to use  Anaconda (See [[Memento Python]]) or use google colab. &amp;lt;br&amp;gt;&lt;br /&gt;
The Collaboratory platform from Google is quite good way to use powerful computer without buying one: It requires no specific hardware or software, and even allows you to use GPU computing for free,  all by writting a jupyter notebook that you can then share.&lt;br /&gt;
&lt;br /&gt;
== Grading ==&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Computational Physics:&#039;&#039;&#039;&lt;br /&gt;
* Homework 1: 5 points &lt;br /&gt;
* Homework 2: 5 points&lt;br /&gt;
* Multiple Choice Questions in November: 10 points&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Data Driven Physics:&#039;&#039;&#039;&lt;br /&gt;
* Homework 3: 5 points&lt;br /&gt;
* Final exam in January: 15 points&lt;br /&gt;
&lt;br /&gt;
== Schedule ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 2, 2022 &#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1X9h3lKD0OZLTKtxb7DWPfynY42rRuE7j/view?usp=sharing Lecture 1]   Introduction to Monte Carlo&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1sIv3qOdyE-XYkjYC-dkNsR72f4BgaQ_y/view?usp=sharing Tutorial 1] Markov Matrix&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 9, 2022&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/15wrgivn6FSnuBUnMwjjhadmD-g1fkS7T/view?usp=sharing Lecture 2] Basic Sampling&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1gf7oRQIpvSvMScyJa5hexB9CCZvdozPs#scrollTo=lDznlLouvlFx Tutorial 2] [https://colab.research.google.com/drive/1tjqbjAi50C4qOqVRtTxEkTeTb10qpTms#scrollTo=uYpaubGkvogU Tutorial 2 b]  - Markov matrices &amp;amp;  Thumb rule ([https://colab.research.google.com/drive/1x9iEHG_F522uFCvD_jGdvHaMETAHfO6-#scrollTo=eSu-nLZ6vm8X solutions]) ([https://colab.research.google.com/drive/1aWVtz4ZGcpIarWiRVAnxrp1t0GDOqZxu#scrollTo=f7ohlMuZvqTr solutionsB])&lt;br /&gt;
&lt;br /&gt;
* Introductory notebooks: [https://colab.research.google.com/drive/1Ovrh1JjLzMMnxtasDgR1j84CHGU6hMxA python], [https://colab.research.google.com/drive/14PWu-C171pYhV8ven-Txc4wz5Tv1DCsK numpy] and [https://colab.research.google.com/drive/1fPjwrdxQPSyfXniyAHmyOcF_gK2fqjts matplotlib]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1g7HXFUBQUBF0fhy5h2jYbfIAVBTqvb7-#scrollTo=U9LFX8OFhHOG Homework 1] (deadline October 1)&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
* [https://colab.research.google.com/drive/1aMo4Ur-0_b4dGhdIfxAmCC2ci1rOda_v?usp=sharing Tutorial 2] Markov matrix [https://colab.research.google.com/drive/1Q5ajzxRGXBBorA9cQ9o8V5VUVJhUXpPS?usp=sharing problems]&lt;br /&gt;
* [https://colab.research.google.com/drive/1k60-ChM3aUWjGsiRsf2Idx9jxHHtwyAb?usp=sharing Tutorial 3] Thumb rule [https://colab.research.google.com/drive/1fdKJlp0lD4k530oRuu50_Hm_T8t3jixa?usp=sharing problems]&lt;br /&gt;
--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 16, 2022&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1eY5cuNcJqYw7df0PBkxq03tEnqzTOC-5/view?usp=sharing Lecture 3 ]: Importance sampling&lt;br /&gt;
&lt;br /&gt;
*  [https://drive.google.com/file/d/1ALR_QKLXdHby54xNux39NUOk4L-Ne1EW/view?usp=sharing  Tutorial 3]: Errors and Precision&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 23, 2022&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1DijhG_856OAuj42WqY1UM47APmMy3A8B/view?usp=sharing Lecture 4]: Ising model and phase transitions &lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1sRUEs768Z6PKdJ3k7MixYeFGlufgjFrG Tutorial 4]: Ising model and phase transitions ([https://colab.research.google.com/drive/1KAQRog_YlAjKZ_hL1FMYurWdPBLNUocI solutions])&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
* [https://colab.research.google.com/drive/1nU4E_pFWjSFPNigzy8-LcJpef26IKY6x?usp=sharing Tutorial 4]: Ising model and phase transitions [https://colab.research.google.com/drive/1AEUX3U7hxDR_YYy8ld3knTEVR1KYa9SP?usp=sharing problems] &lt;br /&gt;
--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 30, 2022&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1PTya42ZS2kU87A-BxQFFIUDTs_k47men?usp=sharing Lecture 5]: Optimization &amp;amp; Dijkstra algorithm&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1ieT5BlfJsOehsa8r-LHGsFsn1dwYnawT Tutorial 5]: Simulated annealing ([https://colab.research.google.com/drive/1JNVl42KNASZiwTtqYo71z_vggjbGfKul solutions])&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
* [https://colab.research.google.com/drive/1p0ooWAXF9KNh-FztMHmVoA9yBzYOM8PC?usp=sharing Tutorial 5]: Simulated annealing [https://colab.research.google.com/drive/1txJGpzreHurWux7ev6sDsX8TjzpeQhZZ?usp=sharing problems]&lt;br /&gt;
--&amp;gt;&lt;br /&gt;
* Send your copy of Homework 1 to numphys.icfp  at   gmail.com  Thanks!&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1EPgj3la7vxDIqSQYNlOFz4rR0vHXAeae Homework 2] (deadline October 22)&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 7, 2022&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Test: XXX&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1iaOGxdVgk--kWUFcMDHs0zvPhsOyhB_c Tutorial 6]: Faster than the clock algorithms ([https://colab.research.google.com/drive/1bHPnJpBd5ExqKF4G5BuV_FHPE4r0_AY2#scrollTo=fQnz_gOeq40e solutions])&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
* [https://colab.research.google.com/drive/1KyT442vB4EuGKBy_Xj3j8cLtMMl4gbac?usp=sharing Tutorial 6]: Faster than the clock algorithms [https://colab.research.google.com/drive/1C-ieAwaAKwkX5MFm8aX2kNO2GNeO9CdY?usp=sharing problems]&lt;br /&gt;
--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 14, 2022&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* Lecture 7: Introduction to Bayesian inference&lt;br /&gt;
&lt;br /&gt;
* Tutorial 7: Bayesian inference and single-particle tracking. [https://drive.google.com/file/d/1q9Quq5mvJ4Avv2qWgzTocU-DVIxJIVWi/view?usp=sharing Questions]. [https://drive.google.com/file/d/1xYb4wfNBysse6Q7frTw_V9TPdUQU5lUx/view?usp=sharing Data]. [https://drive.google.com/file/d/1Ba_kRo3_XMIaDLNYZlbZEw-wGXKS-29I/view?usp=sharing Starting Notebook]. [https://colab.research.google.com/drive/1VePL9X1JT6yl8LmROeZyMyf4Epcu3yOL#scrollTo=1XQNGa_fyEkJ Google colab version]. Solutions [https://drive.google.com/file/d/1Q9IjVUeL7AA8uWk8DX9Vy9vuUQ21RYh2/view?usp=sharing]. Notebook [https://drive.google.com/file/d/1ZJmpdaTQVUttEaaI1ch-reFfZGI93454/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 22, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 8: Asymptotic inference and information. Extra material: Proof of Cramer-Rao bound [https://drive.google.com/file/d/10Ph_iP6AIQ3ps9v3FwRBO9j6-qV7oKV9/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
* Tutorial 8: [https://drive.google.com/file/d/12cG4HBvzs9Oe1mbfuEYyRDmTEamW71pR/view?usp=sharing Questions]. [https://drive.google.com/file/d/1AL8sRtnqYUI8NbubfglgLazknaVIUJEo/view?usp=sharing Data ] [https://drive.google.com/file/d/1DTLzXLZUEPzoU2SsDMcAe8GaoYX8E5gH/view?usp=sharing Starting Notebook]. [https://drive.google.com/file/d/1QpMaM5ACmKUlFAyGvRnHvFVtQoEAF7-9/view?usp=sharing Bibliography] [https://drive.google.com/file/d/1p9v1PkJhwS8Ofg4RiC1nsFJAe8Mb_6WF/view?usp=sharing Solutions].  [https://drive.google.com/file/d/19erJJ4Gjw77n57VrnqaQPCxIh_-NScYT/view?usp=sharing Notebook].&lt;br /&gt;
&lt;br /&gt;
* Send your copy of Homework 2 to numphys.icfp  at   gmail.com  Thanks!&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 29, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 9: High-dimensional inference and Principal Component Analysis. Extra material: Handwritten notes on the derivation of Marcenko-Pastur spectral density [https://drive.google.com/file/d/10Yytv9itdWDDHTsM2lQHwQDMbcf-oVnd/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
* Tutorial 9: [https://drive.google.com/file/d/10y7m1mPf5R5zZN6661Eei92IUNhBL_Zu/view?usp=sharing  Replay of the neuronal activity during sleep after a task].[https://drive.google.com/file/d/11fO26XB6Ri3HDVBvtdBkYxcTRLk1iv5F/view?usp=sharing Data ]. [https://drive.google.com/file/d/1-MFN2ERs_eNs4w6XnLjfzsu2F9REluSt/view?usp=sharing Initial Notebook]. [https://drive.google.com/file/d/11ev4Zwn6DPYLwhMsLyp8S0aQFVu77Ou3/view?usp=sharing Biblio]. &lt;br /&gt;
[https://drive.google.com/file/d/11E75QwrJgDKrutGj9t5NJTRkGtuRgoBI/view?usp=sharing Solutions]. [https://drive.google.com/file/d/1-39oZNNB-35zM4V2tLWtubQnZTdMLtIz/view?usp=sharing Notebook]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, November 12, 2021, 2 pm: The Quiz.&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
The MCQ is composed of 19 questions (one of them counts for two).  For each question you have 4 choices: 3 wrong and 1 correct: If you check the correct one you get a point. If you are wrong you loose 1/4 of a point.  No answer given: zero points.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
MCQ Solution (correct answers in bold):[https://drive.google.com/file/d/1WWcqxFzmCJp2ZXC02a70a1o17pGupdyZ/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, November 26, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 10: Priors, regularisation, sparsity&lt;br /&gt;
&lt;br /&gt;
* Tutorial 10: [https://drive.google.com/file/d/14kaGKRm7uciT7uLVMW_Vqzr8ha-V-Ra2/view?usp=sharing Bayesian Inference and Priors for the analysis of gravitational waves]. [https://drive.google.com/file/d/16UTmpwKm-7UMcIbca8IIGsO-aCmcwKuD/view?usp=sharing Starting notebook on artificial data]. [https://drive.google.com/file/d/1CyiDlXs6ez9-7gnyeBU0YRgV7Nt5ibkn/view?usp=sharing Biblio][https://colab.research.google.com/drive/1pFMOawozlYOIpy0jQWkTfoq-tFp3uvhw?usp=sharing#scrollTo=6picRNBipcYN Notebook on real data] &lt;br /&gt;
[https://drive.google.com/file/d/161ZLuq5s2RpHDJWELFSKXqlf-qwrVrxA/view?usp=sharing Notebook on Artificial data] [https://drive.google.com/file/d/17qhYN8EFpcoCUHOM_juBvEGpu61GgJRx/view?usp=sharing Corrections ]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, December 3, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 11: Probabilistic graphical models&lt;br /&gt;
&lt;br /&gt;
* Tutorial 11:[https://drive.google.com/file/d/1A5pcJICHkmHZYoa2uoAGSAWp-_ZOaIEf/view?usp=sharing Analysis of protein sequence data to infer protein structure] [https://drive.google.com/file/d/1COKr5pNoBRFwwnj7TWPQSU8mEWKvsLud/view?usp=sharing Starting notebook and data] [https://drive.google.com/file/d/1CQw1PQ6RSS6nuGxhkwOqe7LJHpOPIaVp/view?usp=sharing Biblio][https://drive.google.com/file/d/1CslX27bTp5gyhXV4ciFE8s1zMnBgJ-1O/view?usp=sharing Solutions] [https://drive.google.com/file/d/19X59x3TdIsJaccTZE71gCbZxFbOzlhj4/view?usp=sharing Final notebook]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, December 10, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 12: Hidden Markov Models. Extra material: Pedagogical introduction to Kalman filters [https://drive.google.com/file/d/0B4HvoS7Zt11LZUxVLTkyVXRQRUE/view?usp=sharing&amp;amp;resourcekey=0-CzsYaRIrPP2sN-UmwfiLHQ]&lt;br /&gt;
&lt;br /&gt;
* Tutorial 12: &lt;br /&gt;
[https://drive.google.com/file/d/1FLbWZRWJ1JILZV41RjwVKR7mOhNMhLV9/view?usp=sharing Hidden Markov Models Hidden  for identification of recombinations in SARS-CoV-2 viral genomes] [https://drive.google.com/file/d/1FCAg0ihMWoAk-_dtt5ORncjVjkVu-m4D/view?usp=sharing Starting Notebook and Data][https://drive.google.com/file/d/1HMREe6ge7_K-lOKC4f2FwL7vnEa1_8Yf/view?usp=sharing Bibliography] [https://drive.google.com/file/d/1FLDBJmNtXogHiO5VfScGiePTCxMFy1KZ/view?usp=sharing Final Notebook] [https://drive.google.com/file/d/1FBQaNJ2RhjwW_VSut2oC7mZYl5F8RWfS/view?usp=sharing Solutions]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, December 17, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 13: Unsupervised learning and representations&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1p2c35gHMr4_Ptdmwsh3jGJz__9NNIgLw Tutorial 13]: How restricted Boltzmann machines learn ([https://colab.research.google.com/drive/1gnaK_vmTESTV3Ex_A1gqcee6Q58iKyld solutions])&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Final examination of the data-driven course (January 7, 2022)&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Example of exam: On-line Principal Component Analysis [https://drive.google.com/file/d/1BbRY4b3OCVYAtYH4m6ry19KcA2gkp3pH/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
* On-line version of the book [https://drive.google.com/file/d/161YHZA7i2YU-8emy6IPUFhsOXzFRxSRS/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
* Examination repository [https://drive.google.com/file/d/19DNkNBed0Ir5a9N048ZFV4_xF0KG3kcy/view?usp=sharing]&lt;/div&gt;</summary>
		<author><name>Alberto</name></author>
	</entry>
	<entry>
		<id>http://www.lptms.universite-paris-saclay.fr//wiki-cours/index.php?title=CoDaDri2&amp;diff=1760</id>
		<title>CoDaDri2</title>
		<link rel="alternate" type="text/html" href="http://www.lptms.universite-paris-saclay.fr//wiki-cours/index.php?title=CoDaDri2&amp;diff=1760"/>
		<updated>2022-06-22T12:26:08Z</updated>

		<summary type="html">&lt;p&gt;Alberto: /* Schedule */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;=Breaking news:=&lt;br /&gt;
&lt;br /&gt;
* Update with course schedule&lt;br /&gt;
&lt;br /&gt;
= Computational and Data Driven Physics =&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Modern physics is characterized by an increasing complexity of systems under investigation, in&lt;br /&gt;
domains as diverse as condensed matter, astrophysics, biophysics, etc. Establishing adequate&lt;br /&gt;
models to describe these systems and being able to make quantitative predictions from those models&lt;br /&gt;
is extremely challenging. The goal of the course is to provide the tools and concepts necessary to tackle those systems.&lt;br /&gt;
&lt;br /&gt;
== Course description ==&lt;br /&gt;
&lt;br /&gt;
We will first cover many algorithms used in many-body problems and complex systems, with special emphasis on Monte Carlo methods, molecular dynamics, and optimization in complex landscapes. &lt;br /&gt;
&lt;br /&gt;
Second, we will provide statistical inference and machine learning tools to harness the growing availability of experimental data to design accurate models of the underlying, complex, strongly non-homogeneous and interacting systems. &lt;br /&gt;
&lt;br /&gt;
Each theoretical lecture will be followed by a tutorial illustrating the concepts with practical applications&lt;br /&gt;
borrowed from various domains of physics. We will focus on methods and algorithms and physics, not&lt;br /&gt;
on programming and heavy numerics!  You will have to hand in 3 homeworks.&lt;br /&gt;
&lt;br /&gt;
*[https://drive.google.com/file/d/11w7KI5Pi59VWLX1mqiQ8ZyY8YQHRUeMz/view?usp=sharing Preliminary version of the book: Information, Inference, Networks: From statistical physics to big biological data]&lt;br /&gt;
&lt;br /&gt;
== The Team ==&lt;br /&gt;
&lt;br /&gt;
* [http://lptms.u-psud.fr/alberto_rosso/ Alberto Rosso] (Computational physics)&lt;br /&gt;
* [http://www.phys.ens.fr/~monasson/ Rémi Monasson] (Data-driven physics)&lt;br /&gt;
*  [http://www.lps.ens.fr/~cocco/ Simona Cocco]  &amp;amp; [https://www.cpht.polytechnique.fr/?q=en/node/110 Michel Ferrero] (Tutorials)&lt;br /&gt;
* [ Vincenzo Maria Schimmenti] (Tutor)&lt;br /&gt;
&lt;br /&gt;
== Where and When ==&lt;br /&gt;
&lt;br /&gt;
* Lectures on Fridays: 14:00-16:00&lt;br /&gt;
* Tutorials on Fridays: 16:00-18:00&lt;br /&gt;
* ENS, 29 rue D&#039;Ulm, salle Borel + Djebar&lt;br /&gt;
&lt;br /&gt;
== Slack ==&lt;br /&gt;
&lt;br /&gt;
If you have questions or want to discuss topics related to the lecture, to the exercises or to the homeworks, you can use the&lt;br /&gt;
[XXX Computational and Data Driven Physics Slack]. In order to join the Slack&lt;br /&gt;
use the following [XXX invitation link].&lt;br /&gt;
&lt;br /&gt;
== Computer Requirements ==&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;No previous experience in programming is required.&#039;&#039;&#039; &amp;lt;br&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Programming Language: Python&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
For practical installation, we recommand either to use  Anaconda (See [[Memento Python]]) or use google colab. &amp;lt;br&amp;gt;&lt;br /&gt;
The Collaboratory platform from Google is quite good way to use powerful computer without buying one: It requires no specific hardware or software, and even allows you to use GPU computing for free,  all by writting a jupyter notebook that you can then share.&lt;br /&gt;
&lt;br /&gt;
== Grading ==&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Computational Physics:&#039;&#039;&#039;&lt;br /&gt;
* Homework 1: 5 points &lt;br /&gt;
* Homework 2: 5 points&lt;br /&gt;
* Multiple Choice Questions in November: 10 points&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Data Driven Physics:&#039;&#039;&#039;&lt;br /&gt;
* Homework 3: 5 points&lt;br /&gt;
* Final exam in January: 15 points&lt;br /&gt;
&lt;br /&gt;
== Schedule ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 2, 2022 &#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1X9h3lKD0OZLTKtxb7DWPfynY42rRuE7j/view?usp=sharing Lecture 1]   Introduction to Monte Carlo&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1sIv3qOdyE-XYkjYC-dkNsR72f4BgaQ_y/view?usp=sharing Tutorial 1] Markov Matrix&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 9, 2022&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Introductory notebooks: [https://colab.research.google.com/drive/1Ovrh1JjLzMMnxtasDgR1j84CHGU6hMxA python], [https://colab.research.google.com/drive/14PWu-C171pYhV8ven-Txc4wz5Tv1DCsK numpy] and [https://colab.research.google.com/drive/1fPjwrdxQPSyfXniyAHmyOcF_gK2fqjts matplotlib]&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1gf7oRQIpvSvMScyJa5hexB9CCZvdozPs#scrollTo=lDznlLouvlFx Tutorial 2] - Markov matrices ([https://colab.research.google.com/drive/1x9iEHG_F522uFCvD_jGdvHaMETAHfO6-#scrollTo=eSu-nLZ6vm8X solutions])&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1tjqbjAi50C4qOqVRtTxEkTeTb10qpTms#scrollTo=uYpaubGkvogU Tutorial 3] - Thumb rule ([https://colab.research.google.com/drive/1aWVtz4ZGcpIarWiRVAnxrp1t0GDOqZxu#scrollTo=f7ohlMuZvqTr solutions])&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1g7HXFUBQUBF0fhy5h2jYbfIAVBTqvb7-#scrollTo=U9LFX8OFhHOG Homework 1] (deadline October 1)&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
* [https://colab.research.google.com/drive/1aMo4Ur-0_b4dGhdIfxAmCC2ci1rOda_v?usp=sharing Tutorial 2] Markov matrix [https://colab.research.google.com/drive/1Q5ajzxRGXBBorA9cQ9o8V5VUVJhUXpPS?usp=sharing problems]&lt;br /&gt;
* [https://colab.research.google.com/drive/1k60-ChM3aUWjGsiRsf2Idx9jxHHtwyAb?usp=sharing Tutorial 3] Thumb rule [https://colab.research.google.com/drive/1fdKJlp0lD4k530oRuu50_Hm_T8t3jixa?usp=sharing problems]&lt;br /&gt;
--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/15wrgivn6FSnuBUnMwjjhadmD-g1fkS7T/view?usp=sharing Lecture 2] Basic Sampling&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 16, 2022&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1eY5cuNcJqYw7df0PBkxq03tEnqzTOC-5/view?usp=sharing Lecture 7]: Importance sampling&lt;br /&gt;
&lt;br /&gt;
*  [https://drive.google.com/file/d/1ALR_QKLXdHby54xNux39NUOk4L-Ne1EW/view?usp=sharing  Lecture 3]: Errors and Precision&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 23, 2022&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1DijhG_856OAuj42WqY1UM47APmMy3A8B/view?usp=sharing Lecture 4]: Ising model and phase transitions &lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1sRUEs768Z6PKdJ3k7MixYeFGlufgjFrG Tutorial 4]: Ising model and phase transitions ([https://colab.research.google.com/drive/1KAQRog_YlAjKZ_hL1FMYurWdPBLNUocI solutions])&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
* [https://colab.research.google.com/drive/1nU4E_pFWjSFPNigzy8-LcJpef26IKY6x?usp=sharing Tutorial 4]: Ising model and phase transitions [https://colab.research.google.com/drive/1AEUX3U7hxDR_YYy8ld3knTEVR1KYa9SP?usp=sharing problems] &lt;br /&gt;
--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 30, 2022&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1PTya42ZS2kU87A-BxQFFIUDTs_k47men?usp=sharing Lecture 5]: Optimization &amp;amp; Dijkstra algorithm&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1ieT5BlfJsOehsa8r-LHGsFsn1dwYnawT Tutorial 5]: Simulated annealing ([https://colab.research.google.com/drive/1JNVl42KNASZiwTtqYo71z_vggjbGfKul solutions])&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
* [https://colab.research.google.com/drive/1p0ooWAXF9KNh-FztMHmVoA9yBzYOM8PC?usp=sharing Tutorial 5]: Simulated annealing [https://colab.research.google.com/drive/1txJGpzreHurWux7ev6sDsX8TjzpeQhZZ?usp=sharing problems]&lt;br /&gt;
--&amp;gt;&lt;br /&gt;
* Send your copy of Homework 1 to numphys.icfp  at   gmail.com  Thanks!&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1EPgj3la7vxDIqSQYNlOFz4rR0vHXAeae Homework 2] (deadline October 22)&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 7, 2022&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Test: XXX&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1iaOGxdVgk--kWUFcMDHs0zvPhsOyhB_c Tutorial 7]: Faster than the clock algorithms ([https://colab.research.google.com/drive/1bHPnJpBd5ExqKF4G5BuV_FHPE4r0_AY2#scrollTo=fQnz_gOeq40e solutions])&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
* [https://colab.research.google.com/drive/1KyT442vB4EuGKBy_Xj3j8cLtMMl4gbac?usp=sharing Tutorial 6]: Faster than the clock algorithms [https://colab.research.google.com/drive/1C-ieAwaAKwkX5MFm8aX2kNO2GNeO9CdY?usp=sharing problems]&lt;br /&gt;
--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 14, 2022&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* Lecture 7: Introduction to Bayesian inference&lt;br /&gt;
&lt;br /&gt;
* Tutorial 7: Bayesian inference and single-particle tracking. [https://drive.google.com/file/d/1q9Quq5mvJ4Avv2qWgzTocU-DVIxJIVWi/view?usp=sharing Questions]. [https://drive.google.com/file/d/1xYb4wfNBysse6Q7frTw_V9TPdUQU5lUx/view?usp=sharing Data]. [https://drive.google.com/file/d/1Ba_kRo3_XMIaDLNYZlbZEw-wGXKS-29I/view?usp=sharing Starting Notebook]. [https://colab.research.google.com/drive/1VePL9X1JT6yl8LmROeZyMyf4Epcu3yOL#scrollTo=1XQNGa_fyEkJ Google colab version]. Solutions [https://drive.google.com/file/d/1Q9IjVUeL7AA8uWk8DX9Vy9vuUQ21RYh2/view?usp=sharing]. Notebook [https://drive.google.com/file/d/1ZJmpdaTQVUttEaaI1ch-reFfZGI93454/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 22, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 8: Asymptotic inference and information. Extra material: Proof of Cramer-Rao bound [https://drive.google.com/file/d/10Ph_iP6AIQ3ps9v3FwRBO9j6-qV7oKV9/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
* Tutorial 8: [https://drive.google.com/file/d/12cG4HBvzs9Oe1mbfuEYyRDmTEamW71pR/view?usp=sharing Questions]. [https://drive.google.com/file/d/1AL8sRtnqYUI8NbubfglgLazknaVIUJEo/view?usp=sharing Data ] [https://drive.google.com/file/d/1DTLzXLZUEPzoU2SsDMcAe8GaoYX8E5gH/view?usp=sharing Starting Notebook]. [https://drive.google.com/file/d/1QpMaM5ACmKUlFAyGvRnHvFVtQoEAF7-9/view?usp=sharing Bibliography] [https://drive.google.com/file/d/1p9v1PkJhwS8Ofg4RiC1nsFJAe8Mb_6WF/view?usp=sharing Solutions].  [https://drive.google.com/file/d/19erJJ4Gjw77n57VrnqaQPCxIh_-NScYT/view?usp=sharing Notebook].&lt;br /&gt;
&lt;br /&gt;
* Send your copy of Homework 2 to numphys.icfp  at   gmail.com  Thanks!&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 29, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 9: High-dimensional inference and Principal Component Analysis. Extra material: Handwritten notes on the derivation of Marcenko-Pastur spectral density [https://drive.google.com/file/d/10Yytv9itdWDDHTsM2lQHwQDMbcf-oVnd/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
* Tutorial 9: [https://drive.google.com/file/d/10y7m1mPf5R5zZN6661Eei92IUNhBL_Zu/view?usp=sharing  Replay of the neuronal activity during sleep after a task].[https://drive.google.com/file/d/11fO26XB6Ri3HDVBvtdBkYxcTRLk1iv5F/view?usp=sharing Data ]. [https://drive.google.com/file/d/1-MFN2ERs_eNs4w6XnLjfzsu2F9REluSt/view?usp=sharing Initial Notebook]. [https://drive.google.com/file/d/11ev4Zwn6DPYLwhMsLyp8S0aQFVu77Ou3/view?usp=sharing Biblio]. &lt;br /&gt;
[https://drive.google.com/file/d/11E75QwrJgDKrutGj9t5NJTRkGtuRgoBI/view?usp=sharing Solutions]. [https://drive.google.com/file/d/1-39oZNNB-35zM4V2tLWtubQnZTdMLtIz/view?usp=sharing Notebook]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, November 12, 2021, 2 pm: The Quiz.&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
The MCQ is composed of 19 questions (one of them counts for two).  For each question you have 4 choices: 3 wrong and 1 correct: If you check the correct one you get a point. If you are wrong you loose 1/4 of a point.  No answer given: zero points.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
MCQ Solution (correct answers in bold):[https://drive.google.com/file/d/1WWcqxFzmCJp2ZXC02a70a1o17pGupdyZ/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, November 26, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 10: Priors, regularisation, sparsity&lt;br /&gt;
&lt;br /&gt;
* Tutorial 10: [https://drive.google.com/file/d/14kaGKRm7uciT7uLVMW_Vqzr8ha-V-Ra2/view?usp=sharing Bayesian Inference and Priors for the analysis of gravitational waves]. [https://drive.google.com/file/d/16UTmpwKm-7UMcIbca8IIGsO-aCmcwKuD/view?usp=sharing Starting notebook on artificial data]. [https://drive.google.com/file/d/1CyiDlXs6ez9-7gnyeBU0YRgV7Nt5ibkn/view?usp=sharing Biblio][https://colab.research.google.com/drive/1pFMOawozlYOIpy0jQWkTfoq-tFp3uvhw?usp=sharing#scrollTo=6picRNBipcYN Notebook on real data] &lt;br /&gt;
[https://drive.google.com/file/d/161ZLuq5s2RpHDJWELFSKXqlf-qwrVrxA/view?usp=sharing Notebook on Artificial data] [https://drive.google.com/file/d/17qhYN8EFpcoCUHOM_juBvEGpu61GgJRx/view?usp=sharing Corrections ]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, December 3, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 11: Probabilistic graphical models&lt;br /&gt;
&lt;br /&gt;
* Tutorial 11:[https://drive.google.com/file/d/1A5pcJICHkmHZYoa2uoAGSAWp-_ZOaIEf/view?usp=sharing Analysis of protein sequence data to infer protein structure] [https://drive.google.com/file/d/1COKr5pNoBRFwwnj7TWPQSU8mEWKvsLud/view?usp=sharing Starting notebook and data] [https://drive.google.com/file/d/1CQw1PQ6RSS6nuGxhkwOqe7LJHpOPIaVp/view?usp=sharing Biblio][https://drive.google.com/file/d/1CslX27bTp5gyhXV4ciFE8s1zMnBgJ-1O/view?usp=sharing Solutions] [https://drive.google.com/file/d/19X59x3TdIsJaccTZE71gCbZxFbOzlhj4/view?usp=sharing Final notebook]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, December 10, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 12: Hidden Markov Models. Extra material: Pedagogical introduction to Kalman filters [https://drive.google.com/file/d/0B4HvoS7Zt11LZUxVLTkyVXRQRUE/view?usp=sharing&amp;amp;resourcekey=0-CzsYaRIrPP2sN-UmwfiLHQ]&lt;br /&gt;
&lt;br /&gt;
* Tutorial 12: &lt;br /&gt;
[https://drive.google.com/file/d/1FLbWZRWJ1JILZV41RjwVKR7mOhNMhLV9/view?usp=sharing Hidden Markov Models Hidden  for identification of recombinations in SARS-CoV-2 viral genomes] [https://drive.google.com/file/d/1FCAg0ihMWoAk-_dtt5ORncjVjkVu-m4D/view?usp=sharing Starting Notebook and Data][https://drive.google.com/file/d/1HMREe6ge7_K-lOKC4f2FwL7vnEa1_8Yf/view?usp=sharing Bibliography] [https://drive.google.com/file/d/1FLDBJmNtXogHiO5VfScGiePTCxMFy1KZ/view?usp=sharing Final Notebook] [https://drive.google.com/file/d/1FBQaNJ2RhjwW_VSut2oC7mZYl5F8RWfS/view?usp=sharing Solutions]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, December 17, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 13: Unsupervised learning and representations&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1p2c35gHMr4_Ptdmwsh3jGJz__9NNIgLw Tutorial 13]: How restricted Boltzmann machines learn ([https://colab.research.google.com/drive/1gnaK_vmTESTV3Ex_A1gqcee6Q58iKyld solutions])&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Final examination of the data-driven course (January 7, 2022)&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Example of exam: On-line Principal Component Analysis [https://drive.google.com/file/d/1BbRY4b3OCVYAtYH4m6ry19KcA2gkp3pH/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
* On-line version of the book [https://drive.google.com/file/d/161YHZA7i2YU-8emy6IPUFhsOXzFRxSRS/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
* Examination repository [https://drive.google.com/file/d/19DNkNBed0Ir5a9N048ZFV4_xF0KG3kcy/view?usp=sharing]&lt;/div&gt;</summary>
		<author><name>Alberto</name></author>
	</entry>
	<entry>
		<id>http://www.lptms.universite-paris-saclay.fr//wiki-cours/index.php?title=CoDaDri2&amp;diff=1759</id>
		<title>CoDaDri2</title>
		<link rel="alternate" type="text/html" href="http://www.lptms.universite-paris-saclay.fr//wiki-cours/index.php?title=CoDaDri2&amp;diff=1759"/>
		<updated>2022-06-22T12:21:52Z</updated>

		<summary type="html">&lt;p&gt;Alberto: /* Schedule */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;=Breaking news:=&lt;br /&gt;
&lt;br /&gt;
* Update with course schedule&lt;br /&gt;
&lt;br /&gt;
= Computational and Data Driven Physics =&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Modern physics is characterized by an increasing complexity of systems under investigation, in&lt;br /&gt;
domains as diverse as condensed matter, astrophysics, biophysics, etc. Establishing adequate&lt;br /&gt;
models to describe these systems and being able to make quantitative predictions from those models&lt;br /&gt;
is extremely challenging. The goal of the course is to provide the tools and concepts necessary to tackle those systems.&lt;br /&gt;
&lt;br /&gt;
== Course description ==&lt;br /&gt;
&lt;br /&gt;
We will first cover many algorithms used in many-body problems and complex systems, with special emphasis on Monte Carlo methods, molecular dynamics, and optimization in complex landscapes. &lt;br /&gt;
&lt;br /&gt;
Second, we will provide statistical inference and machine learning tools to harness the growing availability of experimental data to design accurate models of the underlying, complex, strongly non-homogeneous and interacting systems. &lt;br /&gt;
&lt;br /&gt;
Each theoretical lecture will be followed by a tutorial illustrating the concepts with practical applications&lt;br /&gt;
borrowed from various domains of physics. We will focus on methods and algorithms and physics, not&lt;br /&gt;
on programming and heavy numerics!  You will have to hand in 3 homeworks.&lt;br /&gt;
&lt;br /&gt;
*[https://drive.google.com/file/d/11w7KI5Pi59VWLX1mqiQ8ZyY8YQHRUeMz/view?usp=sharing Preliminary version of the book: Information, Inference, Networks: From statistical physics to big biological data]&lt;br /&gt;
&lt;br /&gt;
== The Team ==&lt;br /&gt;
&lt;br /&gt;
* [http://lptms.u-psud.fr/alberto_rosso/ Alberto Rosso] (Computational physics)&lt;br /&gt;
* [http://www.phys.ens.fr/~monasson/ Rémi Monasson] (Data-driven physics)&lt;br /&gt;
*  [http://www.lps.ens.fr/~cocco/ Simona Cocco]  &amp;amp; [https://www.cpht.polytechnique.fr/?q=en/node/110 Michel Ferrero] (Tutorials)&lt;br /&gt;
* [ Vincenzo Maria Schimmenti] (Tutor)&lt;br /&gt;
&lt;br /&gt;
== Where and When ==&lt;br /&gt;
&lt;br /&gt;
* Lectures on Fridays: 14:00-16:00&lt;br /&gt;
* Tutorials on Fridays: 16:00-18:00&lt;br /&gt;
* ENS, 29 rue D&#039;Ulm, salle Borel + Djebar&lt;br /&gt;
&lt;br /&gt;
== Slack ==&lt;br /&gt;
&lt;br /&gt;
If you have questions or want to discuss topics related to the lecture, to the exercises or to the homeworks, you can use the&lt;br /&gt;
[XXX Computational and Data Driven Physics Slack]. In order to join the Slack&lt;br /&gt;
use the following [XXX invitation link].&lt;br /&gt;
&lt;br /&gt;
== Computer Requirements ==&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;No previous experience in programming is required.&#039;&#039;&#039; &amp;lt;br&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Programming Language: Python&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
For practical installation, we recommand either to use  Anaconda (See [[Memento Python]]) or use google colab. &amp;lt;br&amp;gt;&lt;br /&gt;
The Collaboratory platform from Google is quite good way to use powerful computer without buying one: It requires no specific hardware or software, and even allows you to use GPU computing for free,  all by writting a jupyter notebook that you can then share.&lt;br /&gt;
&lt;br /&gt;
== Grading ==&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Computational Physics:&#039;&#039;&#039;&lt;br /&gt;
* Homework 1: 5 points &lt;br /&gt;
* Homework 2: 5 points&lt;br /&gt;
* Multiple Choice Questions in November: 10 points&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Data Driven Physics:&#039;&#039;&#039;&lt;br /&gt;
* Homework 3: 5 points&lt;br /&gt;
* Final exam in January: 15 points&lt;br /&gt;
&lt;br /&gt;
== Schedule ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 2, 2022 &#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1X9h3lKD0OZLTKtxb7DWPfynY42rRuE7j/view?usp=sharing Lecture 1]   Introduction to Monte Carlo&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1sIv3qOdyE-XYkjYC-dkNsR72f4BgaQ_y/view?usp=sharing Tutorial 1] Markov Matrix&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 9, 2022&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Introductory notebooks: [https://colab.research.google.com/drive/1Ovrh1JjLzMMnxtasDgR1j84CHGU6hMxA python], [https://colab.research.google.com/drive/14PWu-C171pYhV8ven-Txc4wz5Tv1DCsK numpy] and [https://colab.research.google.com/drive/1fPjwrdxQPSyfXniyAHmyOcF_gK2fqjts matplotlib]&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1gf7oRQIpvSvMScyJa5hexB9CCZvdozPs#scrollTo=lDznlLouvlFx Tutorial 2] - Markov matrices ([https://colab.research.google.com/drive/1x9iEHG_F522uFCvD_jGdvHaMETAHfO6-#scrollTo=eSu-nLZ6vm8X solutions])&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1tjqbjAi50C4qOqVRtTxEkTeTb10qpTms#scrollTo=uYpaubGkvogU Tutorial 3] - Thumb rule ([https://colab.research.google.com/drive/1aWVtz4ZGcpIarWiRVAnxrp1t0GDOqZxu#scrollTo=f7ohlMuZvqTr solutions])&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1g7HXFUBQUBF0fhy5h2jYbfIAVBTqvb7-#scrollTo=U9LFX8OFhHOG Homework 1] (deadline October 1)&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
* [https://colab.research.google.com/drive/1aMo4Ur-0_b4dGhdIfxAmCC2ci1rOda_v?usp=sharing Tutorial 2] Markov matrix [https://colab.research.google.com/drive/1Q5ajzxRGXBBorA9cQ9o8V5VUVJhUXpPS?usp=sharing problems]&lt;br /&gt;
* [https://colab.research.google.com/drive/1k60-ChM3aUWjGsiRsf2Idx9jxHHtwyAb?usp=sharing Tutorial 3] Thumb rule [https://colab.research.google.com/drive/1fdKJlp0lD4k530oRuu50_Hm_T8t3jixa?usp=sharing problems]&lt;br /&gt;
--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 16, 2022&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/15wrgivn6FSnuBUnMwjjhadmD-g1fkS7T/view?usp=sharing Lecture 2] Basic Sampling&lt;br /&gt;
&lt;br /&gt;
*  [https://drive.google.com/file/d/1ALR_QKLXdHby54xNux39NUOk4L-Ne1EW/view?usp=sharing  Lecture 3]: Errors and Precision&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 23, 2022&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1DijhG_856OAuj42WqY1UM47APmMy3A8B/view?usp=sharing Lecture 4]: Ising model and phase transitions &lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1sRUEs768Z6PKdJ3k7MixYeFGlufgjFrG Tutorial 4]: Ising model and phase transitions ([https://colab.research.google.com/drive/1KAQRog_YlAjKZ_hL1FMYurWdPBLNUocI solutions])&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
* [https://colab.research.google.com/drive/1nU4E_pFWjSFPNigzy8-LcJpef26IKY6x?usp=sharing Tutorial 4]: Ising model and phase transitions [https://colab.research.google.com/drive/1AEUX3U7hxDR_YYy8ld3knTEVR1KYa9SP?usp=sharing problems] &lt;br /&gt;
--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 30, 2022&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1PTya42ZS2kU87A-BxQFFIUDTs_k47men?usp=sharing Lecture 5]: Optimization &amp;amp; Dijkstra algorithm&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1ieT5BlfJsOehsa8r-LHGsFsn1dwYnawT Tutorial 5]: Simulated annealing ([https://colab.research.google.com/drive/1JNVl42KNASZiwTtqYo71z_vggjbGfKul solutions])&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
* [https://colab.research.google.com/drive/1p0ooWAXF9KNh-FztMHmVoA9yBzYOM8PC?usp=sharing Tutorial 5]: Simulated annealing [https://colab.research.google.com/drive/1txJGpzreHurWux7ev6sDsX8TjzpeQhZZ?usp=sharing problems]&lt;br /&gt;
--&amp;gt;&lt;br /&gt;
* Send your copy of Homework 1 to numphys.icfp  at   gmail.com  Thanks!&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1EPgj3la7vxDIqSQYNlOFz4rR0vHXAeae Homework 2] (deadline October 22)&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 7, 2022&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1eY5cuNcJqYw7df0PBkxq03tEnqzTOC-5/view?usp=sharing Lecture 7]: Importance sampling&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1iaOGxdVgk--kWUFcMDHs0zvPhsOyhB_c Tutorial 7]: Faster than the clock algorithms ([https://colab.research.google.com/drive/1bHPnJpBd5ExqKF4G5BuV_FHPE4r0_AY2#scrollTo=fQnz_gOeq40e solutions])&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
* [https://colab.research.google.com/drive/1KyT442vB4EuGKBy_Xj3j8cLtMMl4gbac?usp=sharing Tutorial 6]: Faster than the clock algorithms [https://colab.research.google.com/drive/1C-ieAwaAKwkX5MFm8aX2kNO2GNeO9CdY?usp=sharing problems]&lt;br /&gt;
--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* Lecture 6: Introduction to Bayesian inference&lt;br /&gt;
&lt;br /&gt;
* Tutorial 6: Bayesian inference and single-particle tracking. [https://drive.google.com/file/d/1q9Quq5mvJ4Avv2qWgzTocU-DVIxJIVWi/view?usp=sharing Questions]. [https://drive.google.com/file/d/1xYb4wfNBysse6Q7frTw_V9TPdUQU5lUx/view?usp=sharing Data]. [https://drive.google.com/file/d/1Ba_kRo3_XMIaDLNYZlbZEw-wGXKS-29I/view?usp=sharing Starting Notebook]. [https://colab.research.google.com/drive/1VePL9X1JT6yl8LmROeZyMyf4Epcu3yOL#scrollTo=1XQNGa_fyEkJ Google colab version]. Solutions [https://drive.google.com/file/d/1Q9IjVUeL7AA8uWk8DX9Vy9vuUQ21RYh2/view?usp=sharing]. Notebook [https://drive.google.com/file/d/1ZJmpdaTQVUttEaaI1ch-reFfZGI93454/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 14, 2022&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 22, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 8: Asymptotic inference and information. Extra material: Proof of Cramer-Rao bound [https://drive.google.com/file/d/10Ph_iP6AIQ3ps9v3FwRBO9j6-qV7oKV9/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
* Tutorial 8: [https://drive.google.com/file/d/12cG4HBvzs9Oe1mbfuEYyRDmTEamW71pR/view?usp=sharing Questions]. [https://drive.google.com/file/d/1AL8sRtnqYUI8NbubfglgLazknaVIUJEo/view?usp=sharing Data ] [https://drive.google.com/file/d/1DTLzXLZUEPzoU2SsDMcAe8GaoYX8E5gH/view?usp=sharing Starting Notebook]. [https://drive.google.com/file/d/1QpMaM5ACmKUlFAyGvRnHvFVtQoEAF7-9/view?usp=sharing Bibliography] [https://drive.google.com/file/d/1p9v1PkJhwS8Ofg4RiC1nsFJAe8Mb_6WF/view?usp=sharing Solutions].  [https://drive.google.com/file/d/19erJJ4Gjw77n57VrnqaQPCxIh_-NScYT/view?usp=sharing Notebook].&lt;br /&gt;
&lt;br /&gt;
* Send your copy of Homework 2 to numphys.icfp  at   gmail.com  Thanks!&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 29, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 9: High-dimensional inference and Principal Component Analysis. Extra material: Handwritten notes on the derivation of Marcenko-Pastur spectral density [https://drive.google.com/file/d/10Yytv9itdWDDHTsM2lQHwQDMbcf-oVnd/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
* Tutorial 9: [https://drive.google.com/file/d/10y7m1mPf5R5zZN6661Eei92IUNhBL_Zu/view?usp=sharing  Replay of the neuronal activity during sleep after a task].[https://drive.google.com/file/d/11fO26XB6Ri3HDVBvtdBkYxcTRLk1iv5F/view?usp=sharing Data ]. [https://drive.google.com/file/d/1-MFN2ERs_eNs4w6XnLjfzsu2F9REluSt/view?usp=sharing Initial Notebook]. [https://drive.google.com/file/d/11ev4Zwn6DPYLwhMsLyp8S0aQFVu77Ou3/view?usp=sharing Biblio]. &lt;br /&gt;
[https://drive.google.com/file/d/11E75QwrJgDKrutGj9t5NJTRkGtuRgoBI/view?usp=sharing Solutions]. [https://drive.google.com/file/d/1-39oZNNB-35zM4V2tLWtubQnZTdMLtIz/view?usp=sharing Notebook]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, November 12, 2021, 2 pm: The Quiz.&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
The MCQ is composed of 19 questions (one of them counts for two).  For each question you have 4 choices: 3 wrong and 1 correct: If you check the correct one you get a point. If you are wrong you loose 1/4 of a point.  No answer given: zero points.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
MCQ Solution (correct answers in bold):[https://drive.google.com/file/d/1WWcqxFzmCJp2ZXC02a70a1o17pGupdyZ/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, November 26, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 10: Priors, regularisation, sparsity&lt;br /&gt;
&lt;br /&gt;
* Tutorial 10: [https://drive.google.com/file/d/14kaGKRm7uciT7uLVMW_Vqzr8ha-V-Ra2/view?usp=sharing Bayesian Inference and Priors for the analysis of gravitational waves]. [https://drive.google.com/file/d/16UTmpwKm-7UMcIbca8IIGsO-aCmcwKuD/view?usp=sharing Starting notebook on artificial data]. [https://drive.google.com/file/d/1CyiDlXs6ez9-7gnyeBU0YRgV7Nt5ibkn/view?usp=sharing Biblio][https://colab.research.google.com/drive/1pFMOawozlYOIpy0jQWkTfoq-tFp3uvhw?usp=sharing#scrollTo=6picRNBipcYN Notebook on real data] &lt;br /&gt;
[https://drive.google.com/file/d/161ZLuq5s2RpHDJWELFSKXqlf-qwrVrxA/view?usp=sharing Notebook on Artificial data] [https://drive.google.com/file/d/17qhYN8EFpcoCUHOM_juBvEGpu61GgJRx/view?usp=sharing Corrections ]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, December 3, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 11: Probabilistic graphical models&lt;br /&gt;
&lt;br /&gt;
* Tutorial 11:[https://drive.google.com/file/d/1A5pcJICHkmHZYoa2uoAGSAWp-_ZOaIEf/view?usp=sharing Analysis of protein sequence data to infer protein structure] [https://drive.google.com/file/d/1COKr5pNoBRFwwnj7TWPQSU8mEWKvsLud/view?usp=sharing Starting notebook and data] [https://drive.google.com/file/d/1CQw1PQ6RSS6nuGxhkwOqe7LJHpOPIaVp/view?usp=sharing Biblio][https://drive.google.com/file/d/1CslX27bTp5gyhXV4ciFE8s1zMnBgJ-1O/view?usp=sharing Solutions] [https://drive.google.com/file/d/19X59x3TdIsJaccTZE71gCbZxFbOzlhj4/view?usp=sharing Final notebook]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, December 10, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 12: Hidden Markov Models. Extra material: Pedagogical introduction to Kalman filters [https://drive.google.com/file/d/0B4HvoS7Zt11LZUxVLTkyVXRQRUE/view?usp=sharing&amp;amp;resourcekey=0-CzsYaRIrPP2sN-UmwfiLHQ]&lt;br /&gt;
&lt;br /&gt;
* Tutorial 12: &lt;br /&gt;
[https://drive.google.com/file/d/1FLbWZRWJ1JILZV41RjwVKR7mOhNMhLV9/view?usp=sharing Hidden Markov Models Hidden  for identification of recombinations in SARS-CoV-2 viral genomes] [https://drive.google.com/file/d/1FCAg0ihMWoAk-_dtt5ORncjVjkVu-m4D/view?usp=sharing Starting Notebook and Data][https://drive.google.com/file/d/1HMREe6ge7_K-lOKC4f2FwL7vnEa1_8Yf/view?usp=sharing Bibliography] [https://drive.google.com/file/d/1FLDBJmNtXogHiO5VfScGiePTCxMFy1KZ/view?usp=sharing Final Notebook] [https://drive.google.com/file/d/1FBQaNJ2RhjwW_VSut2oC7mZYl5F8RWfS/view?usp=sharing Solutions]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, December 17, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 13: Unsupervised learning and representations&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1p2c35gHMr4_Ptdmwsh3jGJz__9NNIgLw Tutorial 13]: How restricted Boltzmann machines learn ([https://colab.research.google.com/drive/1gnaK_vmTESTV3Ex_A1gqcee6Q58iKyld solutions])&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Final examination of the data-driven course (January 7, 2022)&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Example of exam: On-line Principal Component Analysis [https://drive.google.com/file/d/1BbRY4b3OCVYAtYH4m6ry19KcA2gkp3pH/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
* On-line version of the book [https://drive.google.com/file/d/161YHZA7i2YU-8emy6IPUFhsOXzFRxSRS/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
* Examination repository [https://drive.google.com/file/d/19DNkNBed0Ir5a9N048ZFV4_xF0KG3kcy/view?usp=sharing]&lt;/div&gt;</summary>
		<author><name>Alberto</name></author>
	</entry>
	<entry>
		<id>http://www.lptms.universite-paris-saclay.fr//wiki-cours/index.php?title=CoDaDri2&amp;diff=1758</id>
		<title>CoDaDri2</title>
		<link rel="alternate" type="text/html" href="http://www.lptms.universite-paris-saclay.fr//wiki-cours/index.php?title=CoDaDri2&amp;diff=1758"/>
		<updated>2022-06-22T12:17:09Z</updated>

		<summary type="html">&lt;p&gt;Alberto: /* Grading */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;=Breaking news:=&lt;br /&gt;
&lt;br /&gt;
* Update with course schedule&lt;br /&gt;
&lt;br /&gt;
= Computational and Data Driven Physics =&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Modern physics is characterized by an increasing complexity of systems under investigation, in&lt;br /&gt;
domains as diverse as condensed matter, astrophysics, biophysics, etc. Establishing adequate&lt;br /&gt;
models to describe these systems and being able to make quantitative predictions from those models&lt;br /&gt;
is extremely challenging. The goal of the course is to provide the tools and concepts necessary to tackle those systems.&lt;br /&gt;
&lt;br /&gt;
== Course description ==&lt;br /&gt;
&lt;br /&gt;
We will first cover many algorithms used in many-body problems and complex systems, with special emphasis on Monte Carlo methods, molecular dynamics, and optimization in complex landscapes. &lt;br /&gt;
&lt;br /&gt;
Second, we will provide statistical inference and machine learning tools to harness the growing availability of experimental data to design accurate models of the underlying, complex, strongly non-homogeneous and interacting systems. &lt;br /&gt;
&lt;br /&gt;
Each theoretical lecture will be followed by a tutorial illustrating the concepts with practical applications&lt;br /&gt;
borrowed from various domains of physics. We will focus on methods and algorithms and physics, not&lt;br /&gt;
on programming and heavy numerics!  You will have to hand in 3 homeworks.&lt;br /&gt;
&lt;br /&gt;
*[https://drive.google.com/file/d/11w7KI5Pi59VWLX1mqiQ8ZyY8YQHRUeMz/view?usp=sharing Preliminary version of the book: Information, Inference, Networks: From statistical physics to big biological data]&lt;br /&gt;
&lt;br /&gt;
== The Team ==&lt;br /&gt;
&lt;br /&gt;
* [http://lptms.u-psud.fr/alberto_rosso/ Alberto Rosso] (Computational physics)&lt;br /&gt;
* [http://www.phys.ens.fr/~monasson/ Rémi Monasson] (Data-driven physics)&lt;br /&gt;
*  [http://www.lps.ens.fr/~cocco/ Simona Cocco]  &amp;amp; [https://www.cpht.polytechnique.fr/?q=en/node/110 Michel Ferrero] (Tutorials)&lt;br /&gt;
* [ Vincenzo Maria Schimmenti] (Tutor)&lt;br /&gt;
&lt;br /&gt;
== Where and When ==&lt;br /&gt;
&lt;br /&gt;
* Lectures on Fridays: 14:00-16:00&lt;br /&gt;
* Tutorials on Fridays: 16:00-18:00&lt;br /&gt;
* ENS, 29 rue D&#039;Ulm, salle Borel + Djebar&lt;br /&gt;
&lt;br /&gt;
== Slack ==&lt;br /&gt;
&lt;br /&gt;
If you have questions or want to discuss topics related to the lecture, to the exercises or to the homeworks, you can use the&lt;br /&gt;
[XXX Computational and Data Driven Physics Slack]. In order to join the Slack&lt;br /&gt;
use the following [XXX invitation link].&lt;br /&gt;
&lt;br /&gt;
== Computer Requirements ==&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;No previous experience in programming is required.&#039;&#039;&#039; &amp;lt;br&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Programming Language: Python&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
For practical installation, we recommand either to use  Anaconda (See [[Memento Python]]) or use google colab. &amp;lt;br&amp;gt;&lt;br /&gt;
The Collaboratory platform from Google is quite good way to use powerful computer without buying one: It requires no specific hardware or software, and even allows you to use GPU computing for free,  all by writting a jupyter notebook that you can then share.&lt;br /&gt;
&lt;br /&gt;
== Grading ==&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Computational Physics:&#039;&#039;&#039;&lt;br /&gt;
* Homework 1: 5 points &lt;br /&gt;
* Homework 2: 5 points&lt;br /&gt;
* Multiple Choice Questions in November: 10 points&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Data Driven Physics:&#039;&#039;&#039;&lt;br /&gt;
* Homework 3: 5 points&lt;br /&gt;
* Final exam in January: 15 points&lt;br /&gt;
&lt;br /&gt;
== Schedule ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 3, 2021 &#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1X9h3lKD0OZLTKtxb7DWPfynY42rRuE7j/view?usp=sharing Lecture 1]   Introduction to Monte Carlo&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1sIv3qOdyE-XYkjYC-dkNsR72f4BgaQ_y/view?usp=sharing Tutorial 1] Markov Matrix&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 10, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Introductory notebooks: [https://colab.research.google.com/drive/1Ovrh1JjLzMMnxtasDgR1j84CHGU6hMxA python], [https://colab.research.google.com/drive/14PWu-C171pYhV8ven-Txc4wz5Tv1DCsK numpy] and [https://colab.research.google.com/drive/1fPjwrdxQPSyfXniyAHmyOcF_gK2fqjts matplotlib]&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1gf7oRQIpvSvMScyJa5hexB9CCZvdozPs#scrollTo=lDznlLouvlFx Tutorial 2] - Markov matrices ([https://colab.research.google.com/drive/1x9iEHG_F522uFCvD_jGdvHaMETAHfO6-#scrollTo=eSu-nLZ6vm8X solutions])&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1tjqbjAi50C4qOqVRtTxEkTeTb10qpTms#scrollTo=uYpaubGkvogU Tutorial 3] - Thumb rule ([https://colab.research.google.com/drive/1aWVtz4ZGcpIarWiRVAnxrp1t0GDOqZxu#scrollTo=f7ohlMuZvqTr solutions])&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1g7HXFUBQUBF0fhy5h2jYbfIAVBTqvb7-#scrollTo=U9LFX8OFhHOG Homework 1] (deadline October 1)&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
* [https://colab.research.google.com/drive/1aMo4Ur-0_b4dGhdIfxAmCC2ci1rOda_v?usp=sharing Tutorial 2] Markov matrix [https://colab.research.google.com/drive/1Q5ajzxRGXBBorA9cQ9o8V5VUVJhUXpPS?usp=sharing problems]&lt;br /&gt;
* [https://colab.research.google.com/drive/1k60-ChM3aUWjGsiRsf2Idx9jxHHtwyAb?usp=sharing Tutorial 3] Thumb rule [https://colab.research.google.com/drive/1fdKJlp0lD4k530oRuu50_Hm_T8t3jixa?usp=sharing problems]&lt;br /&gt;
--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 17, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/15wrgivn6FSnuBUnMwjjhadmD-g1fkS7T/view?usp=sharing Lecture 2] Basic Sampling&lt;br /&gt;
&lt;br /&gt;
*  [https://drive.google.com/file/d/1ALR_QKLXdHby54xNux39NUOk4L-Ne1EW/view?usp=sharing  Lecture 3]: Errors and Precision&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 24, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1DijhG_856OAuj42WqY1UM47APmMy3A8B/view?usp=sharing Lecture 4]: Ising model and phase transitions &lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1sRUEs768Z6PKdJ3k7MixYeFGlufgjFrG Tutorial 4]: Ising model and phase transitions ([https://colab.research.google.com/drive/1KAQRog_YlAjKZ_hL1FMYurWdPBLNUocI solutions])&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
* [https://colab.research.google.com/drive/1nU4E_pFWjSFPNigzy8-LcJpef26IKY6x?usp=sharing Tutorial 4]: Ising model and phase transitions [https://colab.research.google.com/drive/1AEUX3U7hxDR_YYy8ld3knTEVR1KYa9SP?usp=sharing problems] &lt;br /&gt;
--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 1, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1PTya42ZS2kU87A-BxQFFIUDTs_k47men?usp=sharing Lecture 5]: Optimization &amp;amp; Dijkstra algorithm&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1ieT5BlfJsOehsa8r-LHGsFsn1dwYnawT Tutorial 5]: Simulated annealing ([https://colab.research.google.com/drive/1JNVl42KNASZiwTtqYo71z_vggjbGfKul solutions])&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
* [https://colab.research.google.com/drive/1p0ooWAXF9KNh-FztMHmVoA9yBzYOM8PC?usp=sharing Tutorial 5]: Simulated annealing [https://colab.research.google.com/drive/1txJGpzreHurWux7ev6sDsX8TjzpeQhZZ?usp=sharing problems]&lt;br /&gt;
--&amp;gt;&lt;br /&gt;
* Send your copy of Homework 1 to numphys.icfp  at   gmail.com  Thanks!&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1EPgj3la7vxDIqSQYNlOFz4rR0vHXAeae Homework 2] (deadline October 22)&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 8, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 6: Introduction to Bayesian inference&lt;br /&gt;
&lt;br /&gt;
* Tutorial 6: Bayesian inference and single-particle tracking. [https://drive.google.com/file/d/1q9Quq5mvJ4Avv2qWgzTocU-DVIxJIVWi/view?usp=sharing Questions]. [https://drive.google.com/file/d/1xYb4wfNBysse6Q7frTw_V9TPdUQU5lUx/view?usp=sharing Data]. [https://drive.google.com/file/d/1Ba_kRo3_XMIaDLNYZlbZEw-wGXKS-29I/view?usp=sharing Starting Notebook]. [https://colab.research.google.com/drive/1VePL9X1JT6yl8LmROeZyMyf4Epcu3yOL#scrollTo=1XQNGa_fyEkJ Google colab version]. Solutions [https://drive.google.com/file/d/1Q9IjVUeL7AA8uWk8DX9Vy9vuUQ21RYh2/view?usp=sharing]. Notebook [https://drive.google.com/file/d/1ZJmpdaTQVUttEaaI1ch-reFfZGI93454/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 15, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1eY5cuNcJqYw7df0PBkxq03tEnqzTOC-5/view?usp=sharing Lecture 7]: Importance sampling&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1iaOGxdVgk--kWUFcMDHs0zvPhsOyhB_c Tutorial 7]: Faster than the clock algorithms ([https://colab.research.google.com/drive/1bHPnJpBd5ExqKF4G5BuV_FHPE4r0_AY2#scrollTo=fQnz_gOeq40e solutions])&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
* [https://colab.research.google.com/drive/1KyT442vB4EuGKBy_Xj3j8cLtMMl4gbac?usp=sharing Tutorial 6]: Faster than the clock algorithms [https://colab.research.google.com/drive/1C-ieAwaAKwkX5MFm8aX2kNO2GNeO9CdY?usp=sharing problems]&lt;br /&gt;
--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 22, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 8: Asymptotic inference and information. Extra material: Proof of Cramer-Rao bound [https://drive.google.com/file/d/10Ph_iP6AIQ3ps9v3FwRBO9j6-qV7oKV9/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
* Tutorial 8: [https://drive.google.com/file/d/12cG4HBvzs9Oe1mbfuEYyRDmTEamW71pR/view?usp=sharing Questions]. [https://drive.google.com/file/d/1AL8sRtnqYUI8NbubfglgLazknaVIUJEo/view?usp=sharing Data ] [https://drive.google.com/file/d/1DTLzXLZUEPzoU2SsDMcAe8GaoYX8E5gH/view?usp=sharing Starting Notebook]. [https://drive.google.com/file/d/1QpMaM5ACmKUlFAyGvRnHvFVtQoEAF7-9/view?usp=sharing Bibliography] [https://drive.google.com/file/d/1p9v1PkJhwS8Ofg4RiC1nsFJAe8Mb_6WF/view?usp=sharing Solutions].  [https://drive.google.com/file/d/19erJJ4Gjw77n57VrnqaQPCxIh_-NScYT/view?usp=sharing Notebook].&lt;br /&gt;
&lt;br /&gt;
* Send your copy of Homework 2 to numphys.icfp  at   gmail.com  Thanks!&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 29, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 9: High-dimensional inference and Principal Component Analysis. Extra material: Handwritten notes on the derivation of Marcenko-Pastur spectral density [https://drive.google.com/file/d/10Yytv9itdWDDHTsM2lQHwQDMbcf-oVnd/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
* Tutorial 9: [https://drive.google.com/file/d/10y7m1mPf5R5zZN6661Eei92IUNhBL_Zu/view?usp=sharing  Replay of the neuronal activity during sleep after a task].[https://drive.google.com/file/d/11fO26XB6Ri3HDVBvtdBkYxcTRLk1iv5F/view?usp=sharing Data ]. [https://drive.google.com/file/d/1-MFN2ERs_eNs4w6XnLjfzsu2F9REluSt/view?usp=sharing Initial Notebook]. [https://drive.google.com/file/d/11ev4Zwn6DPYLwhMsLyp8S0aQFVu77Ou3/view?usp=sharing Biblio]. &lt;br /&gt;
[https://drive.google.com/file/d/11E75QwrJgDKrutGj9t5NJTRkGtuRgoBI/view?usp=sharing Solutions]. [https://drive.google.com/file/d/1-39oZNNB-35zM4V2tLWtubQnZTdMLtIz/view?usp=sharing Notebook]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, November 12, 2021, 2 pm: The Quiz.&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
The MCQ is composed of 19 questions (one of them counts for two).  For each question you have 4 choices: 3 wrong and 1 correct: If you check the correct one you get a point. If you are wrong you loose 1/4 of a point.  No answer given: zero points.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
MCQ Solution (correct answers in bold):[https://drive.google.com/file/d/1WWcqxFzmCJp2ZXC02a70a1o17pGupdyZ/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, November 26, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 10: Priors, regularisation, sparsity&lt;br /&gt;
&lt;br /&gt;
* Tutorial 10: [https://drive.google.com/file/d/14kaGKRm7uciT7uLVMW_Vqzr8ha-V-Ra2/view?usp=sharing Bayesian Inference and Priors for the analysis of gravitational waves]. [https://drive.google.com/file/d/16UTmpwKm-7UMcIbca8IIGsO-aCmcwKuD/view?usp=sharing Starting notebook on artificial data]. [https://drive.google.com/file/d/1CyiDlXs6ez9-7gnyeBU0YRgV7Nt5ibkn/view?usp=sharing Biblio][https://colab.research.google.com/drive/1pFMOawozlYOIpy0jQWkTfoq-tFp3uvhw?usp=sharing#scrollTo=6picRNBipcYN Notebook on real data] &lt;br /&gt;
[https://drive.google.com/file/d/161ZLuq5s2RpHDJWELFSKXqlf-qwrVrxA/view?usp=sharing Notebook on Artificial data] [https://drive.google.com/file/d/17qhYN8EFpcoCUHOM_juBvEGpu61GgJRx/view?usp=sharing Corrections ]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, December 3, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 11: Probabilistic graphical models&lt;br /&gt;
&lt;br /&gt;
* Tutorial 11:[https://drive.google.com/file/d/1A5pcJICHkmHZYoa2uoAGSAWp-_ZOaIEf/view?usp=sharing Analysis of protein sequence data to infer protein structure] [https://drive.google.com/file/d/1COKr5pNoBRFwwnj7TWPQSU8mEWKvsLud/view?usp=sharing Starting notebook and data] [https://drive.google.com/file/d/1CQw1PQ6RSS6nuGxhkwOqe7LJHpOPIaVp/view?usp=sharing Biblio][https://drive.google.com/file/d/1CslX27bTp5gyhXV4ciFE8s1zMnBgJ-1O/view?usp=sharing Solutions] [https://drive.google.com/file/d/19X59x3TdIsJaccTZE71gCbZxFbOzlhj4/view?usp=sharing Final notebook]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, December 10, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 12: Hidden Markov Models. Extra material: Pedagogical introduction to Kalman filters [https://drive.google.com/file/d/0B4HvoS7Zt11LZUxVLTkyVXRQRUE/view?usp=sharing&amp;amp;resourcekey=0-CzsYaRIrPP2sN-UmwfiLHQ]&lt;br /&gt;
&lt;br /&gt;
* Tutorial 12: &lt;br /&gt;
[https://drive.google.com/file/d/1FLbWZRWJ1JILZV41RjwVKR7mOhNMhLV9/view?usp=sharing Hidden Markov Models Hidden  for identification of recombinations in SARS-CoV-2 viral genomes] [https://drive.google.com/file/d/1FCAg0ihMWoAk-_dtt5ORncjVjkVu-m4D/view?usp=sharing Starting Notebook and Data][https://drive.google.com/file/d/1HMREe6ge7_K-lOKC4f2FwL7vnEa1_8Yf/view?usp=sharing Bibliography] [https://drive.google.com/file/d/1FLDBJmNtXogHiO5VfScGiePTCxMFy1KZ/view?usp=sharing Final Notebook] [https://drive.google.com/file/d/1FBQaNJ2RhjwW_VSut2oC7mZYl5F8RWfS/view?usp=sharing Solutions]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, December 17, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 13: Unsupervised learning and representations&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1p2c35gHMr4_Ptdmwsh3jGJz__9NNIgLw Tutorial 13]: How restricted Boltzmann machines learn ([https://colab.research.google.com/drive/1gnaK_vmTESTV3Ex_A1gqcee6Q58iKyld solutions])&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Final examination of the data-driven course (January 7, 2022)&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Example of exam: On-line Principal Component Analysis [https://drive.google.com/file/d/1BbRY4b3OCVYAtYH4m6ry19KcA2gkp3pH/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
* On-line version of the book [https://drive.google.com/file/d/161YHZA7i2YU-8emy6IPUFhsOXzFRxSRS/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
* Examination repository [https://drive.google.com/file/d/19DNkNBed0Ir5a9N048ZFV4_xF0KG3kcy/view?usp=sharing]&lt;/div&gt;</summary>
		<author><name>Alberto</name></author>
	</entry>
	<entry>
		<id>http://www.lptms.universite-paris-saclay.fr//wiki-cours/index.php?title=CoDaDri2&amp;diff=1757</id>
		<title>CoDaDri2</title>
		<link rel="alternate" type="text/html" href="http://www.lptms.universite-paris-saclay.fr//wiki-cours/index.php?title=CoDaDri2&amp;diff=1757"/>
		<updated>2022-06-22T12:16:18Z</updated>

		<summary type="html">&lt;p&gt;Alberto: /* Slack */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;=Breaking news:=&lt;br /&gt;
&lt;br /&gt;
* Update with course schedule&lt;br /&gt;
&lt;br /&gt;
= Computational and Data Driven Physics =&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Modern physics is characterized by an increasing complexity of systems under investigation, in&lt;br /&gt;
domains as diverse as condensed matter, astrophysics, biophysics, etc. Establishing adequate&lt;br /&gt;
models to describe these systems and being able to make quantitative predictions from those models&lt;br /&gt;
is extremely challenging. The goal of the course is to provide the tools and concepts necessary to tackle those systems.&lt;br /&gt;
&lt;br /&gt;
== Course description ==&lt;br /&gt;
&lt;br /&gt;
We will first cover many algorithms used in many-body problems and complex systems, with special emphasis on Monte Carlo methods, molecular dynamics, and optimization in complex landscapes. &lt;br /&gt;
&lt;br /&gt;
Second, we will provide statistical inference and machine learning tools to harness the growing availability of experimental data to design accurate models of the underlying, complex, strongly non-homogeneous and interacting systems. &lt;br /&gt;
&lt;br /&gt;
Each theoretical lecture will be followed by a tutorial illustrating the concepts with practical applications&lt;br /&gt;
borrowed from various domains of physics. We will focus on methods and algorithms and physics, not&lt;br /&gt;
on programming and heavy numerics!  You will have to hand in 3 homeworks.&lt;br /&gt;
&lt;br /&gt;
*[https://drive.google.com/file/d/11w7KI5Pi59VWLX1mqiQ8ZyY8YQHRUeMz/view?usp=sharing Preliminary version of the book: Information, Inference, Networks: From statistical physics to big biological data]&lt;br /&gt;
&lt;br /&gt;
== The Team ==&lt;br /&gt;
&lt;br /&gt;
* [http://lptms.u-psud.fr/alberto_rosso/ Alberto Rosso] (Computational physics)&lt;br /&gt;
* [http://www.phys.ens.fr/~monasson/ Rémi Monasson] (Data-driven physics)&lt;br /&gt;
*  [http://www.lps.ens.fr/~cocco/ Simona Cocco]  &amp;amp; [https://www.cpht.polytechnique.fr/?q=en/node/110 Michel Ferrero] (Tutorials)&lt;br /&gt;
* [ Vincenzo Maria Schimmenti] (Tutor)&lt;br /&gt;
&lt;br /&gt;
== Where and When ==&lt;br /&gt;
&lt;br /&gt;
* Lectures on Fridays: 14:00-16:00&lt;br /&gt;
* Tutorials on Fridays: 16:00-18:00&lt;br /&gt;
* ENS, 29 rue D&#039;Ulm, salle Borel + Djebar&lt;br /&gt;
&lt;br /&gt;
== Slack ==&lt;br /&gt;
&lt;br /&gt;
If you have questions or want to discuss topics related to the lecture, to the exercises or to the homeworks, you can use the&lt;br /&gt;
[XXX Computational and Data Driven Physics Slack]. In order to join the Slack&lt;br /&gt;
use the following [XXX invitation link].&lt;br /&gt;
&lt;br /&gt;
== Computer Requirements ==&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;No previous experience in programming is required.&#039;&#039;&#039; &amp;lt;br&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Programming Language: Python&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
For practical installation, we recommand either to use  Anaconda (See [[Memento Python]]) or use google colab. &amp;lt;br&amp;gt;&lt;br /&gt;
The Collaboratory platform from Google is quite good way to use powerful computer without buying one: It requires no specific hardware or software, and even allows you to use GPU computing for free,  all by writting a jupyter notebook that you can then share.&lt;br /&gt;
&lt;br /&gt;
== Grading ==&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Computational Physics:&#039;&#039;&#039;&lt;br /&gt;
* Homework 1: 5 points &lt;br /&gt;
* Homework 2: 5 points&lt;br /&gt;
* Multiple Choice Questions in November: 10 points&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Data Driven Physics:&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Final exam in January: 20 points&lt;br /&gt;
&lt;br /&gt;
== Schedule ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 3, 2021 &#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1X9h3lKD0OZLTKtxb7DWPfynY42rRuE7j/view?usp=sharing Lecture 1]   Introduction to Monte Carlo&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1sIv3qOdyE-XYkjYC-dkNsR72f4BgaQ_y/view?usp=sharing Tutorial 1] Markov Matrix&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 10, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Introductory notebooks: [https://colab.research.google.com/drive/1Ovrh1JjLzMMnxtasDgR1j84CHGU6hMxA python], [https://colab.research.google.com/drive/14PWu-C171pYhV8ven-Txc4wz5Tv1DCsK numpy] and [https://colab.research.google.com/drive/1fPjwrdxQPSyfXniyAHmyOcF_gK2fqjts matplotlib]&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1gf7oRQIpvSvMScyJa5hexB9CCZvdozPs#scrollTo=lDznlLouvlFx Tutorial 2] - Markov matrices ([https://colab.research.google.com/drive/1x9iEHG_F522uFCvD_jGdvHaMETAHfO6-#scrollTo=eSu-nLZ6vm8X solutions])&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1tjqbjAi50C4qOqVRtTxEkTeTb10qpTms#scrollTo=uYpaubGkvogU Tutorial 3] - Thumb rule ([https://colab.research.google.com/drive/1aWVtz4ZGcpIarWiRVAnxrp1t0GDOqZxu#scrollTo=f7ohlMuZvqTr solutions])&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1g7HXFUBQUBF0fhy5h2jYbfIAVBTqvb7-#scrollTo=U9LFX8OFhHOG Homework 1] (deadline October 1)&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
* [https://colab.research.google.com/drive/1aMo4Ur-0_b4dGhdIfxAmCC2ci1rOda_v?usp=sharing Tutorial 2] Markov matrix [https://colab.research.google.com/drive/1Q5ajzxRGXBBorA9cQ9o8V5VUVJhUXpPS?usp=sharing problems]&lt;br /&gt;
* [https://colab.research.google.com/drive/1k60-ChM3aUWjGsiRsf2Idx9jxHHtwyAb?usp=sharing Tutorial 3] Thumb rule [https://colab.research.google.com/drive/1fdKJlp0lD4k530oRuu50_Hm_T8t3jixa?usp=sharing problems]&lt;br /&gt;
--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 17, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/15wrgivn6FSnuBUnMwjjhadmD-g1fkS7T/view?usp=sharing Lecture 2] Basic Sampling&lt;br /&gt;
&lt;br /&gt;
*  [https://drive.google.com/file/d/1ALR_QKLXdHby54xNux39NUOk4L-Ne1EW/view?usp=sharing  Lecture 3]: Errors and Precision&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 24, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1DijhG_856OAuj42WqY1UM47APmMy3A8B/view?usp=sharing Lecture 4]: Ising model and phase transitions &lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1sRUEs768Z6PKdJ3k7MixYeFGlufgjFrG Tutorial 4]: Ising model and phase transitions ([https://colab.research.google.com/drive/1KAQRog_YlAjKZ_hL1FMYurWdPBLNUocI solutions])&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
* [https://colab.research.google.com/drive/1nU4E_pFWjSFPNigzy8-LcJpef26IKY6x?usp=sharing Tutorial 4]: Ising model and phase transitions [https://colab.research.google.com/drive/1AEUX3U7hxDR_YYy8ld3knTEVR1KYa9SP?usp=sharing problems] &lt;br /&gt;
--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 1, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1PTya42ZS2kU87A-BxQFFIUDTs_k47men?usp=sharing Lecture 5]: Optimization &amp;amp; Dijkstra algorithm&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1ieT5BlfJsOehsa8r-LHGsFsn1dwYnawT Tutorial 5]: Simulated annealing ([https://colab.research.google.com/drive/1JNVl42KNASZiwTtqYo71z_vggjbGfKul solutions])&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
* [https://colab.research.google.com/drive/1p0ooWAXF9KNh-FztMHmVoA9yBzYOM8PC?usp=sharing Tutorial 5]: Simulated annealing [https://colab.research.google.com/drive/1txJGpzreHurWux7ev6sDsX8TjzpeQhZZ?usp=sharing problems]&lt;br /&gt;
--&amp;gt;&lt;br /&gt;
* Send your copy of Homework 1 to numphys.icfp  at   gmail.com  Thanks!&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1EPgj3la7vxDIqSQYNlOFz4rR0vHXAeae Homework 2] (deadline October 22)&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 8, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 6: Introduction to Bayesian inference&lt;br /&gt;
&lt;br /&gt;
* Tutorial 6: Bayesian inference and single-particle tracking. [https://drive.google.com/file/d/1q9Quq5mvJ4Avv2qWgzTocU-DVIxJIVWi/view?usp=sharing Questions]. [https://drive.google.com/file/d/1xYb4wfNBysse6Q7frTw_V9TPdUQU5lUx/view?usp=sharing Data]. [https://drive.google.com/file/d/1Ba_kRo3_XMIaDLNYZlbZEw-wGXKS-29I/view?usp=sharing Starting Notebook]. [https://colab.research.google.com/drive/1VePL9X1JT6yl8LmROeZyMyf4Epcu3yOL#scrollTo=1XQNGa_fyEkJ Google colab version]. Solutions [https://drive.google.com/file/d/1Q9IjVUeL7AA8uWk8DX9Vy9vuUQ21RYh2/view?usp=sharing]. Notebook [https://drive.google.com/file/d/1ZJmpdaTQVUttEaaI1ch-reFfZGI93454/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 15, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1eY5cuNcJqYw7df0PBkxq03tEnqzTOC-5/view?usp=sharing Lecture 7]: Importance sampling&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1iaOGxdVgk--kWUFcMDHs0zvPhsOyhB_c Tutorial 7]: Faster than the clock algorithms ([https://colab.research.google.com/drive/1bHPnJpBd5ExqKF4G5BuV_FHPE4r0_AY2#scrollTo=fQnz_gOeq40e solutions])&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
* [https://colab.research.google.com/drive/1KyT442vB4EuGKBy_Xj3j8cLtMMl4gbac?usp=sharing Tutorial 6]: Faster than the clock algorithms [https://colab.research.google.com/drive/1C-ieAwaAKwkX5MFm8aX2kNO2GNeO9CdY?usp=sharing problems]&lt;br /&gt;
--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 22, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 8: Asymptotic inference and information. Extra material: Proof of Cramer-Rao bound [https://drive.google.com/file/d/10Ph_iP6AIQ3ps9v3FwRBO9j6-qV7oKV9/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
* Tutorial 8: [https://drive.google.com/file/d/12cG4HBvzs9Oe1mbfuEYyRDmTEamW71pR/view?usp=sharing Questions]. [https://drive.google.com/file/d/1AL8sRtnqYUI8NbubfglgLazknaVIUJEo/view?usp=sharing Data ] [https://drive.google.com/file/d/1DTLzXLZUEPzoU2SsDMcAe8GaoYX8E5gH/view?usp=sharing Starting Notebook]. [https://drive.google.com/file/d/1QpMaM5ACmKUlFAyGvRnHvFVtQoEAF7-9/view?usp=sharing Bibliography] [https://drive.google.com/file/d/1p9v1PkJhwS8Ofg4RiC1nsFJAe8Mb_6WF/view?usp=sharing Solutions].  [https://drive.google.com/file/d/19erJJ4Gjw77n57VrnqaQPCxIh_-NScYT/view?usp=sharing Notebook].&lt;br /&gt;
&lt;br /&gt;
* Send your copy of Homework 2 to numphys.icfp  at   gmail.com  Thanks!&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 29, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 9: High-dimensional inference and Principal Component Analysis. Extra material: Handwritten notes on the derivation of Marcenko-Pastur spectral density [https://drive.google.com/file/d/10Yytv9itdWDDHTsM2lQHwQDMbcf-oVnd/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
* Tutorial 9: [https://drive.google.com/file/d/10y7m1mPf5R5zZN6661Eei92IUNhBL_Zu/view?usp=sharing  Replay of the neuronal activity during sleep after a task].[https://drive.google.com/file/d/11fO26XB6Ri3HDVBvtdBkYxcTRLk1iv5F/view?usp=sharing Data ]. [https://drive.google.com/file/d/1-MFN2ERs_eNs4w6XnLjfzsu2F9REluSt/view?usp=sharing Initial Notebook]. [https://drive.google.com/file/d/11ev4Zwn6DPYLwhMsLyp8S0aQFVu77Ou3/view?usp=sharing Biblio]. &lt;br /&gt;
[https://drive.google.com/file/d/11E75QwrJgDKrutGj9t5NJTRkGtuRgoBI/view?usp=sharing Solutions]. [https://drive.google.com/file/d/1-39oZNNB-35zM4V2tLWtubQnZTdMLtIz/view?usp=sharing Notebook]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, November 12, 2021, 2 pm: The Quiz.&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
The MCQ is composed of 19 questions (one of them counts for two).  For each question you have 4 choices: 3 wrong and 1 correct: If you check the correct one you get a point. If you are wrong you loose 1/4 of a point.  No answer given: zero points.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
MCQ Solution (correct answers in bold):[https://drive.google.com/file/d/1WWcqxFzmCJp2ZXC02a70a1o17pGupdyZ/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, November 26, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 10: Priors, regularisation, sparsity&lt;br /&gt;
&lt;br /&gt;
* Tutorial 10: [https://drive.google.com/file/d/14kaGKRm7uciT7uLVMW_Vqzr8ha-V-Ra2/view?usp=sharing Bayesian Inference and Priors for the analysis of gravitational waves]. [https://drive.google.com/file/d/16UTmpwKm-7UMcIbca8IIGsO-aCmcwKuD/view?usp=sharing Starting notebook on artificial data]. [https://drive.google.com/file/d/1CyiDlXs6ez9-7gnyeBU0YRgV7Nt5ibkn/view?usp=sharing Biblio][https://colab.research.google.com/drive/1pFMOawozlYOIpy0jQWkTfoq-tFp3uvhw?usp=sharing#scrollTo=6picRNBipcYN Notebook on real data] &lt;br /&gt;
[https://drive.google.com/file/d/161ZLuq5s2RpHDJWELFSKXqlf-qwrVrxA/view?usp=sharing Notebook on Artificial data] [https://drive.google.com/file/d/17qhYN8EFpcoCUHOM_juBvEGpu61GgJRx/view?usp=sharing Corrections ]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, December 3, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 11: Probabilistic graphical models&lt;br /&gt;
&lt;br /&gt;
* Tutorial 11:[https://drive.google.com/file/d/1A5pcJICHkmHZYoa2uoAGSAWp-_ZOaIEf/view?usp=sharing Analysis of protein sequence data to infer protein structure] [https://drive.google.com/file/d/1COKr5pNoBRFwwnj7TWPQSU8mEWKvsLud/view?usp=sharing Starting notebook and data] [https://drive.google.com/file/d/1CQw1PQ6RSS6nuGxhkwOqe7LJHpOPIaVp/view?usp=sharing Biblio][https://drive.google.com/file/d/1CslX27bTp5gyhXV4ciFE8s1zMnBgJ-1O/view?usp=sharing Solutions] [https://drive.google.com/file/d/19X59x3TdIsJaccTZE71gCbZxFbOzlhj4/view?usp=sharing Final notebook]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, December 10, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 12: Hidden Markov Models. Extra material: Pedagogical introduction to Kalman filters [https://drive.google.com/file/d/0B4HvoS7Zt11LZUxVLTkyVXRQRUE/view?usp=sharing&amp;amp;resourcekey=0-CzsYaRIrPP2sN-UmwfiLHQ]&lt;br /&gt;
&lt;br /&gt;
* Tutorial 12: &lt;br /&gt;
[https://drive.google.com/file/d/1FLbWZRWJ1JILZV41RjwVKR7mOhNMhLV9/view?usp=sharing Hidden Markov Models Hidden  for identification of recombinations in SARS-CoV-2 viral genomes] [https://drive.google.com/file/d/1FCAg0ihMWoAk-_dtt5ORncjVjkVu-m4D/view?usp=sharing Starting Notebook and Data][https://drive.google.com/file/d/1HMREe6ge7_K-lOKC4f2FwL7vnEa1_8Yf/view?usp=sharing Bibliography] [https://drive.google.com/file/d/1FLDBJmNtXogHiO5VfScGiePTCxMFy1KZ/view?usp=sharing Final Notebook] [https://drive.google.com/file/d/1FBQaNJ2RhjwW_VSut2oC7mZYl5F8RWfS/view?usp=sharing Solutions]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, December 17, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 13: Unsupervised learning and representations&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1p2c35gHMr4_Ptdmwsh3jGJz__9NNIgLw Tutorial 13]: How restricted Boltzmann machines learn ([https://colab.research.google.com/drive/1gnaK_vmTESTV3Ex_A1gqcee6Q58iKyld solutions])&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Final examination of the data-driven course (January 7, 2022)&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Example of exam: On-line Principal Component Analysis [https://drive.google.com/file/d/1BbRY4b3OCVYAtYH4m6ry19KcA2gkp3pH/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
* On-line version of the book [https://drive.google.com/file/d/161YHZA7i2YU-8emy6IPUFhsOXzFRxSRS/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
* Examination repository [https://drive.google.com/file/d/19DNkNBed0Ir5a9N048ZFV4_xF0KG3kcy/view?usp=sharing]&lt;/div&gt;</summary>
		<author><name>Alberto</name></author>
	</entry>
	<entry>
		<id>http://www.lptms.universite-paris-saclay.fr//wiki-cours/index.php?title=CoDaDri2&amp;diff=1756</id>
		<title>CoDaDri2</title>
		<link rel="alternate" type="text/html" href="http://www.lptms.universite-paris-saclay.fr//wiki-cours/index.php?title=CoDaDri2&amp;diff=1756"/>
		<updated>2022-06-22T12:15:12Z</updated>

		<summary type="html">&lt;p&gt;Alberto: /* The Team */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;=Breaking news:=&lt;br /&gt;
&lt;br /&gt;
* Update with course schedule&lt;br /&gt;
&lt;br /&gt;
= Computational and Data Driven Physics =&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Modern physics is characterized by an increasing complexity of systems under investigation, in&lt;br /&gt;
domains as diverse as condensed matter, astrophysics, biophysics, etc. Establishing adequate&lt;br /&gt;
models to describe these systems and being able to make quantitative predictions from those models&lt;br /&gt;
is extremely challenging. The goal of the course is to provide the tools and concepts necessary to tackle those systems.&lt;br /&gt;
&lt;br /&gt;
== Course description ==&lt;br /&gt;
&lt;br /&gt;
We will first cover many algorithms used in many-body problems and complex systems, with special emphasis on Monte Carlo methods, molecular dynamics, and optimization in complex landscapes. &lt;br /&gt;
&lt;br /&gt;
Second, we will provide statistical inference and machine learning tools to harness the growing availability of experimental data to design accurate models of the underlying, complex, strongly non-homogeneous and interacting systems. &lt;br /&gt;
&lt;br /&gt;
Each theoretical lecture will be followed by a tutorial illustrating the concepts with practical applications&lt;br /&gt;
borrowed from various domains of physics. We will focus on methods and algorithms and physics, not&lt;br /&gt;
on programming and heavy numerics!  You will have to hand in 3 homeworks.&lt;br /&gt;
&lt;br /&gt;
*[https://drive.google.com/file/d/11w7KI5Pi59VWLX1mqiQ8ZyY8YQHRUeMz/view?usp=sharing Preliminary version of the book: Information, Inference, Networks: From statistical physics to big biological data]&lt;br /&gt;
&lt;br /&gt;
== The Team ==&lt;br /&gt;
&lt;br /&gt;
* [http://lptms.u-psud.fr/alberto_rosso/ Alberto Rosso] (Computational physics)&lt;br /&gt;
* [http://www.phys.ens.fr/~monasson/ Rémi Monasson] (Data-driven physics)&lt;br /&gt;
*  [http://www.lps.ens.fr/~cocco/ Simona Cocco]  &amp;amp; [https://www.cpht.polytechnique.fr/?q=en/node/110 Michel Ferrero] (Tutorials)&lt;br /&gt;
* [ Vincenzo Maria Schimmenti] (Tutor)&lt;br /&gt;
&lt;br /&gt;
== Where and When ==&lt;br /&gt;
&lt;br /&gt;
* Lectures on Fridays: 14:00-16:00&lt;br /&gt;
* Tutorials on Fridays: 16:00-18:00&lt;br /&gt;
* ENS, 29 rue D&#039;Ulm, salle Borel + Djebar&lt;br /&gt;
&lt;br /&gt;
== Slack ==&lt;br /&gt;
&lt;br /&gt;
If you have questions or want to discuss topics related to the lecture, to the exercises or to the homeworks, you can use the&lt;br /&gt;
[http://computational-ozw2847.slack.com Computational and Data Driven Physics Slack]. In order to join the Slack&lt;br /&gt;
use the following [https://join.slack.com/t/computational-ozw2847/shared_invite/zt-vegija8y-cx_vbF2BI6FJewx4W6coSA invitation link].&lt;br /&gt;
&lt;br /&gt;
== Computer Requirements ==&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;No previous experience in programming is required.&#039;&#039;&#039; &amp;lt;br&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Programming Language: Python&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
For practical installation, we recommand either to use  Anaconda (See [[Memento Python]]) or use google colab. &amp;lt;br&amp;gt;&lt;br /&gt;
The Collaboratory platform from Google is quite good way to use powerful computer without buying one: It requires no specific hardware or software, and even allows you to use GPU computing for free,  all by writting a jupyter notebook that you can then share.&lt;br /&gt;
&lt;br /&gt;
== Grading ==&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Computational Physics:&#039;&#039;&#039;&lt;br /&gt;
* Homework 1: 5 points &lt;br /&gt;
* Homework 2: 5 points&lt;br /&gt;
* Multiple Choice Questions in November: 10 points&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Data Driven Physics:&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Final exam in January: 20 points&lt;br /&gt;
&lt;br /&gt;
== Schedule ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 3, 2021 &#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1X9h3lKD0OZLTKtxb7DWPfynY42rRuE7j/view?usp=sharing Lecture 1]   Introduction to Monte Carlo&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1sIv3qOdyE-XYkjYC-dkNsR72f4BgaQ_y/view?usp=sharing Tutorial 1] Markov Matrix&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 10, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Introductory notebooks: [https://colab.research.google.com/drive/1Ovrh1JjLzMMnxtasDgR1j84CHGU6hMxA python], [https://colab.research.google.com/drive/14PWu-C171pYhV8ven-Txc4wz5Tv1DCsK numpy] and [https://colab.research.google.com/drive/1fPjwrdxQPSyfXniyAHmyOcF_gK2fqjts matplotlib]&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1gf7oRQIpvSvMScyJa5hexB9CCZvdozPs#scrollTo=lDznlLouvlFx Tutorial 2] - Markov matrices ([https://colab.research.google.com/drive/1x9iEHG_F522uFCvD_jGdvHaMETAHfO6-#scrollTo=eSu-nLZ6vm8X solutions])&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1tjqbjAi50C4qOqVRtTxEkTeTb10qpTms#scrollTo=uYpaubGkvogU Tutorial 3] - Thumb rule ([https://colab.research.google.com/drive/1aWVtz4ZGcpIarWiRVAnxrp1t0GDOqZxu#scrollTo=f7ohlMuZvqTr solutions])&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1g7HXFUBQUBF0fhy5h2jYbfIAVBTqvb7-#scrollTo=U9LFX8OFhHOG Homework 1] (deadline October 1)&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
* [https://colab.research.google.com/drive/1aMo4Ur-0_b4dGhdIfxAmCC2ci1rOda_v?usp=sharing Tutorial 2] Markov matrix [https://colab.research.google.com/drive/1Q5ajzxRGXBBorA9cQ9o8V5VUVJhUXpPS?usp=sharing problems]&lt;br /&gt;
* [https://colab.research.google.com/drive/1k60-ChM3aUWjGsiRsf2Idx9jxHHtwyAb?usp=sharing Tutorial 3] Thumb rule [https://colab.research.google.com/drive/1fdKJlp0lD4k530oRuu50_Hm_T8t3jixa?usp=sharing problems]&lt;br /&gt;
--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 17, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/15wrgivn6FSnuBUnMwjjhadmD-g1fkS7T/view?usp=sharing Lecture 2] Basic Sampling&lt;br /&gt;
&lt;br /&gt;
*  [https://drive.google.com/file/d/1ALR_QKLXdHby54xNux39NUOk4L-Ne1EW/view?usp=sharing  Lecture 3]: Errors and Precision&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 24, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1DijhG_856OAuj42WqY1UM47APmMy3A8B/view?usp=sharing Lecture 4]: Ising model and phase transitions &lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1sRUEs768Z6PKdJ3k7MixYeFGlufgjFrG Tutorial 4]: Ising model and phase transitions ([https://colab.research.google.com/drive/1KAQRog_YlAjKZ_hL1FMYurWdPBLNUocI solutions])&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
* [https://colab.research.google.com/drive/1nU4E_pFWjSFPNigzy8-LcJpef26IKY6x?usp=sharing Tutorial 4]: Ising model and phase transitions [https://colab.research.google.com/drive/1AEUX3U7hxDR_YYy8ld3knTEVR1KYa9SP?usp=sharing problems] &lt;br /&gt;
--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 1, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1PTya42ZS2kU87A-BxQFFIUDTs_k47men?usp=sharing Lecture 5]: Optimization &amp;amp; Dijkstra algorithm&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1ieT5BlfJsOehsa8r-LHGsFsn1dwYnawT Tutorial 5]: Simulated annealing ([https://colab.research.google.com/drive/1JNVl42KNASZiwTtqYo71z_vggjbGfKul solutions])&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
* [https://colab.research.google.com/drive/1p0ooWAXF9KNh-FztMHmVoA9yBzYOM8PC?usp=sharing Tutorial 5]: Simulated annealing [https://colab.research.google.com/drive/1txJGpzreHurWux7ev6sDsX8TjzpeQhZZ?usp=sharing problems]&lt;br /&gt;
--&amp;gt;&lt;br /&gt;
* Send your copy of Homework 1 to numphys.icfp  at   gmail.com  Thanks!&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1EPgj3la7vxDIqSQYNlOFz4rR0vHXAeae Homework 2] (deadline October 22)&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 8, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 6: Introduction to Bayesian inference&lt;br /&gt;
&lt;br /&gt;
* Tutorial 6: Bayesian inference and single-particle tracking. [https://drive.google.com/file/d/1q9Quq5mvJ4Avv2qWgzTocU-DVIxJIVWi/view?usp=sharing Questions]. [https://drive.google.com/file/d/1xYb4wfNBysse6Q7frTw_V9TPdUQU5lUx/view?usp=sharing Data]. [https://drive.google.com/file/d/1Ba_kRo3_XMIaDLNYZlbZEw-wGXKS-29I/view?usp=sharing Starting Notebook]. [https://colab.research.google.com/drive/1VePL9X1JT6yl8LmROeZyMyf4Epcu3yOL#scrollTo=1XQNGa_fyEkJ Google colab version]. Solutions [https://drive.google.com/file/d/1Q9IjVUeL7AA8uWk8DX9Vy9vuUQ21RYh2/view?usp=sharing]. Notebook [https://drive.google.com/file/d/1ZJmpdaTQVUttEaaI1ch-reFfZGI93454/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 15, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1eY5cuNcJqYw7df0PBkxq03tEnqzTOC-5/view?usp=sharing Lecture 7]: Importance sampling&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1iaOGxdVgk--kWUFcMDHs0zvPhsOyhB_c Tutorial 7]: Faster than the clock algorithms ([https://colab.research.google.com/drive/1bHPnJpBd5ExqKF4G5BuV_FHPE4r0_AY2#scrollTo=fQnz_gOeq40e solutions])&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
* [https://colab.research.google.com/drive/1KyT442vB4EuGKBy_Xj3j8cLtMMl4gbac?usp=sharing Tutorial 6]: Faster than the clock algorithms [https://colab.research.google.com/drive/1C-ieAwaAKwkX5MFm8aX2kNO2GNeO9CdY?usp=sharing problems]&lt;br /&gt;
--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 22, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 8: Asymptotic inference and information. Extra material: Proof of Cramer-Rao bound [https://drive.google.com/file/d/10Ph_iP6AIQ3ps9v3FwRBO9j6-qV7oKV9/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
* Tutorial 8: [https://drive.google.com/file/d/12cG4HBvzs9Oe1mbfuEYyRDmTEamW71pR/view?usp=sharing Questions]. [https://drive.google.com/file/d/1AL8sRtnqYUI8NbubfglgLazknaVIUJEo/view?usp=sharing Data ] [https://drive.google.com/file/d/1DTLzXLZUEPzoU2SsDMcAe8GaoYX8E5gH/view?usp=sharing Starting Notebook]. [https://drive.google.com/file/d/1QpMaM5ACmKUlFAyGvRnHvFVtQoEAF7-9/view?usp=sharing Bibliography] [https://drive.google.com/file/d/1p9v1PkJhwS8Ofg4RiC1nsFJAe8Mb_6WF/view?usp=sharing Solutions].  [https://drive.google.com/file/d/19erJJ4Gjw77n57VrnqaQPCxIh_-NScYT/view?usp=sharing Notebook].&lt;br /&gt;
&lt;br /&gt;
* Send your copy of Homework 2 to numphys.icfp  at   gmail.com  Thanks!&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 29, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 9: High-dimensional inference and Principal Component Analysis. Extra material: Handwritten notes on the derivation of Marcenko-Pastur spectral density [https://drive.google.com/file/d/10Yytv9itdWDDHTsM2lQHwQDMbcf-oVnd/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
* Tutorial 9: [https://drive.google.com/file/d/10y7m1mPf5R5zZN6661Eei92IUNhBL_Zu/view?usp=sharing  Replay of the neuronal activity during sleep after a task].[https://drive.google.com/file/d/11fO26XB6Ri3HDVBvtdBkYxcTRLk1iv5F/view?usp=sharing Data ]. [https://drive.google.com/file/d/1-MFN2ERs_eNs4w6XnLjfzsu2F9REluSt/view?usp=sharing Initial Notebook]. [https://drive.google.com/file/d/11ev4Zwn6DPYLwhMsLyp8S0aQFVu77Ou3/view?usp=sharing Biblio]. &lt;br /&gt;
[https://drive.google.com/file/d/11E75QwrJgDKrutGj9t5NJTRkGtuRgoBI/view?usp=sharing Solutions]. [https://drive.google.com/file/d/1-39oZNNB-35zM4V2tLWtubQnZTdMLtIz/view?usp=sharing Notebook]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, November 12, 2021, 2 pm: The Quiz.&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
The MCQ is composed of 19 questions (one of them counts for two).  For each question you have 4 choices: 3 wrong and 1 correct: If you check the correct one you get a point. If you are wrong you loose 1/4 of a point.  No answer given: zero points.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
MCQ Solution (correct answers in bold):[https://drive.google.com/file/d/1WWcqxFzmCJp2ZXC02a70a1o17pGupdyZ/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, November 26, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 10: Priors, regularisation, sparsity&lt;br /&gt;
&lt;br /&gt;
* Tutorial 10: [https://drive.google.com/file/d/14kaGKRm7uciT7uLVMW_Vqzr8ha-V-Ra2/view?usp=sharing Bayesian Inference and Priors for the analysis of gravitational waves]. [https://drive.google.com/file/d/16UTmpwKm-7UMcIbca8IIGsO-aCmcwKuD/view?usp=sharing Starting notebook on artificial data]. [https://drive.google.com/file/d/1CyiDlXs6ez9-7gnyeBU0YRgV7Nt5ibkn/view?usp=sharing Biblio][https://colab.research.google.com/drive/1pFMOawozlYOIpy0jQWkTfoq-tFp3uvhw?usp=sharing#scrollTo=6picRNBipcYN Notebook on real data] &lt;br /&gt;
[https://drive.google.com/file/d/161ZLuq5s2RpHDJWELFSKXqlf-qwrVrxA/view?usp=sharing Notebook on Artificial data] [https://drive.google.com/file/d/17qhYN8EFpcoCUHOM_juBvEGpu61GgJRx/view?usp=sharing Corrections ]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, December 3, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 11: Probabilistic graphical models&lt;br /&gt;
&lt;br /&gt;
* Tutorial 11:[https://drive.google.com/file/d/1A5pcJICHkmHZYoa2uoAGSAWp-_ZOaIEf/view?usp=sharing Analysis of protein sequence data to infer protein structure] [https://drive.google.com/file/d/1COKr5pNoBRFwwnj7TWPQSU8mEWKvsLud/view?usp=sharing Starting notebook and data] [https://drive.google.com/file/d/1CQw1PQ6RSS6nuGxhkwOqe7LJHpOPIaVp/view?usp=sharing Biblio][https://drive.google.com/file/d/1CslX27bTp5gyhXV4ciFE8s1zMnBgJ-1O/view?usp=sharing Solutions] [https://drive.google.com/file/d/19X59x3TdIsJaccTZE71gCbZxFbOzlhj4/view?usp=sharing Final notebook]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, December 10, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 12: Hidden Markov Models. Extra material: Pedagogical introduction to Kalman filters [https://drive.google.com/file/d/0B4HvoS7Zt11LZUxVLTkyVXRQRUE/view?usp=sharing&amp;amp;resourcekey=0-CzsYaRIrPP2sN-UmwfiLHQ]&lt;br /&gt;
&lt;br /&gt;
* Tutorial 12: &lt;br /&gt;
[https://drive.google.com/file/d/1FLbWZRWJ1JILZV41RjwVKR7mOhNMhLV9/view?usp=sharing Hidden Markov Models Hidden  for identification of recombinations in SARS-CoV-2 viral genomes] [https://drive.google.com/file/d/1FCAg0ihMWoAk-_dtt5ORncjVjkVu-m4D/view?usp=sharing Starting Notebook and Data][https://drive.google.com/file/d/1HMREe6ge7_K-lOKC4f2FwL7vnEa1_8Yf/view?usp=sharing Bibliography] [https://drive.google.com/file/d/1FLDBJmNtXogHiO5VfScGiePTCxMFy1KZ/view?usp=sharing Final Notebook] [https://drive.google.com/file/d/1FBQaNJ2RhjwW_VSut2oC7mZYl5F8RWfS/view?usp=sharing Solutions]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, December 17, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 13: Unsupervised learning and representations&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1p2c35gHMr4_Ptdmwsh3jGJz__9NNIgLw Tutorial 13]: How restricted Boltzmann machines learn ([https://colab.research.google.com/drive/1gnaK_vmTESTV3Ex_A1gqcee6Q58iKyld solutions])&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Final examination of the data-driven course (January 7, 2022)&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Example of exam: On-line Principal Component Analysis [https://drive.google.com/file/d/1BbRY4b3OCVYAtYH4m6ry19KcA2gkp3pH/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
* On-line version of the book [https://drive.google.com/file/d/161YHZA7i2YU-8emy6IPUFhsOXzFRxSRS/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
* Examination repository [https://drive.google.com/file/d/19DNkNBed0Ir5a9N048ZFV4_xF0KG3kcy/view?usp=sharing]&lt;/div&gt;</summary>
		<author><name>Alberto</name></author>
	</entry>
	<entry>
		<id>http://www.lptms.universite-paris-saclay.fr//wiki-cours/index.php?title=CoDaDri2&amp;diff=1755</id>
		<title>CoDaDri2</title>
		<link rel="alternate" type="text/html" href="http://www.lptms.universite-paris-saclay.fr//wiki-cours/index.php?title=CoDaDri2&amp;diff=1755"/>
		<updated>2022-06-22T12:13:04Z</updated>

		<summary type="html">&lt;p&gt;Alberto: /* Breaking news: */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;=Breaking news:=&lt;br /&gt;
&lt;br /&gt;
* Update with course schedule&lt;br /&gt;
&lt;br /&gt;
= Computational and Data Driven Physics =&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Modern physics is characterized by an increasing complexity of systems under investigation, in&lt;br /&gt;
domains as diverse as condensed matter, astrophysics, biophysics, etc. Establishing adequate&lt;br /&gt;
models to describe these systems and being able to make quantitative predictions from those models&lt;br /&gt;
is extremely challenging. The goal of the course is to provide the tools and concepts necessary to tackle those systems.&lt;br /&gt;
&lt;br /&gt;
== Course description ==&lt;br /&gt;
&lt;br /&gt;
We will first cover many algorithms used in many-body problems and complex systems, with special emphasis on Monte Carlo methods, molecular dynamics, and optimization in complex landscapes. &lt;br /&gt;
&lt;br /&gt;
Second, we will provide statistical inference and machine learning tools to harness the growing availability of experimental data to design accurate models of the underlying, complex, strongly non-homogeneous and interacting systems. &lt;br /&gt;
&lt;br /&gt;
Each theoretical lecture will be followed by a tutorial illustrating the concepts with practical applications&lt;br /&gt;
borrowed from various domains of physics. We will focus on methods and algorithms and physics, not&lt;br /&gt;
on programming and heavy numerics!  You will have to hand in 3 homeworks.&lt;br /&gt;
&lt;br /&gt;
*[https://drive.google.com/file/d/11w7KI5Pi59VWLX1mqiQ8ZyY8YQHRUeMz/view?usp=sharing Preliminary version of the book: Information, Inference, Networks: From statistical physics to big biological data]&lt;br /&gt;
&lt;br /&gt;
== The Team ==&lt;br /&gt;
&lt;br /&gt;
* [http://lptms.u-psud.fr/alberto_rosso/ Alberto Rosso] (Computational physics)&lt;br /&gt;
* [http://www.phys.ens.fr/~monasson/ Rémi Monasson] (Data-driven physics)&lt;br /&gt;
*  [http://www.lps.ens.fr/~cocco/ Simona Cocco] &amp;amp; [https://www.pct.espci.fr/~david/ David Lacoste] &amp;amp; [https://www.cpht.polytechnique.fr/?q=en/node/110 Michel Ferrero] (Tutorials)&lt;br /&gt;
&lt;br /&gt;
== Where and When ==&lt;br /&gt;
&lt;br /&gt;
* Lectures on Fridays: 14:00-16:00&lt;br /&gt;
* Tutorials on Fridays: 16:00-18:00&lt;br /&gt;
* ENS, 29 rue D&#039;Ulm, salle Borel + Djebar&lt;br /&gt;
&lt;br /&gt;
== Slack ==&lt;br /&gt;
&lt;br /&gt;
If you have questions or want to discuss topics related to the lecture, to the exercises or to the homeworks, you can use the&lt;br /&gt;
[http://computational-ozw2847.slack.com Computational and Data Driven Physics Slack]. In order to join the Slack&lt;br /&gt;
use the following [https://join.slack.com/t/computational-ozw2847/shared_invite/zt-vegija8y-cx_vbF2BI6FJewx4W6coSA invitation link].&lt;br /&gt;
&lt;br /&gt;
== Computer Requirements ==&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;No previous experience in programming is required.&#039;&#039;&#039; &amp;lt;br&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Programming Language: Python&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
For practical installation, we recommand either to use  Anaconda (See [[Memento Python]]) or use google colab. &amp;lt;br&amp;gt;&lt;br /&gt;
The Collaboratory platform from Google is quite good way to use powerful computer without buying one: It requires no specific hardware or software, and even allows you to use GPU computing for free,  all by writting a jupyter notebook that you can then share.&lt;br /&gt;
&lt;br /&gt;
== Grading ==&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Computational Physics:&#039;&#039;&#039;&lt;br /&gt;
* Homework 1: 5 points &lt;br /&gt;
* Homework 2: 5 points&lt;br /&gt;
* Multiple Choice Questions in November: 10 points&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Data Driven Physics:&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Final exam in January: 20 points&lt;br /&gt;
&lt;br /&gt;
== Schedule ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 3, 2021 &#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1X9h3lKD0OZLTKtxb7DWPfynY42rRuE7j/view?usp=sharing Lecture 1]   Introduction to Monte Carlo&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1sIv3qOdyE-XYkjYC-dkNsR72f4BgaQ_y/view?usp=sharing Tutorial 1] Markov Matrix&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 10, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Introductory notebooks: [https://colab.research.google.com/drive/1Ovrh1JjLzMMnxtasDgR1j84CHGU6hMxA python], [https://colab.research.google.com/drive/14PWu-C171pYhV8ven-Txc4wz5Tv1DCsK numpy] and [https://colab.research.google.com/drive/1fPjwrdxQPSyfXniyAHmyOcF_gK2fqjts matplotlib]&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1gf7oRQIpvSvMScyJa5hexB9CCZvdozPs#scrollTo=lDznlLouvlFx Tutorial 2] - Markov matrices ([https://colab.research.google.com/drive/1x9iEHG_F522uFCvD_jGdvHaMETAHfO6-#scrollTo=eSu-nLZ6vm8X solutions])&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1tjqbjAi50C4qOqVRtTxEkTeTb10qpTms#scrollTo=uYpaubGkvogU Tutorial 3] - Thumb rule ([https://colab.research.google.com/drive/1aWVtz4ZGcpIarWiRVAnxrp1t0GDOqZxu#scrollTo=f7ohlMuZvqTr solutions])&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1g7HXFUBQUBF0fhy5h2jYbfIAVBTqvb7-#scrollTo=U9LFX8OFhHOG Homework 1] (deadline October 1)&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
* [https://colab.research.google.com/drive/1aMo4Ur-0_b4dGhdIfxAmCC2ci1rOda_v?usp=sharing Tutorial 2] Markov matrix [https://colab.research.google.com/drive/1Q5ajzxRGXBBorA9cQ9o8V5VUVJhUXpPS?usp=sharing problems]&lt;br /&gt;
* [https://colab.research.google.com/drive/1k60-ChM3aUWjGsiRsf2Idx9jxHHtwyAb?usp=sharing Tutorial 3] Thumb rule [https://colab.research.google.com/drive/1fdKJlp0lD4k530oRuu50_Hm_T8t3jixa?usp=sharing problems]&lt;br /&gt;
--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 17, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/15wrgivn6FSnuBUnMwjjhadmD-g1fkS7T/view?usp=sharing Lecture 2] Basic Sampling&lt;br /&gt;
&lt;br /&gt;
*  [https://drive.google.com/file/d/1ALR_QKLXdHby54xNux39NUOk4L-Ne1EW/view?usp=sharing  Lecture 3]: Errors and Precision&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 24, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1DijhG_856OAuj42WqY1UM47APmMy3A8B/view?usp=sharing Lecture 4]: Ising model and phase transitions &lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1sRUEs768Z6PKdJ3k7MixYeFGlufgjFrG Tutorial 4]: Ising model and phase transitions ([https://colab.research.google.com/drive/1KAQRog_YlAjKZ_hL1FMYurWdPBLNUocI solutions])&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
* [https://colab.research.google.com/drive/1nU4E_pFWjSFPNigzy8-LcJpef26IKY6x?usp=sharing Tutorial 4]: Ising model and phase transitions [https://colab.research.google.com/drive/1AEUX3U7hxDR_YYy8ld3knTEVR1KYa9SP?usp=sharing problems] &lt;br /&gt;
--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 1, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1PTya42ZS2kU87A-BxQFFIUDTs_k47men?usp=sharing Lecture 5]: Optimization &amp;amp; Dijkstra algorithm&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1ieT5BlfJsOehsa8r-LHGsFsn1dwYnawT Tutorial 5]: Simulated annealing ([https://colab.research.google.com/drive/1JNVl42KNASZiwTtqYo71z_vggjbGfKul solutions])&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
* [https://colab.research.google.com/drive/1p0ooWAXF9KNh-FztMHmVoA9yBzYOM8PC?usp=sharing Tutorial 5]: Simulated annealing [https://colab.research.google.com/drive/1txJGpzreHurWux7ev6sDsX8TjzpeQhZZ?usp=sharing problems]&lt;br /&gt;
--&amp;gt;&lt;br /&gt;
* Send your copy of Homework 1 to numphys.icfp  at   gmail.com  Thanks!&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1EPgj3la7vxDIqSQYNlOFz4rR0vHXAeae Homework 2] (deadline October 22)&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 8, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 6: Introduction to Bayesian inference&lt;br /&gt;
&lt;br /&gt;
* Tutorial 6: Bayesian inference and single-particle tracking. [https://drive.google.com/file/d/1q9Quq5mvJ4Avv2qWgzTocU-DVIxJIVWi/view?usp=sharing Questions]. [https://drive.google.com/file/d/1xYb4wfNBysse6Q7frTw_V9TPdUQU5lUx/view?usp=sharing Data]. [https://drive.google.com/file/d/1Ba_kRo3_XMIaDLNYZlbZEw-wGXKS-29I/view?usp=sharing Starting Notebook]. [https://colab.research.google.com/drive/1VePL9X1JT6yl8LmROeZyMyf4Epcu3yOL#scrollTo=1XQNGa_fyEkJ Google colab version]. Solutions [https://drive.google.com/file/d/1Q9IjVUeL7AA8uWk8DX9Vy9vuUQ21RYh2/view?usp=sharing]. Notebook [https://drive.google.com/file/d/1ZJmpdaTQVUttEaaI1ch-reFfZGI93454/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 15, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1eY5cuNcJqYw7df0PBkxq03tEnqzTOC-5/view?usp=sharing Lecture 7]: Importance sampling&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1iaOGxdVgk--kWUFcMDHs0zvPhsOyhB_c Tutorial 7]: Faster than the clock algorithms ([https://colab.research.google.com/drive/1bHPnJpBd5ExqKF4G5BuV_FHPE4r0_AY2#scrollTo=fQnz_gOeq40e solutions])&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
* [https://colab.research.google.com/drive/1KyT442vB4EuGKBy_Xj3j8cLtMMl4gbac?usp=sharing Tutorial 6]: Faster than the clock algorithms [https://colab.research.google.com/drive/1C-ieAwaAKwkX5MFm8aX2kNO2GNeO9CdY?usp=sharing problems]&lt;br /&gt;
--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 22, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 8: Asymptotic inference and information. Extra material: Proof of Cramer-Rao bound [https://drive.google.com/file/d/10Ph_iP6AIQ3ps9v3FwRBO9j6-qV7oKV9/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
* Tutorial 8: [https://drive.google.com/file/d/12cG4HBvzs9Oe1mbfuEYyRDmTEamW71pR/view?usp=sharing Questions]. [https://drive.google.com/file/d/1AL8sRtnqYUI8NbubfglgLazknaVIUJEo/view?usp=sharing Data ] [https://drive.google.com/file/d/1DTLzXLZUEPzoU2SsDMcAe8GaoYX8E5gH/view?usp=sharing Starting Notebook]. [https://drive.google.com/file/d/1QpMaM5ACmKUlFAyGvRnHvFVtQoEAF7-9/view?usp=sharing Bibliography] [https://drive.google.com/file/d/1p9v1PkJhwS8Ofg4RiC1nsFJAe8Mb_6WF/view?usp=sharing Solutions].  [https://drive.google.com/file/d/19erJJ4Gjw77n57VrnqaQPCxIh_-NScYT/view?usp=sharing Notebook].&lt;br /&gt;
&lt;br /&gt;
* Send your copy of Homework 2 to numphys.icfp  at   gmail.com  Thanks!&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 29, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 9: High-dimensional inference and Principal Component Analysis. Extra material: Handwritten notes on the derivation of Marcenko-Pastur spectral density [https://drive.google.com/file/d/10Yytv9itdWDDHTsM2lQHwQDMbcf-oVnd/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
* Tutorial 9: [https://drive.google.com/file/d/10y7m1mPf5R5zZN6661Eei92IUNhBL_Zu/view?usp=sharing  Replay of the neuronal activity during sleep after a task].[https://drive.google.com/file/d/11fO26XB6Ri3HDVBvtdBkYxcTRLk1iv5F/view?usp=sharing Data ]. [https://drive.google.com/file/d/1-MFN2ERs_eNs4w6XnLjfzsu2F9REluSt/view?usp=sharing Initial Notebook]. [https://drive.google.com/file/d/11ev4Zwn6DPYLwhMsLyp8S0aQFVu77Ou3/view?usp=sharing Biblio]. &lt;br /&gt;
[https://drive.google.com/file/d/11E75QwrJgDKrutGj9t5NJTRkGtuRgoBI/view?usp=sharing Solutions]. [https://drive.google.com/file/d/1-39oZNNB-35zM4V2tLWtubQnZTdMLtIz/view?usp=sharing Notebook]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, November 12, 2021, 2 pm: The Quiz.&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
The MCQ is composed of 19 questions (one of them counts for two).  For each question you have 4 choices: 3 wrong and 1 correct: If you check the correct one you get a point. If you are wrong you loose 1/4 of a point.  No answer given: zero points.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
MCQ Solution (correct answers in bold):[https://drive.google.com/file/d/1WWcqxFzmCJp2ZXC02a70a1o17pGupdyZ/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, November 26, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 10: Priors, regularisation, sparsity&lt;br /&gt;
&lt;br /&gt;
* Tutorial 10: [https://drive.google.com/file/d/14kaGKRm7uciT7uLVMW_Vqzr8ha-V-Ra2/view?usp=sharing Bayesian Inference and Priors for the analysis of gravitational waves]. [https://drive.google.com/file/d/16UTmpwKm-7UMcIbca8IIGsO-aCmcwKuD/view?usp=sharing Starting notebook on artificial data]. [https://drive.google.com/file/d/1CyiDlXs6ez9-7gnyeBU0YRgV7Nt5ibkn/view?usp=sharing Biblio][https://colab.research.google.com/drive/1pFMOawozlYOIpy0jQWkTfoq-tFp3uvhw?usp=sharing#scrollTo=6picRNBipcYN Notebook on real data] &lt;br /&gt;
[https://drive.google.com/file/d/161ZLuq5s2RpHDJWELFSKXqlf-qwrVrxA/view?usp=sharing Notebook on Artificial data] [https://drive.google.com/file/d/17qhYN8EFpcoCUHOM_juBvEGpu61GgJRx/view?usp=sharing Corrections ]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, December 3, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 11: Probabilistic graphical models&lt;br /&gt;
&lt;br /&gt;
* Tutorial 11:[https://drive.google.com/file/d/1A5pcJICHkmHZYoa2uoAGSAWp-_ZOaIEf/view?usp=sharing Analysis of protein sequence data to infer protein structure] [https://drive.google.com/file/d/1COKr5pNoBRFwwnj7TWPQSU8mEWKvsLud/view?usp=sharing Starting notebook and data] [https://drive.google.com/file/d/1CQw1PQ6RSS6nuGxhkwOqe7LJHpOPIaVp/view?usp=sharing Biblio][https://drive.google.com/file/d/1CslX27bTp5gyhXV4ciFE8s1zMnBgJ-1O/view?usp=sharing Solutions] [https://drive.google.com/file/d/19X59x3TdIsJaccTZE71gCbZxFbOzlhj4/view?usp=sharing Final notebook]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, December 10, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 12: Hidden Markov Models. Extra material: Pedagogical introduction to Kalman filters [https://drive.google.com/file/d/0B4HvoS7Zt11LZUxVLTkyVXRQRUE/view?usp=sharing&amp;amp;resourcekey=0-CzsYaRIrPP2sN-UmwfiLHQ]&lt;br /&gt;
&lt;br /&gt;
* Tutorial 12: &lt;br /&gt;
[https://drive.google.com/file/d/1FLbWZRWJ1JILZV41RjwVKR7mOhNMhLV9/view?usp=sharing Hidden Markov Models Hidden  for identification of recombinations in SARS-CoV-2 viral genomes] [https://drive.google.com/file/d/1FCAg0ihMWoAk-_dtt5ORncjVjkVu-m4D/view?usp=sharing Starting Notebook and Data][https://drive.google.com/file/d/1HMREe6ge7_K-lOKC4f2FwL7vnEa1_8Yf/view?usp=sharing Bibliography] [https://drive.google.com/file/d/1FLDBJmNtXogHiO5VfScGiePTCxMFy1KZ/view?usp=sharing Final Notebook] [https://drive.google.com/file/d/1FBQaNJ2RhjwW_VSut2oC7mZYl5F8RWfS/view?usp=sharing Solutions]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, December 17, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 13: Unsupervised learning and representations&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1p2c35gHMr4_Ptdmwsh3jGJz__9NNIgLw Tutorial 13]: How restricted Boltzmann machines learn ([https://colab.research.google.com/drive/1gnaK_vmTESTV3Ex_A1gqcee6Q58iKyld solutions])&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Final examination of the data-driven course (January 7, 2022)&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Example of exam: On-line Principal Component Analysis [https://drive.google.com/file/d/1BbRY4b3OCVYAtYH4m6ry19KcA2gkp3pH/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
* On-line version of the book [https://drive.google.com/file/d/161YHZA7i2YU-8emy6IPUFhsOXzFRxSRS/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
* Examination repository [https://drive.google.com/file/d/19DNkNBed0Ir5a9N048ZFV4_xF0KG3kcy/view?usp=sharing]&lt;/div&gt;</summary>
		<author><name>Alberto</name></author>
	</entry>
	<entry>
		<id>http://www.lptms.universite-paris-saclay.fr//wiki-cours/index.php?title=CoDaDri2&amp;diff=1754</id>
		<title>CoDaDri2</title>
		<link rel="alternate" type="text/html" href="http://www.lptms.universite-paris-saclay.fr//wiki-cours/index.php?title=CoDaDri2&amp;diff=1754"/>
		<updated>2022-06-22T12:12:12Z</updated>

		<summary type="html">&lt;p&gt;Alberto: Created page with &amp;quot;=Breaking news:=  * Homework 1 has been evaluated and sent to you. If you did not receive it, please contact us.  * Here you find the MCQ proposed last year  [https://colab.re...&amp;quot;&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;=Breaking news:=&lt;br /&gt;
&lt;br /&gt;
* Homework 1 has been evaluated and sent to you. If you did not receive it, please contact us. &lt;br /&gt;
* Here you find the MCQ proposed last year &lt;br /&gt;
[https://colab.research.google.com/drive/1Ru_-IQ001XEJd9VAn4nvbBNI_3XA9QSK?usp=sharing The Quiz]&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;The Solution&#039;&#039;&#039; [https://colab.research.google.com/drive/1Faovrt0q5kRVtVsF9afr4iMXww_Wk53_?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
= Computational and Data Driven Physics =&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Modern physics is characterized by an increasing complexity of systems under investigation, in&lt;br /&gt;
domains as diverse as condensed matter, astrophysics, biophysics, etc. Establishing adequate&lt;br /&gt;
models to describe these systems and being able to make quantitative predictions from those models&lt;br /&gt;
is extremely challenging. The goal of the course is to provide the tools and concepts necessary to tackle those systems.&lt;br /&gt;
&lt;br /&gt;
== Course description ==&lt;br /&gt;
&lt;br /&gt;
We will first cover many algorithms used in many-body problems and complex systems, with special emphasis on Monte Carlo methods, molecular dynamics, and optimization in complex landscapes. &lt;br /&gt;
&lt;br /&gt;
Second, we will provide statistical inference and machine learning tools to harness the growing availability of experimental data to design accurate models of the underlying, complex, strongly non-homogeneous and interacting systems. &lt;br /&gt;
&lt;br /&gt;
Each theoretical lecture will be followed by a tutorial illustrating the concepts with practical applications&lt;br /&gt;
borrowed from various domains of physics. We will focus on methods and algorithms and physics, not&lt;br /&gt;
on programming and heavy numerics!  You will have to hand in 3 homeworks.&lt;br /&gt;
&lt;br /&gt;
*[https://drive.google.com/file/d/11w7KI5Pi59VWLX1mqiQ8ZyY8YQHRUeMz/view?usp=sharing Preliminary version of the book: Information, Inference, Networks: From statistical physics to big biological data]&lt;br /&gt;
&lt;br /&gt;
== The Team ==&lt;br /&gt;
&lt;br /&gt;
* [http://lptms.u-psud.fr/alberto_rosso/ Alberto Rosso] (Computational physics)&lt;br /&gt;
* [http://www.phys.ens.fr/~monasson/ Rémi Monasson] (Data-driven physics)&lt;br /&gt;
*  [http://www.lps.ens.fr/~cocco/ Simona Cocco] &amp;amp; [https://www.pct.espci.fr/~david/ David Lacoste] &amp;amp; [https://www.cpht.polytechnique.fr/?q=en/node/110 Michel Ferrero] (Tutorials)&lt;br /&gt;
&lt;br /&gt;
== Where and When ==&lt;br /&gt;
&lt;br /&gt;
* Lectures on Fridays: 14:00-16:00&lt;br /&gt;
* Tutorials on Fridays: 16:00-18:00&lt;br /&gt;
* ENS, 29 rue D&#039;Ulm, salle Borel + Djebar&lt;br /&gt;
&lt;br /&gt;
== Slack ==&lt;br /&gt;
&lt;br /&gt;
If you have questions or want to discuss topics related to the lecture, to the exercises or to the homeworks, you can use the&lt;br /&gt;
[http://computational-ozw2847.slack.com Computational and Data Driven Physics Slack]. In order to join the Slack&lt;br /&gt;
use the following [https://join.slack.com/t/computational-ozw2847/shared_invite/zt-vegija8y-cx_vbF2BI6FJewx4W6coSA invitation link].&lt;br /&gt;
&lt;br /&gt;
== Computer Requirements ==&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;No previous experience in programming is required.&#039;&#039;&#039; &amp;lt;br&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Programming Language: Python&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
For practical installation, we recommand either to use  Anaconda (See [[Memento Python]]) or use google colab. &amp;lt;br&amp;gt;&lt;br /&gt;
The Collaboratory platform from Google is quite good way to use powerful computer without buying one: It requires no specific hardware or software, and even allows you to use GPU computing for free,  all by writting a jupyter notebook that you can then share.&lt;br /&gt;
&lt;br /&gt;
== Grading ==&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Computational Physics:&#039;&#039;&#039;&lt;br /&gt;
* Homework 1: 5 points &lt;br /&gt;
* Homework 2: 5 points&lt;br /&gt;
* Multiple Choice Questions in November: 10 points&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Data Driven Physics:&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Final exam in January: 20 points&lt;br /&gt;
&lt;br /&gt;
== Schedule ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 3, 2021 &#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1X9h3lKD0OZLTKtxb7DWPfynY42rRuE7j/view?usp=sharing Lecture 1]   Introduction to Monte Carlo&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1sIv3qOdyE-XYkjYC-dkNsR72f4BgaQ_y/view?usp=sharing Tutorial 1] Markov Matrix&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 10, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Introductory notebooks: [https://colab.research.google.com/drive/1Ovrh1JjLzMMnxtasDgR1j84CHGU6hMxA python], [https://colab.research.google.com/drive/14PWu-C171pYhV8ven-Txc4wz5Tv1DCsK numpy] and [https://colab.research.google.com/drive/1fPjwrdxQPSyfXniyAHmyOcF_gK2fqjts matplotlib]&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1gf7oRQIpvSvMScyJa5hexB9CCZvdozPs#scrollTo=lDznlLouvlFx Tutorial 2] - Markov matrices ([https://colab.research.google.com/drive/1x9iEHG_F522uFCvD_jGdvHaMETAHfO6-#scrollTo=eSu-nLZ6vm8X solutions])&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1tjqbjAi50C4qOqVRtTxEkTeTb10qpTms#scrollTo=uYpaubGkvogU Tutorial 3] - Thumb rule ([https://colab.research.google.com/drive/1aWVtz4ZGcpIarWiRVAnxrp1t0GDOqZxu#scrollTo=f7ohlMuZvqTr solutions])&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1g7HXFUBQUBF0fhy5h2jYbfIAVBTqvb7-#scrollTo=U9LFX8OFhHOG Homework 1] (deadline October 1)&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
* [https://colab.research.google.com/drive/1aMo4Ur-0_b4dGhdIfxAmCC2ci1rOda_v?usp=sharing Tutorial 2] Markov matrix [https://colab.research.google.com/drive/1Q5ajzxRGXBBorA9cQ9o8V5VUVJhUXpPS?usp=sharing problems]&lt;br /&gt;
* [https://colab.research.google.com/drive/1k60-ChM3aUWjGsiRsf2Idx9jxHHtwyAb?usp=sharing Tutorial 3] Thumb rule [https://colab.research.google.com/drive/1fdKJlp0lD4k530oRuu50_Hm_T8t3jixa?usp=sharing problems]&lt;br /&gt;
--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 17, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/15wrgivn6FSnuBUnMwjjhadmD-g1fkS7T/view?usp=sharing Lecture 2] Basic Sampling&lt;br /&gt;
&lt;br /&gt;
*  [https://drive.google.com/file/d/1ALR_QKLXdHby54xNux39NUOk4L-Ne1EW/view?usp=sharing  Lecture 3]: Errors and Precision&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 24, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1DijhG_856OAuj42WqY1UM47APmMy3A8B/view?usp=sharing Lecture 4]: Ising model and phase transitions &lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1sRUEs768Z6PKdJ3k7MixYeFGlufgjFrG Tutorial 4]: Ising model and phase transitions ([https://colab.research.google.com/drive/1KAQRog_YlAjKZ_hL1FMYurWdPBLNUocI solutions])&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
* [https://colab.research.google.com/drive/1nU4E_pFWjSFPNigzy8-LcJpef26IKY6x?usp=sharing Tutorial 4]: Ising model and phase transitions [https://colab.research.google.com/drive/1AEUX3U7hxDR_YYy8ld3knTEVR1KYa9SP?usp=sharing problems] &lt;br /&gt;
--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 1, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1PTya42ZS2kU87A-BxQFFIUDTs_k47men?usp=sharing Lecture 5]: Optimization &amp;amp; Dijkstra algorithm&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1ieT5BlfJsOehsa8r-LHGsFsn1dwYnawT Tutorial 5]: Simulated annealing ([https://colab.research.google.com/drive/1JNVl42KNASZiwTtqYo71z_vggjbGfKul solutions])&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
* [https://colab.research.google.com/drive/1p0ooWAXF9KNh-FztMHmVoA9yBzYOM8PC?usp=sharing Tutorial 5]: Simulated annealing [https://colab.research.google.com/drive/1txJGpzreHurWux7ev6sDsX8TjzpeQhZZ?usp=sharing problems]&lt;br /&gt;
--&amp;gt;&lt;br /&gt;
* Send your copy of Homework 1 to numphys.icfp  at   gmail.com  Thanks!&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1EPgj3la7vxDIqSQYNlOFz4rR0vHXAeae Homework 2] (deadline October 22)&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 8, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 6: Introduction to Bayesian inference&lt;br /&gt;
&lt;br /&gt;
* Tutorial 6: Bayesian inference and single-particle tracking. [https://drive.google.com/file/d/1q9Quq5mvJ4Avv2qWgzTocU-DVIxJIVWi/view?usp=sharing Questions]. [https://drive.google.com/file/d/1xYb4wfNBysse6Q7frTw_V9TPdUQU5lUx/view?usp=sharing Data]. [https://drive.google.com/file/d/1Ba_kRo3_XMIaDLNYZlbZEw-wGXKS-29I/view?usp=sharing Starting Notebook]. [https://colab.research.google.com/drive/1VePL9X1JT6yl8LmROeZyMyf4Epcu3yOL#scrollTo=1XQNGa_fyEkJ Google colab version]. Solutions [https://drive.google.com/file/d/1Q9IjVUeL7AA8uWk8DX9Vy9vuUQ21RYh2/view?usp=sharing]. Notebook [https://drive.google.com/file/d/1ZJmpdaTQVUttEaaI1ch-reFfZGI93454/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 15, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1eY5cuNcJqYw7df0PBkxq03tEnqzTOC-5/view?usp=sharing Lecture 7]: Importance sampling&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1iaOGxdVgk--kWUFcMDHs0zvPhsOyhB_c Tutorial 7]: Faster than the clock algorithms ([https://colab.research.google.com/drive/1bHPnJpBd5ExqKF4G5BuV_FHPE4r0_AY2#scrollTo=fQnz_gOeq40e solutions])&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
* [https://colab.research.google.com/drive/1KyT442vB4EuGKBy_Xj3j8cLtMMl4gbac?usp=sharing Tutorial 6]: Faster than the clock algorithms [https://colab.research.google.com/drive/1C-ieAwaAKwkX5MFm8aX2kNO2GNeO9CdY?usp=sharing problems]&lt;br /&gt;
--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 22, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 8: Asymptotic inference and information. Extra material: Proof of Cramer-Rao bound [https://drive.google.com/file/d/10Ph_iP6AIQ3ps9v3FwRBO9j6-qV7oKV9/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
* Tutorial 8: [https://drive.google.com/file/d/12cG4HBvzs9Oe1mbfuEYyRDmTEamW71pR/view?usp=sharing Questions]. [https://drive.google.com/file/d/1AL8sRtnqYUI8NbubfglgLazknaVIUJEo/view?usp=sharing Data ] [https://drive.google.com/file/d/1DTLzXLZUEPzoU2SsDMcAe8GaoYX8E5gH/view?usp=sharing Starting Notebook]. [https://drive.google.com/file/d/1QpMaM5ACmKUlFAyGvRnHvFVtQoEAF7-9/view?usp=sharing Bibliography] [https://drive.google.com/file/d/1p9v1PkJhwS8Ofg4RiC1nsFJAe8Mb_6WF/view?usp=sharing Solutions].  [https://drive.google.com/file/d/19erJJ4Gjw77n57VrnqaQPCxIh_-NScYT/view?usp=sharing Notebook].&lt;br /&gt;
&lt;br /&gt;
* Send your copy of Homework 2 to numphys.icfp  at   gmail.com  Thanks!&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 29, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 9: High-dimensional inference and Principal Component Analysis. Extra material: Handwritten notes on the derivation of Marcenko-Pastur spectral density [https://drive.google.com/file/d/10Yytv9itdWDDHTsM2lQHwQDMbcf-oVnd/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
* Tutorial 9: [https://drive.google.com/file/d/10y7m1mPf5R5zZN6661Eei92IUNhBL_Zu/view?usp=sharing  Replay of the neuronal activity during sleep after a task].[https://drive.google.com/file/d/11fO26XB6Ri3HDVBvtdBkYxcTRLk1iv5F/view?usp=sharing Data ]. [https://drive.google.com/file/d/1-MFN2ERs_eNs4w6XnLjfzsu2F9REluSt/view?usp=sharing Initial Notebook]. [https://drive.google.com/file/d/11ev4Zwn6DPYLwhMsLyp8S0aQFVu77Ou3/view?usp=sharing Biblio]. &lt;br /&gt;
[https://drive.google.com/file/d/11E75QwrJgDKrutGj9t5NJTRkGtuRgoBI/view?usp=sharing Solutions]. [https://drive.google.com/file/d/1-39oZNNB-35zM4V2tLWtubQnZTdMLtIz/view?usp=sharing Notebook]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, November 12, 2021, 2 pm: The Quiz.&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
The MCQ is composed of 19 questions (one of them counts for two).  For each question you have 4 choices: 3 wrong and 1 correct: If you check the correct one you get a point. If you are wrong you loose 1/4 of a point.  No answer given: zero points.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
MCQ Solution (correct answers in bold):[https://drive.google.com/file/d/1WWcqxFzmCJp2ZXC02a70a1o17pGupdyZ/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, November 26, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 10: Priors, regularisation, sparsity&lt;br /&gt;
&lt;br /&gt;
* Tutorial 10: [https://drive.google.com/file/d/14kaGKRm7uciT7uLVMW_Vqzr8ha-V-Ra2/view?usp=sharing Bayesian Inference and Priors for the analysis of gravitational waves]. [https://drive.google.com/file/d/16UTmpwKm-7UMcIbca8IIGsO-aCmcwKuD/view?usp=sharing Starting notebook on artificial data]. [https://drive.google.com/file/d/1CyiDlXs6ez9-7gnyeBU0YRgV7Nt5ibkn/view?usp=sharing Biblio][https://colab.research.google.com/drive/1pFMOawozlYOIpy0jQWkTfoq-tFp3uvhw?usp=sharing#scrollTo=6picRNBipcYN Notebook on real data] &lt;br /&gt;
[https://drive.google.com/file/d/161ZLuq5s2RpHDJWELFSKXqlf-qwrVrxA/view?usp=sharing Notebook on Artificial data] [https://drive.google.com/file/d/17qhYN8EFpcoCUHOM_juBvEGpu61GgJRx/view?usp=sharing Corrections ]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, December 3, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 11: Probabilistic graphical models&lt;br /&gt;
&lt;br /&gt;
* Tutorial 11:[https://drive.google.com/file/d/1A5pcJICHkmHZYoa2uoAGSAWp-_ZOaIEf/view?usp=sharing Analysis of protein sequence data to infer protein structure] [https://drive.google.com/file/d/1COKr5pNoBRFwwnj7TWPQSU8mEWKvsLud/view?usp=sharing Starting notebook and data] [https://drive.google.com/file/d/1CQw1PQ6RSS6nuGxhkwOqe7LJHpOPIaVp/view?usp=sharing Biblio][https://drive.google.com/file/d/1CslX27bTp5gyhXV4ciFE8s1zMnBgJ-1O/view?usp=sharing Solutions] [https://drive.google.com/file/d/19X59x3TdIsJaccTZE71gCbZxFbOzlhj4/view?usp=sharing Final notebook]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, December 10, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 12: Hidden Markov Models. Extra material: Pedagogical introduction to Kalman filters [https://drive.google.com/file/d/0B4HvoS7Zt11LZUxVLTkyVXRQRUE/view?usp=sharing&amp;amp;resourcekey=0-CzsYaRIrPP2sN-UmwfiLHQ]&lt;br /&gt;
&lt;br /&gt;
* Tutorial 12: &lt;br /&gt;
[https://drive.google.com/file/d/1FLbWZRWJ1JILZV41RjwVKR7mOhNMhLV9/view?usp=sharing Hidden Markov Models Hidden  for identification of recombinations in SARS-CoV-2 viral genomes] [https://drive.google.com/file/d/1FCAg0ihMWoAk-_dtt5ORncjVjkVu-m4D/view?usp=sharing Starting Notebook and Data][https://drive.google.com/file/d/1HMREe6ge7_K-lOKC4f2FwL7vnEa1_8Yf/view?usp=sharing Bibliography] [https://drive.google.com/file/d/1FLDBJmNtXogHiO5VfScGiePTCxMFy1KZ/view?usp=sharing Final Notebook] [https://drive.google.com/file/d/1FBQaNJ2RhjwW_VSut2oC7mZYl5F8RWfS/view?usp=sharing Solutions]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, December 17, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 13: Unsupervised learning and representations&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1p2c35gHMr4_Ptdmwsh3jGJz__9NNIgLw Tutorial 13]: How restricted Boltzmann machines learn ([https://colab.research.google.com/drive/1gnaK_vmTESTV3Ex_A1gqcee6Q58iKyld solutions])&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Final examination of the data-driven course (January 7, 2022)&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Example of exam: On-line Principal Component Analysis [https://drive.google.com/file/d/1BbRY4b3OCVYAtYH4m6ry19KcA2gkp3pH/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
* On-line version of the book [https://drive.google.com/file/d/161YHZA7i2YU-8emy6IPUFhsOXzFRxSRS/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
* Examination repository [https://drive.google.com/file/d/19DNkNBed0Ir5a9N048ZFV4_xF0KG3kcy/view?usp=sharing]&lt;/div&gt;</summary>
		<author><name>Alberto</name></author>
	</entry>
	<entry>
		<id>http://www.lptms.universite-paris-saclay.fr//wiki-cours/index.php?title=Main_Page&amp;diff=1753</id>
		<title>Main Page</title>
		<link rel="alternate" type="text/html" href="http://www.lptms.universite-paris-saclay.fr//wiki-cours/index.php?title=Main_Page&amp;diff=1753"/>
		<updated>2022-06-22T12:11:16Z</updated>

		<summary type="html">&lt;p&gt;Alberto: /* M2 ICFP */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;__NOTOC__&lt;br /&gt;
== Niveau Licence ==&lt;br /&gt;
&lt;br /&gt;
=== L1 ===&lt;br /&gt;
&lt;br /&gt;
* [http://lptms.u-psud.fr/christophe_texier/enseignements/enseignement-en-licence/phys101/ Mécanique] (Ch. Texier)&lt;br /&gt;
* [http://lptms.u-psud.fr/christophe_texier/enseignements/enseignement-en-licence/l1-mecanique-du-point-et-optique-geometrique/ Optique géométrique] (Ch. Texier)&lt;br /&gt;
&lt;br /&gt;
=== L2 PMCP ou PMCC ===&lt;br /&gt;
* [http://lptms.u-psud.fr/nicolas_pavloff/enseignement/thermodynamique/ Thermodynamique L2 PMCP] (N. Pavloff)&lt;br /&gt;
* [[Mécanique L2 PMCC|Mécanique L2 PMCC]] (G. Roux)&lt;br /&gt;
&lt;br /&gt;
=== L2 frontières du vivant ===&lt;br /&gt;
* [http://lptms.u-psud.fr/membres/mlenz/teaching.html Physique L2S4 de la licence frontières du vivant] (M. Lenz)&lt;br /&gt;
&lt;br /&gt;
=== L3 Physique et applications ===&lt;br /&gt;
* [[Physique statistique L3 Mécanique]] (G. Roux)&lt;br /&gt;
&lt;br /&gt;
=== L3 Physique fondamentale ===&lt;br /&gt;
* [http://lptms.u-psud.fr/christophe_texier/enseignements/enseignement-en-licence/l3-physique-statistique/ Physique statistique L3 Physique fondamentale] (Ch. Texier, G. Roux, N. Pavloff)&lt;br /&gt;
* [http://lptms.u-psud.fr/nicolas_pavloff/enseignement/relativite-restreinte/ Relativité Restreinte] (N. Pavloff)&lt;br /&gt;
&lt;br /&gt;
=== L3 Physique Chimie ===&lt;br /&gt;
* [[Mécanique quantique L3 Physique Chimie]] (G. Roux)&lt;br /&gt;
&lt;br /&gt;
=== L3 FIP ===&lt;br /&gt;
* [http://www.lptms.u-psud.fr/membres/trizac/Ens/L3FIP.html Physique statistique L3 FIP] (E. Trizac)&lt;br /&gt;
&lt;br /&gt;
=== ESPCI &amp;amp; Ecole Centrale ===&lt;br /&gt;
* [http://lptms.u-psud.fr/membres/mlenz/teaching.html Tutorats de physique statistique de L3 à l&#039;ESPCI] (A. Rosso, V. Terras)&lt;br /&gt;
* [http://lptms.u-psud.fr/wikiespci/index.php/Main_Page Tutorat en mathématiques] (G. Schehr)&lt;br /&gt;
* [http://lptms.u-psud.fr/gregory-schehr/teaching/ Quantum Mechanics I and Statistical Physics I] (G. Schehr)&lt;br /&gt;
&lt;br /&gt;
== Niveau Master ==&lt;br /&gt;
&lt;br /&gt;
=== [http://www.magistere-physique.u-psud.fr/spip.php?article12 M1 Physique fondamentale] à Paris-Saclay ===&lt;br /&gt;
&lt;br /&gt;
* [http://lptms.u-psud.fr/nicolas_pavloff/enseignement/electrodynamique-classique-et-quantique/ Électrodynamique classique et quantique] (N. Pavloff)&lt;br /&gt;
* [[Transitions de phase]] (G. Roux, C. Texier, N. Pavloff)&lt;br /&gt;
&lt;br /&gt;
=== [https://www.universite-paris-saclay.fr/fr/formation/master/m1-physique-et-applications#presentation-m1 M1 Physique et application] à Paris-Saclay ===&lt;br /&gt;
&lt;br /&gt;
* [[Programmation et données numériques M1 Physique Appliquée]] (G. Roux)&lt;br /&gt;
&lt;br /&gt;
=== [https://www.universite-paris-saclay.fr/fr/formation/master/m1-general-physics#presentation-m1 M1 General Physics] à Paris-Saclay ===&lt;br /&gt;
&lt;br /&gt;
* [http://lptms.u-psud.fr/membres/trizac/Ens/M1GP.html Statistical Mechanics] (E. Trizac)&lt;br /&gt;
&lt;br /&gt;
=== [https://www.phys.ens.fr/spip.php?rubrique284 M2 ICFP] ===&lt;br /&gt;
&lt;br /&gt;
* [http://lptms.u-psud.fr/membres/trizac/Ens/iCFP.html Statistical physics] (E. Trizac, M. Lenz, Ch. Texier)&lt;br /&gt;
* [http://www.lptms.u-psud.fr/membres/trizac/Ens/M2MQPL.html Physique statistique hors équilibre classique] (E. Trizac)&lt;br /&gt;
* [http://lptms.u-psud.fr/christophe_texier/enseignements/enseignements-en-master/physique-statistique-hors-equilibre  Physique statistique hors équilibre quantique] (Ch. Texier)&lt;br /&gt;
* [http://lptms.u-psud.fr/christophe_texier/enseignements/enseignements-en-master/onde-en-milieu-desordonne/ Ondes en milieux désordonnés] (Ch. Texier)&lt;br /&gt;
* [[ICFP_NumPhys_Paris |Numerical Physics]] (A. Rosso, G. Roux)&lt;br /&gt;
* [[NUMPHYsandML|Numerical physics and Machine learning 2020/2021]] (A. Rosso)&lt;br /&gt;
* [[CoDaDri|Computational and Data Driven Physics 2021/2022]] (R. Monasson, A. Rosso; S. Cocco, M. Ferrero)&lt;br /&gt;
* [[CoDaDri2|Computational and Data Driven Physics 2022/2023]] (R. Monasson, A. Rosso; S. Cocco, M. Ferrero with the special help of V. Schimmenti)&lt;br /&gt;
&lt;br /&gt;
=== [http://www.lps.ens.fr/~benamar/sc/ M2 Systèmes complexes] ===&lt;br /&gt;
&lt;br /&gt;
* [http://lptms.u-psud.fr/membres/mlenz/teaching.html Physique non-linéaire] (M. Lenz)&lt;br /&gt;
* [[Mathematical tools]] (G. Roux)&lt;br /&gt;
* Interface Physics / Social sciences (D. Ullmo)&lt;br /&gt;
* Inference learning and big data (S. Franz)&lt;br /&gt;
&lt;br /&gt;
=== [http://npac.lal.in2p3.fr/accueil/ M2 NPAC] ===&lt;br /&gt;
&lt;br /&gt;
* Stage informatique (S. Franz, N. Pavloff)&lt;br /&gt;
&lt;br /&gt;
== Anciennement ==&lt;br /&gt;
&lt;br /&gt;
* [http://lptms.u-psud.fr/christophe_texier/enseignements/enseignements-en-master/integrale-de-chemin/  Intégrale de chemin] (A. Comtet, Ch. Texier)&lt;br /&gt;
* [http://lptms.u-psud.fr/ressources/cours/cours_electronic_transport_in_weakly_disordered_metals.pdf  Electronic Transport In Weakly Disordered Metals] (Ch. Texier)&lt;br /&gt;
* [http://lptms.u-psud.fr/nicolas_pavloff/files/2010/03/cours_cmplx.pdf Physique Quantique des Systèmes Complexes : approximation de champ moyen, méthodes semiclassiques] (N. Pavloff)&lt;br /&gt;
* [http://lptms.u-psud.fr/nicolas_pavloff/enseignement/physique-statistique/ Physique statistique] (N. Pavloff)&lt;br /&gt;
* [http://lptms.u-psud.fr/christophe_texier/enseignements/enseignement-en-licence/l3-mecanique-quantique/ Mécanique quantique] (Ch. Texier)&lt;br /&gt;
* [http://lptms.u-psud.fr/christophe_texier/files/2010/03/coursrl_Ch_Texier.pdf Physique statistique des systèmes (faiblement) hors équilibre : formalisme de la réponse linéaire. Dissipation quantique. Transport électronique] (Ch. Texier)&lt;/div&gt;</summary>
		<author><name>Alberto</name></author>
	</entry>
	<entry>
		<id>http://www.lptms.universite-paris-saclay.fr//wiki-cours/index.php?title=Main_Page&amp;diff=1752</id>
		<title>Main Page</title>
		<link rel="alternate" type="text/html" href="http://www.lptms.universite-paris-saclay.fr//wiki-cours/index.php?title=Main_Page&amp;diff=1752"/>
		<updated>2022-06-22T12:10:40Z</updated>

		<summary type="html">&lt;p&gt;Alberto: /* M2 ICFP */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;__NOTOC__&lt;br /&gt;
== Niveau Licence ==&lt;br /&gt;
&lt;br /&gt;
=== L1 ===&lt;br /&gt;
&lt;br /&gt;
* [http://lptms.u-psud.fr/christophe_texier/enseignements/enseignement-en-licence/phys101/ Mécanique] (Ch. Texier)&lt;br /&gt;
* [http://lptms.u-psud.fr/christophe_texier/enseignements/enseignement-en-licence/l1-mecanique-du-point-et-optique-geometrique/ Optique géométrique] (Ch. Texier)&lt;br /&gt;
&lt;br /&gt;
=== L2 PMCP ou PMCC ===&lt;br /&gt;
* [http://lptms.u-psud.fr/nicolas_pavloff/enseignement/thermodynamique/ Thermodynamique L2 PMCP] (N. Pavloff)&lt;br /&gt;
* [[Mécanique L2 PMCC|Mécanique L2 PMCC]] (G. Roux)&lt;br /&gt;
&lt;br /&gt;
=== L2 frontières du vivant ===&lt;br /&gt;
* [http://lptms.u-psud.fr/membres/mlenz/teaching.html Physique L2S4 de la licence frontières du vivant] (M. Lenz)&lt;br /&gt;
&lt;br /&gt;
=== L3 Physique et applications ===&lt;br /&gt;
* [[Physique statistique L3 Mécanique]] (G. Roux)&lt;br /&gt;
&lt;br /&gt;
=== L3 Physique fondamentale ===&lt;br /&gt;
* [http://lptms.u-psud.fr/christophe_texier/enseignements/enseignement-en-licence/l3-physique-statistique/ Physique statistique L3 Physique fondamentale] (Ch. Texier, G. Roux, N. Pavloff)&lt;br /&gt;
* [http://lptms.u-psud.fr/nicolas_pavloff/enseignement/relativite-restreinte/ Relativité Restreinte] (N. Pavloff)&lt;br /&gt;
&lt;br /&gt;
=== L3 Physique Chimie ===&lt;br /&gt;
* [[Mécanique quantique L3 Physique Chimie]] (G. Roux)&lt;br /&gt;
&lt;br /&gt;
=== L3 FIP ===&lt;br /&gt;
* [http://www.lptms.u-psud.fr/membres/trizac/Ens/L3FIP.html Physique statistique L3 FIP] (E. Trizac)&lt;br /&gt;
&lt;br /&gt;
=== ESPCI &amp;amp; Ecole Centrale ===&lt;br /&gt;
* [http://lptms.u-psud.fr/membres/mlenz/teaching.html Tutorats de physique statistique de L3 à l&#039;ESPCI] (A. Rosso, V. Terras)&lt;br /&gt;
* [http://lptms.u-psud.fr/wikiespci/index.php/Main_Page Tutorat en mathématiques] (G. Schehr)&lt;br /&gt;
* [http://lptms.u-psud.fr/gregory-schehr/teaching/ Quantum Mechanics I and Statistical Physics I] (G. Schehr)&lt;br /&gt;
&lt;br /&gt;
== Niveau Master ==&lt;br /&gt;
&lt;br /&gt;
=== [http://www.magistere-physique.u-psud.fr/spip.php?article12 M1 Physique fondamentale] à Paris-Saclay ===&lt;br /&gt;
&lt;br /&gt;
* [http://lptms.u-psud.fr/nicolas_pavloff/enseignement/electrodynamique-classique-et-quantique/ Électrodynamique classique et quantique] (N. Pavloff)&lt;br /&gt;
* [[Transitions de phase]] (G. Roux, C. Texier, N. Pavloff)&lt;br /&gt;
&lt;br /&gt;
=== [https://www.universite-paris-saclay.fr/fr/formation/master/m1-physique-et-applications#presentation-m1 M1 Physique et application] à Paris-Saclay ===&lt;br /&gt;
&lt;br /&gt;
* [[Programmation et données numériques M1 Physique Appliquée]] (G. Roux)&lt;br /&gt;
&lt;br /&gt;
=== [https://www.universite-paris-saclay.fr/fr/formation/master/m1-general-physics#presentation-m1 M1 General Physics] à Paris-Saclay ===&lt;br /&gt;
&lt;br /&gt;
* [http://lptms.u-psud.fr/membres/trizac/Ens/M1GP.html Statistical Mechanics] (E. Trizac)&lt;br /&gt;
&lt;br /&gt;
=== [https://www.phys.ens.fr/spip.php?rubrique284 M2 ICFP] ===&lt;br /&gt;
&lt;br /&gt;
* [http://lptms.u-psud.fr/membres/trizac/Ens/iCFP.html Statistical physics] (E. Trizac, M. Lenz, Ch. Texier)&lt;br /&gt;
* [http://www.lptms.u-psud.fr/membres/trizac/Ens/M2MQPL.html Physique statistique hors équilibre classique] (E. Trizac)&lt;br /&gt;
* [http://lptms.u-psud.fr/christophe_texier/enseignements/enseignements-en-master/physique-statistique-hors-equilibre  Physique statistique hors équilibre quantique] (Ch. Texier)&lt;br /&gt;
* [http://lptms.u-psud.fr/christophe_texier/enseignements/enseignements-en-master/onde-en-milieu-desordonne/ Ondes en milieux désordonnés] (Ch. Texier)&lt;br /&gt;
* [[ICFP_NumPhys_Paris |Numerical Physics]] (A. Rosso, G. Roux)&lt;br /&gt;
* [[NUMPHYsandML|Numerical physics and Machine learning 2020/2021]] (A. Rosso)&lt;br /&gt;
* [[CoDaDri|Computational and Data Driven Physics 2021/2022]] (R. Monasson, A. Rosso; S. Cocco, M. Ferrero)&lt;br /&gt;
* [[CoDaDri|Computational and Data Driven Physics 2022/2023]] (R. Monasson, A. Rosso; S. Cocco, M. Ferrero with the special help of V. Schimmenti)&lt;br /&gt;
&lt;br /&gt;
=== [http://www.lps.ens.fr/~benamar/sc/ M2 Systèmes complexes] ===&lt;br /&gt;
&lt;br /&gt;
* [http://lptms.u-psud.fr/membres/mlenz/teaching.html Physique non-linéaire] (M. Lenz)&lt;br /&gt;
* [[Mathematical tools]] (G. Roux)&lt;br /&gt;
* Interface Physics / Social sciences (D. Ullmo)&lt;br /&gt;
* Inference learning and big data (S. Franz)&lt;br /&gt;
&lt;br /&gt;
=== [http://npac.lal.in2p3.fr/accueil/ M2 NPAC] ===&lt;br /&gt;
&lt;br /&gt;
* Stage informatique (S. Franz, N. Pavloff)&lt;br /&gt;
&lt;br /&gt;
== Anciennement ==&lt;br /&gt;
&lt;br /&gt;
* [http://lptms.u-psud.fr/christophe_texier/enseignements/enseignements-en-master/integrale-de-chemin/  Intégrale de chemin] (A. Comtet, Ch. Texier)&lt;br /&gt;
* [http://lptms.u-psud.fr/ressources/cours/cours_electronic_transport_in_weakly_disordered_metals.pdf  Electronic Transport In Weakly Disordered Metals] (Ch. Texier)&lt;br /&gt;
* [http://lptms.u-psud.fr/nicolas_pavloff/files/2010/03/cours_cmplx.pdf Physique Quantique des Systèmes Complexes : approximation de champ moyen, méthodes semiclassiques] (N. Pavloff)&lt;br /&gt;
* [http://lptms.u-psud.fr/nicolas_pavloff/enseignement/physique-statistique/ Physique statistique] (N. Pavloff)&lt;br /&gt;
* [http://lptms.u-psud.fr/christophe_texier/enseignements/enseignement-en-licence/l3-mecanique-quantique/ Mécanique quantique] (Ch. Texier)&lt;br /&gt;
* [http://lptms.u-psud.fr/christophe_texier/files/2010/03/coursrl_Ch_Texier.pdf Physique statistique des systèmes (faiblement) hors équilibre : formalisme de la réponse linéaire. Dissipation quantique. Transport électronique] (Ch. Texier)&lt;/div&gt;</summary>
		<author><name>Alberto</name></author>
	</entry>
	<entry>
		<id>http://www.lptms.universite-paris-saclay.fr//wiki-cours/index.php?title=CoDaDri&amp;diff=1689</id>
		<title>CoDaDri</title>
		<link rel="alternate" type="text/html" href="http://www.lptms.universite-paris-saclay.fr//wiki-cours/index.php?title=CoDaDri&amp;diff=1689"/>
		<updated>2021-11-18T15:46:48Z</updated>

		<summary type="html">&lt;p&gt;Alberto: /* Schedule */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;=Breaking news:=&lt;br /&gt;
&lt;br /&gt;
* Homework 1 has been evaluated and sent to you. If you did not receive it, please contact us. &lt;br /&gt;
* Here you find the MCQ proposed last year &lt;br /&gt;
[https://colab.research.google.com/drive/1Ru_-IQ001XEJd9VAn4nvbBNI_3XA9QSK?usp=sharing The Quiz]&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;The Solution&#039;&#039;&#039; [https://colab.research.google.com/drive/1Faovrt0q5kRVtVsF9afr4iMXww_Wk53_?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
= Computational and Data Driven Physics =&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Modern physics is characterized by an increasing complexity of systems under investigation, in&lt;br /&gt;
domains as diverse as condensed matter, astrophysics, biophysics, etc. Establishing adequate&lt;br /&gt;
models to describe these systems and being able to make quantitative predictions from those models&lt;br /&gt;
is extremely challenging. The goal of the course is to provide the tools and concepts necessary to tackle those systems.&lt;br /&gt;
&lt;br /&gt;
== Course description ==&lt;br /&gt;
&lt;br /&gt;
We will first cover many algorithms used in many-body problems and complex systems, with special emphasis on Monte Carlo methods, molecular dynamics, and optimization in complex landscapes. &lt;br /&gt;
&lt;br /&gt;
Second, we will provide statistical inference and machine learning tools to harness the growing availability of experimental data to design accurate models of the underlying, complex, strongly non-homogeneous and interacting systems. &lt;br /&gt;
&lt;br /&gt;
Each theoretical lecture will be followed by a tutorial illustrating the concepts with practical applications&lt;br /&gt;
borrowed from various domains of physics. We will focus on methods and algorithms and physics, not&lt;br /&gt;
on programming and heavy numerics!  You will have to hand in 3 homeworks.&lt;br /&gt;
&lt;br /&gt;
*[https://drive.google.com/file/d/11w7KI5Pi59VWLX1mqiQ8ZyY8YQHRUeMz/view?usp=sharing Preliminary version of the book: Information, Inference, Networks: From statistical physics to big biological data]&lt;br /&gt;
&lt;br /&gt;
== The Team ==&lt;br /&gt;
&lt;br /&gt;
* [http://lptms.u-psud.fr/alberto_rosso/ Alberto Rosso] (Computational physics)&lt;br /&gt;
* [http://www.phys.ens.fr/~monasson/ Rémi Monasson] (Data-driven physics)&lt;br /&gt;
*  [http://www.lps.ens.fr/~cocco/ Simona Cocco] &amp;amp; [https://www.pct.espci.fr/~david/ David Lacoste] &amp;amp; [https://www.cpht.polytechnique.fr/?q=en/node/110 Michel Ferrero] (Tutorials)&lt;br /&gt;
&lt;br /&gt;
== Where and When ==&lt;br /&gt;
&lt;br /&gt;
* Lectures on Fridays: 14:00-16:00&lt;br /&gt;
* Tutorials on Fridays: 16:00-18:00&lt;br /&gt;
* ENS, 29 rue D&#039;Ulm, salle Borel + Djebar&lt;br /&gt;
&lt;br /&gt;
== Slack ==&lt;br /&gt;
&lt;br /&gt;
If you have questions or want to discuss topics related to the lecture, to the exercises or to the homeworks, you can use the&lt;br /&gt;
[http://computational-ozw2847.slack.com Computational and Data Driven Physics Slack]. In order to join the Slack&lt;br /&gt;
use the following [https://join.slack.com/t/computational-ozw2847/shared_invite/zt-vegija8y-cx_vbF2BI6FJewx4W6coSA invitation link].&lt;br /&gt;
&lt;br /&gt;
== Computer Requirements ==&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;No previous experience in programming is required.&#039;&#039;&#039; &amp;lt;br&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Programming Language: Python&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
For practical installation, we recommand either to use  Anaconda (See [[Memento Python]]) or use google colab. &amp;lt;br&amp;gt;&lt;br /&gt;
The Collaboratory platform from Google is quite good way to use powerful computer without buying one: It requires no specific hardware or software, and even allows you to use GPU computing for free,  all by writting a jupyter notebook that you can then share.&lt;br /&gt;
&lt;br /&gt;
== Grading ==&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Computational Physics:&#039;&#039;&#039;&lt;br /&gt;
* Homework 1: 5 points &lt;br /&gt;
* Homework 2: 5 points&lt;br /&gt;
* Multiple Choice Questions in November: 10 points&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Data Driven Physics:&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Final exam in January: 20 points&lt;br /&gt;
&lt;br /&gt;
== Schedule ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 3, 2021 &#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1X9h3lKD0OZLTKtxb7DWPfynY42rRuE7j/view?usp=sharing Lecture 1]   Introduction to Monte Carlo&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1sIv3qOdyE-XYkjYC-dkNsR72f4BgaQ_y/view?usp=sharing Tutorial 1] Markov Matrix&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 10, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Introductory notebooks: [https://colab.research.google.com/drive/1Ovrh1JjLzMMnxtasDgR1j84CHGU6hMxA python], [https://colab.research.google.com/drive/14PWu-C171pYhV8ven-Txc4wz5Tv1DCsK numpy] and [https://colab.research.google.com/drive/1fPjwrdxQPSyfXniyAHmyOcF_gK2fqjts matplotlib]&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1gf7oRQIpvSvMScyJa5hexB9CCZvdozPs#scrollTo=lDznlLouvlFx Tutorial 2] - Markov matrices ([https://colab.research.google.com/drive/1x9iEHG_F522uFCvD_jGdvHaMETAHfO6-#scrollTo=eSu-nLZ6vm8X solutions])&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1tjqbjAi50C4qOqVRtTxEkTeTb10qpTms#scrollTo=uYpaubGkvogU Tutorial 3] - Thumb rule ([https://colab.research.google.com/drive/1aWVtz4ZGcpIarWiRVAnxrp1t0GDOqZxu#scrollTo=f7ohlMuZvqTr solutions])&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1g7HXFUBQUBF0fhy5h2jYbfIAVBTqvb7-#scrollTo=U9LFX8OFhHOG Homework 1] (deadline October 1)&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
* [https://colab.research.google.com/drive/1aMo4Ur-0_b4dGhdIfxAmCC2ci1rOda_v?usp=sharing Tutorial 2] Markov matrix [https://colab.research.google.com/drive/1Q5ajzxRGXBBorA9cQ9o8V5VUVJhUXpPS?usp=sharing problems]&lt;br /&gt;
* [https://colab.research.google.com/drive/1k60-ChM3aUWjGsiRsf2Idx9jxHHtwyAb?usp=sharing Tutorial 3] Thumb rule [https://colab.research.google.com/drive/1fdKJlp0lD4k530oRuu50_Hm_T8t3jixa?usp=sharing problems]&lt;br /&gt;
--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 17, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/15wrgivn6FSnuBUnMwjjhadmD-g1fkS7T/view?usp=sharing Lecture 2] Basic Sampling&lt;br /&gt;
&lt;br /&gt;
*  [https://drive.google.com/file/d/1ALR_QKLXdHby54xNux39NUOk4L-Ne1EW/view?usp=sharing  Lecture 3]: Errors and Precision&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 24, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1DijhG_856OAuj42WqY1UM47APmMy3A8B/view?usp=sharing Lecture 4]: Ising model and phase transitions &lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1sRUEs768Z6PKdJ3k7MixYeFGlufgjFrG Tutorial 4]: Ising model and phase transitions ([https://colab.research.google.com/drive/1KAQRog_YlAjKZ_hL1FMYurWdPBLNUocI solutions])&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
* [https://colab.research.google.com/drive/1nU4E_pFWjSFPNigzy8-LcJpef26IKY6x?usp=sharing Tutorial 4]: Ising model and phase transitions [https://colab.research.google.com/drive/1AEUX3U7hxDR_YYy8ld3knTEVR1KYa9SP?usp=sharing problems] &lt;br /&gt;
--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 1, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1PTya42ZS2kU87A-BxQFFIUDTs_k47men?usp=sharing Lecture 5]: Optimization &amp;amp; Dijkstra algorithm&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1ieT5BlfJsOehsa8r-LHGsFsn1dwYnawT Tutorial 5]: Simulated annealing ([https://colab.research.google.com/drive/1JNVl42KNASZiwTtqYo71z_vggjbGfKul solutions])&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
* [https://colab.research.google.com/drive/1p0ooWAXF9KNh-FztMHmVoA9yBzYOM8PC?usp=sharing Tutorial 5]: Simulated annealing [https://colab.research.google.com/drive/1txJGpzreHurWux7ev6sDsX8TjzpeQhZZ?usp=sharing problems]&lt;br /&gt;
--&amp;gt;&lt;br /&gt;
* Send your copy of Homework 1 to numphys.icfp  at   gmail.com  Thanks!&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1EPgj3la7vxDIqSQYNlOFz4rR0vHXAeae Homework 2] (deadline October 22)&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 8, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 6: Introduction to Bayesian inference&lt;br /&gt;
&lt;br /&gt;
* Tutorial 6: Bayesian inference and single-particle tracking. [https://drive.google.com/file/d/1q9Quq5mvJ4Avv2qWgzTocU-DVIxJIVWi/view?usp=sharing Questions]. [https://drive.google.com/file/d/1xYb4wfNBysse6Q7frTw_V9TPdUQU5lUx/view?usp=sharing Data]. [https://drive.google.com/file/d/1Ba_kRo3_XMIaDLNYZlbZEw-wGXKS-29I/view?usp=sharing Starting Notebook]. [https://colab.research.google.com/drive/1VePL9X1JT6yl8LmROeZyMyf4Epcu3yOL#scrollTo=1XQNGa_fyEkJ Google colab version]. Solutions [https://drive.google.com/file/d/1Q9IjVUeL7AA8uWk8DX9Vy9vuUQ21RYh2/view?usp=sharing]. Notebook [https://drive.google.com/file/d/1ZJmpdaTQVUttEaaI1ch-reFfZGI93454/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 15, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1eY5cuNcJqYw7df0PBkxq03tEnqzTOC-5/view?usp=sharing Lecture 7]: Importance sampling&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1iaOGxdVgk--kWUFcMDHs0zvPhsOyhB_c Tutorial 7]: Faster than the clock algorithms ([https://colab.research.google.com/drive/1bHPnJpBd5ExqKF4G5BuV_FHPE4r0_AY2#scrollTo=fQnz_gOeq40e solutions])&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
* [https://colab.research.google.com/drive/1KyT442vB4EuGKBy_Xj3j8cLtMMl4gbac?usp=sharing Tutorial 6]: Faster than the clock algorithms [https://colab.research.google.com/drive/1C-ieAwaAKwkX5MFm8aX2kNO2GNeO9CdY?usp=sharing problems]&lt;br /&gt;
--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 22, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 8: Asymptotic inference and information. Extra material: Proof of Cramer-Rao bound [https://drive.google.com/file/d/10Ph_iP6AIQ3ps9v3FwRBO9j6-qV7oKV9/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
* Tutorial 8: [https://drive.google.com/file/d/12cG4HBvzs9Oe1mbfuEYyRDmTEamW71pR/view?usp=sharing Questions]. [https://drive.google.com/file/d/1AL8sRtnqYUI8NbubfglgLazknaVIUJEo/view?usp=sharing Data ] [https://drive.google.com/file/d/1DTLzXLZUEPzoU2SsDMcAe8GaoYX8E5gH/view?usp=sharing Starting Notebook]. [https://drive.google.com/file/d/1QpMaM5ACmKUlFAyGvRnHvFVtQoEAF7-9/view?usp=sharing Bibliography] [https://drive.google.com/file/d/1p9v1PkJhwS8Ofg4RiC1nsFJAe8Mb_6WF/view?usp=sharing Solutions].  [https://drive.google.com/file/d/19erJJ4Gjw77n57VrnqaQPCxIh_-NScYT/view?usp=sharing Notebook].&lt;br /&gt;
&lt;br /&gt;
* Send your copy of Homework 2 to numphys.icfp  at   gmail.com  Thanks!&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 29, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 9: High-dimensional inference and Principal Component Analysis. Extra material: Handwritten notes on the derivation of Marcenko-Pastur spectral density [https://drive.google.com/file/d/10Yytv9itdWDDHTsM2lQHwQDMbcf-oVnd/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
* Tutorial 9: [https://drive.google.com/file/d/10y7m1mPf5R5zZN6661Eei92IUNhBL_Zu/view?usp=sharing  Replay of the neuronal activity during sleep after a task].[https://drive.google.com/file/d/11fO26XB6Ri3HDVBvtdBkYxcTRLk1iv5F/view?usp=sharing Data ]. [https://drive.google.com/file/d/1-MFN2ERs_eNs4w6XnLjfzsu2F9REluSt/view?usp=sharing Initial Notebook]. [https://drive.google.com/file/d/11ev4Zwn6DPYLwhMsLyp8S0aQFVu77Ou3/view?usp=sharing Biblio]. &lt;br /&gt;
[https://drive.google.com/file/d/11E75QwrJgDKrutGj9t5NJTRkGtuRgoBI/view?usp=sharing Solutions]. [https://drive.google.com/file/d/1-39oZNNB-35zM4V2tLWtubQnZTdMLtIz/view?usp=sharing Notebook]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, November 12, 2021, 2 pm: The Quiz.&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
The MCQ is composed of 19 questions (one of them counts for two).  For each question you have 4 choices: 3 wrong and 1 correct: If you check the correct one you get a point. If you are wrong you loose 1/4 of a point.  No answer given: zero points.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
MCQ Solution (correct answers in bold):[https://drive.google.com/file/d/1WWcqxFzmCJp2ZXC02a70a1o17pGupdyZ/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, November 26, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 10: Priors, regularisation, sparsity&lt;br /&gt;
&lt;br /&gt;
* Tutorial 10:&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, December 3, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 11: Network inference&lt;br /&gt;
&lt;br /&gt;
* Tutorial 11:&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, December 10, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 12: Supervised learning and phase transitions&lt;br /&gt;
&lt;br /&gt;
* Tutorial 12:&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, December 17, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 13: Unsupervised learning and representations&lt;br /&gt;
&lt;br /&gt;
* Tutorial 13:&lt;/div&gt;</summary>
		<author><name>Alberto</name></author>
	</entry>
	<entry>
		<id>http://www.lptms.universite-paris-saclay.fr//wiki-cours/index.php?title=CoDaDri&amp;diff=1688</id>
		<title>CoDaDri</title>
		<link rel="alternate" type="text/html" href="http://www.lptms.universite-paris-saclay.fr//wiki-cours/index.php?title=CoDaDri&amp;diff=1688"/>
		<updated>2021-11-18T15:41:21Z</updated>

		<summary type="html">&lt;p&gt;Alberto: /* Schedule */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;=Breaking news:=&lt;br /&gt;
&lt;br /&gt;
* Homework 1 has been evaluated and sent to you. If you did not receive it, please contact us. &lt;br /&gt;
* Here you find the MCQ proposed last year &lt;br /&gt;
[https://colab.research.google.com/drive/1Ru_-IQ001XEJd9VAn4nvbBNI_3XA9QSK?usp=sharing The Quiz]&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;The Solution&#039;&#039;&#039; [https://colab.research.google.com/drive/1Faovrt0q5kRVtVsF9afr4iMXww_Wk53_?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
= Computational and Data Driven Physics =&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Modern physics is characterized by an increasing complexity of systems under investigation, in&lt;br /&gt;
domains as diverse as condensed matter, astrophysics, biophysics, etc. Establishing adequate&lt;br /&gt;
models to describe these systems and being able to make quantitative predictions from those models&lt;br /&gt;
is extremely challenging. The goal of the course is to provide the tools and concepts necessary to tackle those systems.&lt;br /&gt;
&lt;br /&gt;
== Course description ==&lt;br /&gt;
&lt;br /&gt;
We will first cover many algorithms used in many-body problems and complex systems, with special emphasis on Monte Carlo methods, molecular dynamics, and optimization in complex landscapes. &lt;br /&gt;
&lt;br /&gt;
Second, we will provide statistical inference and machine learning tools to harness the growing availability of experimental data to design accurate models of the underlying, complex, strongly non-homogeneous and interacting systems. &lt;br /&gt;
&lt;br /&gt;
Each theoretical lecture will be followed by a tutorial illustrating the concepts with practical applications&lt;br /&gt;
borrowed from various domains of physics. We will focus on methods and algorithms and physics, not&lt;br /&gt;
on programming and heavy numerics!  You will have to hand in 3 homeworks.&lt;br /&gt;
&lt;br /&gt;
*[https://drive.google.com/file/d/11w7KI5Pi59VWLX1mqiQ8ZyY8YQHRUeMz/view?usp=sharing Preliminary version of the book: Information, Inference, Networks: From statistical physics to big biological data]&lt;br /&gt;
&lt;br /&gt;
== The Team ==&lt;br /&gt;
&lt;br /&gt;
* [http://lptms.u-psud.fr/alberto_rosso/ Alberto Rosso] (Computational physics)&lt;br /&gt;
* [http://www.phys.ens.fr/~monasson/ Rémi Monasson] (Data-driven physics)&lt;br /&gt;
*  [http://www.lps.ens.fr/~cocco/ Simona Cocco] &amp;amp; [https://www.pct.espci.fr/~david/ David Lacoste] &amp;amp; [https://www.cpht.polytechnique.fr/?q=en/node/110 Michel Ferrero] (Tutorials)&lt;br /&gt;
&lt;br /&gt;
== Where and When ==&lt;br /&gt;
&lt;br /&gt;
* Lectures on Fridays: 14:00-16:00&lt;br /&gt;
* Tutorials on Fridays: 16:00-18:00&lt;br /&gt;
* ENS, 29 rue D&#039;Ulm, salle Borel + Djebar&lt;br /&gt;
&lt;br /&gt;
== Slack ==&lt;br /&gt;
&lt;br /&gt;
If you have questions or want to discuss topics related to the lecture, to the exercises or to the homeworks, you can use the&lt;br /&gt;
[http://computational-ozw2847.slack.com Computational and Data Driven Physics Slack]. In order to join the Slack&lt;br /&gt;
use the following [https://join.slack.com/t/computational-ozw2847/shared_invite/zt-vegija8y-cx_vbF2BI6FJewx4W6coSA invitation link].&lt;br /&gt;
&lt;br /&gt;
== Computer Requirements ==&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;No previous experience in programming is required.&#039;&#039;&#039; &amp;lt;br&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Programming Language: Python&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
For practical installation, we recommand either to use  Anaconda (See [[Memento Python]]) or use google colab. &amp;lt;br&amp;gt;&lt;br /&gt;
The Collaboratory platform from Google is quite good way to use powerful computer without buying one: It requires no specific hardware or software, and even allows you to use GPU computing for free,  all by writting a jupyter notebook that you can then share.&lt;br /&gt;
&lt;br /&gt;
== Grading ==&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Computational Physics:&#039;&#039;&#039;&lt;br /&gt;
* Homework 1: 5 points &lt;br /&gt;
* Homework 2: 5 points&lt;br /&gt;
* Multiple Choice Questions in November: 10 points&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Data Driven Physics:&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Final exam in January: 20 points&lt;br /&gt;
&lt;br /&gt;
== Schedule ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 3, 2021 &#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1X9h3lKD0OZLTKtxb7DWPfynY42rRuE7j/view?usp=sharing Lecture 1]   Introduction to Monte Carlo&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1sIv3qOdyE-XYkjYC-dkNsR72f4BgaQ_y/view?usp=sharing Tutorial 1] Markov Matrix&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 10, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Introductory notebooks: [https://colab.research.google.com/drive/1Ovrh1JjLzMMnxtasDgR1j84CHGU6hMxA python], [https://colab.research.google.com/drive/14PWu-C171pYhV8ven-Txc4wz5Tv1DCsK numpy] and [https://colab.research.google.com/drive/1fPjwrdxQPSyfXniyAHmyOcF_gK2fqjts matplotlib]&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1gf7oRQIpvSvMScyJa5hexB9CCZvdozPs#scrollTo=lDznlLouvlFx Tutorial 2] - Markov matrices ([https://colab.research.google.com/drive/1x9iEHG_F522uFCvD_jGdvHaMETAHfO6-#scrollTo=eSu-nLZ6vm8X solutions])&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1tjqbjAi50C4qOqVRtTxEkTeTb10qpTms#scrollTo=uYpaubGkvogU Tutorial 3] - Thumb rule ([https://colab.research.google.com/drive/1aWVtz4ZGcpIarWiRVAnxrp1t0GDOqZxu#scrollTo=f7ohlMuZvqTr solutions])&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1g7HXFUBQUBF0fhy5h2jYbfIAVBTqvb7-#scrollTo=U9LFX8OFhHOG Homework 1] (deadline October 1)&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
* [https://colab.research.google.com/drive/1aMo4Ur-0_b4dGhdIfxAmCC2ci1rOda_v?usp=sharing Tutorial 2] Markov matrix [https://colab.research.google.com/drive/1Q5ajzxRGXBBorA9cQ9o8V5VUVJhUXpPS?usp=sharing problems]&lt;br /&gt;
* [https://colab.research.google.com/drive/1k60-ChM3aUWjGsiRsf2Idx9jxHHtwyAb?usp=sharing Tutorial 3] Thumb rule [https://colab.research.google.com/drive/1fdKJlp0lD4k530oRuu50_Hm_T8t3jixa?usp=sharing problems]&lt;br /&gt;
--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 17, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/15wrgivn6FSnuBUnMwjjhadmD-g1fkS7T/view?usp=sharing Lecture 2] Basic Sampling&lt;br /&gt;
&lt;br /&gt;
*  [https://drive.google.com/file/d/1ALR_QKLXdHby54xNux39NUOk4L-Ne1EW/view?usp=sharing  Lecture 3]: Errors and Precision&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 24, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1DijhG_856OAuj42WqY1UM47APmMy3A8B/view?usp=sharing Lecture 4]: Ising model and phase transitions &lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1sRUEs768Z6PKdJ3k7MixYeFGlufgjFrG Tutorial 4]: Ising model and phase transitions ([https://colab.research.google.com/drive/1KAQRog_YlAjKZ_hL1FMYurWdPBLNUocI solutions])&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
* [https://colab.research.google.com/drive/1nU4E_pFWjSFPNigzy8-LcJpef26IKY6x?usp=sharing Tutorial 4]: Ising model and phase transitions [https://colab.research.google.com/drive/1AEUX3U7hxDR_YYy8ld3knTEVR1KYa9SP?usp=sharing problems] &lt;br /&gt;
--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 1, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1PTya42ZS2kU87A-BxQFFIUDTs_k47men?usp=sharing Lecture 5]: Optimization &amp;amp; Dijkstra algorithm&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1ieT5BlfJsOehsa8r-LHGsFsn1dwYnawT Tutorial 5]: Simulated annealing ([https://colab.research.google.com/drive/1JNVl42KNASZiwTtqYo71z_vggjbGfKul solutions])&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
* [https://colab.research.google.com/drive/1p0ooWAXF9KNh-FztMHmVoA9yBzYOM8PC?usp=sharing Tutorial 5]: Simulated annealing [https://colab.research.google.com/drive/1txJGpzreHurWux7ev6sDsX8TjzpeQhZZ?usp=sharing problems]&lt;br /&gt;
--&amp;gt;&lt;br /&gt;
* Send your copy of Homework 1 to numphys.icfp  at   gmail.com  Thanks!&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1EPgj3la7vxDIqSQYNlOFz4rR0vHXAeae Homework 2] (deadline October 22)&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 8, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 6: Introduction to Bayesian inference&lt;br /&gt;
&lt;br /&gt;
* Tutorial 6: Bayesian inference and single-particle tracking. [https://drive.google.com/file/d/1q9Quq5mvJ4Avv2qWgzTocU-DVIxJIVWi/view?usp=sharing Questions]. [https://drive.google.com/file/d/1xYb4wfNBysse6Q7frTw_V9TPdUQU5lUx/view?usp=sharing Data]. [https://drive.google.com/file/d/1Ba_kRo3_XMIaDLNYZlbZEw-wGXKS-29I/view?usp=sharing Starting Notebook]. [https://colab.research.google.com/drive/1VePL9X1JT6yl8LmROeZyMyf4Epcu3yOL#scrollTo=1XQNGa_fyEkJ Google colab version]. Solutions [https://drive.google.com/file/d/1Q9IjVUeL7AA8uWk8DX9Vy9vuUQ21RYh2/view?usp=sharing]. Notebook [https://drive.google.com/file/d/1ZJmpdaTQVUttEaaI1ch-reFfZGI93454/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 15, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1eY5cuNcJqYw7df0PBkxq03tEnqzTOC-5/view?usp=sharing Lecture 7]: Importance sampling&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1iaOGxdVgk--kWUFcMDHs0zvPhsOyhB_c Tutorial 7]: Faster than the clock algorithms ([https://colab.research.google.com/drive/1bHPnJpBd5ExqKF4G5BuV_FHPE4r0_AY2#scrollTo=fQnz_gOeq40e solutions])&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
* [https://colab.research.google.com/drive/1KyT442vB4EuGKBy_Xj3j8cLtMMl4gbac?usp=sharing Tutorial 6]: Faster than the clock algorithms [https://colab.research.google.com/drive/1C-ieAwaAKwkX5MFm8aX2kNO2GNeO9CdY?usp=sharing problems]&lt;br /&gt;
--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 22, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 8: Asymptotic inference and information. Extra material: Proof of Cramer-Rao bound [https://drive.google.com/file/d/10Ph_iP6AIQ3ps9v3FwRBO9j6-qV7oKV9/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
* Tutorial 8: [https://drive.google.com/file/d/12cG4HBvzs9Oe1mbfuEYyRDmTEamW71pR/view?usp=sharing Questions]. [https://drive.google.com/file/d/1AL8sRtnqYUI8NbubfglgLazknaVIUJEo/view?usp=sharing Data ] [https://drive.google.com/file/d/1DTLzXLZUEPzoU2SsDMcAe8GaoYX8E5gH/view?usp=sharing Starting Notebook]. [https://drive.google.com/file/d/1QpMaM5ACmKUlFAyGvRnHvFVtQoEAF7-9/view?usp=sharing Bibliography] [https://drive.google.com/file/d/1p9v1PkJhwS8Ofg4RiC1nsFJAe8Mb_6WF/view?usp=sharing Solutions].  [https://drive.google.com/file/d/19erJJ4Gjw77n57VrnqaQPCxIh_-NScYT/view?usp=sharing Notebook].&lt;br /&gt;
&lt;br /&gt;
* Send your copy of Homework 2 to numphys.icfp  at   gmail.com  Thanks!&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 29, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 9: High-dimensional inference and Principal Component Analysis. Extra material: Handwritten notes on the derivation of Marcenko-Pastur spectral density [https://drive.google.com/file/d/10Yytv9itdWDDHTsM2lQHwQDMbcf-oVnd/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
* Tutorial 9: [https://drive.google.com/file/d/10y7m1mPf5R5zZN6661Eei92IUNhBL_Zu/view?usp=sharing  Replay of the neuronal activity during sleep after a task].[https://drive.google.com/file/d/11fO26XB6Ri3HDVBvtdBkYxcTRLk1iv5F/view?usp=sharing Data ]. [https://drive.google.com/file/d/1-MFN2ERs_eNs4w6XnLjfzsu2F9REluSt/view?usp=sharing Initial Notebook]. [https://drive.google.com/file/d/11ev4Zwn6DPYLwhMsLyp8S0aQFVu77Ou3/view?usp=sharing Biblio]. &lt;br /&gt;
[https://drive.google.com/file/d/11E75QwrJgDKrutGj9t5NJTRkGtuRgoBI/view?usp=sharing Solutions]. [https://drive.google.com/file/d/1-39oZNNB-35zM4V2tLWtubQnZTdMLtIz/view?usp=sharing Notebook]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, November 12, 2021, 2 pm: The Quiz.&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
The MCQ is composed of 19 questions (one of them counts for two).  For each question you have 4 choices: 3 wrong and 1 correct: If you check the correct one you get a point. If you are wrong you loose 1/4 of a point.  No answer given: zero points.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
MCQ Solution (correct answers in bold):[https://drive.google.com/file/d/1WWcqxFzmCJp2ZXC02a70a1o17pGupdyZ/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, November 26, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 10: Priors, regularisation, sparsity&lt;br /&gt;
&lt;br /&gt;
* Tutorial 10:&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, December 3, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 11: Network inference&lt;br /&gt;
&lt;br /&gt;
* Tutorial 11:&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, December 10, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 12: Supervised learning and phase transitions&lt;br /&gt;
&lt;br /&gt;
* Tutorial 12:&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, December 17, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 13: Unsupervised learning and representations&lt;br /&gt;
&lt;br /&gt;
* Tutorial 13:&lt;/div&gt;</summary>
		<author><name>Alberto</name></author>
	</entry>
	<entry>
		<id>http://www.lptms.universite-paris-saclay.fr//wiki-cours/index.php?title=CoDaDri&amp;diff=1687</id>
		<title>CoDaDri</title>
		<link rel="alternate" type="text/html" href="http://www.lptms.universite-paris-saclay.fr//wiki-cours/index.php?title=CoDaDri&amp;diff=1687"/>
		<updated>2021-11-11T11:47:40Z</updated>

		<summary type="html">&lt;p&gt;Alberto: /* Schedule */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;=Breaking news:=&lt;br /&gt;
&lt;br /&gt;
* Homework 1 has been evaluated and sent to you. If you did not receive it, please contact us. &lt;br /&gt;
* Here you find the MCQ proposed last year &lt;br /&gt;
[https://colab.research.google.com/drive/1Ru_-IQ001XEJd9VAn4nvbBNI_3XA9QSK?usp=sharing The Quiz]&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;The Solution&#039;&#039;&#039; [https://colab.research.google.com/drive/1Faovrt0q5kRVtVsF9afr4iMXww_Wk53_?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
= Computational and Data Driven Physics =&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Modern physics is characterized by an increasing complexity of systems under investigation, in&lt;br /&gt;
domains as diverse as condensed matter, astrophysics, biophysics, etc. Establishing adequate&lt;br /&gt;
models to describe these systems and being able to make quantitative predictions from those models&lt;br /&gt;
is extremely challenging. The goal of the course is to provide the tools and concepts necessary to tackle those systems.&lt;br /&gt;
&lt;br /&gt;
== Course description ==&lt;br /&gt;
&lt;br /&gt;
We will first cover many algorithms used in many-body problems and complex systems, with special emphasis on Monte Carlo methods, molecular dynamics, and optimization in complex landscapes. &lt;br /&gt;
&lt;br /&gt;
Second, we will provide statistical inference and machine learning tools to harness the growing availability of experimental data to design accurate models of the underlying, complex, strongly non-homogeneous and interacting systems. &lt;br /&gt;
&lt;br /&gt;
Each theoretical lecture will be followed by a tutorial illustrating the concepts with practical applications&lt;br /&gt;
borrowed from various domains of physics. We will focus on methods and algorithms and physics, not&lt;br /&gt;
on programming and heavy numerics!  You will have to hand in 3 homeworks.&lt;br /&gt;
&lt;br /&gt;
*[https://drive.google.com/file/d/11w7KI5Pi59VWLX1mqiQ8ZyY8YQHRUeMz/view?usp=sharing Preliminary version of the book: Information, Inference, Networks: From statistical physics to big biological data]&lt;br /&gt;
&lt;br /&gt;
== The Team ==&lt;br /&gt;
&lt;br /&gt;
* [http://lptms.u-psud.fr/alberto_rosso/ Alberto Rosso] (Computational physics)&lt;br /&gt;
* [http://www.phys.ens.fr/~monasson/ Rémi Monasson] (Data-driven physics)&lt;br /&gt;
*  [http://www.lps.ens.fr/~cocco/ Simona Cocco] &amp;amp; [https://www.pct.espci.fr/~david/ David Lacoste] &amp;amp; [https://www.cpht.polytechnique.fr/?q=en/node/110 Michel Ferrero] (Tutorials)&lt;br /&gt;
&lt;br /&gt;
== Where and When ==&lt;br /&gt;
&lt;br /&gt;
* Lectures on Fridays: 14:00-16:00&lt;br /&gt;
* Tutorials on Fridays: 16:00-18:00&lt;br /&gt;
* ENS, 29 rue D&#039;Ulm, salle Borel + Djebar&lt;br /&gt;
&lt;br /&gt;
== Slack ==&lt;br /&gt;
&lt;br /&gt;
If you have questions or want to discuss topics related to the lecture, to the exercises or to the homeworks, you can use the&lt;br /&gt;
[http://computational-ozw2847.slack.com Computational and Data Driven Physics Slack]. In order to join the Slack&lt;br /&gt;
use the following [https://join.slack.com/t/computational-ozw2847/shared_invite/zt-vegija8y-cx_vbF2BI6FJewx4W6coSA invitation link].&lt;br /&gt;
&lt;br /&gt;
== Computer Requirements ==&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;No previous experience in programming is required.&#039;&#039;&#039; &amp;lt;br&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Programming Language: Python&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
For practical installation, we recommand either to use  Anaconda (See [[Memento Python]]) or use google colab. &amp;lt;br&amp;gt;&lt;br /&gt;
The Collaboratory platform from Google is quite good way to use powerful computer without buying one: It requires no specific hardware or software, and even allows you to use GPU computing for free,  all by writting a jupyter notebook that you can then share.&lt;br /&gt;
&lt;br /&gt;
== Grading ==&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Computational Physics:&#039;&#039;&#039;&lt;br /&gt;
* Homework 1: 5 points &lt;br /&gt;
* Homework 2: 5 points&lt;br /&gt;
* Multiple Choice Questions in November: 10 points&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Data Driven Physics:&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Final exam in January: 20 points&lt;br /&gt;
&lt;br /&gt;
== Schedule ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 3, 2021 &#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1X9h3lKD0OZLTKtxb7DWPfynY42rRuE7j/view?usp=sharing Lecture 1]   Introduction to Monte Carlo&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1sIv3qOdyE-XYkjYC-dkNsR72f4BgaQ_y/view?usp=sharing Tutorial 1] Markov Matrix&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 10, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Introductory notebooks: [https://colab.research.google.com/drive/1Ovrh1JjLzMMnxtasDgR1j84CHGU6hMxA python], [https://colab.research.google.com/drive/14PWu-C171pYhV8ven-Txc4wz5Tv1DCsK numpy] and [https://colab.research.google.com/drive/1fPjwrdxQPSyfXniyAHmyOcF_gK2fqjts matplotlib]&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1gf7oRQIpvSvMScyJa5hexB9CCZvdozPs#scrollTo=lDznlLouvlFx Tutorial 2] - Markov matrices ([https://colab.research.google.com/drive/1x9iEHG_F522uFCvD_jGdvHaMETAHfO6-#scrollTo=eSu-nLZ6vm8X solutions])&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1tjqbjAi50C4qOqVRtTxEkTeTb10qpTms#scrollTo=uYpaubGkvogU Tutorial 3] - Thumb rule ([https://colab.research.google.com/drive/1aWVtz4ZGcpIarWiRVAnxrp1t0GDOqZxu#scrollTo=f7ohlMuZvqTr solutions])&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1g7HXFUBQUBF0fhy5h2jYbfIAVBTqvb7-#scrollTo=U9LFX8OFhHOG Homework 1] (deadline October 1)&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
* [https://colab.research.google.com/drive/1aMo4Ur-0_b4dGhdIfxAmCC2ci1rOda_v?usp=sharing Tutorial 2] Markov matrix [https://colab.research.google.com/drive/1Q5ajzxRGXBBorA9cQ9o8V5VUVJhUXpPS?usp=sharing problems]&lt;br /&gt;
* [https://colab.research.google.com/drive/1k60-ChM3aUWjGsiRsf2Idx9jxHHtwyAb?usp=sharing Tutorial 3] Thumb rule [https://colab.research.google.com/drive/1fdKJlp0lD4k530oRuu50_Hm_T8t3jixa?usp=sharing problems]&lt;br /&gt;
--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 17, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/15wrgivn6FSnuBUnMwjjhadmD-g1fkS7T/view?usp=sharing Lecture 2] Basic Sampling&lt;br /&gt;
&lt;br /&gt;
*  [https://drive.google.com/file/d/1ALR_QKLXdHby54xNux39NUOk4L-Ne1EW/view?usp=sharing  Lecture 3]: Errors and Precision&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 24, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1DijhG_856OAuj42WqY1UM47APmMy3A8B/view?usp=sharing Lecture 4]: Ising model and phase transitions &lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1sRUEs768Z6PKdJ3k7MixYeFGlufgjFrG Tutorial 4]: Ising model and phase transitions ([https://colab.research.google.com/drive/1KAQRog_YlAjKZ_hL1FMYurWdPBLNUocI solutions])&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
* [https://colab.research.google.com/drive/1nU4E_pFWjSFPNigzy8-LcJpef26IKY6x?usp=sharing Tutorial 4]: Ising model and phase transitions [https://colab.research.google.com/drive/1AEUX3U7hxDR_YYy8ld3knTEVR1KYa9SP?usp=sharing problems] &lt;br /&gt;
--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 1, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1PTya42ZS2kU87A-BxQFFIUDTs_k47men?usp=sharing Lecture 5]: Optimization &amp;amp; Dijkstra algorithm&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1ieT5BlfJsOehsa8r-LHGsFsn1dwYnawT Tutorial 5]: Simulated annealing ([https://colab.research.google.com/drive/1JNVl42KNASZiwTtqYo71z_vggjbGfKul solutions])&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
* [https://colab.research.google.com/drive/1p0ooWAXF9KNh-FztMHmVoA9yBzYOM8PC?usp=sharing Tutorial 5]: Simulated annealing [https://colab.research.google.com/drive/1txJGpzreHurWux7ev6sDsX8TjzpeQhZZ?usp=sharing problems]&lt;br /&gt;
--&amp;gt;&lt;br /&gt;
* Send your copy of Homework 1 to numphys.icfp  at   gmail.com  Thanks!&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1EPgj3la7vxDIqSQYNlOFz4rR0vHXAeae Homework 2] (deadline October 22)&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 8, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 6: Introduction to Bayesian inference&lt;br /&gt;
&lt;br /&gt;
* Tutorial 6: Bayesian inference and single-particle tracking. [https://drive.google.com/file/d/1q9Quq5mvJ4Avv2qWgzTocU-DVIxJIVWi/view?usp=sharing Questions]. [https://drive.google.com/file/d/1xYb4wfNBysse6Q7frTw_V9TPdUQU5lUx/view?usp=sharing Data]. [https://drive.google.com/file/d/1Ba_kRo3_XMIaDLNYZlbZEw-wGXKS-29I/view?usp=sharing Starting Notebook]. [https://colab.research.google.com/drive/1VePL9X1JT6yl8LmROeZyMyf4Epcu3yOL#scrollTo=1XQNGa_fyEkJ Google colab version]. Solutions [https://drive.google.com/file/d/1Q9IjVUeL7AA8uWk8DX9Vy9vuUQ21RYh2/view?usp=sharing]. Notebook [https://drive.google.com/file/d/1ZJmpdaTQVUttEaaI1ch-reFfZGI93454/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 15, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1eY5cuNcJqYw7df0PBkxq03tEnqzTOC-5/view?usp=sharing Lecture 7]: Importance sampling&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1iaOGxdVgk--kWUFcMDHs0zvPhsOyhB_c Tutorial 7]: Faster than the clock algorithms ([https://colab.research.google.com/drive/1bHPnJpBd5ExqKF4G5BuV_FHPE4r0_AY2#scrollTo=fQnz_gOeq40e solutions])&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
* [https://colab.research.google.com/drive/1KyT442vB4EuGKBy_Xj3j8cLtMMl4gbac?usp=sharing Tutorial 6]: Faster than the clock algorithms [https://colab.research.google.com/drive/1C-ieAwaAKwkX5MFm8aX2kNO2GNeO9CdY?usp=sharing problems]&lt;br /&gt;
--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 22, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 8: Asymptotic inference and information. Extra material: Proof of Cramer-Rao bound [https://drive.google.com/file/d/10Ph_iP6AIQ3ps9v3FwRBO9j6-qV7oKV9/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
* Tutorial 8: [https://drive.google.com/file/d/12cG4HBvzs9Oe1mbfuEYyRDmTEamW71pR/view?usp=sharing Questions]. [https://drive.google.com/file/d/1AL8sRtnqYUI8NbubfglgLazknaVIUJEo/view?usp=sharing Data ] [https://drive.google.com/file/d/1DTLzXLZUEPzoU2SsDMcAe8GaoYX8E5gH/view?usp=sharing Starting Notebook]. [https://drive.google.com/file/d/1QpMaM5ACmKUlFAyGvRnHvFVtQoEAF7-9/view?usp=sharing Bibliography] [https://drive.google.com/file/d/1p9v1PkJhwS8Ofg4RiC1nsFJAe8Mb_6WF/view?usp=sharing Solutions].  [https://drive.google.com/file/d/19erJJ4Gjw77n57VrnqaQPCxIh_-NScYT/view?usp=sharing Notebook].&lt;br /&gt;
&lt;br /&gt;
* Send your copy of Homework 2 to numphys.icfp  at   gmail.com  Thanks!&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 29, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 9: High-dimensional inference and Principal Component Analysis. Extra material: Handwritten notes on the derivation of Marcenko-Pastur spectral density [https://drive.google.com/file/d/10Yytv9itdWDDHTsM2lQHwQDMbcf-oVnd/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
* Tutorial 9: [https://drive.google.com/file/d/10y7m1mPf5R5zZN6661Eei92IUNhBL_Zu/view?usp=sharing  Replay of the neuronal activity during sleep after a task].[https://drive.google.com/file/d/11fO26XB6Ri3HDVBvtdBkYxcTRLk1iv5F/view?usp=sharing Data ]. [https://drive.google.com/file/d/1-MFN2ERs_eNs4w6XnLjfzsu2F9REluSt/view?usp=sharing Initial Notebook]. [https://drive.google.com/file/d/11ev4Zwn6DPYLwhMsLyp8S0aQFVu77Ou3/view?usp=sharing Biblio]. &lt;br /&gt;
[https://drive.google.com/file/d/11E75QwrJgDKrutGj9t5NJTRkGtuRgoBI/view?usp=sharing Solutions]. [https://drive.google.com/file/d/1-39oZNNB-35zM4V2tLWtubQnZTdMLtIz/view?usp=sharing Notebook]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, November 12, 2021, 2 pm: The Quiz.&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
The MCQ is composed of 19 questions (one of them counts for two).  For each question you have 4 choices: 3 wrong and 1 correct: If you check the correct one you get a point. If you are wrong you loose 1/4 of a point.  No answer given: zero points.&lt;br /&gt;
&lt;br /&gt;
The Zoom link [https://cnrs.zoom.us/j/94246568891?pwd=eHBxZDU2YmwxWm4vQTl3aFZzMjJ3QT09 CoDaDri MCQ]. We will be there starting from 13h30, we will discuss the rules and we will be there to help you if you face a problem. The exam starts at 14h00: &lt;br /&gt;
* you download your Notebook of questions from the Google Drive directory that brings your name.&lt;br /&gt;
* Name the file with your answers as familyname_name.txt.&lt;br /&gt;
* The answers should be presented in the following format:&lt;br /&gt;
&lt;br /&gt;
1 A&lt;br /&gt;
&lt;br /&gt;
2 B&lt;br /&gt;
&lt;br /&gt;
4 C&lt;br /&gt;
&lt;br /&gt;
If you do not want to answer a question - as question 3 here -  do not add the corresponding number&lt;br /&gt;
* Send the file with your answers at numphys.icfp@gmail.com before 4 pm. &lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Rules&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* You are allowed to use all material you think useful.&lt;br /&gt;
&lt;br /&gt;
* You are not allowed to communicate with other people. Questions will be randomised to make hard life of cheaters, but please do not be one of them! &lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;GOOD LUCK!&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, November 26, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 10: Priors, regularisation, sparsity&lt;br /&gt;
&lt;br /&gt;
* Tutorial 10:&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, December 3, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 11: Network inference&lt;br /&gt;
&lt;br /&gt;
* Tutorial 11:&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, December 10, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 12: Supervised learning and phase transitions&lt;br /&gt;
&lt;br /&gt;
* Tutorial 12:&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, December 17, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 13: Unsupervised learning and representations&lt;br /&gt;
&lt;br /&gt;
* Tutorial 13:&lt;/div&gt;</summary>
		<author><name>Alberto</name></author>
	</entry>
	<entry>
		<id>http://www.lptms.universite-paris-saclay.fr//wiki-cours/index.php?title=CoDaDri&amp;diff=1686</id>
		<title>CoDaDri</title>
		<link rel="alternate" type="text/html" href="http://www.lptms.universite-paris-saclay.fr//wiki-cours/index.php?title=CoDaDri&amp;diff=1686"/>
		<updated>2021-11-11T11:46:18Z</updated>

		<summary type="html">&lt;p&gt;Alberto: /* Schedule */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;=Breaking news:=&lt;br /&gt;
&lt;br /&gt;
* Homework 1 has been evaluated and sent to you. If you did not receive it, please contact us. &lt;br /&gt;
* Here you find the MCQ proposed last year &lt;br /&gt;
[https://colab.research.google.com/drive/1Ru_-IQ001XEJd9VAn4nvbBNI_3XA9QSK?usp=sharing The Quiz]&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;The Solution&#039;&#039;&#039; [https://colab.research.google.com/drive/1Faovrt0q5kRVtVsF9afr4iMXww_Wk53_?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
= Computational and Data Driven Physics =&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Modern physics is characterized by an increasing complexity of systems under investigation, in&lt;br /&gt;
domains as diverse as condensed matter, astrophysics, biophysics, etc. Establishing adequate&lt;br /&gt;
models to describe these systems and being able to make quantitative predictions from those models&lt;br /&gt;
is extremely challenging. The goal of the course is to provide the tools and concepts necessary to tackle those systems.&lt;br /&gt;
&lt;br /&gt;
== Course description ==&lt;br /&gt;
&lt;br /&gt;
We will first cover many algorithms used in many-body problems and complex systems, with special emphasis on Monte Carlo methods, molecular dynamics, and optimization in complex landscapes. &lt;br /&gt;
&lt;br /&gt;
Second, we will provide statistical inference and machine learning tools to harness the growing availability of experimental data to design accurate models of the underlying, complex, strongly non-homogeneous and interacting systems. &lt;br /&gt;
&lt;br /&gt;
Each theoretical lecture will be followed by a tutorial illustrating the concepts with practical applications&lt;br /&gt;
borrowed from various domains of physics. We will focus on methods and algorithms and physics, not&lt;br /&gt;
on programming and heavy numerics!  You will have to hand in 3 homeworks.&lt;br /&gt;
&lt;br /&gt;
*[https://drive.google.com/file/d/11w7KI5Pi59VWLX1mqiQ8ZyY8YQHRUeMz/view?usp=sharing Preliminary version of the book: Information, Inference, Networks: From statistical physics to big biological data]&lt;br /&gt;
&lt;br /&gt;
== The Team ==&lt;br /&gt;
&lt;br /&gt;
* [http://lptms.u-psud.fr/alberto_rosso/ Alberto Rosso] (Computational physics)&lt;br /&gt;
* [http://www.phys.ens.fr/~monasson/ Rémi Monasson] (Data-driven physics)&lt;br /&gt;
*  [http://www.lps.ens.fr/~cocco/ Simona Cocco] &amp;amp; [https://www.pct.espci.fr/~david/ David Lacoste] &amp;amp; [https://www.cpht.polytechnique.fr/?q=en/node/110 Michel Ferrero] (Tutorials)&lt;br /&gt;
&lt;br /&gt;
== Where and When ==&lt;br /&gt;
&lt;br /&gt;
* Lectures on Fridays: 14:00-16:00&lt;br /&gt;
* Tutorials on Fridays: 16:00-18:00&lt;br /&gt;
* ENS, 29 rue D&#039;Ulm, salle Borel + Djebar&lt;br /&gt;
&lt;br /&gt;
== Slack ==&lt;br /&gt;
&lt;br /&gt;
If you have questions or want to discuss topics related to the lecture, to the exercises or to the homeworks, you can use the&lt;br /&gt;
[http://computational-ozw2847.slack.com Computational and Data Driven Physics Slack]. In order to join the Slack&lt;br /&gt;
use the following [https://join.slack.com/t/computational-ozw2847/shared_invite/zt-vegija8y-cx_vbF2BI6FJewx4W6coSA invitation link].&lt;br /&gt;
&lt;br /&gt;
== Computer Requirements ==&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;No previous experience in programming is required.&#039;&#039;&#039; &amp;lt;br&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Programming Language: Python&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
For practical installation, we recommand either to use  Anaconda (See [[Memento Python]]) or use google colab. &amp;lt;br&amp;gt;&lt;br /&gt;
The Collaboratory platform from Google is quite good way to use powerful computer without buying one: It requires no specific hardware or software, and even allows you to use GPU computing for free,  all by writting a jupyter notebook that you can then share.&lt;br /&gt;
&lt;br /&gt;
== Grading ==&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Computational Physics:&#039;&#039;&#039;&lt;br /&gt;
* Homework 1: 5 points &lt;br /&gt;
* Homework 2: 5 points&lt;br /&gt;
* Multiple Choice Questions in November: 10 points&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Data Driven Physics:&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Final exam in January: 20 points&lt;br /&gt;
&lt;br /&gt;
== Schedule ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 3, 2021 &#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1X9h3lKD0OZLTKtxb7DWPfynY42rRuE7j/view?usp=sharing Lecture 1]   Introduction to Monte Carlo&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1sIv3qOdyE-XYkjYC-dkNsR72f4BgaQ_y/view?usp=sharing Tutorial 1] Markov Matrix&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 10, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Introductory notebooks: [https://colab.research.google.com/drive/1Ovrh1JjLzMMnxtasDgR1j84CHGU6hMxA python], [https://colab.research.google.com/drive/14PWu-C171pYhV8ven-Txc4wz5Tv1DCsK numpy] and [https://colab.research.google.com/drive/1fPjwrdxQPSyfXniyAHmyOcF_gK2fqjts matplotlib]&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1gf7oRQIpvSvMScyJa5hexB9CCZvdozPs#scrollTo=lDznlLouvlFx Tutorial 2] - Markov matrices ([https://colab.research.google.com/drive/1x9iEHG_F522uFCvD_jGdvHaMETAHfO6-#scrollTo=eSu-nLZ6vm8X solutions])&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1tjqbjAi50C4qOqVRtTxEkTeTb10qpTms#scrollTo=uYpaubGkvogU Tutorial 3] - Thumb rule ([https://colab.research.google.com/drive/1aWVtz4ZGcpIarWiRVAnxrp1t0GDOqZxu#scrollTo=f7ohlMuZvqTr solutions])&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1g7HXFUBQUBF0fhy5h2jYbfIAVBTqvb7-#scrollTo=U9LFX8OFhHOG Homework 1] (deadline October 1)&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
* [https://colab.research.google.com/drive/1aMo4Ur-0_b4dGhdIfxAmCC2ci1rOda_v?usp=sharing Tutorial 2] Markov matrix [https://colab.research.google.com/drive/1Q5ajzxRGXBBorA9cQ9o8V5VUVJhUXpPS?usp=sharing problems]&lt;br /&gt;
* [https://colab.research.google.com/drive/1k60-ChM3aUWjGsiRsf2Idx9jxHHtwyAb?usp=sharing Tutorial 3] Thumb rule [https://colab.research.google.com/drive/1fdKJlp0lD4k530oRuu50_Hm_T8t3jixa?usp=sharing problems]&lt;br /&gt;
--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 17, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/15wrgivn6FSnuBUnMwjjhadmD-g1fkS7T/view?usp=sharing Lecture 2] Basic Sampling&lt;br /&gt;
&lt;br /&gt;
*  [https://drive.google.com/file/d/1ALR_QKLXdHby54xNux39NUOk4L-Ne1EW/view?usp=sharing  Lecture 3]: Errors and Precision&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 24, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1DijhG_856OAuj42WqY1UM47APmMy3A8B/view?usp=sharing Lecture 4]: Ising model and phase transitions &lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1sRUEs768Z6PKdJ3k7MixYeFGlufgjFrG Tutorial 4]: Ising model and phase transitions ([https://colab.research.google.com/drive/1KAQRog_YlAjKZ_hL1FMYurWdPBLNUocI solutions])&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
* [https://colab.research.google.com/drive/1nU4E_pFWjSFPNigzy8-LcJpef26IKY6x?usp=sharing Tutorial 4]: Ising model and phase transitions [https://colab.research.google.com/drive/1AEUX3U7hxDR_YYy8ld3knTEVR1KYa9SP?usp=sharing problems] &lt;br /&gt;
--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 1, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1PTya42ZS2kU87A-BxQFFIUDTs_k47men?usp=sharing Lecture 5]: Optimization &amp;amp; Dijkstra algorithm&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1ieT5BlfJsOehsa8r-LHGsFsn1dwYnawT Tutorial 5]: Simulated annealing ([https://colab.research.google.com/drive/1JNVl42KNASZiwTtqYo71z_vggjbGfKul solutions])&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
* [https://colab.research.google.com/drive/1p0ooWAXF9KNh-FztMHmVoA9yBzYOM8PC?usp=sharing Tutorial 5]: Simulated annealing [https://colab.research.google.com/drive/1txJGpzreHurWux7ev6sDsX8TjzpeQhZZ?usp=sharing problems]&lt;br /&gt;
--&amp;gt;&lt;br /&gt;
* Send your copy of Homework 1 to numphys.icfp  at   gmail.com  Thanks!&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1EPgj3la7vxDIqSQYNlOFz4rR0vHXAeae Homework 2] (deadline October 22)&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 8, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 6: Introduction to Bayesian inference&lt;br /&gt;
&lt;br /&gt;
* Tutorial 6: Bayesian inference and single-particle tracking. [https://drive.google.com/file/d/1q9Quq5mvJ4Avv2qWgzTocU-DVIxJIVWi/view?usp=sharing Questions]. [https://drive.google.com/file/d/1xYb4wfNBysse6Q7frTw_V9TPdUQU5lUx/view?usp=sharing Data]. [https://drive.google.com/file/d/1Ba_kRo3_XMIaDLNYZlbZEw-wGXKS-29I/view?usp=sharing Starting Notebook]. [https://colab.research.google.com/drive/1VePL9X1JT6yl8LmROeZyMyf4Epcu3yOL#scrollTo=1XQNGa_fyEkJ Google colab version]. Solutions [https://drive.google.com/file/d/1Q9IjVUeL7AA8uWk8DX9Vy9vuUQ21RYh2/view?usp=sharing]. Notebook [https://drive.google.com/file/d/1ZJmpdaTQVUttEaaI1ch-reFfZGI93454/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 15, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1eY5cuNcJqYw7df0PBkxq03tEnqzTOC-5/view?usp=sharing Lecture 7]: Importance sampling&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1iaOGxdVgk--kWUFcMDHs0zvPhsOyhB_c Tutorial 7]: Faster than the clock algorithms ([https://colab.research.google.com/drive/1bHPnJpBd5ExqKF4G5BuV_FHPE4r0_AY2#scrollTo=fQnz_gOeq40e solutions])&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
* [https://colab.research.google.com/drive/1KyT442vB4EuGKBy_Xj3j8cLtMMl4gbac?usp=sharing Tutorial 6]: Faster than the clock algorithms [https://colab.research.google.com/drive/1C-ieAwaAKwkX5MFm8aX2kNO2GNeO9CdY?usp=sharing problems]&lt;br /&gt;
--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 22, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 8: Asymptotic inference and information. Extra material: Proof of Cramer-Rao bound [https://drive.google.com/file/d/10Ph_iP6AIQ3ps9v3FwRBO9j6-qV7oKV9/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
* Tutorial 8: [https://drive.google.com/file/d/12cG4HBvzs9Oe1mbfuEYyRDmTEamW71pR/view?usp=sharing Questions]. [https://drive.google.com/file/d/1AL8sRtnqYUI8NbubfglgLazknaVIUJEo/view?usp=sharing Data ] [https://drive.google.com/file/d/1DTLzXLZUEPzoU2SsDMcAe8GaoYX8E5gH/view?usp=sharing Starting Notebook]. [https://drive.google.com/file/d/1QpMaM5ACmKUlFAyGvRnHvFVtQoEAF7-9/view?usp=sharing Bibliography] [https://drive.google.com/file/d/1p9v1PkJhwS8Ofg4RiC1nsFJAe8Mb_6WF/view?usp=sharing Solutions].  [https://drive.google.com/file/d/19erJJ4Gjw77n57VrnqaQPCxIh_-NScYT/view?usp=sharing Notebook].&lt;br /&gt;
&lt;br /&gt;
* Send your copy of Homework 2 to numphys.icfp  at   gmail.com  Thanks!&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 29, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 9: High-dimensional inference and Principal Component Analysis. Extra material: Handwritten notes on the derivation of Marcenko-Pastur spectral density [https://drive.google.com/file/d/10Yytv9itdWDDHTsM2lQHwQDMbcf-oVnd/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
* Tutorial 9: [https://drive.google.com/file/d/10y7m1mPf5R5zZN6661Eei92IUNhBL_Zu/view?usp=sharing  Replay of the neuronal activity during sleep after a task].[https://drive.google.com/file/d/11fO26XB6Ri3HDVBvtdBkYxcTRLk1iv5F/view?usp=sharing Data ]. [https://drive.google.com/file/d/1-MFN2ERs_eNs4w6XnLjfzsu2F9REluSt/view?usp=sharing Initial Notebook]. [https://drive.google.com/file/d/11ev4Zwn6DPYLwhMsLyp8S0aQFVu77Ou3/view?usp=sharing Biblio]. &lt;br /&gt;
[https://drive.google.com/file/d/11E75QwrJgDKrutGj9t5NJTRkGtuRgoBI/view?usp=sharing Solutions]. [https://drive.google.com/file/d/1-39oZNNB-35zM4V2tLWtubQnZTdMLtIz/view?usp=sharing Notebook]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, November 12, 2021, 2 pm: The Quiz.&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
The MCQ is composed of 19 questions (one of them counts for two). &lt;br /&gt;
&lt;br /&gt;
For each question you have 4 choices: 3 wrong and 1 correct: If you check the correct one you get a point. If you are wrong you loose 1/4 of a point.  No answer given: zero points.&lt;br /&gt;
&lt;br /&gt;
The Zoom link [https://cnrs.zoom.us/j/94246568891?pwd=eHBxZDU2YmwxWm4vQTl3aFZzMjJ3QT09 CoDaDri MCQ]. We will be there starting from 13h30, we will discuss the rules and we will be there to help you if you face a problem. The exam starts at 14h00: &lt;br /&gt;
* you download your Notebook of questions from the Google Drive directory that brings your name.&lt;br /&gt;
* Name the file with your answers as familyname_name.txt.&lt;br /&gt;
* The answers should be presented in the following format:&lt;br /&gt;
&lt;br /&gt;
1 A&lt;br /&gt;
&lt;br /&gt;
2 B&lt;br /&gt;
&lt;br /&gt;
4 C&lt;br /&gt;
&lt;br /&gt;
If you do not want to answer a question - as question 3 here -  do not add the corresponding number&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* Send the file with your answers at numphys.icfp@gmail.com before 4 pm. &lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Rules&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* You are allowed to use all material you think useful.&lt;br /&gt;
&lt;br /&gt;
* You are not allowed to communicate with other people. Questions will be randomised to make hard life of cheaters, but please do not be one of them! &lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;GOOD LUCK!&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, November 26, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 10: Priors, regularisation, sparsity&lt;br /&gt;
&lt;br /&gt;
* Tutorial 10:&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, December 3, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 11: Network inference&lt;br /&gt;
&lt;br /&gt;
* Tutorial 11:&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, December 10, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 12: Supervised learning and phase transitions&lt;br /&gt;
&lt;br /&gt;
* Tutorial 12:&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, December 17, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 13: Unsupervised learning and representations&lt;br /&gt;
&lt;br /&gt;
* Tutorial 13:&lt;/div&gt;</summary>
		<author><name>Alberto</name></author>
	</entry>
	<entry>
		<id>http://www.lptms.universite-paris-saclay.fr//wiki-cours/index.php?title=T-I-3draft&amp;diff=1685</id>
		<title>T-I-3draft</title>
		<link rel="alternate" type="text/html" href="http://www.lptms.universite-paris-saclay.fr//wiki-cours/index.php?title=T-I-3draft&amp;diff=1685"/>
		<updated>2021-11-10T16:38:10Z</updated>

		<summary type="html">&lt;p&gt;Alberto: /* Inversion of the Radon transform */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;=Radon transform and X-ray tomography=&lt;br /&gt;
The goal of this homework is to introduce the Radon transform of a two-dimensional function. We will show that this transform is invertible and the inverse involves the Fourier transform in two dimensions. From a practical point of view, the Radon transform is the basis of X-ray tomography (as well as X-ray scanning), applied in the medical context in order to obtain cross-section images of different organs.&lt;br /&gt;
The second part of the homework consists of a documentation work to be conducted in pairs: each pair of students should prepare a blackboard presentation of approximately five minutes on this part.&lt;br /&gt;
&lt;br /&gt;
== Radon transform ==&lt;br /&gt;
=== Preliminaries: parametrisation of a line in the plane ===&lt;br /&gt;
[[File:Line_parametrisation.png |thumb|right| &#039;&#039;&#039;Figure 1:&#039;&#039;&#039; Parametrisation &amp;lt;math&amp;gt;(t,\Phi)&amp;lt;/math&amp;gt; of a line in the plane.]]&lt;br /&gt;
&#039;&#039;&#039;Q1:&#039;&#039;&#039; In a two-dimensional space, how many parameters are needed in order to define a line? Provide some examples of equations that define a unique line in the plane.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Q2:&#039;&#039;&#039; In the context of Radon transform, we choose to define a line via the parameters &amp;lt;math&amp;gt;t&amp;lt;/math&amp;gt; and &amp;lt;math&amp;gt;\Phi&amp;lt;/math&amp;gt;, where &amp;lt;math&amp;gt;(t,\Phi)\in \mathbb{R}\times [0;2\pi[&amp;lt;/math&amp;gt;, as displayed in Figure 1. Each angle &amp;lt;math&amp;gt;\Phi&amp;lt;/math&amp;gt; is associated to a unique unit vector &amp;lt;math&amp;gt;\mathbf{u_t}&amp;lt;/math&amp;gt;:&lt;br /&gt;
&amp;lt;center&amp;gt;&amp;lt;math&amp;gt;\mathbf{u_t} = \cos(\Phi) \mathbf{u_x}+ \sin(\Phi)\mathbf{u_y}.&amp;lt;/math&amp;gt;&amp;lt;/center&amp;gt;&lt;br /&gt;
Show that for each given line there exist two possible pairs of values &amp;lt;math&amp;gt;(t,\Phi)&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Q3:&#039;&#039;&#039; We choose to &#039;&#039;orient&#039;&#039;  the line positively along the unit vector &amp;lt;math&amp;gt;\mathbf{u_{\Phi}}&amp;lt;/math&amp;gt;, defined by:&lt;br /&gt;
&amp;lt;center&amp;gt;&amp;lt;math&amp;gt; \mathbf{u_{\Phi}} = -\sin(\Phi)\mathbf{u_x} + \cos(\Phi)\mathbf{u_y}.&amp;lt;/math&amp;gt;&amp;lt;/center&amp;gt;&lt;br /&gt;
Show that for each pair &amp;lt;math&amp;gt;(t,\Phi)&amp;lt;/math&amp;gt; there exists one unique &#039;&#039;oriented&#039;&#039; line.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Q4:&#039;&#039;&#039; A natural pair of coordinates, associated to the family of lines obtained from a given &amp;lt;math&amp;gt;\Phi&amp;lt;/math&amp;gt;, is the pair &amp;lt;math&amp;gt;(t,s)\in \mathbb{R}^2&amp;lt;/math&amp;gt; of coordinates of a point in the basis &amp;lt;math&amp;gt;(\mathbf{u_t},\mathbf{u_\Phi})&amp;lt;/math&amp;gt; related to the line that passes through that point. Provide the expression for &amp;lt;math&amp;gt;(x,y)&amp;lt;/math&amp;gt; as a function of &amp;lt;math&amp;gt;(t,s)&amp;lt;/math&amp;gt;, as well as the expression for &amp;lt;math&amp;gt;(t,s)&amp;lt;/math&amp;gt; as a function of &amp;lt;math&amp;gt;(x,y)&amp;lt;/math&amp;gt;. Deduce the relation between the surface elements &amp;lt;math&amp;gt;\textrm{d}x \,\textrm{d}y&amp;lt;/math&amp;gt; and &amp;lt;math&amp;gt;\textrm{d}s \,\textrm{d}t&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
=== Definition of Radon transform ===&lt;br /&gt;
&#039;&#039;&#039; Definition: &#039;&#039;&#039; The Radon transform of a function &amp;lt;math&amp;gt; f : \mathbb{R}^2\rightarrow \mathbb{R}&amp;lt;/math&amp;gt; is the function &amp;lt;math&amp;gt;\hat f : \mathbb{R}^2\rightarrow \mathbb{R}&amp;lt;/math&amp;gt; defined by the following expression&lt;br /&gt;
&lt;br /&gt;
&amp;lt;center&amp;gt;&amp;lt;math&amp;gt;&lt;br /&gt;
 \hat f(t,\mathbf{u_t})=\int_{-\infty}^{+\infty}f(t\mathbf{u_t}+s\mathbf{u_\Phi})\,\mathrm{d}s.&lt;br /&gt;
&amp;lt;/math&amp;gt;&amp;lt;/center&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039; Use of the &amp;lt;math&amp;gt;\delta-&amp;lt;/math&amp;gt;distribution: &#039;&#039;&#039; The definition of Radon transform can be elegantly written by means of the Dirac-delta distribution. This formulation provides the advantage of generalising the definition of Radon transform to arbitrary dimension.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Q5:&#039;&#039;&#039; Using the relation&lt;br /&gt;
&amp;lt;center&amp;gt;&amp;lt;math&amp;gt;&lt;br /&gt;
f(t\mathbf{u_t}+s\mathbf{u_\Phi})=\int_{-\infty}^{+\infty}f(t&#039; \mathbf{u_{t&#039;}}+s\mathbf{u_\Phi})\delta(t&#039;-t)\mathrm{d}t&#039;,&lt;br /&gt;
&amp;lt;/math&amp;gt;&amp;lt;/center&amp;gt;&lt;br /&gt;
propose a definition of Radon transform in the form of a surface integral.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Q6:&#039;&#039;&#039; Propose a definition of the Radon transform of a function &amp;lt;math&amp;gt;f:\mathbb{R}^n\rightarrow \mathbb{R}&amp;lt;/math&amp;gt; (&amp;lt;math&amp;gt;n\geq 2&amp;lt;/math&amp;gt;). Give a geometrical interpretation of the Radon transform in dimension &amp;lt;math&amp;gt;n=3&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
From now on, we will always consider the Radon transform in the two-dimensional case &amp;lt;math&amp;gt;n=2&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
=== Some examples ===&lt;br /&gt;
&lt;br /&gt;
==== No calculation needed ==== &lt;br /&gt;
&#039;&#039;&#039; Q7: &#039;&#039;&#039;In Figure 2, match each image with the corresponding Radon transform. Images represent functions &amp;lt;math&amp;gt;f: \mathbb{R}^2\rightarrow \mathbb{R}^+&amp;lt;/math&amp;gt;. Specify the meaning of the grey scales in the different figures. Draw the axes &amp;lt;math&amp;gt;t,\Phi&amp;lt;/math&amp;gt; on the Radon transforms, knowing that in the images in the direct space (plane &amp;lt;math&amp;gt;x,y&amp;lt;/math&amp;gt;), the origin of axes &amp;lt;math&amp;gt;x,y&amp;lt;/math&amp;gt; is located at the center of the figure.&lt;br /&gt;
&amp;lt;center&amp;gt; Some binary images...&amp;lt;/center&amp;gt;&lt;br /&gt;
[[File:binary_images.png | 800px|thumb|center]]&lt;br /&gt;
&amp;lt;center&amp;gt; ... and their Radon transform (in random order):&amp;lt;/center&amp;gt;&lt;br /&gt;
[[File:radon_transform.png | 800px| thumb|center| &#039;&#039;&#039; Figure 2:&#039;&#039;&#039; Qualitative illustration of the Radon transform.]]&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Q8:&#039;&#039;&#039; Indicate (without doing any calculation) the profile of the Radon transform of a constant function on a quasi-point-like support. Similarly, indicate (without any calculation) the profile of the Radon transform of a constant function on a line, and on a line segment.&lt;br /&gt;
&lt;br /&gt;
==== Hand calculations ====&lt;br /&gt;
&#039;&#039;&#039;Q9:&#039;&#039;&#039; Compute the Radon transform of a function that is constant on a disc of radius &amp;lt;math&amp;gt;R&amp;lt;/math&amp;gt;, and null outside.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Q10:&#039;&#039;&#039; Compute the Radon transform of the function &amp;lt;math&amp;gt;f(x,y)=a\,\exp\left(-\frac{x^2+y^2}{\sigma^2}\right)&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
=== Expression for radial functions ===&lt;br /&gt;
&#039;&#039;&#039;Q11:&#039;&#039;&#039; Show that in the case of radial function &amp;lt;math&amp;gt;f(x,y)=F(r)=F(\sqrt{x^2+y^2})&amp;lt;/math&amp;gt; the Radon transform can be written as a simple integral transform of the function &amp;lt;math&amp;gt;F(r)&amp;lt;/math&amp;gt;. &lt;br /&gt;
&lt;br /&gt;
The following section addresses the principle at the basis of this inversion.&lt;br /&gt;
&lt;br /&gt;
== Inversion of the Radon transform==&lt;br /&gt;
=== Back-projection formula===&lt;br /&gt;
&#039;&#039;&#039;Q12:&#039;&#039;&#039; Explain why the following function&lt;br /&gt;
&amp;lt;center&amp;gt;&amp;lt;math&amp;gt;&lt;br /&gt;
g(\mathbf{r})=\frac{1}{2\pi}\int_0^{2\pi}\hat f (\mathbf{r}\cdot \mathbf{u_t},\mathbf{u_t})\,\mathrm{d}\Phi,&lt;br /&gt;
&amp;lt;/math&amp;gt;&amp;lt;/center&amp;gt;&lt;br /&gt;
obtained via an angular mean of the Radon transform of a function &amp;lt;math&amp;gt;f&amp;lt;/math&amp;gt;, is likely to resemble to the function &amp;lt;math&amp;gt;f&amp;lt;/math&amp;gt;. This formula is called &#039;&#039;back-projection formula&#039;&#039;.&lt;br /&gt;
&amp;lt;center&amp;gt;Some images...&amp;lt;/center&amp;gt;&lt;br /&gt;
[[File:images_radon.png | 800px| thumb|center]]&lt;br /&gt;
&amp;lt;center&amp;gt;... and the back-projection of their Radon transform.&amp;lt;/center&amp;gt;&lt;br /&gt;
[[File:back_projection.png | 800px| thumb|center| &#039;&#039;&#039; Figure 3:&#039;&#039;&#039; Illustration of the back-projection formula.]]&lt;br /&gt;
Figure 3 displays the application of the back-projection formula to the examples that we have previously considered (binary images), as well as to an example from medical imaging context. Does the back-projection formula allow to inverse the Radon transform? Explain.&lt;br /&gt;
&lt;br /&gt;
=== Projection-slice theorem === &lt;br /&gt;
&#039;&#039;&#039;Q13:&#039;&#039;&#039; Show that, for a given &amp;lt;math&amp;gt;\Phi&amp;lt;/math&amp;gt;, the one-dimensional Fourier transform of &amp;lt;math&amp;gt;\hat f (t,\mathbf{u_t})&amp;lt;/math&amp;gt; over the variable &amp;lt;math&amp;gt;t&amp;lt;/math&amp;gt; is equal to the two-dimensional transform of &amp;lt;math&amp;gt;f(\mathbf{r})&amp;lt;/math&amp;gt;:&lt;br /&gt;
&amp;lt;center&amp;gt;&amp;lt;math&amp;gt;&lt;br /&gt;
\int_{-\infty}^{+\infty}\hat f (t,\mathbf{u_t})\, e^{-ikt}\,\mathrm{d}t =\int \int f(\mathbf{r})\, e^{-i(k\mathbf{u_t})\cdot \mathbf{r}}\mathrm{d}\mathbf{r}&lt;br /&gt;
&amp;lt;/math&amp;gt;&amp;lt;/center&amp;gt;&lt;br /&gt;
or, similarly, &lt;br /&gt;
&amp;lt;center&amp;gt;&amp;lt;math&amp;gt;&lt;br /&gt;
\textrm{TF}_{1D(t)}\left(\hat f(t,\mathbf{u_t})\right)[k]=\textrm{TF}_{2D}\left( f(x,y)\right)[k\mathbf{u_t}].&lt;br /&gt;
&amp;lt;/math&amp;gt;&amp;lt;/center&amp;gt;&lt;br /&gt;
In the context of medical imaging, this relation is called &#039;&#039;projection-slice theorem&#039;&#039;. It relates the two-dimensional Fourier transform of a function to its Radon transform.&lt;br /&gt;
&lt;br /&gt;
Recall the meaning of the Fourier transform of a function of one variable and of two variables. From the projection-slice theorem, deduce an interpretation of the two-dimensional Fourier transform in terms of the one-dimensional Fourier transform.&lt;br /&gt;
&lt;br /&gt;
=== Inversion formula ===&lt;br /&gt;
&#039;&#039;&#039;Q14: (to do in class only)&#039;&#039;&#039; For brevity, we choose to denote the one-dimensional Fourier transform (notation: &amp;lt;math&amp;gt;\tilde f&amp;lt;/math&amp;gt;) of the Radon transform (notation: &amp;lt;math&amp;gt;\hat f&amp;lt;/math&amp;gt;) over the variable &amp;lt;math&amp;gt;t&amp;lt;/math&amp;gt; as follows:&lt;br /&gt;
&amp;lt;center&amp;gt;&amp;lt;math&amp;gt;&lt;br /&gt;
\widetilde{(\hat f)}\,(k,\mathbf{u_t})=\mathrm{TF}_{1D(t)}\left(\hat f (t,\mathbf{u_t})\right)[k].&lt;br /&gt;
&amp;lt;/math&amp;gt;&amp;lt;/center&amp;gt;&lt;br /&gt;
From the projection-slice theorem, show that the inversion formula of the Radon transform is:&lt;br /&gt;
&amp;lt;center&amp;gt;&amp;lt;math&amp;gt;&lt;br /&gt;
f(\mathbf{r})=\frac{1}{(2\pi)^2}\int_0^\pi\int_{-\infty}^{+\infty}|k|\widetilde{(\hat f)}\,(k,\mathbf{u_t})\,e^{+i(\mathbf{r}\cdot\mathbf{u_t})k}\,\mathrm{d}k\mathrm{d}\Phi.&lt;br /&gt;
&amp;lt;/math&amp;gt;&amp;lt;/center&amp;gt;&lt;/div&gt;</summary>
		<author><name>Alberto</name></author>
	</entry>
	<entry>
		<id>http://www.lptms.universite-paris-saclay.fr//wiki-cours/index.php?title=T-I-3draft&amp;diff=1684</id>
		<title>T-I-3draft</title>
		<link rel="alternate" type="text/html" href="http://www.lptms.universite-paris-saclay.fr//wiki-cours/index.php?title=T-I-3draft&amp;diff=1684"/>
		<updated>2021-11-10T16:35:59Z</updated>

		<summary type="html">&lt;p&gt;Alberto: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;=Radon transform and X-ray tomography=&lt;br /&gt;
The goal of this homework is to introduce the Radon transform of a two-dimensional function. We will show that this transform is invertible and the inverse involves the Fourier transform in two dimensions. From a practical point of view, the Radon transform is the basis of X-ray tomography (as well as X-ray scanning), applied in the medical context in order to obtain cross-section images of different organs.&lt;br /&gt;
The second part of the homework consists of a documentation work to be conducted in pairs: each pair of students should prepare a blackboard presentation of approximately five minutes on this part.&lt;br /&gt;
&lt;br /&gt;
== Radon transform ==&lt;br /&gt;
=== Preliminaries: parametrisation of a line in the plane ===&lt;br /&gt;
[[File:Line_parametrisation.png |thumb|right| &#039;&#039;&#039;Figure 1:&#039;&#039;&#039; Parametrisation &amp;lt;math&amp;gt;(t,\Phi)&amp;lt;/math&amp;gt; of a line in the plane.]]&lt;br /&gt;
&#039;&#039;&#039;Q1:&#039;&#039;&#039; In a two-dimensional space, how many parameters are needed in order to define a line? Provide some examples of equations that define a unique line in the plane.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Q2:&#039;&#039;&#039; In the context of Radon transform, we choose to define a line via the parameters &amp;lt;math&amp;gt;t&amp;lt;/math&amp;gt; and &amp;lt;math&amp;gt;\Phi&amp;lt;/math&amp;gt;, where &amp;lt;math&amp;gt;(t,\Phi)\in \mathbb{R}\times [0;2\pi[&amp;lt;/math&amp;gt;, as displayed in Figure 1. Each angle &amp;lt;math&amp;gt;\Phi&amp;lt;/math&amp;gt; is associated to a unique unit vector &amp;lt;math&amp;gt;\mathbf{u_t}&amp;lt;/math&amp;gt;:&lt;br /&gt;
&amp;lt;center&amp;gt;&amp;lt;math&amp;gt;\mathbf{u_t} = \cos(\Phi) \mathbf{u_x}+ \sin(\Phi)\mathbf{u_y}.&amp;lt;/math&amp;gt;&amp;lt;/center&amp;gt;&lt;br /&gt;
Show that for each given line there exist two possible pairs of values &amp;lt;math&amp;gt;(t,\Phi)&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Q3:&#039;&#039;&#039; We choose to &#039;&#039;orient&#039;&#039;  the line positively along the unit vector &amp;lt;math&amp;gt;\mathbf{u_{\Phi}}&amp;lt;/math&amp;gt;, defined by:&lt;br /&gt;
&amp;lt;center&amp;gt;&amp;lt;math&amp;gt; \mathbf{u_{\Phi}} = -\sin(\Phi)\mathbf{u_x} + \cos(\Phi)\mathbf{u_y}.&amp;lt;/math&amp;gt;&amp;lt;/center&amp;gt;&lt;br /&gt;
Show that for each pair &amp;lt;math&amp;gt;(t,\Phi)&amp;lt;/math&amp;gt; there exists one unique &#039;&#039;oriented&#039;&#039; line.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Q4:&#039;&#039;&#039; A natural pair of coordinates, associated to the family of lines obtained from a given &amp;lt;math&amp;gt;\Phi&amp;lt;/math&amp;gt;, is the pair &amp;lt;math&amp;gt;(t,s)\in \mathbb{R}^2&amp;lt;/math&amp;gt; of coordinates of a point in the basis &amp;lt;math&amp;gt;(\mathbf{u_t},\mathbf{u_\Phi})&amp;lt;/math&amp;gt; related to the line that passes through that point. Provide the expression for &amp;lt;math&amp;gt;(x,y)&amp;lt;/math&amp;gt; as a function of &amp;lt;math&amp;gt;(t,s)&amp;lt;/math&amp;gt;, as well as the expression for &amp;lt;math&amp;gt;(t,s)&amp;lt;/math&amp;gt; as a function of &amp;lt;math&amp;gt;(x,y)&amp;lt;/math&amp;gt;. Deduce the relation between the surface elements &amp;lt;math&amp;gt;\textrm{d}x \,\textrm{d}y&amp;lt;/math&amp;gt; and &amp;lt;math&amp;gt;\textrm{d}s \,\textrm{d}t&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
=== Definition of Radon transform ===&lt;br /&gt;
&#039;&#039;&#039; Definition: &#039;&#039;&#039; The Radon transform of a function &amp;lt;math&amp;gt; f : \mathbb{R}^2\rightarrow \mathbb{R}&amp;lt;/math&amp;gt; is the function &amp;lt;math&amp;gt;\hat f : \mathbb{R}^2\rightarrow \mathbb{R}&amp;lt;/math&amp;gt; defined by the following expression&lt;br /&gt;
&lt;br /&gt;
&amp;lt;center&amp;gt;&amp;lt;math&amp;gt;&lt;br /&gt;
 \hat f(t,\mathbf{u_t})=\int_{-\infty}^{+\infty}f(t\mathbf{u_t}+s\mathbf{u_\Phi})\,\mathrm{d}s.&lt;br /&gt;
&amp;lt;/math&amp;gt;&amp;lt;/center&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039; Use of the &amp;lt;math&amp;gt;\delta-&amp;lt;/math&amp;gt;distribution: &#039;&#039;&#039; The definition of Radon transform can be elegantly written by means of the Dirac-delta distribution. This formulation provides the advantage of generalising the definition of Radon transform to arbitrary dimension.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Q5:&#039;&#039;&#039; Using the relation&lt;br /&gt;
&amp;lt;center&amp;gt;&amp;lt;math&amp;gt;&lt;br /&gt;
f(t\mathbf{u_t}+s\mathbf{u_\Phi})=\int_{-\infty}^{+\infty}f(t&#039; \mathbf{u_{t&#039;}}+s\mathbf{u_\Phi})\delta(t&#039;-t)\mathrm{d}t&#039;,&lt;br /&gt;
&amp;lt;/math&amp;gt;&amp;lt;/center&amp;gt;&lt;br /&gt;
propose a definition of Radon transform in the form of a surface integral.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Q6:&#039;&#039;&#039; Propose a definition of the Radon transform of a function &amp;lt;math&amp;gt;f:\mathbb{R}^n\rightarrow \mathbb{R}&amp;lt;/math&amp;gt; (&amp;lt;math&amp;gt;n\geq 2&amp;lt;/math&amp;gt;). Give a geometrical interpretation of the Radon transform in dimension &amp;lt;math&amp;gt;n=3&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
From now on, we will always consider the Radon transform in the two-dimensional case &amp;lt;math&amp;gt;n=2&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
=== Some examples ===&lt;br /&gt;
&lt;br /&gt;
==== No calculation needed ==== &lt;br /&gt;
&#039;&#039;&#039; Q7: &#039;&#039;&#039;In Figure 2, match each image with the corresponding Radon transform. Images represent functions &amp;lt;math&amp;gt;f: \mathbb{R}^2\rightarrow \mathbb{R}^+&amp;lt;/math&amp;gt;. Specify the meaning of the grey scales in the different figures. Draw the axes &amp;lt;math&amp;gt;t,\Phi&amp;lt;/math&amp;gt; on the Radon transforms, knowing that in the images in the direct space (plane &amp;lt;math&amp;gt;x,y&amp;lt;/math&amp;gt;), the origin of axes &amp;lt;math&amp;gt;x,y&amp;lt;/math&amp;gt; is located at the center of the figure.&lt;br /&gt;
&amp;lt;center&amp;gt; Some binary images...&amp;lt;/center&amp;gt;&lt;br /&gt;
[[File:binary_images.png | 800px|thumb|center]]&lt;br /&gt;
&amp;lt;center&amp;gt; ... and their Radon transform (in random order):&amp;lt;/center&amp;gt;&lt;br /&gt;
[[File:radon_transform.png | 800px| thumb|center| &#039;&#039;&#039; Figure 2:&#039;&#039;&#039; Qualitative illustration of the Radon transform.]]&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Q8:&#039;&#039;&#039; Indicate (without doing any calculation) the profile of the Radon transform of a constant function on a quasi-point-like support. Similarly, indicate (without any calculation) the profile of the Radon transform of a constant function on a line, and on a line segment.&lt;br /&gt;
&lt;br /&gt;
==== Hand calculations ====&lt;br /&gt;
&#039;&#039;&#039;Q9:&#039;&#039;&#039; Compute the Radon transform of a function that is constant on a disc of radius &amp;lt;math&amp;gt;R&amp;lt;/math&amp;gt;, and null outside.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Q10:&#039;&#039;&#039; Compute the Radon transform of the function &amp;lt;math&amp;gt;f(x,y)=a\,\exp\left(-\frac{x^2+y^2}{\sigma^2}\right)&amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
=== Expression for radial functions ===&lt;br /&gt;
&#039;&#039;&#039;Q11:&#039;&#039;&#039; Show that in the case of radial function &amp;lt;math&amp;gt;f(x,y)=F(r)=F(\sqrt{x^2+y^2})&amp;lt;/math&amp;gt; the Radon transform can be written as a simple integral transform of the function &amp;lt;math&amp;gt;F(r)&amp;lt;/math&amp;gt;. &lt;br /&gt;
&lt;br /&gt;
The following section addresses the principle at the basis of this inversion.&lt;br /&gt;
&lt;br /&gt;
== Inversion of the Radon transform==&lt;br /&gt;
=== Back-projection formula===&lt;br /&gt;
&#039;&#039;&#039;Q12:&#039;&#039;&#039; Explain why the following function&lt;br /&gt;
&amp;lt;center&amp;gt;&amp;lt;math&amp;gt;&lt;br /&gt;
g(\mathbf{r})=\frac{1}{2\pi}\int_0^{2\pi}\hat f (\mathbf{r}\cdot \mathbf{u_t},\mathbf{u_t})\,\mathrm{d}\Phi,&lt;br /&gt;
&amp;lt;/math&amp;gt;&amp;lt;/center&amp;gt;&lt;br /&gt;
obtained via an angular mean of the Radon transform of a function &amp;lt;math&amp;gt;f&amp;lt;/math&amp;gt;, is likely to resemble to the function &amp;lt;math&amp;gt;f&amp;lt;/math&amp;gt;. This formula is called &#039;&#039;back-projection formula&#039;&#039;.&lt;br /&gt;
&amp;lt;center&amp;gt;Some images...&amp;lt;/center&amp;gt;&lt;br /&gt;
[[File:images_radon.png | 800px| thumb|center]]&lt;br /&gt;
&amp;lt;center&amp;gt;... and the back-projection of their Radon transform.&amp;lt;/center&amp;gt;&lt;br /&gt;
[[File:back_projection.png | 800px| thumb|center| &#039;&#039;&#039; Figure 3:&#039;&#039;&#039; Illustration of the back-projection formula.]]&lt;br /&gt;
Figure 3 displays the application of the back-projection formula to the examples that we have previously considered (binary images), as well as to an example from medical imaging context. Does the back-projection formula allow to inverse the Radon transform? Explain.&lt;br /&gt;
&lt;br /&gt;
=== Projection-slice theorem === &lt;br /&gt;
Show that, for a given &amp;lt;math&amp;gt;\Phi&amp;lt;/math&amp;gt;, the one-dimensional Fourier transform of &amp;lt;math&amp;gt;\hat f (t,\mathbf{u_t})&amp;lt;/math&amp;gt; over the variable &amp;lt;math&amp;gt;t&amp;lt;/math&amp;gt; is equal to the two-dimensional transform of &amp;lt;math&amp;gt;f(\mathbf{r})&amp;lt;/math&amp;gt;:&lt;br /&gt;
&amp;lt;center&amp;gt;&amp;lt;math&amp;gt;&lt;br /&gt;
\int_{-\infty}^{+\infty}\hat f (t,\mathbf{u_t})\, e^{-ikt}\,\mathrm{d}t =\int \int f(\mathbf{r})\, e^{-i(k\mathbf{u_t})\cdot \mathbf{r}}\mathrm{d}\mathbf{r}&lt;br /&gt;
&amp;lt;/math&amp;gt;&amp;lt;/center&amp;gt;&lt;br /&gt;
or, similarly, &lt;br /&gt;
&amp;lt;center&amp;gt;&amp;lt;math&amp;gt;&lt;br /&gt;
\textrm{TF}_{1D(t)}\left(\hat f(t,\mathbf{u_t})\right)[k]=\textrm{TF}_{2D}\left( f(x,y)\right)[k\mathbf{u_t}].&lt;br /&gt;
&amp;lt;/math&amp;gt;&amp;lt;/center&amp;gt;&lt;br /&gt;
In the context of medical imaging, this relation is called &#039;&#039;projection-slice theorem&#039;&#039;. It relates the two-dimensional Fourier transform of a function to its Radon transform.&lt;br /&gt;
&lt;br /&gt;
Recall the meaning of the Fourier transform of a function of one variable and of two variables. From the projection-slice theorem, deduce an interpretation of the two-dimensional Fourier transform in terms of the one-dimensional Fourier transform.&lt;br /&gt;
&lt;br /&gt;
=== Inversion formula ===&lt;br /&gt;
For brevity, we choose to denote the one-dimensional Fourier transform (notation: &amp;lt;math&amp;gt;\tilde f&amp;lt;/math&amp;gt;) of the Radon transform (notation: &amp;lt;math&amp;gt;\hat f&amp;lt;/math&amp;gt;) over the variable &amp;lt;math&amp;gt;t&amp;lt;/math&amp;gt; as follows:&lt;br /&gt;
&amp;lt;center&amp;gt;&amp;lt;math&amp;gt;&lt;br /&gt;
\widetilde{(\hat f)}\,(k,\mathbf{u_t})=\mathrm{TF}_{1D(t)}\left(\hat f (t,\mathbf{u_t})\right)[k].&lt;br /&gt;
&amp;lt;/math&amp;gt;&amp;lt;/center&amp;gt;&lt;br /&gt;
From the projection-slice theorem, show that the inversion formula of the Radon transform is:&lt;br /&gt;
&amp;lt;center&amp;gt;&amp;lt;math&amp;gt;&lt;br /&gt;
f(\mathbf{r})=\frac{1}{(2\pi)^2}\int_0^\pi\int_{-\infty}^{+\infty}|k|\widetilde{(\hat f)}\,(k,\mathbf{u_t})\,e^{+i(\mathbf{r}\cdot\mathbf{u_t})k}\,\mathrm{d}k\mathrm{d}\Phi.&lt;br /&gt;
&amp;lt;/math&amp;gt;&amp;lt;/center&amp;gt;&lt;/div&gt;</summary>
		<author><name>Alberto</name></author>
	</entry>
	<entry>
		<id>http://www.lptms.universite-paris-saclay.fr//wiki-cours/index.php?title=CoDaDri&amp;diff=1680</id>
		<title>CoDaDri</title>
		<link rel="alternate" type="text/html" href="http://www.lptms.universite-paris-saclay.fr//wiki-cours/index.php?title=CoDaDri&amp;diff=1680"/>
		<updated>2021-11-08T13:46:54Z</updated>

		<summary type="html">&lt;p&gt;Alberto: /* Breaking news: */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;=Breaking news:=&lt;br /&gt;
&lt;br /&gt;
* Homework 1 has been evaluated and sent to you. If you did not receive it, please contact us. &lt;br /&gt;
* Here you find the MCQ proposed last year &lt;br /&gt;
[https://colab.research.google.com/drive/1Ru_-IQ001XEJd9VAn4nvbBNI_3XA9QSK?usp=sharing The Quiz]&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;The Solution&#039;&#039;&#039; [https://colab.research.google.com/drive/1Faovrt0q5kRVtVsF9afr4iMXww_Wk53_?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
= Computational and Data Driven Physics =&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Modern physics is characterized by an increasing complexity of systems under investigation, in&lt;br /&gt;
domains as diverse as condensed matter, astrophysics, biophysics, etc. Establishing adequate&lt;br /&gt;
models to describe these systems and being able to make quantitative predictions from those models&lt;br /&gt;
is extremely challenging. The goal of the course is to provide the tools and concepts necessary to tackle those systems.&lt;br /&gt;
&lt;br /&gt;
== Course description ==&lt;br /&gt;
&lt;br /&gt;
We will first cover many algorithms used in many-body problems and complex systems, with special emphasis on Monte Carlo methods, molecular dynamics, and optimization in complex landscapes. &lt;br /&gt;
&lt;br /&gt;
Second, we will provide statistical inference and machine learning tools to harness the growing availability of experimental data to design accurate models of the underlying, complex, strongly non-homogeneous and interacting systems. &lt;br /&gt;
&lt;br /&gt;
Each theoretical lecture will be followed by a tutorial illustrating the concepts with practical applications&lt;br /&gt;
borrowed from various domains of physics. We will focus on methods and algorithms and physics, not&lt;br /&gt;
on programming and heavy numerics!  You will have to hand in 3 homeworks.&lt;br /&gt;
&lt;br /&gt;
*[https://drive.google.com/file/d/11w7KI5Pi59VWLX1mqiQ8ZyY8YQHRUeMz/view?usp=sharing Preliminary version of the book: Information, Inference, Networks: From statistical physics to big biological data]&lt;br /&gt;
&lt;br /&gt;
== The Team ==&lt;br /&gt;
&lt;br /&gt;
* [http://lptms.u-psud.fr/alberto_rosso/ Alberto Rosso] (Computational physics)&lt;br /&gt;
* [http://www.phys.ens.fr/~monasson/ Rémi Monasson] (Data-driven physics)&lt;br /&gt;
*  [http://www.lps.ens.fr/~cocco/ Simona Cocco] &amp;amp; [https://www.pct.espci.fr/~david/ David Lacoste] &amp;amp; [https://www.cpht.polytechnique.fr/?q=en/node/110 Michel Ferrero] (Tutorials)&lt;br /&gt;
&lt;br /&gt;
== Where and When ==&lt;br /&gt;
&lt;br /&gt;
* Lectures on Fridays: 14:00-16:00&lt;br /&gt;
* Tutorials on Fridays: 16:00-18:00&lt;br /&gt;
* ENS, 29 rue D&#039;Ulm, salle Borel + Djebar&lt;br /&gt;
&lt;br /&gt;
== Slack ==&lt;br /&gt;
&lt;br /&gt;
If you have questions or want to discuss topics related to the lecture, to the exercises or to the homeworks, you can use the&lt;br /&gt;
[http://computational-ozw2847.slack.com Computational and Data Driven Physics Slack]. In order to join the Slack&lt;br /&gt;
use the following [https://join.slack.com/t/computational-ozw2847/shared_invite/zt-vegija8y-cx_vbF2BI6FJewx4W6coSA invitation link].&lt;br /&gt;
&lt;br /&gt;
== Computer Requirements ==&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;No previous experience in programming is required.&#039;&#039;&#039; &amp;lt;br&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Programming Language: Python&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
For practical installation, we recommand either to use  Anaconda (See [[Memento Python]]) or use google colab. &amp;lt;br&amp;gt;&lt;br /&gt;
The Collaboratory platform from Google is quite good way to use powerful computer without buying one: It requires no specific hardware or software, and even allows you to use GPU computing for free,  all by writting a jupyter notebook that you can then share.&lt;br /&gt;
&lt;br /&gt;
== Grading ==&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Computational Physics:&#039;&#039;&#039;&lt;br /&gt;
* Homework 1: 5 points &lt;br /&gt;
* Homework 2: 5 points&lt;br /&gt;
* Multiple Choice Questions in November: 10 points&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Data Driven Physics:&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Final exam in January: 20 points&lt;br /&gt;
&lt;br /&gt;
== Schedule ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 3, 2021 &#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1X9h3lKD0OZLTKtxb7DWPfynY42rRuE7j/view?usp=sharing Lecture 1]   Introduction to Monte Carlo&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1sIv3qOdyE-XYkjYC-dkNsR72f4BgaQ_y/view?usp=sharing Tutorial 1] Markov Matrix&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 10, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Introductory notebooks: [https://colab.research.google.com/drive/1Ovrh1JjLzMMnxtasDgR1j84CHGU6hMxA python], [https://colab.research.google.com/drive/14PWu-C171pYhV8ven-Txc4wz5Tv1DCsK numpy] and [https://colab.research.google.com/drive/1fPjwrdxQPSyfXniyAHmyOcF_gK2fqjts matplotlib]&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1gf7oRQIpvSvMScyJa5hexB9CCZvdozPs#scrollTo=lDznlLouvlFx Tutorial 2] - Markov matrices ([https://colab.research.google.com/drive/1x9iEHG_F522uFCvD_jGdvHaMETAHfO6-#scrollTo=eSu-nLZ6vm8X solutions])&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1tjqbjAi50C4qOqVRtTxEkTeTb10qpTms#scrollTo=uYpaubGkvogU Tutorial 3] - Thumb rule ([https://colab.research.google.com/drive/1aWVtz4ZGcpIarWiRVAnxrp1t0GDOqZxu#scrollTo=f7ohlMuZvqTr solutions])&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1g7HXFUBQUBF0fhy5h2jYbfIAVBTqvb7-#scrollTo=U9LFX8OFhHOG Homework 1] (deadline October 1)&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
* [https://colab.research.google.com/drive/1aMo4Ur-0_b4dGhdIfxAmCC2ci1rOda_v?usp=sharing Tutorial 2] Markov matrix [https://colab.research.google.com/drive/1Q5ajzxRGXBBorA9cQ9o8V5VUVJhUXpPS?usp=sharing problems]&lt;br /&gt;
* [https://colab.research.google.com/drive/1k60-ChM3aUWjGsiRsf2Idx9jxHHtwyAb?usp=sharing Tutorial 3] Thumb rule [https://colab.research.google.com/drive/1fdKJlp0lD4k530oRuu50_Hm_T8t3jixa?usp=sharing problems]&lt;br /&gt;
--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 17, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/15wrgivn6FSnuBUnMwjjhadmD-g1fkS7T/view?usp=sharing Lecture 2] Basic Sampling&lt;br /&gt;
&lt;br /&gt;
*  [https://drive.google.com/file/d/1ALR_QKLXdHby54xNux39NUOk4L-Ne1EW/view?usp=sharing  Lecture 3]: Errors and Precision&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 24, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1DijhG_856OAuj42WqY1UM47APmMy3A8B/view?usp=sharing Lecture 4]: Ising model and phase transitions &lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1sRUEs768Z6PKdJ3k7MixYeFGlufgjFrG Tutorial 4]: Ising model and phase transitions ([https://colab.research.google.com/drive/1KAQRog_YlAjKZ_hL1FMYurWdPBLNUocI solutions])&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
* [https://colab.research.google.com/drive/1nU4E_pFWjSFPNigzy8-LcJpef26IKY6x?usp=sharing Tutorial 4]: Ising model and phase transitions [https://colab.research.google.com/drive/1AEUX3U7hxDR_YYy8ld3knTEVR1KYa9SP?usp=sharing problems] &lt;br /&gt;
--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 1, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1PTya42ZS2kU87A-BxQFFIUDTs_k47men?usp=sharing Lecture 5]: Optimization &amp;amp; Dijkstra algorithm&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1ieT5BlfJsOehsa8r-LHGsFsn1dwYnawT Tutorial 5]: Simulated annealing ([https://colab.research.google.com/drive/1JNVl42KNASZiwTtqYo71z_vggjbGfKul solutions])&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
* [https://colab.research.google.com/drive/1p0ooWAXF9KNh-FztMHmVoA9yBzYOM8PC?usp=sharing Tutorial 5]: Simulated annealing [https://colab.research.google.com/drive/1txJGpzreHurWux7ev6sDsX8TjzpeQhZZ?usp=sharing problems]&lt;br /&gt;
--&amp;gt;&lt;br /&gt;
* Send your copy of Homework 1 to numphys.icfp  at   gmail.com  Thanks!&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1EPgj3la7vxDIqSQYNlOFz4rR0vHXAeae Homework 2] (deadline October 22)&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 8, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 6: Introduction to Bayesian inference&lt;br /&gt;
&lt;br /&gt;
* Tutorial 6: Bayesian inference and single-particle tracking. [https://drive.google.com/file/d/1q9Quq5mvJ4Avv2qWgzTocU-DVIxJIVWi/view?usp=sharing Questions]. [https://drive.google.com/file/d/1xYb4wfNBysse6Q7frTw_V9TPdUQU5lUx/view?usp=sharing Data]. [https://drive.google.com/file/d/1Ba_kRo3_XMIaDLNYZlbZEw-wGXKS-29I/view?usp=sharing Starting Notebook]. [https://colab.research.google.com/drive/1VePL9X1JT6yl8LmROeZyMyf4Epcu3yOL#scrollTo=1XQNGa_fyEkJ Google colab version]. Solutions [https://drive.google.com/file/d/1Q9IjVUeL7AA8uWk8DX9Vy9vuUQ21RYh2/view?usp=sharing]. Notebook [https://drive.google.com/file/d/1ZJmpdaTQVUttEaaI1ch-reFfZGI93454/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 15, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1eY5cuNcJqYw7df0PBkxq03tEnqzTOC-5/view?usp=sharing Lecture 7]: Importance sampling&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1iaOGxdVgk--kWUFcMDHs0zvPhsOyhB_c Tutorial 7]: Faster than the clock algorithms ([https://colab.research.google.com/drive/1bHPnJpBd5ExqKF4G5BuV_FHPE4r0_AY2#scrollTo=fQnz_gOeq40e solutions])&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
* [https://colab.research.google.com/drive/1KyT442vB4EuGKBy_Xj3j8cLtMMl4gbac?usp=sharing Tutorial 6]: Faster than the clock algorithms [https://colab.research.google.com/drive/1C-ieAwaAKwkX5MFm8aX2kNO2GNeO9CdY?usp=sharing problems]&lt;br /&gt;
--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 22, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 8: Asymptotic inference and information. Extra material: Proof of Cramer-Rao bound [https://drive.google.com/file/d/10Ph_iP6AIQ3ps9v3FwRBO9j6-qV7oKV9/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
* Tutorial 8: [https://drive.google.com/file/d/12cG4HBvzs9Oe1mbfuEYyRDmTEamW71pR/view?usp=sharing Questions]. [https://drive.google.com/file/d/1AL8sRtnqYUI8NbubfglgLazknaVIUJEo/view?usp=sharing Data ] [https://drive.google.com/file/d/1DTLzXLZUEPzoU2SsDMcAe8GaoYX8E5gH/view?usp=sharing Starting Notebook]. [https://drive.google.com/file/d/1QpMaM5ACmKUlFAyGvRnHvFVtQoEAF7-9/view?usp=sharing Bibliography] [https://drive.google.com/file/d/1p9v1PkJhwS8Ofg4RiC1nsFJAe8Mb_6WF/view?usp=sharing Solutions].  [https://drive.google.com/file/d/19erJJ4Gjw77n57VrnqaQPCxIh_-NScYT/view?usp=sharing Notebook].&lt;br /&gt;
&lt;br /&gt;
* Send your copy of Homework 2 to numphys.icfp  at   gmail.com  Thanks!&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 29, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 9: High-dimensional inference and Principal Component Analysis. Extra material: Handwritten notes on the derivation of Marcenko-Pastur spectral density [https://drive.google.com/file/d/10Yytv9itdWDDHTsM2lQHwQDMbcf-oVnd/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
* Tutorial 9: [https://drive.google.com/file/d/10y7m1mPf5R5zZN6661Eei92IUNhBL_Zu/view?usp=sharing  Replay of the neuronal activity during sleep after a task].[https://drive.google.com/file/d/11fO26XB6Ri3HDVBvtdBkYxcTRLk1iv5F/view?usp=sharing Data ]. [https://drive.google.com/file/d/1-MFN2ERs_eNs4w6XnLjfzsu2F9REluSt/view?usp=sharing Initial Notebook]. [https://drive.google.com/file/d/11ev4Zwn6DPYLwhMsLyp8S0aQFVu77Ou3/view?usp=sharing Biblio]. &lt;br /&gt;
[https://drive.google.com/file/d/11E75QwrJgDKrutGj9t5NJTRkGtuRgoBI/view?usp=sharing Solutions]. [https://drive.google.com/file/d/1-39oZNNB-35zM4V2tLWtubQnZTdMLtIz/view?usp=sharing Notebook]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, November 12, 2021, 2 pm: The Quiz.&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
The MCQ is composed of 19 questions (one of them counts for two). &lt;br /&gt;
&lt;br /&gt;
For each question you have 4 choices: 3 wrong and 1 correct: If you check the correct one you get a point. If you are wrong you loose 1/4 of a point.  No answer given: zero points.&lt;br /&gt;
&lt;br /&gt;
The Zoom link [??? update soon). We will be there starting from 13h30, we will discuss the rules and we will be there to help you if you face a problem. The exam starts at 14h00: &lt;br /&gt;
* you download your Notebook of questions from the Google Drive directory that brings your name.&lt;br /&gt;
* Name the file with your answers as familyname_name.txt.&lt;br /&gt;
* The answers should be presented in the following format:&lt;br /&gt;
&lt;br /&gt;
1 A&lt;br /&gt;
&lt;br /&gt;
2 B&lt;br /&gt;
&lt;br /&gt;
4 C&lt;br /&gt;
&lt;br /&gt;
If you do not want to answer a question - as question 3 here -  do not add the corresponding number&lt;br /&gt;
&lt;br /&gt;
* Send the file with your answers at numphys.icfp@gmail.com before 4 pm. &lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Rules&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* You are allowed to use all material you think useful.&lt;br /&gt;
&lt;br /&gt;
* You are not allowed to communicate with other people. Questions will be randomised to make hard life of cheaters, but please do not be one of them! &lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;GOOD LUCK!&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, November 26, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 10: Priors, regularisation, sparsity&lt;br /&gt;
&lt;br /&gt;
* Tutorial 10:&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, December 3, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 11: Network inference&lt;br /&gt;
&lt;br /&gt;
* Tutorial 11:&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, December 10, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 12: Supervised learning and phase transitions&lt;br /&gt;
&lt;br /&gt;
* Tutorial 12:&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, December 17, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 13: Unsupervised learning and representations&lt;br /&gt;
&lt;br /&gt;
* Tutorial 13:&lt;/div&gt;</summary>
		<author><name>Alberto</name></author>
	</entry>
	<entry>
		<id>http://www.lptms.universite-paris-saclay.fr//wiki-cours/index.php?title=CoDaDri&amp;diff=1679</id>
		<title>CoDaDri</title>
		<link rel="alternate" type="text/html" href="http://www.lptms.universite-paris-saclay.fr//wiki-cours/index.php?title=CoDaDri&amp;diff=1679"/>
		<updated>2021-11-08T13:32:37Z</updated>

		<summary type="html">&lt;p&gt;Alberto: /* Breaking news: */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;=Breaking news:=&lt;br /&gt;
&lt;br /&gt;
* Homework 1 has been evaluated and sent to you. If you did not receive it, please contact us. &lt;br /&gt;
* Here you find the MCQ proposed last year &lt;br /&gt;
[https://colab.research.google.com/drive/1Ru_-IQ001XEJd9VAn4nvbBNI_3XA9QSK?usp=sharing The Quiz]&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;The Solution&#039;&#039;&#039; [https://drive.google.com/file/d/1lMwtaAHerJ4uffZoE9egy7Pa_V2-cwOe/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
= Computational and Data Driven Physics =&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Modern physics is characterized by an increasing complexity of systems under investigation, in&lt;br /&gt;
domains as diverse as condensed matter, astrophysics, biophysics, etc. Establishing adequate&lt;br /&gt;
models to describe these systems and being able to make quantitative predictions from those models&lt;br /&gt;
is extremely challenging. The goal of the course is to provide the tools and concepts necessary to tackle those systems.&lt;br /&gt;
&lt;br /&gt;
== Course description ==&lt;br /&gt;
&lt;br /&gt;
We will first cover many algorithms used in many-body problems and complex systems, with special emphasis on Monte Carlo methods, molecular dynamics, and optimization in complex landscapes. &lt;br /&gt;
&lt;br /&gt;
Second, we will provide statistical inference and machine learning tools to harness the growing availability of experimental data to design accurate models of the underlying, complex, strongly non-homogeneous and interacting systems. &lt;br /&gt;
&lt;br /&gt;
Each theoretical lecture will be followed by a tutorial illustrating the concepts with practical applications&lt;br /&gt;
borrowed from various domains of physics. We will focus on methods and algorithms and physics, not&lt;br /&gt;
on programming and heavy numerics!  You will have to hand in 3 homeworks.&lt;br /&gt;
&lt;br /&gt;
*[https://drive.google.com/file/d/11w7KI5Pi59VWLX1mqiQ8ZyY8YQHRUeMz/view?usp=sharing Preliminary version of the book: Information, Inference, Networks: From statistical physics to big biological data]&lt;br /&gt;
&lt;br /&gt;
== The Team ==&lt;br /&gt;
&lt;br /&gt;
* [http://lptms.u-psud.fr/alberto_rosso/ Alberto Rosso] (Computational physics)&lt;br /&gt;
* [http://www.phys.ens.fr/~monasson/ Rémi Monasson] (Data-driven physics)&lt;br /&gt;
*  [http://www.lps.ens.fr/~cocco/ Simona Cocco] &amp;amp; [https://www.pct.espci.fr/~david/ David Lacoste] &amp;amp; [https://www.cpht.polytechnique.fr/?q=en/node/110 Michel Ferrero] (Tutorials)&lt;br /&gt;
&lt;br /&gt;
== Where and When ==&lt;br /&gt;
&lt;br /&gt;
* Lectures on Fridays: 14:00-16:00&lt;br /&gt;
* Tutorials on Fridays: 16:00-18:00&lt;br /&gt;
* ENS, 29 rue D&#039;Ulm, salle Borel + Djebar&lt;br /&gt;
&lt;br /&gt;
== Slack ==&lt;br /&gt;
&lt;br /&gt;
If you have questions or want to discuss topics related to the lecture, to the exercises or to the homeworks, you can use the&lt;br /&gt;
[http://computational-ozw2847.slack.com Computational and Data Driven Physics Slack]. In order to join the Slack&lt;br /&gt;
use the following [https://join.slack.com/t/computational-ozw2847/shared_invite/zt-vegija8y-cx_vbF2BI6FJewx4W6coSA invitation link].&lt;br /&gt;
&lt;br /&gt;
== Computer Requirements ==&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;No previous experience in programming is required.&#039;&#039;&#039; &amp;lt;br&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Programming Language: Python&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
For practical installation, we recommand either to use  Anaconda (See [[Memento Python]]) or use google colab. &amp;lt;br&amp;gt;&lt;br /&gt;
The Collaboratory platform from Google is quite good way to use powerful computer without buying one: It requires no specific hardware or software, and even allows you to use GPU computing for free,  all by writting a jupyter notebook that you can then share.&lt;br /&gt;
&lt;br /&gt;
== Grading ==&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Computational Physics:&#039;&#039;&#039;&lt;br /&gt;
* Homework 1: 5 points &lt;br /&gt;
* Homework 2: 5 points&lt;br /&gt;
* Multiple Choice Questions in November: 10 points&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Data Driven Physics:&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Final exam in January: 20 points&lt;br /&gt;
&lt;br /&gt;
== Schedule ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 3, 2021 &#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1X9h3lKD0OZLTKtxb7DWPfynY42rRuE7j/view?usp=sharing Lecture 1]   Introduction to Monte Carlo&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1sIv3qOdyE-XYkjYC-dkNsR72f4BgaQ_y/view?usp=sharing Tutorial 1] Markov Matrix&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 10, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Introductory notebooks: [https://colab.research.google.com/drive/1Ovrh1JjLzMMnxtasDgR1j84CHGU6hMxA python], [https://colab.research.google.com/drive/14PWu-C171pYhV8ven-Txc4wz5Tv1DCsK numpy] and [https://colab.research.google.com/drive/1fPjwrdxQPSyfXniyAHmyOcF_gK2fqjts matplotlib]&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1gf7oRQIpvSvMScyJa5hexB9CCZvdozPs#scrollTo=lDznlLouvlFx Tutorial 2] - Markov matrices ([https://colab.research.google.com/drive/1x9iEHG_F522uFCvD_jGdvHaMETAHfO6-#scrollTo=eSu-nLZ6vm8X solutions])&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1tjqbjAi50C4qOqVRtTxEkTeTb10qpTms#scrollTo=uYpaubGkvogU Tutorial 3] - Thumb rule ([https://colab.research.google.com/drive/1aWVtz4ZGcpIarWiRVAnxrp1t0GDOqZxu#scrollTo=f7ohlMuZvqTr solutions])&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1g7HXFUBQUBF0fhy5h2jYbfIAVBTqvb7-#scrollTo=U9LFX8OFhHOG Homework 1] (deadline October 1)&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
* [https://colab.research.google.com/drive/1aMo4Ur-0_b4dGhdIfxAmCC2ci1rOda_v?usp=sharing Tutorial 2] Markov matrix [https://colab.research.google.com/drive/1Q5ajzxRGXBBorA9cQ9o8V5VUVJhUXpPS?usp=sharing problems]&lt;br /&gt;
* [https://colab.research.google.com/drive/1k60-ChM3aUWjGsiRsf2Idx9jxHHtwyAb?usp=sharing Tutorial 3] Thumb rule [https://colab.research.google.com/drive/1fdKJlp0lD4k530oRuu50_Hm_T8t3jixa?usp=sharing problems]&lt;br /&gt;
--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 17, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/15wrgivn6FSnuBUnMwjjhadmD-g1fkS7T/view?usp=sharing Lecture 2] Basic Sampling&lt;br /&gt;
&lt;br /&gt;
*  [https://drive.google.com/file/d/1ALR_QKLXdHby54xNux39NUOk4L-Ne1EW/view?usp=sharing  Lecture 3]: Errors and Precision&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 24, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1DijhG_856OAuj42WqY1UM47APmMy3A8B/view?usp=sharing Lecture 4]: Ising model and phase transitions &lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1sRUEs768Z6PKdJ3k7MixYeFGlufgjFrG Tutorial 4]: Ising model and phase transitions ([https://colab.research.google.com/drive/1KAQRog_YlAjKZ_hL1FMYurWdPBLNUocI solutions])&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
* [https://colab.research.google.com/drive/1nU4E_pFWjSFPNigzy8-LcJpef26IKY6x?usp=sharing Tutorial 4]: Ising model and phase transitions [https://colab.research.google.com/drive/1AEUX3U7hxDR_YYy8ld3knTEVR1KYa9SP?usp=sharing problems] &lt;br /&gt;
--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 1, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1PTya42ZS2kU87A-BxQFFIUDTs_k47men?usp=sharing Lecture 5]: Optimization &amp;amp; Dijkstra algorithm&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1ieT5BlfJsOehsa8r-LHGsFsn1dwYnawT Tutorial 5]: Simulated annealing ([https://colab.research.google.com/drive/1JNVl42KNASZiwTtqYo71z_vggjbGfKul solutions])&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
* [https://colab.research.google.com/drive/1p0ooWAXF9KNh-FztMHmVoA9yBzYOM8PC?usp=sharing Tutorial 5]: Simulated annealing [https://colab.research.google.com/drive/1txJGpzreHurWux7ev6sDsX8TjzpeQhZZ?usp=sharing problems]&lt;br /&gt;
--&amp;gt;&lt;br /&gt;
* Send your copy of Homework 1 to numphys.icfp  at   gmail.com  Thanks!&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1EPgj3la7vxDIqSQYNlOFz4rR0vHXAeae Homework 2] (deadline October 22)&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 8, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 6: Introduction to Bayesian inference&lt;br /&gt;
&lt;br /&gt;
* Tutorial 6: Bayesian inference and single-particle tracking. [https://drive.google.com/file/d/1q9Quq5mvJ4Avv2qWgzTocU-DVIxJIVWi/view?usp=sharing Questions]. [https://drive.google.com/file/d/1xYb4wfNBysse6Q7frTw_V9TPdUQU5lUx/view?usp=sharing Data]. [https://drive.google.com/file/d/1Ba_kRo3_XMIaDLNYZlbZEw-wGXKS-29I/view?usp=sharing Starting Notebook]. [https://colab.research.google.com/drive/1VePL9X1JT6yl8LmROeZyMyf4Epcu3yOL#scrollTo=1XQNGa_fyEkJ Google colab version]. Solutions [https://drive.google.com/file/d/1Q9IjVUeL7AA8uWk8DX9Vy9vuUQ21RYh2/view?usp=sharing]. Notebook [https://drive.google.com/file/d/1ZJmpdaTQVUttEaaI1ch-reFfZGI93454/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 15, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1eY5cuNcJqYw7df0PBkxq03tEnqzTOC-5/view?usp=sharing Lecture 7]: Importance sampling&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1iaOGxdVgk--kWUFcMDHs0zvPhsOyhB_c Tutorial 7]: Faster than the clock algorithms ([https://colab.research.google.com/drive/1bHPnJpBd5ExqKF4G5BuV_FHPE4r0_AY2#scrollTo=fQnz_gOeq40e solutions])&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
* [https://colab.research.google.com/drive/1KyT442vB4EuGKBy_Xj3j8cLtMMl4gbac?usp=sharing Tutorial 6]: Faster than the clock algorithms [https://colab.research.google.com/drive/1C-ieAwaAKwkX5MFm8aX2kNO2GNeO9CdY?usp=sharing problems]&lt;br /&gt;
--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 22, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 8: Asymptotic inference and information. Extra material: Proof of Cramer-Rao bound [https://drive.google.com/file/d/10Ph_iP6AIQ3ps9v3FwRBO9j6-qV7oKV9/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
* Tutorial 8: [https://drive.google.com/file/d/12cG4HBvzs9Oe1mbfuEYyRDmTEamW71pR/view?usp=sharing Questions]. [https://drive.google.com/file/d/1AL8sRtnqYUI8NbubfglgLazknaVIUJEo/view?usp=sharing Data ] [https://drive.google.com/file/d/1DTLzXLZUEPzoU2SsDMcAe8GaoYX8E5gH/view?usp=sharing Starting Notebook]. [https://drive.google.com/file/d/1QpMaM5ACmKUlFAyGvRnHvFVtQoEAF7-9/view?usp=sharing Bibliography] [https://drive.google.com/file/d/1p9v1PkJhwS8Ofg4RiC1nsFJAe8Mb_6WF/view?usp=sharing Solutions].  [https://drive.google.com/file/d/19erJJ4Gjw77n57VrnqaQPCxIh_-NScYT/view?usp=sharing Notebook].&lt;br /&gt;
&lt;br /&gt;
* Send your copy of Homework 2 to numphys.icfp  at   gmail.com  Thanks!&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 29, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 9: High-dimensional inference and Principal Component Analysis. Extra material: Handwritten notes on the derivation of Marcenko-Pastur spectral density [https://drive.google.com/file/d/10Yytv9itdWDDHTsM2lQHwQDMbcf-oVnd/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
* Tutorial 9: [https://drive.google.com/file/d/10y7m1mPf5R5zZN6661Eei92IUNhBL_Zu/view?usp=sharing  Replay of the neuronal activity during sleep after a task].[https://drive.google.com/file/d/11fO26XB6Ri3HDVBvtdBkYxcTRLk1iv5F/view?usp=sharing Data ]. [https://drive.google.com/file/d/1-MFN2ERs_eNs4w6XnLjfzsu2F9REluSt/view?usp=sharing Initial Notebook]. [https://drive.google.com/file/d/11ev4Zwn6DPYLwhMsLyp8S0aQFVu77Ou3/view?usp=sharing Biblio]. &lt;br /&gt;
[https://drive.google.com/file/d/11E75QwrJgDKrutGj9t5NJTRkGtuRgoBI/view?usp=sharing Solutions]. [https://drive.google.com/file/d/1-39oZNNB-35zM4V2tLWtubQnZTdMLtIz/view?usp=sharing Notebook]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, November 12, 2021, 2 pm: The Quiz.&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
The MCQ is composed of 19 questions (one of them counts for two). &lt;br /&gt;
&lt;br /&gt;
For each question you have 4 choices: 3 wrong and 1 correct: If you check the correct one you get a point. If you are wrong you loose 1/4 of a point.  No answer given: zero points.&lt;br /&gt;
&lt;br /&gt;
The Zoom link [??? update soon). We will be there starting from 13h30, we will discuss the rules and we will be there to help you if you face a problem. The exam starts at 14h00: &lt;br /&gt;
* you download your Notebook of questions from the Google Drive directory that brings your name.&lt;br /&gt;
* Name the file with your answers as familyname_name.txt.&lt;br /&gt;
* The answers should be presented in the following format:&lt;br /&gt;
&lt;br /&gt;
1 A&lt;br /&gt;
&lt;br /&gt;
2 B&lt;br /&gt;
&lt;br /&gt;
4 C&lt;br /&gt;
&lt;br /&gt;
If you do not want to answer a question - as question 3 here -  do not add the corresponding number&lt;br /&gt;
&lt;br /&gt;
* Send the file with your answers at numphys.icfp@gmail.com before 4 pm. &lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Rules&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* You are allowed to use all material you think useful.&lt;br /&gt;
&lt;br /&gt;
* You are not allowed to communicate with other people. Questions will be randomised to make hard life of cheaters, but please do not be one of them! &lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;GOOD LUCK!&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, November 26, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 10: Priors, regularisation, sparsity&lt;br /&gt;
&lt;br /&gt;
* Tutorial 10:&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, December 3, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 11: Network inference&lt;br /&gt;
&lt;br /&gt;
* Tutorial 11:&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, December 10, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 12: Supervised learning and phase transitions&lt;br /&gt;
&lt;br /&gt;
* Tutorial 12:&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, December 17, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 13: Unsupervised learning and representations&lt;br /&gt;
&lt;br /&gt;
* Tutorial 13:&lt;/div&gt;</summary>
		<author><name>Alberto</name></author>
	</entry>
	<entry>
		<id>http://www.lptms.universite-paris-saclay.fr//wiki-cours/index.php?title=CoDaDri&amp;diff=1678</id>
		<title>CoDaDri</title>
		<link rel="alternate" type="text/html" href="http://www.lptms.universite-paris-saclay.fr//wiki-cours/index.php?title=CoDaDri&amp;diff=1678"/>
		<updated>2021-11-05T20:14:37Z</updated>

		<summary type="html">&lt;p&gt;Alberto: /* Schedule */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;=Breaking news:=&lt;br /&gt;
&lt;br /&gt;
* Homework 1 has been evaluated and sent to you. If you did not receive it, please contact us. &lt;br /&gt;
* Here you find the MCQ proposed last year &lt;br /&gt;
[https://colab.research.google.com/drive/1Ru_-IQ001XEJd9VAn4nvbBNI_3XA9QSK?usp=sharing The Quiz]&lt;br /&gt;
&lt;br /&gt;
= Computational and Data Driven Physics =&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Modern physics is characterized by an increasing complexity of systems under investigation, in&lt;br /&gt;
domains as diverse as condensed matter, astrophysics, biophysics, etc. Establishing adequate&lt;br /&gt;
models to describe these systems and being able to make quantitative predictions from those models&lt;br /&gt;
is extremely challenging. The goal of the course is to provide the tools and concepts necessary to tackle those systems.&lt;br /&gt;
&lt;br /&gt;
== Course description ==&lt;br /&gt;
&lt;br /&gt;
We will first cover many algorithms used in many-body problems and complex systems, with special emphasis on Monte Carlo methods, molecular dynamics, and optimization in complex landscapes. &lt;br /&gt;
&lt;br /&gt;
Second, we will provide statistical inference and machine learning tools to harness the growing availability of experimental data to design accurate models of the underlying, complex, strongly non-homogeneous and interacting systems. &lt;br /&gt;
&lt;br /&gt;
Each theoretical lecture will be followed by a tutorial illustrating the concepts with practical applications&lt;br /&gt;
borrowed from various domains of physics. We will focus on methods and algorithms and physics, not&lt;br /&gt;
on programming and heavy numerics!  You will have to hand in 3 homeworks.&lt;br /&gt;
&lt;br /&gt;
*[https://drive.google.com/file/d/11w7KI5Pi59VWLX1mqiQ8ZyY8YQHRUeMz/view?usp=sharing Preliminary version of the book: Information, Inference, Networks: From statistical physics to big biological data]&lt;br /&gt;
&lt;br /&gt;
== The Team ==&lt;br /&gt;
&lt;br /&gt;
* [http://lptms.u-psud.fr/alberto_rosso/ Alberto Rosso] (Computational physics)&lt;br /&gt;
* [http://www.phys.ens.fr/~monasson/ Rémi Monasson] (Data-driven physics)&lt;br /&gt;
*  [http://www.lps.ens.fr/~cocco/ Simona Cocco] &amp;amp; [https://www.pct.espci.fr/~david/ David Lacoste] &amp;amp; [https://www.cpht.polytechnique.fr/?q=en/node/110 Michel Ferrero] (Tutorials)&lt;br /&gt;
&lt;br /&gt;
== Where and When ==&lt;br /&gt;
&lt;br /&gt;
* Lectures on Fridays: 14:00-16:00&lt;br /&gt;
* Tutorials on Fridays: 16:00-18:00&lt;br /&gt;
* ENS, 29 rue D&#039;Ulm, salle Borel + Djebar&lt;br /&gt;
&lt;br /&gt;
== Slack ==&lt;br /&gt;
&lt;br /&gt;
If you have questions or want to discuss topics related to the lecture, to the exercises or to the homeworks, you can use the&lt;br /&gt;
[http://computational-ozw2847.slack.com Computational and Data Driven Physics Slack]. In order to join the Slack&lt;br /&gt;
use the following [https://join.slack.com/t/computational-ozw2847/shared_invite/zt-vegija8y-cx_vbF2BI6FJewx4W6coSA invitation link].&lt;br /&gt;
&lt;br /&gt;
== Computer Requirements ==&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;No previous experience in programming is required.&#039;&#039;&#039; &amp;lt;br&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Programming Language: Python&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
For practical installation, we recommand either to use  Anaconda (See [[Memento Python]]) or use google colab. &amp;lt;br&amp;gt;&lt;br /&gt;
The Collaboratory platform from Google is quite good way to use powerful computer without buying one: It requires no specific hardware or software, and even allows you to use GPU computing for free,  all by writting a jupyter notebook that you can then share.&lt;br /&gt;
&lt;br /&gt;
== Grading ==&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Computational Physics:&#039;&#039;&#039;&lt;br /&gt;
* Homework 1: 5 points &lt;br /&gt;
* Homework 2: 5 points&lt;br /&gt;
* Multiple Choice Questions in November: 10 points&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Data Driven Physics:&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Final exam in January: 20 points&lt;br /&gt;
&lt;br /&gt;
== Schedule ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 3, 2021 &#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1X9h3lKD0OZLTKtxb7DWPfynY42rRuE7j/view?usp=sharing Lecture 1]   Introduction to Monte Carlo&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1sIv3qOdyE-XYkjYC-dkNsR72f4BgaQ_y/view?usp=sharing Tutorial 1] Markov Matrix&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 10, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Introductory notebooks: [https://colab.research.google.com/drive/1Ovrh1JjLzMMnxtasDgR1j84CHGU6hMxA python], [https://colab.research.google.com/drive/14PWu-C171pYhV8ven-Txc4wz5Tv1DCsK numpy] and [https://colab.research.google.com/drive/1fPjwrdxQPSyfXniyAHmyOcF_gK2fqjts matplotlib]&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1gf7oRQIpvSvMScyJa5hexB9CCZvdozPs#scrollTo=lDznlLouvlFx Tutorial 2] - Markov matrices ([https://colab.research.google.com/drive/1x9iEHG_F522uFCvD_jGdvHaMETAHfO6-#scrollTo=eSu-nLZ6vm8X solutions])&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1tjqbjAi50C4qOqVRtTxEkTeTb10qpTms#scrollTo=uYpaubGkvogU Tutorial 3] - Thumb rule ([https://colab.research.google.com/drive/1aWVtz4ZGcpIarWiRVAnxrp1t0GDOqZxu#scrollTo=f7ohlMuZvqTr solutions])&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1g7HXFUBQUBF0fhy5h2jYbfIAVBTqvb7-#scrollTo=U9LFX8OFhHOG Homework 1] (deadline October 1)&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
* [https://colab.research.google.com/drive/1aMo4Ur-0_b4dGhdIfxAmCC2ci1rOda_v?usp=sharing Tutorial 2] Markov matrix [https://colab.research.google.com/drive/1Q5ajzxRGXBBorA9cQ9o8V5VUVJhUXpPS?usp=sharing problems]&lt;br /&gt;
* [https://colab.research.google.com/drive/1k60-ChM3aUWjGsiRsf2Idx9jxHHtwyAb?usp=sharing Tutorial 3] Thumb rule [https://colab.research.google.com/drive/1fdKJlp0lD4k530oRuu50_Hm_T8t3jixa?usp=sharing problems]&lt;br /&gt;
--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 17, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/15wrgivn6FSnuBUnMwjjhadmD-g1fkS7T/view?usp=sharing Lecture 2] Basic Sampling&lt;br /&gt;
&lt;br /&gt;
*  [https://drive.google.com/file/d/1ALR_QKLXdHby54xNux39NUOk4L-Ne1EW/view?usp=sharing  Lecture 3]: Errors and Precision&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 24, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1DijhG_856OAuj42WqY1UM47APmMy3A8B/view?usp=sharing Lecture 4]: Ising model and phase transitions &lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1sRUEs768Z6PKdJ3k7MixYeFGlufgjFrG Tutorial 4]: Ising model and phase transitions ([https://colab.research.google.com/drive/1KAQRog_YlAjKZ_hL1FMYurWdPBLNUocI solutions])&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
* [https://colab.research.google.com/drive/1nU4E_pFWjSFPNigzy8-LcJpef26IKY6x?usp=sharing Tutorial 4]: Ising model and phase transitions [https://colab.research.google.com/drive/1AEUX3U7hxDR_YYy8ld3knTEVR1KYa9SP?usp=sharing problems] &lt;br /&gt;
--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 1, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1PTya42ZS2kU87A-BxQFFIUDTs_k47men?usp=sharing Lecture 5]: Optimization &amp;amp; Dijkstra algorithm&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1ieT5BlfJsOehsa8r-LHGsFsn1dwYnawT Tutorial 5]: Simulated annealing ([https://colab.research.google.com/drive/1JNVl42KNASZiwTtqYo71z_vggjbGfKul solutions])&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
* [https://colab.research.google.com/drive/1p0ooWAXF9KNh-FztMHmVoA9yBzYOM8PC?usp=sharing Tutorial 5]: Simulated annealing [https://colab.research.google.com/drive/1txJGpzreHurWux7ev6sDsX8TjzpeQhZZ?usp=sharing problems]&lt;br /&gt;
--&amp;gt;&lt;br /&gt;
* Send your copy of Homework 1 to numphys.icfp  at   gmail.com  Thanks!&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1EPgj3la7vxDIqSQYNlOFz4rR0vHXAeae Homework 2] (deadline October 22)&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 8, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 6: Introduction to Bayesian inference&lt;br /&gt;
&lt;br /&gt;
* Tutorial 6: Bayesian inference and single-particle tracking. [https://drive.google.com/file/d/1q9Quq5mvJ4Avv2qWgzTocU-DVIxJIVWi/view?usp=sharing Questions]. [https://drive.google.com/file/d/1xYb4wfNBysse6Q7frTw_V9TPdUQU5lUx/view?usp=sharing Data]. [https://drive.google.com/file/d/1Ba_kRo3_XMIaDLNYZlbZEw-wGXKS-29I/view?usp=sharing Starting Notebook]. [https://colab.research.google.com/drive/1VePL9X1JT6yl8LmROeZyMyf4Epcu3yOL#scrollTo=1XQNGa_fyEkJ Google colab version]. Solutions [https://drive.google.com/file/d/1Q9IjVUeL7AA8uWk8DX9Vy9vuUQ21RYh2/view?usp=sharing]. Notebook [https://drive.google.com/file/d/1ZJmpdaTQVUttEaaI1ch-reFfZGI93454/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 15, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1eY5cuNcJqYw7df0PBkxq03tEnqzTOC-5/view?usp=sharing Lecture 7]: Importance sampling&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1iaOGxdVgk--kWUFcMDHs0zvPhsOyhB_c Tutorial 7]: Faster than the clock algorithms ([https://colab.research.google.com/drive/1bHPnJpBd5ExqKF4G5BuV_FHPE4r0_AY2#scrollTo=fQnz_gOeq40e solutions])&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
* [https://colab.research.google.com/drive/1KyT442vB4EuGKBy_Xj3j8cLtMMl4gbac?usp=sharing Tutorial 6]: Faster than the clock algorithms [https://colab.research.google.com/drive/1C-ieAwaAKwkX5MFm8aX2kNO2GNeO9CdY?usp=sharing problems]&lt;br /&gt;
--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 22, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 8: Asymptotic inference and information. Extra material: Proof of Cramer-Rao bound [https://drive.google.com/file/d/10Ph_iP6AIQ3ps9v3FwRBO9j6-qV7oKV9/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
* Tutorial 8: [https://drive.google.com/file/d/12cG4HBvzs9Oe1mbfuEYyRDmTEamW71pR/view?usp=sharing Questions]. [https://drive.google.com/file/d/1AL8sRtnqYUI8NbubfglgLazknaVIUJEo/view?usp=sharing Data ] [https://drive.google.com/file/d/1DTLzXLZUEPzoU2SsDMcAe8GaoYX8E5gH/view?usp=sharing Starting Notebook]. [https://drive.google.com/file/d/1QpMaM5ACmKUlFAyGvRnHvFVtQoEAF7-9/view?usp=sharing Bibliography] [https://drive.google.com/file/d/1p9v1PkJhwS8Ofg4RiC1nsFJAe8Mb_6WF/view?usp=sharing Solutions].  [https://drive.google.com/file/d/19erJJ4Gjw77n57VrnqaQPCxIh_-NScYT/view?usp=sharing Notebook].&lt;br /&gt;
&lt;br /&gt;
* Send your copy of Homework 2 to numphys.icfp  at   gmail.com  Thanks!&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 29, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 9: High-dimensional inference and Principal Component Analysis. Extra material: Handwritten notes on the derivation of Marcenko-Pastur spectral density [https://drive.google.com/file/d/10Yytv9itdWDDHTsM2lQHwQDMbcf-oVnd/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
* Tutorial 9: [https://drive.google.com/file/d/10y7m1mPf5R5zZN6661Eei92IUNhBL_Zu/view?usp=sharing  Replay of the neuronal activity during sleep after a task].[https://drive.google.com/file/d/11fO26XB6Ri3HDVBvtdBkYxcTRLk1iv5F/view?usp=sharing Data ]. [https://drive.google.com/file/d/1-MFN2ERs_eNs4w6XnLjfzsu2F9REluSt/view?usp=sharing Initial Notebook]. [https://drive.google.com/file/d/11ev4Zwn6DPYLwhMsLyp8S0aQFVu77Ou3/view?usp=sharing Biblio]. &lt;br /&gt;
[https://drive.google.com/file/d/11E75QwrJgDKrutGj9t5NJTRkGtuRgoBI/view?usp=sharing Solutions]. [https://drive.google.com/file/d/1-39oZNNB-35zM4V2tLWtubQnZTdMLtIz/view?usp=sharing Notebook]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, November 12, 2021, 2 pm: The Quiz.&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
The MCQ is composed of 19 questions (one of them counts for two). &lt;br /&gt;
&lt;br /&gt;
For each question you have 4 choices: 3 wrong and 1 correct: If you check the correct one you get a point. If you are wrong you loose 1/4 of a point.  No answer given: zero points.&lt;br /&gt;
&lt;br /&gt;
The Zoom link [??? update soon). We will be there starting from 13h30, we will discuss the rules and we will be there to help you if you face a problem. The exam starts at 14h00: &lt;br /&gt;
* you download your Notebook of questions from the Google Drive directory that brings your name.&lt;br /&gt;
* Name the file with your answers as familyname_name.txt.&lt;br /&gt;
* The answers should be presented in the following format:&lt;br /&gt;
&lt;br /&gt;
1 A&lt;br /&gt;
&lt;br /&gt;
2 B&lt;br /&gt;
&lt;br /&gt;
4 C&lt;br /&gt;
&lt;br /&gt;
If you do not want to answer a question - as question 3 here -  do not add the corresponding number&lt;br /&gt;
&lt;br /&gt;
* Send the file with your answers at numphys.icfp@gmail.com before 4 pm. &lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Rules&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* You are allowed to use all material you think useful.&lt;br /&gt;
&lt;br /&gt;
* You are not allowed to communicate with other people. Questions will be randomised to make hard life of cheaters, but please do not be one of them! &lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;GOOD LUCK!&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, November 26, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 10: Priors, regularisation, sparsity&lt;br /&gt;
&lt;br /&gt;
* Tutorial 10:&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, December 3, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 11: Network inference&lt;br /&gt;
&lt;br /&gt;
* Tutorial 11:&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, December 10, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 12: Supervised learning and phase transitions&lt;br /&gt;
&lt;br /&gt;
* Tutorial 12:&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, December 17, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 13: Unsupervised learning and representations&lt;br /&gt;
&lt;br /&gt;
* Tutorial 13:&lt;/div&gt;</summary>
		<author><name>Alberto</name></author>
	</entry>
	<entry>
		<id>http://www.lptms.universite-paris-saclay.fr//wiki-cours/index.php?title=CoDaDri&amp;diff=1677</id>
		<title>CoDaDri</title>
		<link rel="alternate" type="text/html" href="http://www.lptms.universite-paris-saclay.fr//wiki-cours/index.php?title=CoDaDri&amp;diff=1677"/>
		<updated>2021-11-05T20:14:00Z</updated>

		<summary type="html">&lt;p&gt;Alberto: /* Schedule */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;=Breaking news:=&lt;br /&gt;
&lt;br /&gt;
* Homework 1 has been evaluated and sent to you. If you did not receive it, please contact us. &lt;br /&gt;
* Here you find the MCQ proposed last year &lt;br /&gt;
[https://colab.research.google.com/drive/1Ru_-IQ001XEJd9VAn4nvbBNI_3XA9QSK?usp=sharing The Quiz]&lt;br /&gt;
&lt;br /&gt;
= Computational and Data Driven Physics =&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Modern physics is characterized by an increasing complexity of systems under investigation, in&lt;br /&gt;
domains as diverse as condensed matter, astrophysics, biophysics, etc. Establishing adequate&lt;br /&gt;
models to describe these systems and being able to make quantitative predictions from those models&lt;br /&gt;
is extremely challenging. The goal of the course is to provide the tools and concepts necessary to tackle those systems.&lt;br /&gt;
&lt;br /&gt;
== Course description ==&lt;br /&gt;
&lt;br /&gt;
We will first cover many algorithms used in many-body problems and complex systems, with special emphasis on Monte Carlo methods, molecular dynamics, and optimization in complex landscapes. &lt;br /&gt;
&lt;br /&gt;
Second, we will provide statistical inference and machine learning tools to harness the growing availability of experimental data to design accurate models of the underlying, complex, strongly non-homogeneous and interacting systems. &lt;br /&gt;
&lt;br /&gt;
Each theoretical lecture will be followed by a tutorial illustrating the concepts with practical applications&lt;br /&gt;
borrowed from various domains of physics. We will focus on methods and algorithms and physics, not&lt;br /&gt;
on programming and heavy numerics!  You will have to hand in 3 homeworks.&lt;br /&gt;
&lt;br /&gt;
*[https://drive.google.com/file/d/11w7KI5Pi59VWLX1mqiQ8ZyY8YQHRUeMz/view?usp=sharing Preliminary version of the book: Information, Inference, Networks: From statistical physics to big biological data]&lt;br /&gt;
&lt;br /&gt;
== The Team ==&lt;br /&gt;
&lt;br /&gt;
* [http://lptms.u-psud.fr/alberto_rosso/ Alberto Rosso] (Computational physics)&lt;br /&gt;
* [http://www.phys.ens.fr/~monasson/ Rémi Monasson] (Data-driven physics)&lt;br /&gt;
*  [http://www.lps.ens.fr/~cocco/ Simona Cocco] &amp;amp; [https://www.pct.espci.fr/~david/ David Lacoste] &amp;amp; [https://www.cpht.polytechnique.fr/?q=en/node/110 Michel Ferrero] (Tutorials)&lt;br /&gt;
&lt;br /&gt;
== Where and When ==&lt;br /&gt;
&lt;br /&gt;
* Lectures on Fridays: 14:00-16:00&lt;br /&gt;
* Tutorials on Fridays: 16:00-18:00&lt;br /&gt;
* ENS, 29 rue D&#039;Ulm, salle Borel + Djebar&lt;br /&gt;
&lt;br /&gt;
== Slack ==&lt;br /&gt;
&lt;br /&gt;
If you have questions or want to discuss topics related to the lecture, to the exercises or to the homeworks, you can use the&lt;br /&gt;
[http://computational-ozw2847.slack.com Computational and Data Driven Physics Slack]. In order to join the Slack&lt;br /&gt;
use the following [https://join.slack.com/t/computational-ozw2847/shared_invite/zt-vegija8y-cx_vbF2BI6FJewx4W6coSA invitation link].&lt;br /&gt;
&lt;br /&gt;
== Computer Requirements ==&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;No previous experience in programming is required.&#039;&#039;&#039; &amp;lt;br&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Programming Language: Python&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
For practical installation, we recommand either to use  Anaconda (See [[Memento Python]]) or use google colab. &amp;lt;br&amp;gt;&lt;br /&gt;
The Collaboratory platform from Google is quite good way to use powerful computer without buying one: It requires no specific hardware or software, and even allows you to use GPU computing for free,  all by writting a jupyter notebook that you can then share.&lt;br /&gt;
&lt;br /&gt;
== Grading ==&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Computational Physics:&#039;&#039;&#039;&lt;br /&gt;
* Homework 1: 5 points &lt;br /&gt;
* Homework 2: 5 points&lt;br /&gt;
* Multiple Choice Questions in November: 10 points&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Data Driven Physics:&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Final exam in January: 20 points&lt;br /&gt;
&lt;br /&gt;
== Schedule ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 3, 2021 &#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1X9h3lKD0OZLTKtxb7DWPfynY42rRuE7j/view?usp=sharing Lecture 1]   Introduction to Monte Carlo&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1sIv3qOdyE-XYkjYC-dkNsR72f4BgaQ_y/view?usp=sharing Tutorial 1] Markov Matrix&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 10, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Introductory notebooks: [https://colab.research.google.com/drive/1Ovrh1JjLzMMnxtasDgR1j84CHGU6hMxA python], [https://colab.research.google.com/drive/14PWu-C171pYhV8ven-Txc4wz5Tv1DCsK numpy] and [https://colab.research.google.com/drive/1fPjwrdxQPSyfXniyAHmyOcF_gK2fqjts matplotlib]&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1gf7oRQIpvSvMScyJa5hexB9CCZvdozPs#scrollTo=lDznlLouvlFx Tutorial 2] - Markov matrices ([https://colab.research.google.com/drive/1x9iEHG_F522uFCvD_jGdvHaMETAHfO6-#scrollTo=eSu-nLZ6vm8X solutions])&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1tjqbjAi50C4qOqVRtTxEkTeTb10qpTms#scrollTo=uYpaubGkvogU Tutorial 3] - Thumb rule ([https://colab.research.google.com/drive/1aWVtz4ZGcpIarWiRVAnxrp1t0GDOqZxu#scrollTo=f7ohlMuZvqTr solutions])&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1g7HXFUBQUBF0fhy5h2jYbfIAVBTqvb7-#scrollTo=U9LFX8OFhHOG Homework 1] (deadline October 1)&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
* [https://colab.research.google.com/drive/1aMo4Ur-0_b4dGhdIfxAmCC2ci1rOda_v?usp=sharing Tutorial 2] Markov matrix [https://colab.research.google.com/drive/1Q5ajzxRGXBBorA9cQ9o8V5VUVJhUXpPS?usp=sharing problems]&lt;br /&gt;
* [https://colab.research.google.com/drive/1k60-ChM3aUWjGsiRsf2Idx9jxHHtwyAb?usp=sharing Tutorial 3] Thumb rule [https://colab.research.google.com/drive/1fdKJlp0lD4k530oRuu50_Hm_T8t3jixa?usp=sharing problems]&lt;br /&gt;
--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 17, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/15wrgivn6FSnuBUnMwjjhadmD-g1fkS7T/view?usp=sharing Lecture 2] Basic Sampling&lt;br /&gt;
&lt;br /&gt;
*  [https://drive.google.com/file/d/1ALR_QKLXdHby54xNux39NUOk4L-Ne1EW/view?usp=sharing  Lecture 3]: Errors and Precision&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 24, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1DijhG_856OAuj42WqY1UM47APmMy3A8B/view?usp=sharing Lecture 4]: Ising model and phase transitions &lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1sRUEs768Z6PKdJ3k7MixYeFGlufgjFrG Tutorial 4]: Ising model and phase transitions ([https://colab.research.google.com/drive/1KAQRog_YlAjKZ_hL1FMYurWdPBLNUocI solutions])&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
* [https://colab.research.google.com/drive/1nU4E_pFWjSFPNigzy8-LcJpef26IKY6x?usp=sharing Tutorial 4]: Ising model and phase transitions [https://colab.research.google.com/drive/1AEUX3U7hxDR_YYy8ld3knTEVR1KYa9SP?usp=sharing problems] &lt;br /&gt;
--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 1, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1PTya42ZS2kU87A-BxQFFIUDTs_k47men?usp=sharing Lecture 5]: Optimization &amp;amp; Dijkstra algorithm&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1ieT5BlfJsOehsa8r-LHGsFsn1dwYnawT Tutorial 5]: Simulated annealing ([https://colab.research.google.com/drive/1JNVl42KNASZiwTtqYo71z_vggjbGfKul solutions])&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
* [https://colab.research.google.com/drive/1p0ooWAXF9KNh-FztMHmVoA9yBzYOM8PC?usp=sharing Tutorial 5]: Simulated annealing [https://colab.research.google.com/drive/1txJGpzreHurWux7ev6sDsX8TjzpeQhZZ?usp=sharing problems]&lt;br /&gt;
--&amp;gt;&lt;br /&gt;
* Send your copy of Homework 1 to numphys.icfp  at   gmail.com  Thanks!&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1EPgj3la7vxDIqSQYNlOFz4rR0vHXAeae Homework 2] (deadline October 22)&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 8, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 6: Introduction to Bayesian inference&lt;br /&gt;
&lt;br /&gt;
* Tutorial 6: Bayesian inference and single-particle tracking. [https://drive.google.com/file/d/1q9Quq5mvJ4Avv2qWgzTocU-DVIxJIVWi/view?usp=sharing Questions]. [https://drive.google.com/file/d/1xYb4wfNBysse6Q7frTw_V9TPdUQU5lUx/view?usp=sharing Data]. [https://drive.google.com/file/d/1Ba_kRo3_XMIaDLNYZlbZEw-wGXKS-29I/view?usp=sharing Starting Notebook]. [https://colab.research.google.com/drive/1VePL9X1JT6yl8LmROeZyMyf4Epcu3yOL#scrollTo=1XQNGa_fyEkJ Google colab version]. Solutions [https://drive.google.com/file/d/1Q9IjVUeL7AA8uWk8DX9Vy9vuUQ21RYh2/view?usp=sharing]. Notebook [https://drive.google.com/file/d/1ZJmpdaTQVUttEaaI1ch-reFfZGI93454/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 15, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1eY5cuNcJqYw7df0PBkxq03tEnqzTOC-5/view?usp=sharing Lecture 7]: Importance sampling&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1iaOGxdVgk--kWUFcMDHs0zvPhsOyhB_c Tutorial 7]: Faster than the clock algorithms ([https://colab.research.google.com/drive/1bHPnJpBd5ExqKF4G5BuV_FHPE4r0_AY2#scrollTo=fQnz_gOeq40e solutions])&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
* [https://colab.research.google.com/drive/1KyT442vB4EuGKBy_Xj3j8cLtMMl4gbac?usp=sharing Tutorial 6]: Faster than the clock algorithms [https://colab.research.google.com/drive/1C-ieAwaAKwkX5MFm8aX2kNO2GNeO9CdY?usp=sharing problems]&lt;br /&gt;
--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 22, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 8: Asymptotic inference and information. Extra material: Proof of Cramer-Rao bound [https://drive.google.com/file/d/10Ph_iP6AIQ3ps9v3FwRBO9j6-qV7oKV9/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
* Tutorial 8: [https://drive.google.com/file/d/12cG4HBvzs9Oe1mbfuEYyRDmTEamW71pR/view?usp=sharing Questions]. [https://drive.google.com/file/d/1AL8sRtnqYUI8NbubfglgLazknaVIUJEo/view?usp=sharing Data ] [https://drive.google.com/file/d/1DTLzXLZUEPzoU2SsDMcAe8GaoYX8E5gH/view?usp=sharing Starting Notebook]. [https://drive.google.com/file/d/1QpMaM5ACmKUlFAyGvRnHvFVtQoEAF7-9/view?usp=sharing Bibliography] [https://drive.google.com/file/d/1p9v1PkJhwS8Ofg4RiC1nsFJAe8Mb_6WF/view?usp=sharing Solutions].  [https://drive.google.com/file/d/19erJJ4Gjw77n57VrnqaQPCxIh_-NScYT/view?usp=sharing Notebook].&lt;br /&gt;
&lt;br /&gt;
* Send your copy of Homework 2 to numphys.icfp  at   gmail.com  Thanks!&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 29, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 9: High-dimensional inference and Principal Component Analysis. Extra material: Handwritten notes on the derivation of Marcenko-Pastur spectral density [https://drive.google.com/file/d/10Yytv9itdWDDHTsM2lQHwQDMbcf-oVnd/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
* Tutorial 9: [https://drive.google.com/file/d/10y7m1mPf5R5zZN6661Eei92IUNhBL_Zu/view?usp=sharing  Replay of the neuronal activity during sleep after a task].[https://drive.google.com/file/d/11fO26XB6Ri3HDVBvtdBkYxcTRLk1iv5F/view?usp=sharing Data ]. [https://drive.google.com/file/d/1-MFN2ERs_eNs4w6XnLjfzsu2F9REluSt/view?usp=sharing Initial Notebook]. [https://drive.google.com/file/d/11ev4Zwn6DPYLwhMsLyp8S0aQFVu77Ou3/view?usp=sharing Biblio]. &lt;br /&gt;
[https://drive.google.com/file/d/11E75QwrJgDKrutGj9t5NJTRkGtuRgoBI/view?usp=sharing Solutions]. [https://drive.google.com/file/d/1-39oZNNB-35zM4V2tLWtubQnZTdMLtIz/view?usp=sharing Notebook]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, November 12, 2021, 2 pm: The Quiz.&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
The MCQ is composed of 19 questions (one of them counts for two). &lt;br /&gt;
&lt;br /&gt;
For each question you have 4 choices: 3 wrong and 1 correct: If you check the correct one you get a point. If you are wrong you loose 1/4 of a point.  No answer given: zero points.&lt;br /&gt;
&lt;br /&gt;
The Zoom link [??? update soon). We will be there starting from 13h30, we will discuss the rules and we will be there to help you if you face a problem. The exam starts at 14h00: &lt;br /&gt;
* you download your Notebook of questions from the Google Drive directory that brings your name.&lt;br /&gt;
* Name the file with your answers as familyname_name.txt.&lt;br /&gt;
* The answers should be presented in the following format:&lt;br /&gt;
&lt;br /&gt;
1 A&lt;br /&gt;
&lt;br /&gt;
2 B&lt;br /&gt;
&lt;br /&gt;
4 C&lt;br /&gt;
&lt;br /&gt;
If you do not want to answer a question - as question 3 here -  do not add the corresponding number&lt;br /&gt;
&lt;br /&gt;
* Send the file with your answers at numphys.icfp@gmail.com before 4 pm. &lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Rules&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* You are allowed to use all material you think useful.&lt;br /&gt;
&lt;br /&gt;
* You are not allowed to communicate with other people. Questions will be randomised to make hard life of cheaters, but please do not be one of them! &lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
** GOOD LUCK!** &lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, November 26, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 10: Priors, regularisation, sparsity&lt;br /&gt;
&lt;br /&gt;
* Tutorial 10:&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, December 3, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 11: Network inference&lt;br /&gt;
&lt;br /&gt;
* Tutorial 11:&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, December 10, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 12: Supervised learning and phase transitions&lt;br /&gt;
&lt;br /&gt;
* Tutorial 12:&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, December 17, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 13: Unsupervised learning and representations&lt;br /&gt;
&lt;br /&gt;
* Tutorial 13:&lt;/div&gt;</summary>
		<author><name>Alberto</name></author>
	</entry>
	<entry>
		<id>http://www.lptms.universite-paris-saclay.fr//wiki-cours/index.php?title=CoDaDri&amp;diff=1676</id>
		<title>CoDaDri</title>
		<link rel="alternate" type="text/html" href="http://www.lptms.universite-paris-saclay.fr//wiki-cours/index.php?title=CoDaDri&amp;diff=1676"/>
		<updated>2021-11-05T20:12:55Z</updated>

		<summary type="html">&lt;p&gt;Alberto: /* Schedule */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;=Breaking news:=&lt;br /&gt;
&lt;br /&gt;
* Homework 1 has been evaluated and sent to you. If you did not receive it, please contact us. &lt;br /&gt;
* Here you find the MCQ proposed last year &lt;br /&gt;
[https://colab.research.google.com/drive/1Ru_-IQ001XEJd9VAn4nvbBNI_3XA9QSK?usp=sharing The Quiz]&lt;br /&gt;
&lt;br /&gt;
= Computational and Data Driven Physics =&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Modern physics is characterized by an increasing complexity of systems under investigation, in&lt;br /&gt;
domains as diverse as condensed matter, astrophysics, biophysics, etc. Establishing adequate&lt;br /&gt;
models to describe these systems and being able to make quantitative predictions from those models&lt;br /&gt;
is extremely challenging. The goal of the course is to provide the tools and concepts necessary to tackle those systems.&lt;br /&gt;
&lt;br /&gt;
== Course description ==&lt;br /&gt;
&lt;br /&gt;
We will first cover many algorithms used in many-body problems and complex systems, with special emphasis on Monte Carlo methods, molecular dynamics, and optimization in complex landscapes. &lt;br /&gt;
&lt;br /&gt;
Second, we will provide statistical inference and machine learning tools to harness the growing availability of experimental data to design accurate models of the underlying, complex, strongly non-homogeneous and interacting systems. &lt;br /&gt;
&lt;br /&gt;
Each theoretical lecture will be followed by a tutorial illustrating the concepts with practical applications&lt;br /&gt;
borrowed from various domains of physics. We will focus on methods and algorithms and physics, not&lt;br /&gt;
on programming and heavy numerics!  You will have to hand in 3 homeworks.&lt;br /&gt;
&lt;br /&gt;
*[https://drive.google.com/file/d/11w7KI5Pi59VWLX1mqiQ8ZyY8YQHRUeMz/view?usp=sharing Preliminary version of the book: Information, Inference, Networks: From statistical physics to big biological data]&lt;br /&gt;
&lt;br /&gt;
== The Team ==&lt;br /&gt;
&lt;br /&gt;
* [http://lptms.u-psud.fr/alberto_rosso/ Alberto Rosso] (Computational physics)&lt;br /&gt;
* [http://www.phys.ens.fr/~monasson/ Rémi Monasson] (Data-driven physics)&lt;br /&gt;
*  [http://www.lps.ens.fr/~cocco/ Simona Cocco] &amp;amp; [https://www.pct.espci.fr/~david/ David Lacoste] &amp;amp; [https://www.cpht.polytechnique.fr/?q=en/node/110 Michel Ferrero] (Tutorials)&lt;br /&gt;
&lt;br /&gt;
== Where and When ==&lt;br /&gt;
&lt;br /&gt;
* Lectures on Fridays: 14:00-16:00&lt;br /&gt;
* Tutorials on Fridays: 16:00-18:00&lt;br /&gt;
* ENS, 29 rue D&#039;Ulm, salle Borel + Djebar&lt;br /&gt;
&lt;br /&gt;
== Slack ==&lt;br /&gt;
&lt;br /&gt;
If you have questions or want to discuss topics related to the lecture, to the exercises or to the homeworks, you can use the&lt;br /&gt;
[http://computational-ozw2847.slack.com Computational and Data Driven Physics Slack]. In order to join the Slack&lt;br /&gt;
use the following [https://join.slack.com/t/computational-ozw2847/shared_invite/zt-vegija8y-cx_vbF2BI6FJewx4W6coSA invitation link].&lt;br /&gt;
&lt;br /&gt;
== Computer Requirements ==&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;No previous experience in programming is required.&#039;&#039;&#039; &amp;lt;br&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Programming Language: Python&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
For practical installation, we recommand either to use  Anaconda (See [[Memento Python]]) or use google colab. &amp;lt;br&amp;gt;&lt;br /&gt;
The Collaboratory platform from Google is quite good way to use powerful computer without buying one: It requires no specific hardware or software, and even allows you to use GPU computing for free,  all by writting a jupyter notebook that you can then share.&lt;br /&gt;
&lt;br /&gt;
== Grading ==&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Computational Physics:&#039;&#039;&#039;&lt;br /&gt;
* Homework 1: 5 points &lt;br /&gt;
* Homework 2: 5 points&lt;br /&gt;
* Multiple Choice Questions in November: 10 points&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Data Driven Physics:&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Final exam in January: 20 points&lt;br /&gt;
&lt;br /&gt;
== Schedule ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 3, 2021 &#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1X9h3lKD0OZLTKtxb7DWPfynY42rRuE7j/view?usp=sharing Lecture 1]   Introduction to Monte Carlo&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1sIv3qOdyE-XYkjYC-dkNsR72f4BgaQ_y/view?usp=sharing Tutorial 1] Markov Matrix&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 10, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Introductory notebooks: [https://colab.research.google.com/drive/1Ovrh1JjLzMMnxtasDgR1j84CHGU6hMxA python], [https://colab.research.google.com/drive/14PWu-C171pYhV8ven-Txc4wz5Tv1DCsK numpy] and [https://colab.research.google.com/drive/1fPjwrdxQPSyfXniyAHmyOcF_gK2fqjts matplotlib]&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1gf7oRQIpvSvMScyJa5hexB9CCZvdozPs#scrollTo=lDznlLouvlFx Tutorial 2] - Markov matrices ([https://colab.research.google.com/drive/1x9iEHG_F522uFCvD_jGdvHaMETAHfO6-#scrollTo=eSu-nLZ6vm8X solutions])&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1tjqbjAi50C4qOqVRtTxEkTeTb10qpTms#scrollTo=uYpaubGkvogU Tutorial 3] - Thumb rule ([https://colab.research.google.com/drive/1aWVtz4ZGcpIarWiRVAnxrp1t0GDOqZxu#scrollTo=f7ohlMuZvqTr solutions])&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1g7HXFUBQUBF0fhy5h2jYbfIAVBTqvb7-#scrollTo=U9LFX8OFhHOG Homework 1] (deadline October 1)&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
* [https://colab.research.google.com/drive/1aMo4Ur-0_b4dGhdIfxAmCC2ci1rOda_v?usp=sharing Tutorial 2] Markov matrix [https://colab.research.google.com/drive/1Q5ajzxRGXBBorA9cQ9o8V5VUVJhUXpPS?usp=sharing problems]&lt;br /&gt;
* [https://colab.research.google.com/drive/1k60-ChM3aUWjGsiRsf2Idx9jxHHtwyAb?usp=sharing Tutorial 3] Thumb rule [https://colab.research.google.com/drive/1fdKJlp0lD4k530oRuu50_Hm_T8t3jixa?usp=sharing problems]&lt;br /&gt;
--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 17, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/15wrgivn6FSnuBUnMwjjhadmD-g1fkS7T/view?usp=sharing Lecture 2] Basic Sampling&lt;br /&gt;
&lt;br /&gt;
*  [https://drive.google.com/file/d/1ALR_QKLXdHby54xNux39NUOk4L-Ne1EW/view?usp=sharing  Lecture 3]: Errors and Precision&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 24, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1DijhG_856OAuj42WqY1UM47APmMy3A8B/view?usp=sharing Lecture 4]: Ising model and phase transitions &lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1sRUEs768Z6PKdJ3k7MixYeFGlufgjFrG Tutorial 4]: Ising model and phase transitions ([https://colab.research.google.com/drive/1KAQRog_YlAjKZ_hL1FMYurWdPBLNUocI solutions])&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
* [https://colab.research.google.com/drive/1nU4E_pFWjSFPNigzy8-LcJpef26IKY6x?usp=sharing Tutorial 4]: Ising model and phase transitions [https://colab.research.google.com/drive/1AEUX3U7hxDR_YYy8ld3knTEVR1KYa9SP?usp=sharing problems] &lt;br /&gt;
--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 1, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1PTya42ZS2kU87A-BxQFFIUDTs_k47men?usp=sharing Lecture 5]: Optimization &amp;amp; Dijkstra algorithm&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1ieT5BlfJsOehsa8r-LHGsFsn1dwYnawT Tutorial 5]: Simulated annealing ([https://colab.research.google.com/drive/1JNVl42KNASZiwTtqYo71z_vggjbGfKul solutions])&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
* [https://colab.research.google.com/drive/1p0ooWAXF9KNh-FztMHmVoA9yBzYOM8PC?usp=sharing Tutorial 5]: Simulated annealing [https://colab.research.google.com/drive/1txJGpzreHurWux7ev6sDsX8TjzpeQhZZ?usp=sharing problems]&lt;br /&gt;
--&amp;gt;&lt;br /&gt;
* Send your copy of Homework 1 to numphys.icfp  at   gmail.com  Thanks!&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1EPgj3la7vxDIqSQYNlOFz4rR0vHXAeae Homework 2] (deadline October 22)&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 8, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 6: Introduction to Bayesian inference&lt;br /&gt;
&lt;br /&gt;
* Tutorial 6: Bayesian inference and single-particle tracking. [https://drive.google.com/file/d/1q9Quq5mvJ4Avv2qWgzTocU-DVIxJIVWi/view?usp=sharing Questions]. [https://drive.google.com/file/d/1xYb4wfNBysse6Q7frTw_V9TPdUQU5lUx/view?usp=sharing Data]. [https://drive.google.com/file/d/1Ba_kRo3_XMIaDLNYZlbZEw-wGXKS-29I/view?usp=sharing Starting Notebook]. [https://colab.research.google.com/drive/1VePL9X1JT6yl8LmROeZyMyf4Epcu3yOL#scrollTo=1XQNGa_fyEkJ Google colab version]. Solutions [https://drive.google.com/file/d/1Q9IjVUeL7AA8uWk8DX9Vy9vuUQ21RYh2/view?usp=sharing]. Notebook [https://drive.google.com/file/d/1ZJmpdaTQVUttEaaI1ch-reFfZGI93454/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 15, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1eY5cuNcJqYw7df0PBkxq03tEnqzTOC-5/view?usp=sharing Lecture 7]: Importance sampling&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1iaOGxdVgk--kWUFcMDHs0zvPhsOyhB_c Tutorial 7]: Faster than the clock algorithms ([https://colab.research.google.com/drive/1bHPnJpBd5ExqKF4G5BuV_FHPE4r0_AY2#scrollTo=fQnz_gOeq40e solutions])&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
* [https://colab.research.google.com/drive/1KyT442vB4EuGKBy_Xj3j8cLtMMl4gbac?usp=sharing Tutorial 6]: Faster than the clock algorithms [https://colab.research.google.com/drive/1C-ieAwaAKwkX5MFm8aX2kNO2GNeO9CdY?usp=sharing problems]&lt;br /&gt;
--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 22, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 8: Asymptotic inference and information. Extra material: Proof of Cramer-Rao bound [https://drive.google.com/file/d/10Ph_iP6AIQ3ps9v3FwRBO9j6-qV7oKV9/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
* Tutorial 8: [https://drive.google.com/file/d/12cG4HBvzs9Oe1mbfuEYyRDmTEamW71pR/view?usp=sharing Questions]. [https://drive.google.com/file/d/1AL8sRtnqYUI8NbubfglgLazknaVIUJEo/view?usp=sharing Data ] [https://drive.google.com/file/d/1DTLzXLZUEPzoU2SsDMcAe8GaoYX8E5gH/view?usp=sharing Starting Notebook]. [https://drive.google.com/file/d/1QpMaM5ACmKUlFAyGvRnHvFVtQoEAF7-9/view?usp=sharing Bibliography] [https://drive.google.com/file/d/1p9v1PkJhwS8Ofg4RiC1nsFJAe8Mb_6WF/view?usp=sharing Solutions].  [https://drive.google.com/file/d/19erJJ4Gjw77n57VrnqaQPCxIh_-NScYT/view?usp=sharing Notebook].&lt;br /&gt;
&lt;br /&gt;
* Send your copy of Homework 2 to numphys.icfp  at   gmail.com  Thanks!&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 29, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 9: High-dimensional inference and Principal Component Analysis. Extra material: Handwritten notes on the derivation of Marcenko-Pastur spectral density [https://drive.google.com/file/d/10Yytv9itdWDDHTsM2lQHwQDMbcf-oVnd/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
* Tutorial 9: [https://drive.google.com/file/d/10y7m1mPf5R5zZN6661Eei92IUNhBL_Zu/view?usp=sharing  Replay of the neuronal activity during sleep after a task].[https://drive.google.com/file/d/11fO26XB6Ri3HDVBvtdBkYxcTRLk1iv5F/view?usp=sharing Data ]. [https://drive.google.com/file/d/1-MFN2ERs_eNs4w6XnLjfzsu2F9REluSt/view?usp=sharing Initial Notebook]. [https://drive.google.com/file/d/11ev4Zwn6DPYLwhMsLyp8S0aQFVu77Ou3/view?usp=sharing Biblio]. &lt;br /&gt;
[https://drive.google.com/file/d/11E75QwrJgDKrutGj9t5NJTRkGtuRgoBI/view?usp=sharing Solutions]. [https://drive.google.com/file/d/1-39oZNNB-35zM4V2tLWtubQnZTdMLtIz/view?usp=sharing Notebook]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, November 12, 2021, 2 pm: The Quiz.&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
The MCQ is composed of 19 questions (one of them counts for two). &lt;br /&gt;
&lt;br /&gt;
For each question you have 4 choices: 3 wrong and 1 correct: If you check the correct one you get a point. If you are wrong you loose 1/4 of a point.  No answer given: zero points.&lt;br /&gt;
&lt;br /&gt;
The Zoom link [??? update soon). We will be there starting from 13h30, we will discuss the rules and we will be there to help you if you face a problem. The exam starts at 14h00: &lt;br /&gt;
* you download your Notebook of questions from the Google Drive directory that brings your name.&lt;br /&gt;
* Name the file with your answers as familyname_name.txt.&lt;br /&gt;
* The answers should be presented in the following format:&lt;br /&gt;
&lt;br /&gt;
1 A&lt;br /&gt;
&lt;br /&gt;
2 B&lt;br /&gt;
&lt;br /&gt;
4 C&lt;br /&gt;
&lt;br /&gt;
If you do not want to answer a question - as question 3 here -  do not add the corresponding number&lt;br /&gt;
&lt;br /&gt;
* Send the file with your answers at numphys.icfp@gmail.com before 4 pm. &lt;br /&gt;
&lt;br /&gt;
**Rules**&lt;br /&gt;
&lt;br /&gt;
* You are allowed to use all material you think useful.&lt;br /&gt;
&lt;br /&gt;
* You are not allowed to communicate with other people. Questions will be randomised to make hard life of cheaters, but please do not be one of them! &lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
** GOOD LUCK!** &lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, November 26, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 10: Priors, regularisation, sparsity&lt;br /&gt;
&lt;br /&gt;
* Tutorial 10:&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, December 3, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 11: Network inference&lt;br /&gt;
&lt;br /&gt;
* Tutorial 11:&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, December 10, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 12: Supervised learning and phase transitions&lt;br /&gt;
&lt;br /&gt;
* Tutorial 12:&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, December 17, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 13: Unsupervised learning and representations&lt;br /&gt;
&lt;br /&gt;
* Tutorial 13:&lt;/div&gt;</summary>
		<author><name>Alberto</name></author>
	</entry>
	<entry>
		<id>http://www.lptms.universite-paris-saclay.fr//wiki-cours/index.php?title=CoDaDri&amp;diff=1675</id>
		<title>CoDaDri</title>
		<link rel="alternate" type="text/html" href="http://www.lptms.universite-paris-saclay.fr//wiki-cours/index.php?title=CoDaDri&amp;diff=1675"/>
		<updated>2021-11-05T18:18:50Z</updated>

		<summary type="html">&lt;p&gt;Alberto: /* Schedule */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;=Breaking news:=&lt;br /&gt;
&lt;br /&gt;
* Homework 1 has been evaluated and sent to you. If you did not receive it, please contact us. &lt;br /&gt;
* Here you find the MCQ proposed last year &lt;br /&gt;
[https://colab.research.google.com/drive/1Ru_-IQ001XEJd9VAn4nvbBNI_3XA9QSK?usp=sharing The Quiz]&lt;br /&gt;
&lt;br /&gt;
= Computational and Data Driven Physics =&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Modern physics is characterized by an increasing complexity of systems under investigation, in&lt;br /&gt;
domains as diverse as condensed matter, astrophysics, biophysics, etc. Establishing adequate&lt;br /&gt;
models to describe these systems and being able to make quantitative predictions from those models&lt;br /&gt;
is extremely challenging. The goal of the course is to provide the tools and concepts necessary to tackle those systems.&lt;br /&gt;
&lt;br /&gt;
== Course description ==&lt;br /&gt;
&lt;br /&gt;
We will first cover many algorithms used in many-body problems and complex systems, with special emphasis on Monte Carlo methods, molecular dynamics, and optimization in complex landscapes. &lt;br /&gt;
&lt;br /&gt;
Second, we will provide statistical inference and machine learning tools to harness the growing availability of experimental data to design accurate models of the underlying, complex, strongly non-homogeneous and interacting systems. &lt;br /&gt;
&lt;br /&gt;
Each theoretical lecture will be followed by a tutorial illustrating the concepts with practical applications&lt;br /&gt;
borrowed from various domains of physics. We will focus on methods and algorithms and physics, not&lt;br /&gt;
on programming and heavy numerics!  You will have to hand in 3 homeworks.&lt;br /&gt;
&lt;br /&gt;
*[https://drive.google.com/file/d/11w7KI5Pi59VWLX1mqiQ8ZyY8YQHRUeMz/view?usp=sharing Preliminary version of the book: Information, Inference, Networks: From statistical physics to big biological data]&lt;br /&gt;
&lt;br /&gt;
== The Team ==&lt;br /&gt;
&lt;br /&gt;
* [http://lptms.u-psud.fr/alberto_rosso/ Alberto Rosso] (Computational physics)&lt;br /&gt;
* [http://www.phys.ens.fr/~monasson/ Rémi Monasson] (Data-driven physics)&lt;br /&gt;
*  [http://www.lps.ens.fr/~cocco/ Simona Cocco] &amp;amp; [https://www.pct.espci.fr/~david/ David Lacoste] &amp;amp; [https://www.cpht.polytechnique.fr/?q=en/node/110 Michel Ferrero] (Tutorials)&lt;br /&gt;
&lt;br /&gt;
== Where and When ==&lt;br /&gt;
&lt;br /&gt;
* Lectures on Fridays: 14:00-16:00&lt;br /&gt;
* Tutorials on Fridays: 16:00-18:00&lt;br /&gt;
* ENS, 29 rue D&#039;Ulm, salle Borel + Djebar&lt;br /&gt;
&lt;br /&gt;
== Slack ==&lt;br /&gt;
&lt;br /&gt;
If you have questions or want to discuss topics related to the lecture, to the exercises or to the homeworks, you can use the&lt;br /&gt;
[http://computational-ozw2847.slack.com Computational and Data Driven Physics Slack]. In order to join the Slack&lt;br /&gt;
use the following [https://join.slack.com/t/computational-ozw2847/shared_invite/zt-vegija8y-cx_vbF2BI6FJewx4W6coSA invitation link].&lt;br /&gt;
&lt;br /&gt;
== Computer Requirements ==&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;No previous experience in programming is required.&#039;&#039;&#039; &amp;lt;br&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Programming Language: Python&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
For practical installation, we recommand either to use  Anaconda (See [[Memento Python]]) or use google colab. &amp;lt;br&amp;gt;&lt;br /&gt;
The Collaboratory platform from Google is quite good way to use powerful computer without buying one: It requires no specific hardware or software, and even allows you to use GPU computing for free,  all by writting a jupyter notebook that you can then share.&lt;br /&gt;
&lt;br /&gt;
== Grading ==&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Computational Physics:&#039;&#039;&#039;&lt;br /&gt;
* Homework 1: 5 points &lt;br /&gt;
* Homework 2: 5 points&lt;br /&gt;
* Multiple Choice Questions in November: 10 points&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Data Driven Physics:&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Final exam in January: 20 points&lt;br /&gt;
&lt;br /&gt;
== Schedule ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 3, 2021 &#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1X9h3lKD0OZLTKtxb7DWPfynY42rRuE7j/view?usp=sharing Lecture 1]   Introduction to Monte Carlo&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1sIv3qOdyE-XYkjYC-dkNsR72f4BgaQ_y/view?usp=sharing Tutorial 1] Markov Matrix&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 10, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Introductory notebooks: [https://colab.research.google.com/drive/1Ovrh1JjLzMMnxtasDgR1j84CHGU6hMxA python], [https://colab.research.google.com/drive/14PWu-C171pYhV8ven-Txc4wz5Tv1DCsK numpy] and [https://colab.research.google.com/drive/1fPjwrdxQPSyfXniyAHmyOcF_gK2fqjts matplotlib]&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1gf7oRQIpvSvMScyJa5hexB9CCZvdozPs#scrollTo=lDznlLouvlFx Tutorial 2] - Markov matrices ([https://colab.research.google.com/drive/1x9iEHG_F522uFCvD_jGdvHaMETAHfO6-#scrollTo=eSu-nLZ6vm8X solutions])&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1tjqbjAi50C4qOqVRtTxEkTeTb10qpTms#scrollTo=uYpaubGkvogU Tutorial 3] - Thumb rule ([https://colab.research.google.com/drive/1aWVtz4ZGcpIarWiRVAnxrp1t0GDOqZxu#scrollTo=f7ohlMuZvqTr solutions])&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1g7HXFUBQUBF0fhy5h2jYbfIAVBTqvb7-#scrollTo=U9LFX8OFhHOG Homework 1] (deadline October 1)&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
* [https://colab.research.google.com/drive/1aMo4Ur-0_b4dGhdIfxAmCC2ci1rOda_v?usp=sharing Tutorial 2] Markov matrix [https://colab.research.google.com/drive/1Q5ajzxRGXBBorA9cQ9o8V5VUVJhUXpPS?usp=sharing problems]&lt;br /&gt;
* [https://colab.research.google.com/drive/1k60-ChM3aUWjGsiRsf2Idx9jxHHtwyAb?usp=sharing Tutorial 3] Thumb rule [https://colab.research.google.com/drive/1fdKJlp0lD4k530oRuu50_Hm_T8t3jixa?usp=sharing problems]&lt;br /&gt;
--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 17, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/15wrgivn6FSnuBUnMwjjhadmD-g1fkS7T/view?usp=sharing Lecture 2] Basic Sampling&lt;br /&gt;
&lt;br /&gt;
*  [https://drive.google.com/file/d/1ALR_QKLXdHby54xNux39NUOk4L-Ne1EW/view?usp=sharing  Lecture 3]: Errors and Precision&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 24, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1DijhG_856OAuj42WqY1UM47APmMy3A8B/view?usp=sharing Lecture 4]: Ising model and phase transitions &lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1sRUEs768Z6PKdJ3k7MixYeFGlufgjFrG Tutorial 4]: Ising model and phase transitions ([https://colab.research.google.com/drive/1KAQRog_YlAjKZ_hL1FMYurWdPBLNUocI solutions])&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
* [https://colab.research.google.com/drive/1nU4E_pFWjSFPNigzy8-LcJpef26IKY6x?usp=sharing Tutorial 4]: Ising model and phase transitions [https://colab.research.google.com/drive/1AEUX3U7hxDR_YYy8ld3knTEVR1KYa9SP?usp=sharing problems] &lt;br /&gt;
--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 1, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1PTya42ZS2kU87A-BxQFFIUDTs_k47men?usp=sharing Lecture 5]: Optimization &amp;amp; Dijkstra algorithm&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1ieT5BlfJsOehsa8r-LHGsFsn1dwYnawT Tutorial 5]: Simulated annealing ([https://colab.research.google.com/drive/1JNVl42KNASZiwTtqYo71z_vggjbGfKul solutions])&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
* [https://colab.research.google.com/drive/1p0ooWAXF9KNh-FztMHmVoA9yBzYOM8PC?usp=sharing Tutorial 5]: Simulated annealing [https://colab.research.google.com/drive/1txJGpzreHurWux7ev6sDsX8TjzpeQhZZ?usp=sharing problems]&lt;br /&gt;
--&amp;gt;&lt;br /&gt;
* Send your copy of Homework 1 to numphys.icfp  at   gmail.com  Thanks!&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1EPgj3la7vxDIqSQYNlOFz4rR0vHXAeae Homework 2] (deadline October 22)&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 8, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 6: Introduction to Bayesian inference&lt;br /&gt;
&lt;br /&gt;
* Tutorial 6: Bayesian inference and single-particle tracking. [https://drive.google.com/file/d/1q9Quq5mvJ4Avv2qWgzTocU-DVIxJIVWi/view?usp=sharing Questions]. [https://drive.google.com/file/d/1xYb4wfNBysse6Q7frTw_V9TPdUQU5lUx/view?usp=sharing Data]. [https://drive.google.com/file/d/1Ba_kRo3_XMIaDLNYZlbZEw-wGXKS-29I/view?usp=sharing Starting Notebook]. [https://colab.research.google.com/drive/1VePL9X1JT6yl8LmROeZyMyf4Epcu3yOL#scrollTo=1XQNGa_fyEkJ Google colab version]. Solutions [https://drive.google.com/file/d/1Q9IjVUeL7AA8uWk8DX9Vy9vuUQ21RYh2/view?usp=sharing]. Notebook [https://drive.google.com/file/d/1ZJmpdaTQVUttEaaI1ch-reFfZGI93454/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 15, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1eY5cuNcJqYw7df0PBkxq03tEnqzTOC-5/view?usp=sharing Lecture 7]: Importance sampling&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1iaOGxdVgk--kWUFcMDHs0zvPhsOyhB_c Tutorial 7]: Faster than the clock algorithms ([https://colab.research.google.com/drive/1bHPnJpBd5ExqKF4G5BuV_FHPE4r0_AY2#scrollTo=fQnz_gOeq40e solutions])&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
* [https://colab.research.google.com/drive/1KyT442vB4EuGKBy_Xj3j8cLtMMl4gbac?usp=sharing Tutorial 6]: Faster than the clock algorithms [https://colab.research.google.com/drive/1C-ieAwaAKwkX5MFm8aX2kNO2GNeO9CdY?usp=sharing problems]&lt;br /&gt;
--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 22, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 8: Asymptotic inference and information. Extra material: Proof of Cramer-Rao bound [https://drive.google.com/file/d/10Ph_iP6AIQ3ps9v3FwRBO9j6-qV7oKV9/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
* Tutorial 8: [https://drive.google.com/file/d/12cG4HBvzs9Oe1mbfuEYyRDmTEamW71pR/view?usp=sharing Questions]. [https://drive.google.com/file/d/1AL8sRtnqYUI8NbubfglgLazknaVIUJEo/view?usp=sharing Data ] [https://drive.google.com/file/d/1DTLzXLZUEPzoU2SsDMcAe8GaoYX8E5gH/view?usp=sharing Starting Notebook]. [https://drive.google.com/file/d/1QpMaM5ACmKUlFAyGvRnHvFVtQoEAF7-9/view?usp=sharing Bibliography] [https://drive.google.com/file/d/1p9v1PkJhwS8Ofg4RiC1nsFJAe8Mb_6WF/view?usp=sharing Solutions].  [https://drive.google.com/file/d/19erJJ4Gjw77n57VrnqaQPCxIh_-NScYT/view?usp=sharing Notebook].&lt;br /&gt;
&lt;br /&gt;
* Send your copy of Homework 2 to numphys.icfp  at   gmail.com  Thanks!&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 29, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 9: High-dimensional inference and Principal Component Analysis. Extra material: Handwritten notes on the derivation of Marcenko-Pastur spectral density [https://drive.google.com/file/d/10Yytv9itdWDDHTsM2lQHwQDMbcf-oVnd/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
* Tutorial 9: [https://drive.google.com/file/d/10y7m1mPf5R5zZN6661Eei92IUNhBL_Zu/view?usp=sharing  Replay of the neuronal activity during sleep after a task].[https://drive.google.com/file/d/11fO26XB6Ri3HDVBvtdBkYxcTRLk1iv5F/view?usp=sharing Data ]. [https://drive.google.com/file/d/1-MFN2ERs_eNs4w6XnLjfzsu2F9REluSt/view?usp=sharing Initial Notebook]. [https://drive.google.com/file/d/11ev4Zwn6DPYLwhMsLyp8S0aQFVu77Ou3/view?usp=sharing Biblio]. &lt;br /&gt;
[https://drive.google.com/file/d/11E75QwrJgDKrutGj9t5NJTRkGtuRgoBI/view?usp=sharing Solutions]. [https://drive.google.com/file/d/1-39oZNNB-35zM4V2tLWtubQnZTdMLtIz/view?usp=sharing Notebook]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, November 12, 2021, 2 pm: The Quiz.&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
The MCQ is composed of 19 questions (one of them counts for two). For each question you have 4 choices: 3 wrong and 1 correct.&lt;br /&gt;
&lt;br /&gt;
If you check the correct one you get a point.&lt;br /&gt;
&lt;br /&gt;
If you are wrong you loose 1/4 of a point. &lt;br /&gt;
&lt;br /&gt;
No answer given: zero points.&lt;br /&gt;
&lt;br /&gt;
The Zoom link ??? (update soon) . I will be there starting from 13h30, we will discuss the rules and I will be there to help you if you face a problem.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Time schedule&lt;br /&gt;
&lt;br /&gt;
The exam starts at 14h00: you download your Notebook of questions from the Google Drive directory that brings your name.&lt;br /&gt;
&lt;br /&gt;
Name the file with your answers as familyname_name.txt.&lt;br /&gt;
&lt;br /&gt;
The answers should be presented in the following format:&lt;br /&gt;
&lt;br /&gt;
1 A&lt;br /&gt;
&lt;br /&gt;
2 B&lt;br /&gt;
&lt;br /&gt;
4 C&lt;br /&gt;
&lt;br /&gt;
(if you do not want to answer a question - as question 3 here -  do not add the corresponding number)&lt;br /&gt;
&lt;br /&gt;
Send the file with your answers at numphys.icfp@gmail.com before 4 pm. &lt;br /&gt;
&lt;br /&gt;
Rules&lt;br /&gt;
&lt;br /&gt;
You are allowed to use all material you think useful.&lt;br /&gt;
&lt;br /&gt;
You are not allowed to communicate with other people. Questions will be randomised to make hard life of cheaters, but please do not be one of them! &lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
GOOD LUCK! &lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, November 26, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 10: Priors, regularisation, sparsity&lt;br /&gt;
&lt;br /&gt;
* Tutorial 10:&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, December 3, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 11: Network inference&lt;br /&gt;
&lt;br /&gt;
* Tutorial 11:&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, December 10, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 12: Supervised learning and phase transitions&lt;br /&gt;
&lt;br /&gt;
* Tutorial 12:&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, December 17, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 13: Unsupervised learning and representations&lt;br /&gt;
&lt;br /&gt;
* Tutorial 13:&lt;/div&gt;</summary>
		<author><name>Alberto</name></author>
	</entry>
	<entry>
		<id>http://www.lptms.universite-paris-saclay.fr//wiki-cours/index.php?title=CoDaDri&amp;diff=1674</id>
		<title>CoDaDri</title>
		<link rel="alternate" type="text/html" href="http://www.lptms.universite-paris-saclay.fr//wiki-cours/index.php?title=CoDaDri&amp;diff=1674"/>
		<updated>2021-11-05T18:17:55Z</updated>

		<summary type="html">&lt;p&gt;Alberto: /* Schedule */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;=Breaking news:=&lt;br /&gt;
&lt;br /&gt;
* Homework 1 has been evaluated and sent to you. If you did not receive it, please contact us. &lt;br /&gt;
* Here you find the MCQ proposed last year &lt;br /&gt;
[https://colab.research.google.com/drive/1Ru_-IQ001XEJd9VAn4nvbBNI_3XA9QSK?usp=sharing The Quiz]&lt;br /&gt;
&lt;br /&gt;
= Computational and Data Driven Physics =&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Modern physics is characterized by an increasing complexity of systems under investigation, in&lt;br /&gt;
domains as diverse as condensed matter, astrophysics, biophysics, etc. Establishing adequate&lt;br /&gt;
models to describe these systems and being able to make quantitative predictions from those models&lt;br /&gt;
is extremely challenging. The goal of the course is to provide the tools and concepts necessary to tackle those systems.&lt;br /&gt;
&lt;br /&gt;
== Course description ==&lt;br /&gt;
&lt;br /&gt;
We will first cover many algorithms used in many-body problems and complex systems, with special emphasis on Monte Carlo methods, molecular dynamics, and optimization in complex landscapes. &lt;br /&gt;
&lt;br /&gt;
Second, we will provide statistical inference and machine learning tools to harness the growing availability of experimental data to design accurate models of the underlying, complex, strongly non-homogeneous and interacting systems. &lt;br /&gt;
&lt;br /&gt;
Each theoretical lecture will be followed by a tutorial illustrating the concepts with practical applications&lt;br /&gt;
borrowed from various domains of physics. We will focus on methods and algorithms and physics, not&lt;br /&gt;
on programming and heavy numerics!  You will have to hand in 3 homeworks.&lt;br /&gt;
&lt;br /&gt;
*[https://drive.google.com/file/d/11w7KI5Pi59VWLX1mqiQ8ZyY8YQHRUeMz/view?usp=sharing Preliminary version of the book: Information, Inference, Networks: From statistical physics to big biological data]&lt;br /&gt;
&lt;br /&gt;
== The Team ==&lt;br /&gt;
&lt;br /&gt;
* [http://lptms.u-psud.fr/alberto_rosso/ Alberto Rosso] (Computational physics)&lt;br /&gt;
* [http://www.phys.ens.fr/~monasson/ Rémi Monasson] (Data-driven physics)&lt;br /&gt;
*  [http://www.lps.ens.fr/~cocco/ Simona Cocco] &amp;amp; [https://www.pct.espci.fr/~david/ David Lacoste] &amp;amp; [https://www.cpht.polytechnique.fr/?q=en/node/110 Michel Ferrero] (Tutorials)&lt;br /&gt;
&lt;br /&gt;
== Where and When ==&lt;br /&gt;
&lt;br /&gt;
* Lectures on Fridays: 14:00-16:00&lt;br /&gt;
* Tutorials on Fridays: 16:00-18:00&lt;br /&gt;
* ENS, 29 rue D&#039;Ulm, salle Borel + Djebar&lt;br /&gt;
&lt;br /&gt;
== Slack ==&lt;br /&gt;
&lt;br /&gt;
If you have questions or want to discuss topics related to the lecture, to the exercises or to the homeworks, you can use the&lt;br /&gt;
[http://computational-ozw2847.slack.com Computational and Data Driven Physics Slack]. In order to join the Slack&lt;br /&gt;
use the following [https://join.slack.com/t/computational-ozw2847/shared_invite/zt-vegija8y-cx_vbF2BI6FJewx4W6coSA invitation link].&lt;br /&gt;
&lt;br /&gt;
== Computer Requirements ==&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;No previous experience in programming is required.&#039;&#039;&#039; &amp;lt;br&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Programming Language: Python&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
For practical installation, we recommand either to use  Anaconda (See [[Memento Python]]) or use google colab. &amp;lt;br&amp;gt;&lt;br /&gt;
The Collaboratory platform from Google is quite good way to use powerful computer without buying one: It requires no specific hardware or software, and even allows you to use GPU computing for free,  all by writting a jupyter notebook that you can then share.&lt;br /&gt;
&lt;br /&gt;
== Grading ==&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Computational Physics:&#039;&#039;&#039;&lt;br /&gt;
* Homework 1: 5 points &lt;br /&gt;
* Homework 2: 5 points&lt;br /&gt;
* Multiple Choice Questions in November: 10 points&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Data Driven Physics:&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Final exam in January: 20 points&lt;br /&gt;
&lt;br /&gt;
== Schedule ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 3, 2021 &#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1X9h3lKD0OZLTKtxb7DWPfynY42rRuE7j/view?usp=sharing Lecture 1]   Introduction to Monte Carlo&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1sIv3qOdyE-XYkjYC-dkNsR72f4BgaQ_y/view?usp=sharing Tutorial 1] Markov Matrix&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 10, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Introductory notebooks: [https://colab.research.google.com/drive/1Ovrh1JjLzMMnxtasDgR1j84CHGU6hMxA python], [https://colab.research.google.com/drive/14PWu-C171pYhV8ven-Txc4wz5Tv1DCsK numpy] and [https://colab.research.google.com/drive/1fPjwrdxQPSyfXniyAHmyOcF_gK2fqjts matplotlib]&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1gf7oRQIpvSvMScyJa5hexB9CCZvdozPs#scrollTo=lDznlLouvlFx Tutorial 2] - Markov matrices ([https://colab.research.google.com/drive/1x9iEHG_F522uFCvD_jGdvHaMETAHfO6-#scrollTo=eSu-nLZ6vm8X solutions])&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1tjqbjAi50C4qOqVRtTxEkTeTb10qpTms#scrollTo=uYpaubGkvogU Tutorial 3] - Thumb rule ([https://colab.research.google.com/drive/1aWVtz4ZGcpIarWiRVAnxrp1t0GDOqZxu#scrollTo=f7ohlMuZvqTr solutions])&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1g7HXFUBQUBF0fhy5h2jYbfIAVBTqvb7-#scrollTo=U9LFX8OFhHOG Homework 1] (deadline October 1)&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
* [https://colab.research.google.com/drive/1aMo4Ur-0_b4dGhdIfxAmCC2ci1rOda_v?usp=sharing Tutorial 2] Markov matrix [https://colab.research.google.com/drive/1Q5ajzxRGXBBorA9cQ9o8V5VUVJhUXpPS?usp=sharing problems]&lt;br /&gt;
* [https://colab.research.google.com/drive/1k60-ChM3aUWjGsiRsf2Idx9jxHHtwyAb?usp=sharing Tutorial 3] Thumb rule [https://colab.research.google.com/drive/1fdKJlp0lD4k530oRuu50_Hm_T8t3jixa?usp=sharing problems]&lt;br /&gt;
--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 17, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/15wrgivn6FSnuBUnMwjjhadmD-g1fkS7T/view?usp=sharing Lecture 2] Basic Sampling&lt;br /&gt;
&lt;br /&gt;
*  [https://drive.google.com/file/d/1ALR_QKLXdHby54xNux39NUOk4L-Ne1EW/view?usp=sharing  Lecture 3]: Errors and Precision&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 24, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1DijhG_856OAuj42WqY1UM47APmMy3A8B/view?usp=sharing Lecture 4]: Ising model and phase transitions &lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1sRUEs768Z6PKdJ3k7MixYeFGlufgjFrG Tutorial 4]: Ising model and phase transitions ([https://colab.research.google.com/drive/1KAQRog_YlAjKZ_hL1FMYurWdPBLNUocI solutions])&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
* [https://colab.research.google.com/drive/1nU4E_pFWjSFPNigzy8-LcJpef26IKY6x?usp=sharing Tutorial 4]: Ising model and phase transitions [https://colab.research.google.com/drive/1AEUX3U7hxDR_YYy8ld3knTEVR1KYa9SP?usp=sharing problems] &lt;br /&gt;
--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 1, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1PTya42ZS2kU87A-BxQFFIUDTs_k47men?usp=sharing Lecture 5]: Optimization &amp;amp; Dijkstra algorithm&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1ieT5BlfJsOehsa8r-LHGsFsn1dwYnawT Tutorial 5]: Simulated annealing ([https://colab.research.google.com/drive/1JNVl42KNASZiwTtqYo71z_vggjbGfKul solutions])&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
* [https://colab.research.google.com/drive/1p0ooWAXF9KNh-FztMHmVoA9yBzYOM8PC?usp=sharing Tutorial 5]: Simulated annealing [https://colab.research.google.com/drive/1txJGpzreHurWux7ev6sDsX8TjzpeQhZZ?usp=sharing problems]&lt;br /&gt;
--&amp;gt;&lt;br /&gt;
* Send your copy of Homework 1 to numphys.icfp  at   gmail.com  Thanks!&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1EPgj3la7vxDIqSQYNlOFz4rR0vHXAeae Homework 2] (deadline October 22)&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 8, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 6: Introduction to Bayesian inference&lt;br /&gt;
&lt;br /&gt;
* Tutorial 6: Bayesian inference and single-particle tracking. [https://drive.google.com/file/d/1q9Quq5mvJ4Avv2qWgzTocU-DVIxJIVWi/view?usp=sharing Questions]. [https://drive.google.com/file/d/1xYb4wfNBysse6Q7frTw_V9TPdUQU5lUx/view?usp=sharing Data]. [https://drive.google.com/file/d/1Ba_kRo3_XMIaDLNYZlbZEw-wGXKS-29I/view?usp=sharing Starting Notebook]. [https://colab.research.google.com/drive/1VePL9X1JT6yl8LmROeZyMyf4Epcu3yOL#scrollTo=1XQNGa_fyEkJ Google colab version]. Solutions [https://drive.google.com/file/d/1Q9IjVUeL7AA8uWk8DX9Vy9vuUQ21RYh2/view?usp=sharing]. Notebook [https://drive.google.com/file/d/1ZJmpdaTQVUttEaaI1ch-reFfZGI93454/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 15, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1eY5cuNcJqYw7df0PBkxq03tEnqzTOC-5/view?usp=sharing Lecture 7]: Importance sampling&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1iaOGxdVgk--kWUFcMDHs0zvPhsOyhB_c Tutorial 7]: Faster than the clock algorithms ([https://colab.research.google.com/drive/1bHPnJpBd5ExqKF4G5BuV_FHPE4r0_AY2#scrollTo=fQnz_gOeq40e solutions])&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
* [https://colab.research.google.com/drive/1KyT442vB4EuGKBy_Xj3j8cLtMMl4gbac?usp=sharing Tutorial 6]: Faster than the clock algorithms [https://colab.research.google.com/drive/1C-ieAwaAKwkX5MFm8aX2kNO2GNeO9CdY?usp=sharing problems]&lt;br /&gt;
--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 22, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 8: Asymptotic inference and information. Extra material: Proof of Cramer-Rao bound [https://drive.google.com/file/d/10Ph_iP6AIQ3ps9v3FwRBO9j6-qV7oKV9/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
* Tutorial 8: [https://drive.google.com/file/d/12cG4HBvzs9Oe1mbfuEYyRDmTEamW71pR/view?usp=sharing Questions]. [https://drive.google.com/file/d/1AL8sRtnqYUI8NbubfglgLazknaVIUJEo/view?usp=sharing Data ] [https://drive.google.com/file/d/1DTLzXLZUEPzoU2SsDMcAe8GaoYX8E5gH/view?usp=sharing Starting Notebook]. [https://drive.google.com/file/d/1QpMaM5ACmKUlFAyGvRnHvFVtQoEAF7-9/view?usp=sharing Bibliography] [https://drive.google.com/file/d/1p9v1PkJhwS8Ofg4RiC1nsFJAe8Mb_6WF/view?usp=sharing Solutions].  [https://drive.google.com/file/d/19erJJ4Gjw77n57VrnqaQPCxIh_-NScYT/view?usp=sharing Notebook].&lt;br /&gt;
&lt;br /&gt;
* Send your copy of Homework 2 to numphys.icfp  at   gmail.com  Thanks!&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 29, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 9: High-dimensional inference and Principal Component Analysis. Extra material: Handwritten notes on the derivation of Marcenko-Pastur spectral density [https://drive.google.com/file/d/10Yytv9itdWDDHTsM2lQHwQDMbcf-oVnd/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
* Tutorial 9: [https://drive.google.com/file/d/10y7m1mPf5R5zZN6661Eei92IUNhBL_Zu/view?usp=sharing  Replay of the neuronal activity during sleep after a task].[https://drive.google.com/file/d/11fO26XB6Ri3HDVBvtdBkYxcTRLk1iv5F/view?usp=sharing Data ]. [https://drive.google.com/file/d/1-MFN2ERs_eNs4w6XnLjfzsu2F9REluSt/view?usp=sharing Initial Notebook]. [https://drive.google.com/file/d/11ev4Zwn6DPYLwhMsLyp8S0aQFVu77Ou3/view?usp=sharing Biblio]. &lt;br /&gt;
[https://drive.google.com/file/d/11E75QwrJgDKrutGj9t5NJTRkGtuRgoBI/view?usp=sharing Solutions]. [https://drive.google.com/file/d/1-39oZNNB-35zM4V2tLWtubQnZTdMLtIz/view?usp=sharing Notebook]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, November 12, 2021, 2 pm: The Quiz.&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
The MCQ is composed of 19 questions (one of them counts for two). For each question you have 4 choices: 3 wrong and 1 correct.&lt;br /&gt;
&lt;br /&gt;
If you check the correct one you get a point.&lt;br /&gt;
&lt;br /&gt;
If you are wrong you loose 1/4 of a point. &lt;br /&gt;
&lt;br /&gt;
No answer given: zero points.&lt;br /&gt;
&lt;br /&gt;
The Zoom link ??? (update soon) . I will be there starting from 13h30, we will discuss the rules and I will be there to help you if you face a problem.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Time schedule&lt;br /&gt;
&lt;br /&gt;
    The exam starts at 14h00: you download your Notebook of questions from the Google Drive directory that brings your name.&lt;br /&gt;
&lt;br /&gt;
    Name the file with your answers as familyname_name.txt.&lt;br /&gt;
&lt;br /&gt;
    The answers should be presented in the following format:&lt;br /&gt;
&lt;br /&gt;
1 A&lt;br /&gt;
&lt;br /&gt;
2 B&lt;br /&gt;
&lt;br /&gt;
4 C&lt;br /&gt;
&lt;br /&gt;
(if you do not want to answer a question - as question 3 here -  do not add the corresponding number)&lt;br /&gt;
&lt;br /&gt;
    Send the file with your answers at numphys.icfp@gmail.com before 4 pm. &lt;br /&gt;
&lt;br /&gt;
Rules&lt;br /&gt;
&lt;br /&gt;
    You are allowed to use all material you think useful.&lt;br /&gt;
&lt;br /&gt;
    You are not allowed to communicate with other people. Questions will be randomised to make hard life of cheaters, but please do not be one of them! &lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
GOOD LUCK! &lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, November 26, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 10: Priors, regularisation, sparsity&lt;br /&gt;
&lt;br /&gt;
* Tutorial 10:&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, December 3, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 11: Network inference&lt;br /&gt;
&lt;br /&gt;
* Tutorial 11:&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, December 10, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 12: Supervised learning and phase transitions&lt;br /&gt;
&lt;br /&gt;
* Tutorial 12:&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, December 17, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 13: Unsupervised learning and representations&lt;br /&gt;
&lt;br /&gt;
* Tutorial 13:&lt;/div&gt;</summary>
		<author><name>Alberto</name></author>
	</entry>
	<entry>
		<id>http://www.lptms.universite-paris-saclay.fr//wiki-cours/index.php?title=CoDaDri&amp;diff=1673</id>
		<title>CoDaDri</title>
		<link rel="alternate" type="text/html" href="http://www.lptms.universite-paris-saclay.fr//wiki-cours/index.php?title=CoDaDri&amp;diff=1673"/>
		<updated>2021-11-05T18:17:17Z</updated>

		<summary type="html">&lt;p&gt;Alberto: /* Schedule */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;=Breaking news:=&lt;br /&gt;
&lt;br /&gt;
* Homework 1 has been evaluated and sent to you. If you did not receive it, please contact us. &lt;br /&gt;
* Here you find the MCQ proposed last year &lt;br /&gt;
[https://colab.research.google.com/drive/1Ru_-IQ001XEJd9VAn4nvbBNI_3XA9QSK?usp=sharing The Quiz]&lt;br /&gt;
&lt;br /&gt;
= Computational and Data Driven Physics =&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Modern physics is characterized by an increasing complexity of systems under investigation, in&lt;br /&gt;
domains as diverse as condensed matter, astrophysics, biophysics, etc. Establishing adequate&lt;br /&gt;
models to describe these systems and being able to make quantitative predictions from those models&lt;br /&gt;
is extremely challenging. The goal of the course is to provide the tools and concepts necessary to tackle those systems.&lt;br /&gt;
&lt;br /&gt;
== Course description ==&lt;br /&gt;
&lt;br /&gt;
We will first cover many algorithms used in many-body problems and complex systems, with special emphasis on Monte Carlo methods, molecular dynamics, and optimization in complex landscapes. &lt;br /&gt;
&lt;br /&gt;
Second, we will provide statistical inference and machine learning tools to harness the growing availability of experimental data to design accurate models of the underlying, complex, strongly non-homogeneous and interacting systems. &lt;br /&gt;
&lt;br /&gt;
Each theoretical lecture will be followed by a tutorial illustrating the concepts with practical applications&lt;br /&gt;
borrowed from various domains of physics. We will focus on methods and algorithms and physics, not&lt;br /&gt;
on programming and heavy numerics!  You will have to hand in 3 homeworks.&lt;br /&gt;
&lt;br /&gt;
*[https://drive.google.com/file/d/11w7KI5Pi59VWLX1mqiQ8ZyY8YQHRUeMz/view?usp=sharing Preliminary version of the book: Information, Inference, Networks: From statistical physics to big biological data]&lt;br /&gt;
&lt;br /&gt;
== The Team ==&lt;br /&gt;
&lt;br /&gt;
* [http://lptms.u-psud.fr/alberto_rosso/ Alberto Rosso] (Computational physics)&lt;br /&gt;
* [http://www.phys.ens.fr/~monasson/ Rémi Monasson] (Data-driven physics)&lt;br /&gt;
*  [http://www.lps.ens.fr/~cocco/ Simona Cocco] &amp;amp; [https://www.pct.espci.fr/~david/ David Lacoste] &amp;amp; [https://www.cpht.polytechnique.fr/?q=en/node/110 Michel Ferrero] (Tutorials)&lt;br /&gt;
&lt;br /&gt;
== Where and When ==&lt;br /&gt;
&lt;br /&gt;
* Lectures on Fridays: 14:00-16:00&lt;br /&gt;
* Tutorials on Fridays: 16:00-18:00&lt;br /&gt;
* ENS, 29 rue D&#039;Ulm, salle Borel + Djebar&lt;br /&gt;
&lt;br /&gt;
== Slack ==&lt;br /&gt;
&lt;br /&gt;
If you have questions or want to discuss topics related to the lecture, to the exercises or to the homeworks, you can use the&lt;br /&gt;
[http://computational-ozw2847.slack.com Computational and Data Driven Physics Slack]. In order to join the Slack&lt;br /&gt;
use the following [https://join.slack.com/t/computational-ozw2847/shared_invite/zt-vegija8y-cx_vbF2BI6FJewx4W6coSA invitation link].&lt;br /&gt;
&lt;br /&gt;
== Computer Requirements ==&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;No previous experience in programming is required.&#039;&#039;&#039; &amp;lt;br&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Programming Language: Python&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
For practical installation, we recommand either to use  Anaconda (See [[Memento Python]]) or use google colab. &amp;lt;br&amp;gt;&lt;br /&gt;
The Collaboratory platform from Google is quite good way to use powerful computer without buying one: It requires no specific hardware or software, and even allows you to use GPU computing for free,  all by writting a jupyter notebook that you can then share.&lt;br /&gt;
&lt;br /&gt;
== Grading ==&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Computational Physics:&#039;&#039;&#039;&lt;br /&gt;
* Homework 1: 5 points &lt;br /&gt;
* Homework 2: 5 points&lt;br /&gt;
* Multiple Choice Questions in November: 10 points&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Data Driven Physics:&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Final exam in January: 20 points&lt;br /&gt;
&lt;br /&gt;
== Schedule ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 3, 2021 &#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1X9h3lKD0OZLTKtxb7DWPfynY42rRuE7j/view?usp=sharing Lecture 1]   Introduction to Monte Carlo&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1sIv3qOdyE-XYkjYC-dkNsR72f4BgaQ_y/view?usp=sharing Tutorial 1] Markov Matrix&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 10, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Introductory notebooks: [https://colab.research.google.com/drive/1Ovrh1JjLzMMnxtasDgR1j84CHGU6hMxA python], [https://colab.research.google.com/drive/14PWu-C171pYhV8ven-Txc4wz5Tv1DCsK numpy] and [https://colab.research.google.com/drive/1fPjwrdxQPSyfXniyAHmyOcF_gK2fqjts matplotlib]&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1gf7oRQIpvSvMScyJa5hexB9CCZvdozPs#scrollTo=lDznlLouvlFx Tutorial 2] - Markov matrices ([https://colab.research.google.com/drive/1x9iEHG_F522uFCvD_jGdvHaMETAHfO6-#scrollTo=eSu-nLZ6vm8X solutions])&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1tjqbjAi50C4qOqVRtTxEkTeTb10qpTms#scrollTo=uYpaubGkvogU Tutorial 3] - Thumb rule ([https://colab.research.google.com/drive/1aWVtz4ZGcpIarWiRVAnxrp1t0GDOqZxu#scrollTo=f7ohlMuZvqTr solutions])&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1g7HXFUBQUBF0fhy5h2jYbfIAVBTqvb7-#scrollTo=U9LFX8OFhHOG Homework 1] (deadline October 1)&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
* [https://colab.research.google.com/drive/1aMo4Ur-0_b4dGhdIfxAmCC2ci1rOda_v?usp=sharing Tutorial 2] Markov matrix [https://colab.research.google.com/drive/1Q5ajzxRGXBBorA9cQ9o8V5VUVJhUXpPS?usp=sharing problems]&lt;br /&gt;
* [https://colab.research.google.com/drive/1k60-ChM3aUWjGsiRsf2Idx9jxHHtwyAb?usp=sharing Tutorial 3] Thumb rule [https://colab.research.google.com/drive/1fdKJlp0lD4k530oRuu50_Hm_T8t3jixa?usp=sharing problems]&lt;br /&gt;
--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 17, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/15wrgivn6FSnuBUnMwjjhadmD-g1fkS7T/view?usp=sharing Lecture 2] Basic Sampling&lt;br /&gt;
&lt;br /&gt;
*  [https://drive.google.com/file/d/1ALR_QKLXdHby54xNux39NUOk4L-Ne1EW/view?usp=sharing  Lecture 3]: Errors and Precision&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 24, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1DijhG_856OAuj42WqY1UM47APmMy3A8B/view?usp=sharing Lecture 4]: Ising model and phase transitions &lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1sRUEs768Z6PKdJ3k7MixYeFGlufgjFrG Tutorial 4]: Ising model and phase transitions ([https://colab.research.google.com/drive/1KAQRog_YlAjKZ_hL1FMYurWdPBLNUocI solutions])&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
* [https://colab.research.google.com/drive/1nU4E_pFWjSFPNigzy8-LcJpef26IKY6x?usp=sharing Tutorial 4]: Ising model and phase transitions [https://colab.research.google.com/drive/1AEUX3U7hxDR_YYy8ld3knTEVR1KYa9SP?usp=sharing problems] &lt;br /&gt;
--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 1, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1PTya42ZS2kU87A-BxQFFIUDTs_k47men?usp=sharing Lecture 5]: Optimization &amp;amp; Dijkstra algorithm&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1ieT5BlfJsOehsa8r-LHGsFsn1dwYnawT Tutorial 5]: Simulated annealing ([https://colab.research.google.com/drive/1JNVl42KNASZiwTtqYo71z_vggjbGfKul solutions])&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
* [https://colab.research.google.com/drive/1p0ooWAXF9KNh-FztMHmVoA9yBzYOM8PC?usp=sharing Tutorial 5]: Simulated annealing [https://colab.research.google.com/drive/1txJGpzreHurWux7ev6sDsX8TjzpeQhZZ?usp=sharing problems]&lt;br /&gt;
--&amp;gt;&lt;br /&gt;
* Send your copy of Homework 1 to numphys.icfp  at   gmail.com  Thanks!&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1EPgj3la7vxDIqSQYNlOFz4rR0vHXAeae Homework 2] (deadline October 22)&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 8, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 6: Introduction to Bayesian inference&lt;br /&gt;
&lt;br /&gt;
* Tutorial 6: Bayesian inference and single-particle tracking. [https://drive.google.com/file/d/1q9Quq5mvJ4Avv2qWgzTocU-DVIxJIVWi/view?usp=sharing Questions]. [https://drive.google.com/file/d/1xYb4wfNBysse6Q7frTw_V9TPdUQU5lUx/view?usp=sharing Data]. [https://drive.google.com/file/d/1Ba_kRo3_XMIaDLNYZlbZEw-wGXKS-29I/view?usp=sharing Starting Notebook]. [https://colab.research.google.com/drive/1VePL9X1JT6yl8LmROeZyMyf4Epcu3yOL#scrollTo=1XQNGa_fyEkJ Google colab version]. Solutions [https://drive.google.com/file/d/1Q9IjVUeL7AA8uWk8DX9Vy9vuUQ21RYh2/view?usp=sharing]. Notebook [https://drive.google.com/file/d/1ZJmpdaTQVUttEaaI1ch-reFfZGI93454/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 15, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1eY5cuNcJqYw7df0PBkxq03tEnqzTOC-5/view?usp=sharing Lecture 7]: Importance sampling&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1iaOGxdVgk--kWUFcMDHs0zvPhsOyhB_c Tutorial 7]: Faster than the clock algorithms ([https://colab.research.google.com/drive/1bHPnJpBd5ExqKF4G5BuV_FHPE4r0_AY2#scrollTo=fQnz_gOeq40e solutions])&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
* [https://colab.research.google.com/drive/1KyT442vB4EuGKBy_Xj3j8cLtMMl4gbac?usp=sharing Tutorial 6]: Faster than the clock algorithms [https://colab.research.google.com/drive/1C-ieAwaAKwkX5MFm8aX2kNO2GNeO9CdY?usp=sharing problems]&lt;br /&gt;
--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 22, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 8: Asymptotic inference and information. Extra material: Proof of Cramer-Rao bound [https://drive.google.com/file/d/10Ph_iP6AIQ3ps9v3FwRBO9j6-qV7oKV9/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
* Tutorial 8: [https://drive.google.com/file/d/12cG4HBvzs9Oe1mbfuEYyRDmTEamW71pR/view?usp=sharing Questions]. [https://drive.google.com/file/d/1AL8sRtnqYUI8NbubfglgLazknaVIUJEo/view?usp=sharing Data ] [https://drive.google.com/file/d/1DTLzXLZUEPzoU2SsDMcAe8GaoYX8E5gH/view?usp=sharing Starting Notebook]. [https://drive.google.com/file/d/1QpMaM5ACmKUlFAyGvRnHvFVtQoEAF7-9/view?usp=sharing Bibliography] [https://drive.google.com/file/d/1p9v1PkJhwS8Ofg4RiC1nsFJAe8Mb_6WF/view?usp=sharing Solutions].  [https://drive.google.com/file/d/19erJJ4Gjw77n57VrnqaQPCxIh_-NScYT/view?usp=sharing Notebook].&lt;br /&gt;
&lt;br /&gt;
* Send your copy of Homework 2 to numphys.icfp  at   gmail.com  Thanks!&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 29, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 9: High-dimensional inference and Principal Component Analysis. Extra material: Handwritten notes on the derivation of Marcenko-Pastur spectral density [https://drive.google.com/file/d/10Yytv9itdWDDHTsM2lQHwQDMbcf-oVnd/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
* Tutorial 9: [https://drive.google.com/file/d/10y7m1mPf5R5zZN6661Eei92IUNhBL_Zu/view?usp=sharing  Replay of the neuronal activity during sleep after a task].[https://drive.google.com/file/d/11fO26XB6Ri3HDVBvtdBkYxcTRLk1iv5F/view?usp=sharing Data ]. [https://drive.google.com/file/d/1-MFN2ERs_eNs4w6XnLjfzsu2F9REluSt/view?usp=sharing Initial Notebook]. [https://drive.google.com/file/d/11ev4Zwn6DPYLwhMsLyp8S0aQFVu77Ou3/view?usp=sharing Biblio]. &lt;br /&gt;
[https://drive.google.com/file/d/11E75QwrJgDKrutGj9t5NJTRkGtuRgoBI/view?usp=sharing Solutions]. [https://drive.google.com/file/d/1-39oZNNB-35zM4V2tLWtubQnZTdMLtIz/view?usp=sharing Notebook]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, November 12, 2021, 2 pm: The Quiz.&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
The MCQ is composed of 19 questions (one of them counts for two). For each question you have 4 choices: 3 wrong and 1 correct.&lt;br /&gt;
- If you check the correct one you get a point.&lt;br /&gt;
- If you are wrong you loose 1/4 of a point. &lt;br /&gt;
- No answer given: zero points.&lt;br /&gt;
&lt;br /&gt;
The Zoom link ??? (update soon) . I will be there starting from 13h30, we will discuss the rules and I will be there to help you if you face a problem.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Time schedule&lt;br /&gt;
&lt;br /&gt;
    The exam starts at 14h00: you download your Notebook of questions from the Google Drive directory that brings your name.&lt;br /&gt;
&lt;br /&gt;
    Name the file with your answers as familyname_name.txt.&lt;br /&gt;
&lt;br /&gt;
    The answers should be presented in the following format:&lt;br /&gt;
&lt;br /&gt;
1 A&lt;br /&gt;
&lt;br /&gt;
2 B&lt;br /&gt;
&lt;br /&gt;
4 C&lt;br /&gt;
&lt;br /&gt;
(if you do not want to answer a question - as question 3 here -  do not add the corresponding number)&lt;br /&gt;
&lt;br /&gt;
    Send the file with your answers at numphys.icfp@gmail.com before 4 pm. &lt;br /&gt;
&lt;br /&gt;
Rules&lt;br /&gt;
&lt;br /&gt;
    You are allowed to use all material you think useful.&lt;br /&gt;
&lt;br /&gt;
    You are not allowed to communicate with other people. Questions will be randomised to make hard life of cheaters, but please do not be one of them! &lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
GOOD LUCK! &lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, November 26, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 10: Priors, regularisation, sparsity&lt;br /&gt;
&lt;br /&gt;
* Tutorial 10:&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, December 3, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 11: Network inference&lt;br /&gt;
&lt;br /&gt;
* Tutorial 11:&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, December 10, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 12: Supervised learning and phase transitions&lt;br /&gt;
&lt;br /&gt;
* Tutorial 12:&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, December 17, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 13: Unsupervised learning and representations&lt;br /&gt;
&lt;br /&gt;
* Tutorial 13:&lt;/div&gt;</summary>
		<author><name>Alberto</name></author>
	</entry>
	<entry>
		<id>http://www.lptms.universite-paris-saclay.fr//wiki-cours/index.php?title=CoDaDri&amp;diff=1672</id>
		<title>CoDaDri</title>
		<link rel="alternate" type="text/html" href="http://www.lptms.universite-paris-saclay.fr//wiki-cours/index.php?title=CoDaDri&amp;diff=1672"/>
		<updated>2021-11-05T18:16:06Z</updated>

		<summary type="html">&lt;p&gt;Alberto: /* Schedule */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;=Breaking news:=&lt;br /&gt;
&lt;br /&gt;
* Homework 1 has been evaluated and sent to you. If you did not receive it, please contact us. &lt;br /&gt;
* Here you find the MCQ proposed last year &lt;br /&gt;
[https://colab.research.google.com/drive/1Ru_-IQ001XEJd9VAn4nvbBNI_3XA9QSK?usp=sharing The Quiz]&lt;br /&gt;
&lt;br /&gt;
= Computational and Data Driven Physics =&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Modern physics is characterized by an increasing complexity of systems under investigation, in&lt;br /&gt;
domains as diverse as condensed matter, astrophysics, biophysics, etc. Establishing adequate&lt;br /&gt;
models to describe these systems and being able to make quantitative predictions from those models&lt;br /&gt;
is extremely challenging. The goal of the course is to provide the tools and concepts necessary to tackle those systems.&lt;br /&gt;
&lt;br /&gt;
== Course description ==&lt;br /&gt;
&lt;br /&gt;
We will first cover many algorithms used in many-body problems and complex systems, with special emphasis on Monte Carlo methods, molecular dynamics, and optimization in complex landscapes. &lt;br /&gt;
&lt;br /&gt;
Second, we will provide statistical inference and machine learning tools to harness the growing availability of experimental data to design accurate models of the underlying, complex, strongly non-homogeneous and interacting systems. &lt;br /&gt;
&lt;br /&gt;
Each theoretical lecture will be followed by a tutorial illustrating the concepts with practical applications&lt;br /&gt;
borrowed from various domains of physics. We will focus on methods and algorithms and physics, not&lt;br /&gt;
on programming and heavy numerics!  You will have to hand in 3 homeworks.&lt;br /&gt;
&lt;br /&gt;
*[https://drive.google.com/file/d/11w7KI5Pi59VWLX1mqiQ8ZyY8YQHRUeMz/view?usp=sharing Preliminary version of the book: Information, Inference, Networks: From statistical physics to big biological data]&lt;br /&gt;
&lt;br /&gt;
== The Team ==&lt;br /&gt;
&lt;br /&gt;
* [http://lptms.u-psud.fr/alberto_rosso/ Alberto Rosso] (Computational physics)&lt;br /&gt;
* [http://www.phys.ens.fr/~monasson/ Rémi Monasson] (Data-driven physics)&lt;br /&gt;
*  [http://www.lps.ens.fr/~cocco/ Simona Cocco] &amp;amp; [https://www.pct.espci.fr/~david/ David Lacoste] &amp;amp; [https://www.cpht.polytechnique.fr/?q=en/node/110 Michel Ferrero] (Tutorials)&lt;br /&gt;
&lt;br /&gt;
== Where and When ==&lt;br /&gt;
&lt;br /&gt;
* Lectures on Fridays: 14:00-16:00&lt;br /&gt;
* Tutorials on Fridays: 16:00-18:00&lt;br /&gt;
* ENS, 29 rue D&#039;Ulm, salle Borel + Djebar&lt;br /&gt;
&lt;br /&gt;
== Slack ==&lt;br /&gt;
&lt;br /&gt;
If you have questions or want to discuss topics related to the lecture, to the exercises or to the homeworks, you can use the&lt;br /&gt;
[http://computational-ozw2847.slack.com Computational and Data Driven Physics Slack]. In order to join the Slack&lt;br /&gt;
use the following [https://join.slack.com/t/computational-ozw2847/shared_invite/zt-vegija8y-cx_vbF2BI6FJewx4W6coSA invitation link].&lt;br /&gt;
&lt;br /&gt;
== Computer Requirements ==&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;No previous experience in programming is required.&#039;&#039;&#039; &amp;lt;br&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Programming Language: Python&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
For practical installation, we recommand either to use  Anaconda (See [[Memento Python]]) or use google colab. &amp;lt;br&amp;gt;&lt;br /&gt;
The Collaboratory platform from Google is quite good way to use powerful computer without buying one: It requires no specific hardware or software, and even allows you to use GPU computing for free,  all by writting a jupyter notebook that you can then share.&lt;br /&gt;
&lt;br /&gt;
== Grading ==&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Computational Physics:&#039;&#039;&#039;&lt;br /&gt;
* Homework 1: 5 points &lt;br /&gt;
* Homework 2: 5 points&lt;br /&gt;
* Multiple Choice Questions in November: 10 points&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Data Driven Physics:&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Final exam in January: 20 points&lt;br /&gt;
&lt;br /&gt;
== Schedule ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 3, 2021 &#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1X9h3lKD0OZLTKtxb7DWPfynY42rRuE7j/view?usp=sharing Lecture 1]   Introduction to Monte Carlo&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1sIv3qOdyE-XYkjYC-dkNsR72f4BgaQ_y/view?usp=sharing Tutorial 1] Markov Matrix&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 10, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Introductory notebooks: [https://colab.research.google.com/drive/1Ovrh1JjLzMMnxtasDgR1j84CHGU6hMxA python], [https://colab.research.google.com/drive/14PWu-C171pYhV8ven-Txc4wz5Tv1DCsK numpy] and [https://colab.research.google.com/drive/1fPjwrdxQPSyfXniyAHmyOcF_gK2fqjts matplotlib]&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1gf7oRQIpvSvMScyJa5hexB9CCZvdozPs#scrollTo=lDznlLouvlFx Tutorial 2] - Markov matrices ([https://colab.research.google.com/drive/1x9iEHG_F522uFCvD_jGdvHaMETAHfO6-#scrollTo=eSu-nLZ6vm8X solutions])&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1tjqbjAi50C4qOqVRtTxEkTeTb10qpTms#scrollTo=uYpaubGkvogU Tutorial 3] - Thumb rule ([https://colab.research.google.com/drive/1aWVtz4ZGcpIarWiRVAnxrp1t0GDOqZxu#scrollTo=f7ohlMuZvqTr solutions])&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1g7HXFUBQUBF0fhy5h2jYbfIAVBTqvb7-#scrollTo=U9LFX8OFhHOG Homework 1] (deadline October 1)&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
* [https://colab.research.google.com/drive/1aMo4Ur-0_b4dGhdIfxAmCC2ci1rOda_v?usp=sharing Tutorial 2] Markov matrix [https://colab.research.google.com/drive/1Q5ajzxRGXBBorA9cQ9o8V5VUVJhUXpPS?usp=sharing problems]&lt;br /&gt;
* [https://colab.research.google.com/drive/1k60-ChM3aUWjGsiRsf2Idx9jxHHtwyAb?usp=sharing Tutorial 3] Thumb rule [https://colab.research.google.com/drive/1fdKJlp0lD4k530oRuu50_Hm_T8t3jixa?usp=sharing problems]&lt;br /&gt;
--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 17, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/15wrgivn6FSnuBUnMwjjhadmD-g1fkS7T/view?usp=sharing Lecture 2] Basic Sampling&lt;br /&gt;
&lt;br /&gt;
*  [https://drive.google.com/file/d/1ALR_QKLXdHby54xNux39NUOk4L-Ne1EW/view?usp=sharing  Lecture 3]: Errors and Precision&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 24, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1DijhG_856OAuj42WqY1UM47APmMy3A8B/view?usp=sharing Lecture 4]: Ising model and phase transitions &lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1sRUEs768Z6PKdJ3k7MixYeFGlufgjFrG Tutorial 4]: Ising model and phase transitions ([https://colab.research.google.com/drive/1KAQRog_YlAjKZ_hL1FMYurWdPBLNUocI solutions])&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
* [https://colab.research.google.com/drive/1nU4E_pFWjSFPNigzy8-LcJpef26IKY6x?usp=sharing Tutorial 4]: Ising model and phase transitions [https://colab.research.google.com/drive/1AEUX3U7hxDR_YYy8ld3knTEVR1KYa9SP?usp=sharing problems] &lt;br /&gt;
--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 1, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1PTya42ZS2kU87A-BxQFFIUDTs_k47men?usp=sharing Lecture 5]: Optimization &amp;amp; Dijkstra algorithm&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1ieT5BlfJsOehsa8r-LHGsFsn1dwYnawT Tutorial 5]: Simulated annealing ([https://colab.research.google.com/drive/1JNVl42KNASZiwTtqYo71z_vggjbGfKul solutions])&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
* [https://colab.research.google.com/drive/1p0ooWAXF9KNh-FztMHmVoA9yBzYOM8PC?usp=sharing Tutorial 5]: Simulated annealing [https://colab.research.google.com/drive/1txJGpzreHurWux7ev6sDsX8TjzpeQhZZ?usp=sharing problems]&lt;br /&gt;
--&amp;gt;&lt;br /&gt;
* Send your copy of Homework 1 to numphys.icfp  at   gmail.com  Thanks!&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1EPgj3la7vxDIqSQYNlOFz4rR0vHXAeae Homework 2] (deadline October 22)&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 8, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 6: Introduction to Bayesian inference&lt;br /&gt;
&lt;br /&gt;
* Tutorial 6: Bayesian inference and single-particle tracking. [https://drive.google.com/file/d/1q9Quq5mvJ4Avv2qWgzTocU-DVIxJIVWi/view?usp=sharing Questions]. [https://drive.google.com/file/d/1xYb4wfNBysse6Q7frTw_V9TPdUQU5lUx/view?usp=sharing Data]. [https://drive.google.com/file/d/1Ba_kRo3_XMIaDLNYZlbZEw-wGXKS-29I/view?usp=sharing Starting Notebook]. [https://colab.research.google.com/drive/1VePL9X1JT6yl8LmROeZyMyf4Epcu3yOL#scrollTo=1XQNGa_fyEkJ Google colab version]. Solutions [https://drive.google.com/file/d/1Q9IjVUeL7AA8uWk8DX9Vy9vuUQ21RYh2/view?usp=sharing]. Notebook [https://drive.google.com/file/d/1ZJmpdaTQVUttEaaI1ch-reFfZGI93454/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 15, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1eY5cuNcJqYw7df0PBkxq03tEnqzTOC-5/view?usp=sharing Lecture 7]: Importance sampling&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1iaOGxdVgk--kWUFcMDHs0zvPhsOyhB_c Tutorial 7]: Faster than the clock algorithms ([https://colab.research.google.com/drive/1bHPnJpBd5ExqKF4G5BuV_FHPE4r0_AY2#scrollTo=fQnz_gOeq40e solutions])&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
* [https://colab.research.google.com/drive/1KyT442vB4EuGKBy_Xj3j8cLtMMl4gbac?usp=sharing Tutorial 6]: Faster than the clock algorithms [https://colab.research.google.com/drive/1C-ieAwaAKwkX5MFm8aX2kNO2GNeO9CdY?usp=sharing problems]&lt;br /&gt;
--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 22, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 8: Asymptotic inference and information. Extra material: Proof of Cramer-Rao bound [https://drive.google.com/file/d/10Ph_iP6AIQ3ps9v3FwRBO9j6-qV7oKV9/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
* Tutorial 8: [https://drive.google.com/file/d/12cG4HBvzs9Oe1mbfuEYyRDmTEamW71pR/view?usp=sharing Questions]. [https://drive.google.com/file/d/1AL8sRtnqYUI8NbubfglgLazknaVIUJEo/view?usp=sharing Data ] [https://drive.google.com/file/d/1DTLzXLZUEPzoU2SsDMcAe8GaoYX8E5gH/view?usp=sharing Starting Notebook]. [https://drive.google.com/file/d/1QpMaM5ACmKUlFAyGvRnHvFVtQoEAF7-9/view?usp=sharing Bibliography] [https://drive.google.com/file/d/1p9v1PkJhwS8Ofg4RiC1nsFJAe8Mb_6WF/view?usp=sharing Solutions].  [https://drive.google.com/file/d/19erJJ4Gjw77n57VrnqaQPCxIh_-NScYT/view?usp=sharing Notebook].&lt;br /&gt;
&lt;br /&gt;
* Send your copy of Homework 2 to numphys.icfp  at   gmail.com  Thanks!&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 29, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 9: High-dimensional inference and Principal Component Analysis. Extra material: Handwritten notes on the derivation of Marcenko-Pastur spectral density [https://drive.google.com/file/d/10Yytv9itdWDDHTsM2lQHwQDMbcf-oVnd/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
* Tutorial 9: [https://drive.google.com/file/d/10y7m1mPf5R5zZN6661Eei92IUNhBL_Zu/view?usp=sharing  Replay of the neuronal activity during sleep after a task].[https://drive.google.com/file/d/11fO26XB6Ri3HDVBvtdBkYxcTRLk1iv5F/view?usp=sharing Data ]. [https://drive.google.com/file/d/1-MFN2ERs_eNs4w6XnLjfzsu2F9REluSt/view?usp=sharing Initial Notebook]. [https://drive.google.com/file/d/11ev4Zwn6DPYLwhMsLyp8S0aQFVu77Ou3/view?usp=sharing Biblio]. &lt;br /&gt;
[https://drive.google.com/file/d/11E75QwrJgDKrutGj9t5NJTRkGtuRgoBI/view?usp=sharing Solutions]. [https://drive.google.com/file/d/1-39oZNNB-35zM4V2tLWtubQnZTdMLtIz/view?usp=sharing Notebook]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, November 12, 2021, 2 pm: The Quiz.&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
The MCQ is composed of 19 questions (one of them counts for two). For each question you have 4 choices: 3 wrong and 1 correct.&lt;br /&gt;
&lt;br /&gt;
    If you check the correct one you get a point.&lt;br /&gt;
&lt;br /&gt;
    If you are wrong you loose 1/4 of a point. &lt;br /&gt;
&lt;br /&gt;
    No answer given: zero points.&lt;br /&gt;
&lt;br /&gt;
The Zoom link ??? (update soon) . I will be there starting from 13h30, we will discuss the rules and I will be there to help you if you face a problem.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Time schedule&lt;br /&gt;
&lt;br /&gt;
    The exam starts at 14h00: you download your Notebook of questions from the Google Drive directory that brings your name.&lt;br /&gt;
&lt;br /&gt;
    Name the file with your answers as familyname_name.txt.&lt;br /&gt;
&lt;br /&gt;
    The answers should be presented in the following format:&lt;br /&gt;
&lt;br /&gt;
1 A&lt;br /&gt;
&lt;br /&gt;
2 B&lt;br /&gt;
&lt;br /&gt;
4 C&lt;br /&gt;
&lt;br /&gt;
(if you do not want to answer a question - as question 3 here -  do not add the corresponding number)&lt;br /&gt;
&lt;br /&gt;
    Send the file with your answers at numphys.icfp@gmail.com before 4 pm. &lt;br /&gt;
&lt;br /&gt;
Rules&lt;br /&gt;
&lt;br /&gt;
    You are allowed to use all material you think useful.&lt;br /&gt;
&lt;br /&gt;
    You are not allowed to communicate with other people. Questions will be randomised to make hard life of cheaters, but please do not be one of them! &lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
GOOD LUCK! &lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, November 26, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 10: Priors, regularisation, sparsity&lt;br /&gt;
&lt;br /&gt;
* Tutorial 10:&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, December 3, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 11: Network inference&lt;br /&gt;
&lt;br /&gt;
* Tutorial 11:&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, December 10, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 12: Supervised learning and phase transitions&lt;br /&gt;
&lt;br /&gt;
* Tutorial 12:&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, December 17, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 13: Unsupervised learning and representations&lt;br /&gt;
&lt;br /&gt;
* Tutorial 13:&lt;/div&gt;</summary>
		<author><name>Alberto</name></author>
	</entry>
	<entry>
		<id>http://www.lptms.universite-paris-saclay.fr//wiki-cours/index.php?title=NUMPHYsandML&amp;diff=1671</id>
		<title>NUMPHYsandML</title>
		<link rel="alternate" type="text/html" href="http://www.lptms.universite-paris-saclay.fr//wiki-cours/index.php?title=NUMPHYsandML&amp;diff=1671"/>
		<updated>2021-11-04T11:33:32Z</updated>

		<summary type="html">&lt;p&gt;Alberto: /* Schedule */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;= Numerical Physics and Machine Learning =&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== Course description == &lt;br /&gt;
&lt;br /&gt;
We will cover many algothims used in many-body problems and complex systems: Monte Carlo methods, molecular dynamics and  optmization in complex landscapes. We shall also discuss the use of some machine learning algorithms (Boltzmann machines, Auto-encoder, Deep Learning) for physics problems.&lt;br /&gt;
We focus on algorithms and physics, not on programming and heavy numerics. The theoretical lecture is followed by a tutorial introducing concrete numerical exercises. You will have to hand in 3 homeworks.&lt;br /&gt;
&lt;br /&gt;
 &#039;&#039;&#039;Lectures on machine learning will be done remotely. You will be able to access them on https://epfl.zoom.us/my/krzakalaflorent Tutorials will take place as usual on the gotomeeting.&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== The Team ==&lt;br /&gt;
&lt;br /&gt;
* [http://lptms.u-psud.fr/alberto_rosso/ Alberto Rosso] (Numerical Physics)&lt;br /&gt;
* [https://florentkrzakala.com/ Florent Krzakala] (Machine Learning)&lt;br /&gt;
*  Marko Medenjak (Tutorials)&lt;br /&gt;
&lt;br /&gt;
== Where and When ==&lt;br /&gt;
&lt;br /&gt;
* Lectures on Fridays: 14:00-16:00&lt;br /&gt;
* Tutorials on Fridays: 16:00-18:00&lt;br /&gt;
* ENS, 24 rue Lhomond, room L367 (third floor)&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== Computer Requirements ==&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;No previous experience in programming is required.&#039;&#039;&#039; &amp;lt;br&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Programming Language: Python&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
For practical installation, we recommand either to use  Anaconda (See [[Memento Python]]) or use google colab. &amp;lt;br&amp;gt;&lt;br /&gt;
The Colaboratory platform from Google is quite good way to use powerful computer without buying one: It requires no specific hardware or software, and even allows you to use GPU computing for free,  all by writting a jupyter notebook that you can then share.&lt;br /&gt;
&lt;br /&gt;
== Grading ==&lt;br /&gt;
&lt;br /&gt;
Homeworks (50% of the mark) + 1 MCQ (50% of the final mark)&lt;br /&gt;
&lt;br /&gt;
== Schedule ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 4, 2020 &#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
 &lt;br /&gt;
* [https://drive.google.com/file/d/1X9h3lKD0OZLTKtxb7DWPfynY42rRuE7j/view?usp=sharing Lecture 1]   Introduction to Monte Carlo&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1sIv3qOdyE-XYkjYC-dkNsR72f4BgaQ_y/view?usp=sharing Tutorial 1] Markov Matrix&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 11, 2020&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/15wrgivn6FSnuBUnMwjjhadmD-g1fkS7T/view?usp=sharing Lecture 2] Basic Sampling&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1aMo4Ur-0_b4dGhdIfxAmCC2ci1rOda_v?usp=sharing Tutorial 2] Markov matrix [https://colab.research.google.com/drive/1Q5ajzxRGXBBorA9cQ9o8V5VUVJhUXpPS?usp=sharing problems]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 18, 2020&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
*  [https://drive.google.com/file/d/1ALR_QKLXdHby54xNux39NUOk4L-Ne1EW/view?usp=sharing  Lecture 3]: Errors and Precision&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1k60-ChM3aUWjGsiRsf2Idx9jxHHtwyAb?usp=sharing Tutorial 3] Thumb rule [https://colab.research.google.com/drive/1fdKJlp0lD4k530oRuu50_Hm_T8t3jixa?usp=sharing problems]&lt;br /&gt;
&lt;br /&gt;
Homework: [https://drive.google.com/file/d/1g7HXFUBQUBF0fhy5h2jYbfIAVBTqvb7-/view?usp=sharing  Download]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 25, 2020&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1DijhG_856OAuj42WqY1UM47APmMy3A8B/view?usp=sharing Lecture 4]: Ising model and phase transitions &lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1nU4E_pFWjSFPNigzy8-LcJpef26IKY6x?usp=sharing Tutorial 4]: Ising model and phase transitions [https://colab.research.google.com/drive/1AEUX3U7hxDR_YYy8ld3knTEVR1KYa9SP?usp=sharing problems] &lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 2, 2020&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/file/d/1JY7PlB00hGpw1814lUyVor37E-um3xQj/view?usp=sharing Lecture 5]: Quantum particle&lt;br /&gt;
&lt;br /&gt;
[https://colab.research.google.com/drive/1mYLzPTV79kpesX2ZR8LlQfdyGva45o9p?usp=sharing Tutorial 5]: Time evolution (quantum) [https://colab.research.google.com/drive/142acFqwTI91RZT_9gSb1-JHs9rd2PO_E?usp=sharing problems]&lt;br /&gt;
&lt;br /&gt;
Homework 2: [https://drive.google.com/file/d/1lTgHlAvWAKhkZK13_yihmPxGzD3qo7ko/view?usp=sharing Download]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 9, 2020&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/file/d/1eY5cuNcJqYw7df0PBkxq03tEnqzTOC-5/view?usp=sharing Lecture 6]: Importance sampling&lt;br /&gt;
&lt;br /&gt;
[https://colab.research.google.com/drive/1KyT442vB4EuGKBy_Xj3j8cLtMMl4gbac?usp=sharing Tutorial 6]: Faster than the clock algorithms [https://colab.research.google.com/drive/1C-ieAwaAKwkX5MFm8aX2kNO2GNeO9CdY?usp=sharing problems]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039; Friday, October 16, 2020&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;GoToMeeting link&#039;&#039;&#039; [https://global.gotomeeting.com/join/854835733] (Room 1 M2 ICFP)&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[https://drive.google.com/file/d/1qAG8ARVuuXjMzQkU8I92KUEEPZxK5ynr/view?usp=sharing  Lecture 7]: Optimization &amp;amp; Dijkstra algorithm&lt;br /&gt;
&lt;br /&gt;
[https://colab.research.google.com/drive/1p0ooWAXF9KNh-FztMHmVoA9yBzYOM8PC?usp=sharing Tutorial 7]: Simulated annealing [https://colab.research.google.com/drive/1txJGpzreHurWux7ev6sDsX8TjzpeQhZZ?usp=sharing problems]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 23, 2020&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
Lecture 8: Maximum Likelyhood estimation: &lt;br /&gt;
&lt;br /&gt;
[https://colab.research.google.com/drive/1m2YBrQLfhVSMBpTEsfvOf4hXVZplp1D7?usp=sharing#scrollTo=-cLvGNzqh2Ah Tutorial 8]: Maximum Likelyhood estimation [https://colab.research.google.com/drive/1p2ZcgOUPcUS3LGP3k7-N8ZBbA2FM4qrs?usp=sharing problems]&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039; Due: Homework 2   (send it to Marko)&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, November 06, 2020&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
Lecture 9: Restricted Boltzmann machines&lt;br /&gt;
&lt;br /&gt;
[https://colab.research.google.com/drive/1pUeAtNXo-eLyTs9Kl6_fchsqsBxeEiKg?usp=sharing Tutorial 9]: Restricted Boltzmann machines [https://colab.research.google.com/drive/1rctxia3v3y_AMOXYIHh3hL6NuxmbL2CB?usp=sharing problems]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, November 13, 2020&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
[https://colab.research.google.com/drive/1gpDaNKhg3vZqbsYPJqPSZCgboHfgki3F?usp=sharing Tutorial 10]: k-NN and regression [https://colab.research.google.com/drive/1d66oT7a5JuIHgHJjAbEsUQ9IccCrASsk?usp=sharing problems]&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Homework 3&#039;&#039;&#039; Due by December 4, 2020&lt;br /&gt;
[https://colab.research.google.com/drive/1NkJPKqkut-7Vbr-0jtiyi1tXarvxLUsU?usp=sharing Homework]&lt;br /&gt;
[https://drive.google.com/file/d/1Nts8Dc06QjZ7E2uFPj4D6YHVZTTgJeih/view?usp=sharing Data]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, November 27, 2020&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
Tomorrow Florent cannot really give the talk in direct live ... but never fear: &lt;br /&gt;
* he can make a short Q/A tomorrow at, say, 15h or 15H30 &lt;br /&gt;
&lt;br /&gt;
* he registered the whole lecture in video, and put it here:&lt;br /&gt;
&lt;br /&gt;
[https://www.dropbox.com/s/1yvmqbb5bb67w8n/video_lec4.mov?dl=0 Lecture 11] &lt;br /&gt;
&lt;br /&gt;
[https://www.dropbox.com/s/dl31z2306y9salr/ML-lec4.pdf?dl=0 The notes]                    &lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[https://colab.research.google.com/drive/1OfxV5oL-9CVOxuhKgUF8AsboB89fm2xQ?usp=sharing Tutorial 11] Deep neural networks&lt;br /&gt;
[https://colab.research.google.com/drive/1Zblg4v9RE-zcIgIHI3It9Kw8EmzcvwjR?usp=sharing problems]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, December 4, 2020&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
[https://colab.research.google.com/drive/1yxct9k6f2BioBQ6OywN22yfeDtGH_SlJ?usp=sharing Tutorial 12] Convolutional neural networks and auto-encoders&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Due: Homework 3&#039;&#039;&#039; (send it to me (Marko))&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, December 11, 2020&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Multiple Choice Questions: &#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
-------------&lt;br /&gt;
&#039;&#039;&#039;The Solution&#039;&#039;&#039; [https://drive.google.com/file/d/1lMwtaAHerJ4uffZoE9egy7Pa_V2-cwOe/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;The test&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
The MCQ is composed of 20 questions.  For each question you have 4 choices: 3 wrong and 1 correct.&lt;br /&gt;
&lt;br /&gt;
* If you check the correct one you get a point.&lt;br /&gt;
  &lt;br /&gt;
* If you are wrong you loose 1/4 of a point. &lt;br /&gt;
&lt;br /&gt;
* No answer given: zero points.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039; The Zoom link&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
Follow the link [https://zoom.us/j/4583355667?pwd=bUExNDJ1OU9IZEF6VUV5cmZKWDJ1dz09]. I will be there starting from 13h30, we will discuss the rules and I will be there to help you if you face a problem. &lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Time schedule&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* The exam starts at 14h00: you download your file of questions from that dropbox directory that brings your name.&lt;br /&gt;
&lt;br /&gt;
* Name the file with your answers as familyname_name.txt.&lt;br /&gt;
&lt;br /&gt;
* The answers shuld be presented in the following way:&lt;br /&gt;
&lt;br /&gt;
1 A&lt;br /&gt;
&lt;br /&gt;
2 B&lt;br /&gt;
&lt;br /&gt;
4 C&lt;br /&gt;
&lt;br /&gt;
(if some question is missing - as question 3 here - it  is not a problem)&lt;br /&gt;
&lt;br /&gt;
* Send the file with your answers at numphys.icfp@gmail.com before  4 pm.  &lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Rules&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* You are allowed to use all material you think useful.&lt;br /&gt;
&lt;br /&gt;
* You are not allowed to communicate with other people. Questions will be randomised to make hard life of cheaters, but please do not be one of them! &lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;GOOD LUCK!&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
== References ==&lt;br /&gt;
* [http://www.lps.ens.fr/~krauth/index.php/SMAC SMAC W. Krauth Statistical Mechanics: Algorithms and Computations (Oxford: Oxford University Press) (2006)]&lt;br /&gt;
* Other references are specified in each lectures&lt;/div&gt;</summary>
		<author><name>Alberto</name></author>
	</entry>
	<entry>
		<id>http://www.lptms.universite-paris-saclay.fr//wiki-cours/index.php?title=CoDaDri&amp;diff=1596</id>
		<title>CoDaDri</title>
		<link rel="alternate" type="text/html" href="http://www.lptms.universite-paris-saclay.fr//wiki-cours/index.php?title=CoDaDri&amp;diff=1596"/>
		<updated>2021-10-14T06:40:27Z</updated>

		<summary type="html">&lt;p&gt;Alberto: /* Breaking news: */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;=Breaking news:=&lt;br /&gt;
&lt;br /&gt;
* Homework 1 has been evaluated and sent to you. If you did not receive it, please contact us. &lt;br /&gt;
* Here you find the MCQ proposed last year &lt;br /&gt;
[https://colab.research.google.com/drive/1Ru_-IQ001XEJd9VAn4nvbBNI_3XA9QSK?usp=sharing The Quiz]&lt;br /&gt;
&lt;br /&gt;
= Computational and Data Driven Physics =&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Modern physics is characterized by an increasing complexity of systems under investigation, in&lt;br /&gt;
domains as diverse as condensed matter, astrophysics, biophysics, etc. Establishing adequate&lt;br /&gt;
models to describe these systems and being able to make quantitative predictions from those models&lt;br /&gt;
is extremely challenging. The goal of the course is to provide the tools and concepts necessary to tackle those systems.&lt;br /&gt;
&lt;br /&gt;
== Course description ==&lt;br /&gt;
&lt;br /&gt;
We will first cover many algorithms used in many-body problems and complex systems, with special emphasis on Monte Carlo methods, molecular dynamics, and optimization in complex landscapes. &lt;br /&gt;
&lt;br /&gt;
Second, we will provide statistical inference and machine learning tools to harness the growing availability of experimental data to design accurate models of the underlying, complex, strongly non-homogeneous and interacting systems. &lt;br /&gt;
&lt;br /&gt;
Each theoretical lecture will be followed by a tutorial illustrating the concepts with practical applications&lt;br /&gt;
borrowed from various domains of physics. We will focus on methods and algorithms and physics, not&lt;br /&gt;
on programming and heavy numerics!  You will have to hand in 3 homeworks.&lt;br /&gt;
&lt;br /&gt;
== The Team ==&lt;br /&gt;
&lt;br /&gt;
* [http://lptms.u-psud.fr/alberto_rosso/ Alberto Rosso] (Computational physics)&lt;br /&gt;
* [http://www.phys.ens.fr/~monasson/ Rémi Monasson] (Data-driven physics)&lt;br /&gt;
*  [http://www.lps.ens.fr/~cocco/ Simona Cocco] &amp;amp; [https://www.pct.espci.fr/~david/ David Lacoste] &amp;amp; [https://www.cpht.polytechnique.fr/?q=en/node/110 Michel Ferrero] (Tutorials)&lt;br /&gt;
&lt;br /&gt;
== Where and When ==&lt;br /&gt;
&lt;br /&gt;
* Lectures on Fridays: 14:00-16:00&lt;br /&gt;
* Tutorials on Fridays: 16:00-18:00&lt;br /&gt;
* ENS, 29 rue D&#039;Ulm, salle Borel + Djebar&lt;br /&gt;
&lt;br /&gt;
== Slack ==&lt;br /&gt;
&lt;br /&gt;
If you have questions or want to discuss topics related to the lecture, to the exercises or to the homeworks, you can use the&lt;br /&gt;
[http://computational-ozw2847.slack.com Computational and Data Driven Physics Slack]. In order to join the Slack&lt;br /&gt;
use the following [https://join.slack.com/t/computational-ozw2847/shared_invite/zt-vegija8y-cx_vbF2BI6FJewx4W6coSA invitation link].&lt;br /&gt;
&lt;br /&gt;
== Computer Requirements ==&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;No previous experience in programming is required.&#039;&#039;&#039; &amp;lt;br&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Programming Language: Python&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
For practical installation, we recommand either to use  Anaconda (See [[Memento Python]]) or use google colab. &amp;lt;br&amp;gt;&lt;br /&gt;
The Collaboratory platform from Google is quite good way to use powerful computer without buying one: It requires no specific hardware or software, and even allows you to use GPU computing for free,  all by writting a jupyter notebook that you can then share.&lt;br /&gt;
&lt;br /&gt;
== Grading ==&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Computational Physics:&#039;&#039;&#039;&lt;br /&gt;
* Homework 1: 5 points &lt;br /&gt;
* Homework 2: 5 points&lt;br /&gt;
* Multiple Choice Questions in November: 10 points&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Data Driven Physics:&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Final exam in January: 20 points&lt;br /&gt;
&lt;br /&gt;
== Schedule ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 3, 2021 &#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1X9h3lKD0OZLTKtxb7DWPfynY42rRuE7j/view?usp=sharing Lecture 1]   Introduction to Monte Carlo&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1sIv3qOdyE-XYkjYC-dkNsR72f4BgaQ_y/view?usp=sharing Tutorial 1] Markov Matrix&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 10, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Introductory notebooks: [https://colab.research.google.com/drive/1Ovrh1JjLzMMnxtasDgR1j84CHGU6hMxA python], [https://colab.research.google.com/drive/14PWu-C171pYhV8ven-Txc4wz5Tv1DCsK numpy] and [https://colab.research.google.com/drive/1fPjwrdxQPSyfXniyAHmyOcF_gK2fqjts matplotlib]&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1gf7oRQIpvSvMScyJa5hexB9CCZvdozPs#scrollTo=lDznlLouvlFx Tutorial 2] - Markov matrices ([https://colab.research.google.com/drive/1x9iEHG_F522uFCvD_jGdvHaMETAHfO6-#scrollTo=eSu-nLZ6vm8X solutions])&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1tjqbjAi50C4qOqVRtTxEkTeTb10qpTms#scrollTo=uYpaubGkvogU Tutorial 3] - Thumb rule ([https://colab.research.google.com/drive/1aWVtz4ZGcpIarWiRVAnxrp1t0GDOqZxu#scrollTo=f7ohlMuZvqTr solutions])&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1g7HXFUBQUBF0fhy5h2jYbfIAVBTqvb7-#scrollTo=U9LFX8OFhHOG Homework 1] (deadline October 1)&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
* [https://colab.research.google.com/drive/1aMo4Ur-0_b4dGhdIfxAmCC2ci1rOda_v?usp=sharing Tutorial 2] Markov matrix [https://colab.research.google.com/drive/1Q5ajzxRGXBBorA9cQ9o8V5VUVJhUXpPS?usp=sharing problems]&lt;br /&gt;
* [https://colab.research.google.com/drive/1k60-ChM3aUWjGsiRsf2Idx9jxHHtwyAb?usp=sharing Tutorial 3] Thumb rule [https://colab.research.google.com/drive/1fdKJlp0lD4k530oRuu50_Hm_T8t3jixa?usp=sharing problems]&lt;br /&gt;
--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 17, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/15wrgivn6FSnuBUnMwjjhadmD-g1fkS7T/view?usp=sharing Lecture 2] Basic Sampling&lt;br /&gt;
&lt;br /&gt;
*  [https://drive.google.com/file/d/1ALR_QKLXdHby54xNux39NUOk4L-Ne1EW/view?usp=sharing  Lecture 3]: Errors and Precision&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 24, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1DijhG_856OAuj42WqY1UM47APmMy3A8B/view?usp=sharing Lecture 4]: Ising model and phase transitions &lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1sRUEs768Z6PKdJ3k7MixYeFGlufgjFrG Tutorial 4]: Ising model and phase transitions ([https://colab.research.google.com/drive/1KAQRog_YlAjKZ_hL1FMYurWdPBLNUocI solutions])&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
* [https://colab.research.google.com/drive/1nU4E_pFWjSFPNigzy8-LcJpef26IKY6x?usp=sharing Tutorial 4]: Ising model and phase transitions [https://colab.research.google.com/drive/1AEUX3U7hxDR_YYy8ld3knTEVR1KYa9SP?usp=sharing problems] &lt;br /&gt;
--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 1, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1PTya42ZS2kU87A-BxQFFIUDTs_k47men?usp=sharing Lecture 5]: Optimization &amp;amp; Dijkstra algorithm&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1ieT5BlfJsOehsa8r-LHGsFsn1dwYnawT Tutorial 5]: Simulated annealing ([https://colab.research.google.com/drive/1JNVl42KNASZiwTtqYo71z_vggjbGfKul solutions])&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
* [https://colab.research.google.com/drive/1p0ooWAXF9KNh-FztMHmVoA9yBzYOM8PC?usp=sharing Tutorial 5]: Simulated annealing [https://colab.research.google.com/drive/1txJGpzreHurWux7ev6sDsX8TjzpeQhZZ?usp=sharing problems]&lt;br /&gt;
--&amp;gt;&lt;br /&gt;
* Send your copy of Homework 1 to numphys.icfp  at   gmail.com  Thanks!&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1EPgj3la7vxDIqSQYNlOFz4rR0vHXAeae Homework 2] (deadline October 22)&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 8, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 6: Introduction to Bayesian inference&lt;br /&gt;
&lt;br /&gt;
* Tutorial 6: Bayesian inference and single-particle tracking. [https://drive.google.com/file/d/1q9Quq5mvJ4Avv2qWgzTocU-DVIxJIVWi/view?usp=sharing Questions]. [https://drive.google.com/file/d/1xYb4wfNBysse6Q7frTw_V9TPdUQU5lUx/view?usp=sharing Data]. [https://drive.google.com/file/d/1Ba_kRo3_XMIaDLNYZlbZEw-wGXKS-29I/view?usp=sharing Starting Notebook]. [https://colab.research.google.com/drive/1VePL9X1JT6yl8LmROeZyMyf4Epcu3yOL#scrollTo=1XQNGa_fyEkJ Google colab version]. Solutions [https://drive.google.com/file/d/1Q9IjVUeL7AA8uWk8DX9Vy9vuUQ21RYh2/view?usp=sharing]. Notebook [https://drive.google.com/file/d/1ZJmpdaTQVUttEaaI1ch-reFfZGI93454/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 15, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1eY5cuNcJqYw7df0PBkxq03tEnqzTOC-5/view?usp=sharing Lecture 7]: Importance sampling&lt;br /&gt;
&lt;br /&gt;
* Tutorial 7: Faster than the clock algorithms&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
* [https://colab.research.google.com/drive/1iaOGxdVgk--kWUFcMDHs0zvPhsOyhB_c Tutorial 7]: Faster than the clock algorithms ([https://colab.research.google.com/drive/1bHPnJpBd5ExqKF4G5BuV_FHPE4r0_AY2#scrollTo=fQnz_gOeq40e solutions])&lt;br /&gt;
--&amp;gt;&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
* [https://colab.research.google.com/drive/1KyT442vB4EuGKBy_Xj3j8cLtMMl4gbac?usp=sharing Tutorial 6]: Faster than the clock algorithms [https://colab.research.google.com/drive/1C-ieAwaAKwkX5MFm8aX2kNO2GNeO9CdY?usp=sharing problems]&lt;br /&gt;
--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 22, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 8: Asymptotic inference and information&lt;br /&gt;
&lt;br /&gt;
* Tutorial 8:&lt;br /&gt;
&lt;br /&gt;
* Send your copy of Homework 2 to numphys.icfp  at   gmail.com  Thanks!&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 29, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 9: High-dimensional inference and Principal Component Analysis&lt;br /&gt;
&lt;br /&gt;
* Tutorial 9:&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, November 12, 2021, 2 pm: The Quiz.&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, November 26, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 10: Priors, regularisation, sparsity&lt;br /&gt;
&lt;br /&gt;
* Tutorial 10:&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, December 3, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 11: Network inference&lt;br /&gt;
&lt;br /&gt;
* Tutorial 11:&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, December 10, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 12: Supervised learning and phase transitions&lt;br /&gt;
&lt;br /&gt;
* Tutorial 12:&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, December 17, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 13: Unsupervised learning and representations&lt;br /&gt;
&lt;br /&gt;
* Tutorial 13:&lt;/div&gt;</summary>
		<author><name>Alberto</name></author>
	</entry>
	<entry>
		<id>http://www.lptms.universite-paris-saclay.fr//wiki-cours/index.php?title=CoDaDri&amp;diff=1595</id>
		<title>CoDaDri</title>
		<link rel="alternate" type="text/html" href="http://www.lptms.universite-paris-saclay.fr//wiki-cours/index.php?title=CoDaDri&amp;diff=1595"/>
		<updated>2021-10-14T06:37:18Z</updated>

		<summary type="html">&lt;p&gt;Alberto: /* Computational and Data Driven Physics */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;=Breaking news:=&lt;br /&gt;
&lt;br /&gt;
* Homework 1 has been evaluated and sent to you. If you did not receive it, please contact us. &lt;br /&gt;
* Here you find the MCQ proposed last year &lt;br /&gt;
[https://colab.research.google.com/drive/1Ru_-IQ001XEJd9VAn4nvbBNI_3XA9QSK?usp=sharing The Quiz]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
= Computational and Data Driven Physics =&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Modern physics is characterized by an increasing complexity of systems under investigation, in&lt;br /&gt;
domains as diverse as condensed matter, astrophysics, biophysics, etc. Establishing adequate&lt;br /&gt;
models to describe these systems and being able to make quantitative predictions from those models&lt;br /&gt;
is extremely challenging. The goal of the course is to provide the tools and concepts necessary to tackle those systems.&lt;br /&gt;
&lt;br /&gt;
== Course description ==&lt;br /&gt;
&lt;br /&gt;
We will first cover many algorithms used in many-body problems and complex systems, with special emphasis on Monte Carlo methods, molecular dynamics, and optimization in complex landscapes. &lt;br /&gt;
&lt;br /&gt;
Second, we will provide statistical inference and machine learning tools to harness the growing availability of experimental data to design accurate models of the underlying, complex, strongly non-homogeneous and interacting systems. &lt;br /&gt;
&lt;br /&gt;
Each theoretical lecture will be followed by a tutorial illustrating the concepts with practical applications&lt;br /&gt;
borrowed from various domains of physics. We will focus on methods and algorithms and physics, not&lt;br /&gt;
on programming and heavy numerics!  You will have to hand in 3 homeworks.&lt;br /&gt;
&lt;br /&gt;
== The Team ==&lt;br /&gt;
&lt;br /&gt;
* [http://lptms.u-psud.fr/alberto_rosso/ Alberto Rosso] (Computational physics)&lt;br /&gt;
* [http://www.phys.ens.fr/~monasson/ Rémi Monasson] (Data-driven physics)&lt;br /&gt;
*  [http://www.lps.ens.fr/~cocco/ Simona Cocco] &amp;amp; [https://www.pct.espci.fr/~david/ David Lacoste] &amp;amp; [https://www.cpht.polytechnique.fr/?q=en/node/110 Michel Ferrero] (Tutorials)&lt;br /&gt;
&lt;br /&gt;
== Where and When ==&lt;br /&gt;
&lt;br /&gt;
* Lectures on Fridays: 14:00-16:00&lt;br /&gt;
* Tutorials on Fridays: 16:00-18:00&lt;br /&gt;
* ENS, 29 rue D&#039;Ulm, salle Borel + Djebar&lt;br /&gt;
&lt;br /&gt;
== Slack ==&lt;br /&gt;
&lt;br /&gt;
If you have questions or want to discuss topics related to the lecture, to the exercises or to the homeworks, you can use the&lt;br /&gt;
[http://computational-ozw2847.slack.com Computational and Data Driven Physics Slack]. In order to join the Slack&lt;br /&gt;
use the following [https://join.slack.com/t/computational-ozw2847/shared_invite/zt-vegija8y-cx_vbF2BI6FJewx4W6coSA invitation link].&lt;br /&gt;
&lt;br /&gt;
== Computer Requirements ==&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;No previous experience in programming is required.&#039;&#039;&#039; &amp;lt;br&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Programming Language: Python&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
For practical installation, we recommand either to use  Anaconda (See [[Memento Python]]) or use google colab. &amp;lt;br&amp;gt;&lt;br /&gt;
The Collaboratory platform from Google is quite good way to use powerful computer without buying one: It requires no specific hardware or software, and even allows you to use GPU computing for free,  all by writting a jupyter notebook that you can then share.&lt;br /&gt;
&lt;br /&gt;
== Grading ==&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Computational Physics:&#039;&#039;&#039;&lt;br /&gt;
* Homework 1: 5 points &lt;br /&gt;
* Homework 2: 5 points&lt;br /&gt;
* Multiple Choice Questions in November: 10 points&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Data Driven Physics:&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Final exam in January: 20 points&lt;br /&gt;
&lt;br /&gt;
== Schedule ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 3, 2021 &#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1X9h3lKD0OZLTKtxb7DWPfynY42rRuE7j/view?usp=sharing Lecture 1]   Introduction to Monte Carlo&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1sIv3qOdyE-XYkjYC-dkNsR72f4BgaQ_y/view?usp=sharing Tutorial 1] Markov Matrix&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 10, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Introductory notebooks: [https://colab.research.google.com/drive/1Ovrh1JjLzMMnxtasDgR1j84CHGU6hMxA python], [https://colab.research.google.com/drive/14PWu-C171pYhV8ven-Txc4wz5Tv1DCsK numpy] and [https://colab.research.google.com/drive/1fPjwrdxQPSyfXniyAHmyOcF_gK2fqjts matplotlib]&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1gf7oRQIpvSvMScyJa5hexB9CCZvdozPs#scrollTo=lDznlLouvlFx Tutorial 2] - Markov matrices ([https://colab.research.google.com/drive/1x9iEHG_F522uFCvD_jGdvHaMETAHfO6-#scrollTo=eSu-nLZ6vm8X solutions])&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1tjqbjAi50C4qOqVRtTxEkTeTb10qpTms#scrollTo=uYpaubGkvogU Tutorial 3] - Thumb rule ([https://colab.research.google.com/drive/1aWVtz4ZGcpIarWiRVAnxrp1t0GDOqZxu#scrollTo=f7ohlMuZvqTr solutions])&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1g7HXFUBQUBF0fhy5h2jYbfIAVBTqvb7-#scrollTo=U9LFX8OFhHOG Homework 1] (deadline October 1)&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
* [https://colab.research.google.com/drive/1aMo4Ur-0_b4dGhdIfxAmCC2ci1rOda_v?usp=sharing Tutorial 2] Markov matrix [https://colab.research.google.com/drive/1Q5ajzxRGXBBorA9cQ9o8V5VUVJhUXpPS?usp=sharing problems]&lt;br /&gt;
* [https://colab.research.google.com/drive/1k60-ChM3aUWjGsiRsf2Idx9jxHHtwyAb?usp=sharing Tutorial 3] Thumb rule [https://colab.research.google.com/drive/1fdKJlp0lD4k530oRuu50_Hm_T8t3jixa?usp=sharing problems]&lt;br /&gt;
--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 17, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/15wrgivn6FSnuBUnMwjjhadmD-g1fkS7T/view?usp=sharing Lecture 2] Basic Sampling&lt;br /&gt;
&lt;br /&gt;
*  [https://drive.google.com/file/d/1ALR_QKLXdHby54xNux39NUOk4L-Ne1EW/view?usp=sharing  Lecture 3]: Errors and Precision&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 24, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1DijhG_856OAuj42WqY1UM47APmMy3A8B/view?usp=sharing Lecture 4]: Ising model and phase transitions &lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1sRUEs768Z6PKdJ3k7MixYeFGlufgjFrG Tutorial 4]: Ising model and phase transitions ([https://colab.research.google.com/drive/1KAQRog_YlAjKZ_hL1FMYurWdPBLNUocI solutions])&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
* [https://colab.research.google.com/drive/1nU4E_pFWjSFPNigzy8-LcJpef26IKY6x?usp=sharing Tutorial 4]: Ising model and phase transitions [https://colab.research.google.com/drive/1AEUX3U7hxDR_YYy8ld3knTEVR1KYa9SP?usp=sharing problems] &lt;br /&gt;
--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 1, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1PTya42ZS2kU87A-BxQFFIUDTs_k47men?usp=sharing Lecture 5]: Optimization &amp;amp; Dijkstra algorithm&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1ieT5BlfJsOehsa8r-LHGsFsn1dwYnawT Tutorial 5]: Simulated annealing ([https://colab.research.google.com/drive/1JNVl42KNASZiwTtqYo71z_vggjbGfKul solutions])&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
* [https://colab.research.google.com/drive/1p0ooWAXF9KNh-FztMHmVoA9yBzYOM8PC?usp=sharing Tutorial 5]: Simulated annealing [https://colab.research.google.com/drive/1txJGpzreHurWux7ev6sDsX8TjzpeQhZZ?usp=sharing problems]&lt;br /&gt;
--&amp;gt;&lt;br /&gt;
* Send your copy of Homework 1 to numphys.icfp  at   gmail.com  Thanks!&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1EPgj3la7vxDIqSQYNlOFz4rR0vHXAeae Homework 2] (deadline October 22)&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 8, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 6: Introduction to Bayesian inference&lt;br /&gt;
&lt;br /&gt;
* Tutorial 6: Bayesian inference and single-particle tracking. [https://drive.google.com/file/d/1q9Quq5mvJ4Avv2qWgzTocU-DVIxJIVWi/view?usp=sharing Questions]. [https://drive.google.com/file/d/1xYb4wfNBysse6Q7frTw_V9TPdUQU5lUx/view?usp=sharing Data]. [https://drive.google.com/file/d/1Ba_kRo3_XMIaDLNYZlbZEw-wGXKS-29I/view?usp=sharing Starting Notebook]. [https://colab.research.google.com/drive/1VePL9X1JT6yl8LmROeZyMyf4Epcu3yOL#scrollTo=1XQNGa_fyEkJ Google colab version]. Solutions [https://drive.google.com/file/d/1Q9IjVUeL7AA8uWk8DX9Vy9vuUQ21RYh2/view?usp=sharing]. Notebook [https://drive.google.com/file/d/1ZJmpdaTQVUttEaaI1ch-reFfZGI93454/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 15, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1eY5cuNcJqYw7df0PBkxq03tEnqzTOC-5/view?usp=sharing Lecture 7]: Importance sampling&lt;br /&gt;
&lt;br /&gt;
* Tutorial 7: Faster than the clock algorithms&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
* [https://colab.research.google.com/drive/1iaOGxdVgk--kWUFcMDHs0zvPhsOyhB_c Tutorial 7]: Faster than the clock algorithms ([https://colab.research.google.com/drive/1bHPnJpBd5ExqKF4G5BuV_FHPE4r0_AY2#scrollTo=fQnz_gOeq40e solutions])&lt;br /&gt;
--&amp;gt;&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
* [https://colab.research.google.com/drive/1KyT442vB4EuGKBy_Xj3j8cLtMMl4gbac?usp=sharing Tutorial 6]: Faster than the clock algorithms [https://colab.research.google.com/drive/1C-ieAwaAKwkX5MFm8aX2kNO2GNeO9CdY?usp=sharing problems]&lt;br /&gt;
--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 22, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 8: Asymptotic inference and information&lt;br /&gt;
&lt;br /&gt;
* Tutorial 8:&lt;br /&gt;
&lt;br /&gt;
* Send your copy of Homework 2 to numphys.icfp  at   gmail.com  Thanks!&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 29, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 9: High-dimensional inference and Principal Component Analysis&lt;br /&gt;
&lt;br /&gt;
* Tutorial 9:&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, November 12, 2021, 2 pm: The Quiz.&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, November 26, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 10: Priors, regularisation, sparsity&lt;br /&gt;
&lt;br /&gt;
* Tutorial 10:&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, December 3, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 11: Network inference&lt;br /&gt;
&lt;br /&gt;
* Tutorial 11:&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, December 10, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 12: Supervised learning and phase transitions&lt;br /&gt;
&lt;br /&gt;
* Tutorial 12:&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, December 17, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 13: Unsupervised learning and representations&lt;br /&gt;
&lt;br /&gt;
* Tutorial 13:&lt;/div&gt;</summary>
		<author><name>Alberto</name></author>
	</entry>
	<entry>
		<id>http://www.lptms.universite-paris-saclay.fr//wiki-cours/index.php?title=CoDaDri&amp;diff=1586</id>
		<title>CoDaDri</title>
		<link rel="alternate" type="text/html" href="http://www.lptms.universite-paris-saclay.fr//wiki-cours/index.php?title=CoDaDri&amp;diff=1586"/>
		<updated>2021-10-12T19:55:04Z</updated>

		<summary type="html">&lt;p&gt;Alberto: /* Schedule */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;= Computational and Data Driven Physics =&lt;br /&gt;
&lt;br /&gt;
Modern physics is characterized by an increasing complexity of systems under investigation, in&lt;br /&gt;
domains as diverse as condensed matter, astrophysics, biophysics, etc. Establishing adequate&lt;br /&gt;
models to describe these systems and being able to make quantitative predictions from those models&lt;br /&gt;
is extremely challenging. The goal of the course is to provide the tools and concepts necessary to tackle those systems.&lt;br /&gt;
&lt;br /&gt;
== Course description ==&lt;br /&gt;
&lt;br /&gt;
We will first cover many algorithms used in many-body problems and complex systems, with special emphasis on Monte Carlo methods, molecular dynamics, and optimization in complex landscapes. &lt;br /&gt;
&lt;br /&gt;
Second, we will provide statistical inference and machine learning tools to harness the growing availability of experimental data to design accurate models of the underlying, complex, strongly non-homogeneous and interacting systems. &lt;br /&gt;
&lt;br /&gt;
Each theoretical lecture will be followed by a tutorial illustrating the concepts with practical applications&lt;br /&gt;
borrowed from various domains of physics. We will focus on methods and algorithms and physics, not&lt;br /&gt;
on programming and heavy numerics!  You will have to hand in 3 homeworks.&lt;br /&gt;
&lt;br /&gt;
== The Team ==&lt;br /&gt;
&lt;br /&gt;
* [http://lptms.u-psud.fr/alberto_rosso/ Alberto Rosso] (Computational physics)&lt;br /&gt;
* [http://www.phys.ens.fr/~monasson/ Rémi Monasson] (Data-driven physics)&lt;br /&gt;
*  [http://www.lps.ens.fr/~cocco/ Simona Cocco] &amp;amp; [https://www.pct.espci.fr/~david/ David Lacoste] &amp;amp; [https://www.cpht.polytechnique.fr/?q=en/node/110 Michel Ferrero] (Tutorials)&lt;br /&gt;
&lt;br /&gt;
== Where and When ==&lt;br /&gt;
&lt;br /&gt;
* Lectures on Fridays: 14:00-16:00&lt;br /&gt;
* Tutorials on Fridays: 16:00-18:00&lt;br /&gt;
* ENS, 29 rue D&#039;Ulm, salle Borel + Djebar&lt;br /&gt;
&lt;br /&gt;
== Slack ==&lt;br /&gt;
&lt;br /&gt;
If you have questions or want to discuss topics related to the lecture, to the exercises or to the homeworks, you can use the&lt;br /&gt;
[http://computational-ozw2847.slack.com Computational and Data Driven Physics Slack]. In order to join the Slack&lt;br /&gt;
use the following [https://join.slack.com/t/computational-ozw2847/shared_invite/zt-vegija8y-cx_vbF2BI6FJewx4W6coSA invitation link].&lt;br /&gt;
&lt;br /&gt;
== Computer Requirements ==&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;No previous experience in programming is required.&#039;&#039;&#039; &amp;lt;br&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Programming Language: Python&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
For practical installation, we recommand either to use  Anaconda (See [[Memento Python]]) or use google colab. &amp;lt;br&amp;gt;&lt;br /&gt;
The Collaboratory platform from Google is quite good way to use powerful computer without buying one: It requires no specific hardware or software, and even allows you to use GPU computing for free,  all by writting a jupyter notebook that you can then share.&lt;br /&gt;
&lt;br /&gt;
== Grading ==&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Computational Physics:&#039;&#039;&#039;&lt;br /&gt;
* Homework 1: 5 points &lt;br /&gt;
* Homework 2: 5 points&lt;br /&gt;
* Multiple Choice Questions in November: 10 points&lt;br /&gt;
&lt;br /&gt;
Here you find the MCQ proposed last year &lt;br /&gt;
[https://colab.research.google.com/drive/1Ru_-IQ001XEJd9VAn4nvbBNI_3XA9QSK?usp=sharing The Quiz]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Data Driven Physics:&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Final exam in January: 20 points&lt;br /&gt;
&lt;br /&gt;
== Schedule ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 3, 2021 &#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1X9h3lKD0OZLTKtxb7DWPfynY42rRuE7j/view?usp=sharing Lecture 1]   Introduction to Monte Carlo&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1sIv3qOdyE-XYkjYC-dkNsR72f4BgaQ_y/view?usp=sharing Tutorial 1] Markov Matrix&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 10, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Introductory notebooks: [https://colab.research.google.com/drive/1Ovrh1JjLzMMnxtasDgR1j84CHGU6hMxA python], [https://colab.research.google.com/drive/14PWu-C171pYhV8ven-Txc4wz5Tv1DCsK numpy] and [https://colab.research.google.com/drive/1fPjwrdxQPSyfXniyAHmyOcF_gK2fqjts matplotlib]&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1gf7oRQIpvSvMScyJa5hexB9CCZvdozPs#scrollTo=lDznlLouvlFx Tutorial 2] - Markov matrices ([https://colab.research.google.com/drive/1x9iEHG_F522uFCvD_jGdvHaMETAHfO6-#scrollTo=eSu-nLZ6vm8X solutions])&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1tjqbjAi50C4qOqVRtTxEkTeTb10qpTms#scrollTo=uYpaubGkvogU Tutorial 3] - Thumb rule ([https://colab.research.google.com/drive/1aWVtz4ZGcpIarWiRVAnxrp1t0GDOqZxu#scrollTo=f7ohlMuZvqTr solutions])&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1g7HXFUBQUBF0fhy5h2jYbfIAVBTqvb7-#scrollTo=U9LFX8OFhHOG Homework 1] (deadline October 1)&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
* [https://colab.research.google.com/drive/1aMo4Ur-0_b4dGhdIfxAmCC2ci1rOda_v?usp=sharing Tutorial 2] Markov matrix [https://colab.research.google.com/drive/1Q5ajzxRGXBBorA9cQ9o8V5VUVJhUXpPS?usp=sharing problems]&lt;br /&gt;
* [https://colab.research.google.com/drive/1k60-ChM3aUWjGsiRsf2Idx9jxHHtwyAb?usp=sharing Tutorial 3] Thumb rule [https://colab.research.google.com/drive/1fdKJlp0lD4k530oRuu50_Hm_T8t3jixa?usp=sharing problems]&lt;br /&gt;
--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 17, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/15wrgivn6FSnuBUnMwjjhadmD-g1fkS7T/view?usp=sharing Lecture 2] Basic Sampling&lt;br /&gt;
&lt;br /&gt;
*  [https://drive.google.com/file/d/1ALR_QKLXdHby54xNux39NUOk4L-Ne1EW/view?usp=sharing  Lecture 3]: Errors and Precision&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 24, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1DijhG_856OAuj42WqY1UM47APmMy3A8B/view?usp=sharing Lecture 4]: Ising model and phase transitions &lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1sRUEs768Z6PKdJ3k7MixYeFGlufgjFrG Tutorial 4]: Ising model and phase transitions ([https://colab.research.google.com/drive/1KAQRog_YlAjKZ_hL1FMYurWdPBLNUocI solutions])&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
* [https://colab.research.google.com/drive/1nU4E_pFWjSFPNigzy8-LcJpef26IKY6x?usp=sharing Tutorial 4]: Ising model and phase transitions [https://colab.research.google.com/drive/1AEUX3U7hxDR_YYy8ld3knTEVR1KYa9SP?usp=sharing problems] &lt;br /&gt;
--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 1, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1PTya42ZS2kU87A-BxQFFIUDTs_k47men?usp=sharing Lecture 5]: Optimization &amp;amp; Dijkstra algorithm&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1ieT5BlfJsOehsa8r-LHGsFsn1dwYnawT Tutorial 5]: Simulated annealing ([https://colab.research.google.com/drive/1JNVl42KNASZiwTtqYo71z_vggjbGfKul solutions])&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
* [https://colab.research.google.com/drive/1p0ooWAXF9KNh-FztMHmVoA9yBzYOM8PC?usp=sharing Tutorial 5]: Simulated annealing [https://colab.research.google.com/drive/1txJGpzreHurWux7ev6sDsX8TjzpeQhZZ?usp=sharing problems]&lt;br /&gt;
--&amp;gt;&lt;br /&gt;
* Send your copy of Homework 1 to numphys.icfp  at   gmail.com  Thanks!&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1EPgj3la7vxDIqSQYNlOFz4rR0vHXAeae Homework 2] (deadline October 22)&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 8, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 6: Introduction to Bayesian inference&lt;br /&gt;
&lt;br /&gt;
* Tutorial 6: Bayesian inference and single-particle tracking. [https://drive.google.com/file/d/1q9Quq5mvJ4Avv2qWgzTocU-DVIxJIVWi/view?usp=sharing Questions]. [https://drive.google.com/file/d/1xYb4wfNBysse6Q7frTw_V9TPdUQU5lUx/view?usp=sharing Data]. [https://drive.google.com/file/d/1Ba_kRo3_XMIaDLNYZlbZEw-wGXKS-29I/view?usp=sharing Starting Notebook]. [https://colab.research.google.com/drive/1VePL9X1JT6yl8LmROeZyMyf4Epcu3yOL#scrollTo=1XQNGa_fyEkJ Google colab version]. Solutions [https://drive.google.com/file/d/1Q9IjVUeL7AA8uWk8DX9Vy9vuUQ21RYh2/view?usp=sharing]. Notebook [https://drive.google.com/file/d/1ZJmpdaTQVUttEaaI1ch-reFfZGI93454/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 15, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1eY5cuNcJqYw7df0PBkxq03tEnqzTOC-5/view?usp=sharing Lecture 7]: Importance sampling&lt;br /&gt;
&lt;br /&gt;
* Tutorial 7: Faster than the clock algorithms&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
* [https://colab.research.google.com/drive/1KyT442vB4EuGKBy_Xj3j8cLtMMl4gbac?usp=sharing Tutorial 6]: Faster than the clock algorithms [https://colab.research.google.com/drive/1C-ieAwaAKwkX5MFm8aX2kNO2GNeO9CdY?usp=sharing problems]&lt;br /&gt;
--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 22, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 8: Asymptotic inference and information&lt;br /&gt;
&lt;br /&gt;
* Tutorial 8:&lt;br /&gt;
&lt;br /&gt;
* Send your copy of Homework 2 to numphys.icfp  at   gmail.com  Thanks!&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 29, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 9: High-dimensional inference and Principal Component Analysis&lt;br /&gt;
&lt;br /&gt;
* Tutorial 9:&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, November 12, 2021, 2 pm: The Quiz.&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, November 26, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 10: Priors, regularisation, sparsity&lt;br /&gt;
&lt;br /&gt;
* Tutorial 10:&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, December 3, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 11: Network inference&lt;br /&gt;
&lt;br /&gt;
* Tutorial 11:&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, December 10, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 12: Supervised learning and phase transitions&lt;br /&gt;
&lt;br /&gt;
* Tutorial 12:&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, December 17, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 13: Unsupervised learning and representations&lt;br /&gt;
&lt;br /&gt;
* Tutorial 13:&lt;/div&gt;</summary>
		<author><name>Alberto</name></author>
	</entry>
	<entry>
		<id>http://www.lptms.universite-paris-saclay.fr//wiki-cours/index.php?title=CoDaDri&amp;diff=1585</id>
		<title>CoDaDri</title>
		<link rel="alternate" type="text/html" href="http://www.lptms.universite-paris-saclay.fr//wiki-cours/index.php?title=CoDaDri&amp;diff=1585"/>
		<updated>2021-10-12T19:54:02Z</updated>

		<summary type="html">&lt;p&gt;Alberto: /* Schedule */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;= Computational and Data Driven Physics =&lt;br /&gt;
&lt;br /&gt;
Modern physics is characterized by an increasing complexity of systems under investigation, in&lt;br /&gt;
domains as diverse as condensed matter, astrophysics, biophysics, etc. Establishing adequate&lt;br /&gt;
models to describe these systems and being able to make quantitative predictions from those models&lt;br /&gt;
is extremely challenging. The goal of the course is to provide the tools and concepts necessary to tackle those systems.&lt;br /&gt;
&lt;br /&gt;
== Course description ==&lt;br /&gt;
&lt;br /&gt;
We will first cover many algorithms used in many-body problems and complex systems, with special emphasis on Monte Carlo methods, molecular dynamics, and optimization in complex landscapes. &lt;br /&gt;
&lt;br /&gt;
Second, we will provide statistical inference and machine learning tools to harness the growing availability of experimental data to design accurate models of the underlying, complex, strongly non-homogeneous and interacting systems. &lt;br /&gt;
&lt;br /&gt;
Each theoretical lecture will be followed by a tutorial illustrating the concepts with practical applications&lt;br /&gt;
borrowed from various domains of physics. We will focus on methods and algorithms and physics, not&lt;br /&gt;
on programming and heavy numerics!  You will have to hand in 3 homeworks.&lt;br /&gt;
&lt;br /&gt;
== The Team ==&lt;br /&gt;
&lt;br /&gt;
* [http://lptms.u-psud.fr/alberto_rosso/ Alberto Rosso] (Computational physics)&lt;br /&gt;
* [http://www.phys.ens.fr/~monasson/ Rémi Monasson] (Data-driven physics)&lt;br /&gt;
*  [http://www.lps.ens.fr/~cocco/ Simona Cocco] &amp;amp; [https://www.pct.espci.fr/~david/ David Lacoste] &amp;amp; [https://www.cpht.polytechnique.fr/?q=en/node/110 Michel Ferrero] (Tutorials)&lt;br /&gt;
&lt;br /&gt;
== Where and When ==&lt;br /&gt;
&lt;br /&gt;
* Lectures on Fridays: 14:00-16:00&lt;br /&gt;
* Tutorials on Fridays: 16:00-18:00&lt;br /&gt;
* ENS, 29 rue D&#039;Ulm, salle Borel + Djebar&lt;br /&gt;
&lt;br /&gt;
== Slack ==&lt;br /&gt;
&lt;br /&gt;
If you have questions or want to discuss topics related to the lecture, to the exercises or to the homeworks, you can use the&lt;br /&gt;
[http://computational-ozw2847.slack.com Computational and Data Driven Physics Slack]. In order to join the Slack&lt;br /&gt;
use the following [https://join.slack.com/t/computational-ozw2847/shared_invite/zt-vegija8y-cx_vbF2BI6FJewx4W6coSA invitation link].&lt;br /&gt;
&lt;br /&gt;
== Computer Requirements ==&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;No previous experience in programming is required.&#039;&#039;&#039; &amp;lt;br&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Programming Language: Python&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
For practical installation, we recommand either to use  Anaconda (See [[Memento Python]]) or use google colab. &amp;lt;br&amp;gt;&lt;br /&gt;
The Collaboratory platform from Google is quite good way to use powerful computer without buying one: It requires no specific hardware or software, and even allows you to use GPU computing for free,  all by writting a jupyter notebook that you can then share.&lt;br /&gt;
&lt;br /&gt;
== Grading ==&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Computational Physics:&#039;&#039;&#039;&lt;br /&gt;
* Homework 1: 5 points &lt;br /&gt;
* Homework 2: 5 points&lt;br /&gt;
* Multiple Choice Questions in November: 10 points&lt;br /&gt;
&lt;br /&gt;
Here you find the MCQ proposed last year &lt;br /&gt;
[https://colab.research.google.com/drive/1Ru_-IQ001XEJd9VAn4nvbBNI_3XA9QSK?usp=sharing The Quiz]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Data Driven Physics:&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Final exam in January: 20 points&lt;br /&gt;
&lt;br /&gt;
== Schedule ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 3, 2021 &#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1X9h3lKD0OZLTKtxb7DWPfynY42rRuE7j/view?usp=sharing Lecture 1]   Introduction to Monte Carlo&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1sIv3qOdyE-XYkjYC-dkNsR72f4BgaQ_y/view?usp=sharing Tutorial 1] Markov Matrix&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 10, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Introductory notebooks: [https://colab.research.google.com/drive/1Ovrh1JjLzMMnxtasDgR1j84CHGU6hMxA python], [https://colab.research.google.com/drive/14PWu-C171pYhV8ven-Txc4wz5Tv1DCsK numpy] and [https://colab.research.google.com/drive/1fPjwrdxQPSyfXniyAHmyOcF_gK2fqjts matplotlib]&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1gf7oRQIpvSvMScyJa5hexB9CCZvdozPs#scrollTo=lDznlLouvlFx Tutorial 2] - Markov matrices ([https://colab.research.google.com/drive/1x9iEHG_F522uFCvD_jGdvHaMETAHfO6-#scrollTo=eSu-nLZ6vm8X solutions])&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1tjqbjAi50C4qOqVRtTxEkTeTb10qpTms#scrollTo=uYpaubGkvogU Tutorial 3] - Thumb rule ([https://colab.research.google.com/drive/1aWVtz4ZGcpIarWiRVAnxrp1t0GDOqZxu#scrollTo=f7ohlMuZvqTr solutions])&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1g7HXFUBQUBF0fhy5h2jYbfIAVBTqvb7-#scrollTo=U9LFX8OFhHOG Homework 1] (deadline October 1)&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
* [https://colab.research.google.com/drive/1aMo4Ur-0_b4dGhdIfxAmCC2ci1rOda_v?usp=sharing Tutorial 2] Markov matrix [https://colab.research.google.com/drive/1Q5ajzxRGXBBorA9cQ9o8V5VUVJhUXpPS?usp=sharing problems]&lt;br /&gt;
* [https://colab.research.google.com/drive/1k60-ChM3aUWjGsiRsf2Idx9jxHHtwyAb?usp=sharing Tutorial 3] Thumb rule [https://colab.research.google.com/drive/1fdKJlp0lD4k530oRuu50_Hm_T8t3jixa?usp=sharing problems]&lt;br /&gt;
--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 17, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/15wrgivn6FSnuBUnMwjjhadmD-g1fkS7T/view?usp=sharing Lecture 2] Basic Sampling&lt;br /&gt;
&lt;br /&gt;
*  [https://drive.google.com/file/d/1ALR_QKLXdHby54xNux39NUOk4L-Ne1EW/view?usp=sharing  Lecture 3]: Errors and Precision&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 24, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1DijhG_856OAuj42WqY1UM47APmMy3A8B/view?usp=sharing Lecture 4]: Ising model and phase transitions &lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1sRUEs768Z6PKdJ3k7MixYeFGlufgjFrG Tutorial 4]: Ising model and phase transitions ([https://colab.research.google.com/drive/1KAQRog_YlAjKZ_hL1FMYurWdPBLNUocI solutions])&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
* [https://colab.research.google.com/drive/1nU4E_pFWjSFPNigzy8-LcJpef26IKY6x?usp=sharing Tutorial 4]: Ising model and phase transitions [https://colab.research.google.com/drive/1AEUX3U7hxDR_YYy8ld3knTEVR1KYa9SP?usp=sharing problems] &lt;br /&gt;
--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 1, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1PTya42ZS2kU87A-BxQFFIUDTs_k47men?usp=sharing Lecture 5]: Optimization &amp;amp; Dijkstra algorithm&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1ieT5BlfJsOehsa8r-LHGsFsn1dwYnawT Tutorial 5]: Simulated annealing ([https://colab.research.google.com/drive/1JNVl42KNASZiwTtqYo71z_vggjbGfKul solutions])&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
* [https://colab.research.google.com/drive/1p0ooWAXF9KNh-FztMHmVoA9yBzYOM8PC?usp=sharing Tutorial 5]: Simulated annealing [https://colab.research.google.com/drive/1txJGpzreHurWux7ev6sDsX8TjzpeQhZZ?usp=sharing problems]&lt;br /&gt;
--&amp;gt;&lt;br /&gt;
* Send your copy of Homework 1 to numphys.icfp  at   gmail.com  Thanks!&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1EPgj3la7vxDIqSQYNlOFz4rR0vHXAeae Homework 2] (deadline October 22)&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 8, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 6: Introduction to Bayesian inference&lt;br /&gt;
&lt;br /&gt;
* Tutorial 6: Bayesian inference and single-particle tracking. [https://drive.google.com/file/d/1q9Quq5mvJ4Avv2qWgzTocU-DVIxJIVWi/view?usp=sharing Questions]. [https://drive.google.com/file/d/1xYb4wfNBysse6Q7frTw_V9TPdUQU5lUx/view?usp=sharing Data]. [https://drive.google.com/file/d/1Ba_kRo3_XMIaDLNYZlbZEw-wGXKS-29I/view?usp=sharing Starting Notebook]. [https://colab.research.google.com/drive/1VePL9X1JT6yl8LmROeZyMyf4Epcu3yOL#scrollTo=1XQNGa_fyEkJ Google colab version]. Solutions [https://drive.google.com/file/d/1Q9IjVUeL7AA8uWk8DX9Vy9vuUQ21RYh2/view?usp=sharing]. Notebook [https://drive.google.com/file/d/1ZJmpdaTQVUttEaaI1ch-reFfZGI93454/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 15, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1eY5cuNcJqYw7df0PBkxq03tEnqzTOC-5/view?usp=sharing Lecture 7]: Importance sampling&lt;br /&gt;
&lt;br /&gt;
* Tutorial 7: Faster than the clock algorithms&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
* [https://colab.research.google.com/drive/1KyT442vB4EuGKBy_Xj3j8cLtMMl4gbac?usp=sharing Tutorial 6]: Faster than the clock algorithms [https://colab.research.google.com/drive/1C-ieAwaAKwkX5MFm8aX2kNO2GNeO9CdY?usp=sharing problems]&lt;br /&gt;
--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 22, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 8: Asymptotic inference and information&lt;br /&gt;
&lt;br /&gt;
* Tutorial 8:&lt;br /&gt;
&lt;br /&gt;
* Send your copy of Homework 2 to numphys.icfp  at   gmail.com  Thanks!&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 29, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 9: High-dimensional inference and Principal Component Analysis&lt;br /&gt;
&lt;br /&gt;
* Tutorial 9:&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, November 12, 2021&#039;&#039;&#039;&lt;br /&gt;
&#039;&#039; * 2 pm - 4 pm  The Quiz. &#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, November 26, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 10: Priors, regularisation, sparsity&lt;br /&gt;
&lt;br /&gt;
* Tutorial 10:&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, December 3, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 11: Network inference&lt;br /&gt;
&lt;br /&gt;
* Tutorial 11:&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, December 10, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 12: Supervised learning and phase transitions&lt;br /&gt;
&lt;br /&gt;
* Tutorial 12:&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, December 17, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 13: Unsupervised learning and representations&lt;br /&gt;
&lt;br /&gt;
* Tutorial 13:&lt;/div&gt;</summary>
		<author><name>Alberto</name></author>
	</entry>
	<entry>
		<id>http://www.lptms.universite-paris-saclay.fr//wiki-cours/index.php?title=CoDaDri&amp;diff=1584</id>
		<title>CoDaDri</title>
		<link rel="alternate" type="text/html" href="http://www.lptms.universite-paris-saclay.fr//wiki-cours/index.php?title=CoDaDri&amp;diff=1584"/>
		<updated>2021-10-12T19:52:48Z</updated>

		<summary type="html">&lt;p&gt;Alberto: /* Schedule */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;= Computational and Data Driven Physics =&lt;br /&gt;
&lt;br /&gt;
Modern physics is characterized by an increasing complexity of systems under investigation, in&lt;br /&gt;
domains as diverse as condensed matter, astrophysics, biophysics, etc. Establishing adequate&lt;br /&gt;
models to describe these systems and being able to make quantitative predictions from those models&lt;br /&gt;
is extremely challenging. The goal of the course is to provide the tools and concepts necessary to tackle those systems.&lt;br /&gt;
&lt;br /&gt;
== Course description ==&lt;br /&gt;
&lt;br /&gt;
We will first cover many algorithms used in many-body problems and complex systems, with special emphasis on Monte Carlo methods, molecular dynamics, and optimization in complex landscapes. &lt;br /&gt;
&lt;br /&gt;
Second, we will provide statistical inference and machine learning tools to harness the growing availability of experimental data to design accurate models of the underlying, complex, strongly non-homogeneous and interacting systems. &lt;br /&gt;
&lt;br /&gt;
Each theoretical lecture will be followed by a tutorial illustrating the concepts with practical applications&lt;br /&gt;
borrowed from various domains of physics. We will focus on methods and algorithms and physics, not&lt;br /&gt;
on programming and heavy numerics!  You will have to hand in 3 homeworks.&lt;br /&gt;
&lt;br /&gt;
== The Team ==&lt;br /&gt;
&lt;br /&gt;
* [http://lptms.u-psud.fr/alberto_rosso/ Alberto Rosso] (Computational physics)&lt;br /&gt;
* [http://www.phys.ens.fr/~monasson/ Rémi Monasson] (Data-driven physics)&lt;br /&gt;
*  [http://www.lps.ens.fr/~cocco/ Simona Cocco] &amp;amp; [https://www.pct.espci.fr/~david/ David Lacoste] &amp;amp; [https://www.cpht.polytechnique.fr/?q=en/node/110 Michel Ferrero] (Tutorials)&lt;br /&gt;
&lt;br /&gt;
== Where and When ==&lt;br /&gt;
&lt;br /&gt;
* Lectures on Fridays: 14:00-16:00&lt;br /&gt;
* Tutorials on Fridays: 16:00-18:00&lt;br /&gt;
* ENS, 29 rue D&#039;Ulm, salle Borel + Djebar&lt;br /&gt;
&lt;br /&gt;
== Slack ==&lt;br /&gt;
&lt;br /&gt;
If you have questions or want to discuss topics related to the lecture, to the exercises or to the homeworks, you can use the&lt;br /&gt;
[http://computational-ozw2847.slack.com Computational and Data Driven Physics Slack]. In order to join the Slack&lt;br /&gt;
use the following [https://join.slack.com/t/computational-ozw2847/shared_invite/zt-vegija8y-cx_vbF2BI6FJewx4W6coSA invitation link].&lt;br /&gt;
&lt;br /&gt;
== Computer Requirements ==&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;No previous experience in programming is required.&#039;&#039;&#039; &amp;lt;br&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Programming Language: Python&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
For practical installation, we recommand either to use  Anaconda (See [[Memento Python]]) or use google colab. &amp;lt;br&amp;gt;&lt;br /&gt;
The Collaboratory platform from Google is quite good way to use powerful computer without buying one: It requires no specific hardware or software, and even allows you to use GPU computing for free,  all by writting a jupyter notebook that you can then share.&lt;br /&gt;
&lt;br /&gt;
== Grading ==&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Computational Physics:&#039;&#039;&#039;&lt;br /&gt;
* Homework 1: 5 points &lt;br /&gt;
* Homework 2: 5 points&lt;br /&gt;
* Multiple Choice Questions in November: 10 points&lt;br /&gt;
&lt;br /&gt;
Here you find the MCQ proposed last year &lt;br /&gt;
[https://colab.research.google.com/drive/1Ru_-IQ001XEJd9VAn4nvbBNI_3XA9QSK?usp=sharing The Quiz]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Data Driven Physics:&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Final exam in January: 20 points&lt;br /&gt;
&lt;br /&gt;
== Schedule ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 3, 2021 &#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1X9h3lKD0OZLTKtxb7DWPfynY42rRuE7j/view?usp=sharing Lecture 1]   Introduction to Monte Carlo&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1sIv3qOdyE-XYkjYC-dkNsR72f4BgaQ_y/view?usp=sharing Tutorial 1] Markov Matrix&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 10, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Introductory notebooks: [https://colab.research.google.com/drive/1Ovrh1JjLzMMnxtasDgR1j84CHGU6hMxA python], [https://colab.research.google.com/drive/14PWu-C171pYhV8ven-Txc4wz5Tv1DCsK numpy] and [https://colab.research.google.com/drive/1fPjwrdxQPSyfXniyAHmyOcF_gK2fqjts matplotlib]&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1gf7oRQIpvSvMScyJa5hexB9CCZvdozPs#scrollTo=lDznlLouvlFx Tutorial 2] - Markov matrices ([https://colab.research.google.com/drive/1x9iEHG_F522uFCvD_jGdvHaMETAHfO6-#scrollTo=eSu-nLZ6vm8X solutions])&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1tjqbjAi50C4qOqVRtTxEkTeTb10qpTms#scrollTo=uYpaubGkvogU Tutorial 3] - Thumb rule ([https://colab.research.google.com/drive/1aWVtz4ZGcpIarWiRVAnxrp1t0GDOqZxu#scrollTo=f7ohlMuZvqTr solutions])&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1g7HXFUBQUBF0fhy5h2jYbfIAVBTqvb7-#scrollTo=U9LFX8OFhHOG Homework 1] (deadline October 1)&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
* [https://colab.research.google.com/drive/1aMo4Ur-0_b4dGhdIfxAmCC2ci1rOda_v?usp=sharing Tutorial 2] Markov matrix [https://colab.research.google.com/drive/1Q5ajzxRGXBBorA9cQ9o8V5VUVJhUXpPS?usp=sharing problems]&lt;br /&gt;
* [https://colab.research.google.com/drive/1k60-ChM3aUWjGsiRsf2Idx9jxHHtwyAb?usp=sharing Tutorial 3] Thumb rule [https://colab.research.google.com/drive/1fdKJlp0lD4k530oRuu50_Hm_T8t3jixa?usp=sharing problems]&lt;br /&gt;
--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 17, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/15wrgivn6FSnuBUnMwjjhadmD-g1fkS7T/view?usp=sharing Lecture 2] Basic Sampling&lt;br /&gt;
&lt;br /&gt;
*  [https://drive.google.com/file/d/1ALR_QKLXdHby54xNux39NUOk4L-Ne1EW/view?usp=sharing  Lecture 3]: Errors and Precision&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 24, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1DijhG_856OAuj42WqY1UM47APmMy3A8B/view?usp=sharing Lecture 4]: Ising model and phase transitions &lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1sRUEs768Z6PKdJ3k7MixYeFGlufgjFrG Tutorial 4]: Ising model and phase transitions ([https://colab.research.google.com/drive/1KAQRog_YlAjKZ_hL1FMYurWdPBLNUocI solutions])&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
* [https://colab.research.google.com/drive/1nU4E_pFWjSFPNigzy8-LcJpef26IKY6x?usp=sharing Tutorial 4]: Ising model and phase transitions [https://colab.research.google.com/drive/1AEUX3U7hxDR_YYy8ld3knTEVR1KYa9SP?usp=sharing problems] &lt;br /&gt;
--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 1, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1PTya42ZS2kU87A-BxQFFIUDTs_k47men?usp=sharing Lecture 5]: Optimization &amp;amp; Dijkstra algorithm&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1ieT5BlfJsOehsa8r-LHGsFsn1dwYnawT Tutorial 5]: Simulated annealing ([https://colab.research.google.com/drive/1JNVl42KNASZiwTtqYo71z_vggjbGfKul solutions])&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
* [https://colab.research.google.com/drive/1p0ooWAXF9KNh-FztMHmVoA9yBzYOM8PC?usp=sharing Tutorial 5]: Simulated annealing [https://colab.research.google.com/drive/1txJGpzreHurWux7ev6sDsX8TjzpeQhZZ?usp=sharing problems]&lt;br /&gt;
--&amp;gt;&lt;br /&gt;
* Send your copy of Homework 1 to numphys.icfp  at   gmail.com  Thanks!&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1EPgj3la7vxDIqSQYNlOFz4rR0vHXAeae Homework 2] (deadline October 22)&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 8, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 6: Introduction to Bayesian inference&lt;br /&gt;
&lt;br /&gt;
* Tutorial 6: Bayesian inference and single-particle tracking. [https://drive.google.com/file/d/1q9Quq5mvJ4Avv2qWgzTocU-DVIxJIVWi/view?usp=sharing Questions]. [https://drive.google.com/file/d/1xYb4wfNBysse6Q7frTw_V9TPdUQU5lUx/view?usp=sharing Data]. [https://drive.google.com/file/d/1Ba_kRo3_XMIaDLNYZlbZEw-wGXKS-29I/view?usp=sharing Starting Notebook]. [https://colab.research.google.com/drive/1VePL9X1JT6yl8LmROeZyMyf4Epcu3yOL#scrollTo=1XQNGa_fyEkJ Google colab version]. Solutions [https://drive.google.com/file/d/1Q9IjVUeL7AA8uWk8DX9Vy9vuUQ21RYh2/view?usp=sharing]. Notebook [https://drive.google.com/file/d/1ZJmpdaTQVUttEaaI1ch-reFfZGI93454/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 15, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1eY5cuNcJqYw7df0PBkxq03tEnqzTOC-5/view?usp=sharing Lecture 7]: Importance sampling&lt;br /&gt;
&lt;br /&gt;
* Tutorial 7: Faster than the clock algorithms&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
* [https://colab.research.google.com/drive/1KyT442vB4EuGKBy_Xj3j8cLtMMl4gbac?usp=sharing Tutorial 6]: Faster than the clock algorithms [https://colab.research.google.com/drive/1C-ieAwaAKwkX5MFm8aX2kNO2GNeO9CdY?usp=sharing problems]&lt;br /&gt;
--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 22, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 8: Asymptotic inference and information&lt;br /&gt;
&lt;br /&gt;
* Tutorial 8:&lt;br /&gt;
&lt;br /&gt;
* Send your copy of Homework 2 to numphys.icfp  at   gmail.com  Thanks!&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 29, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 9: High-dimensional inference and Principal Component Analysis&lt;br /&gt;
&lt;br /&gt;
* Tutorial 9:&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, November 26, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 10: Priors, regularisation, sparsity&lt;br /&gt;
&lt;br /&gt;
* Tutorial 10:&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, November 12, 2021&#039;&#039;&#039;&lt;br /&gt;
* 2 pm - 4 pm The Quiz. &lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, December 3, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 11: Network inference&lt;br /&gt;
&lt;br /&gt;
* Tutorial 11:&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, December 10, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 12: Supervised learning and phase transitions&lt;br /&gt;
&lt;br /&gt;
* Tutorial 12:&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, December 17, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 13: Unsupervised learning and representations&lt;br /&gt;
&lt;br /&gt;
* Tutorial 13:&lt;/div&gt;</summary>
		<author><name>Alberto</name></author>
	</entry>
	<entry>
		<id>http://www.lptms.universite-paris-saclay.fr//wiki-cours/index.php?title=CoDaDri&amp;diff=1583</id>
		<title>CoDaDri</title>
		<link rel="alternate" type="text/html" href="http://www.lptms.universite-paris-saclay.fr//wiki-cours/index.php?title=CoDaDri&amp;diff=1583"/>
		<updated>2021-10-12T14:59:42Z</updated>

		<summary type="html">&lt;p&gt;Alberto: /* Grading */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;= Computational and Data Driven Physics =&lt;br /&gt;
&lt;br /&gt;
Modern physics is characterized by an increasing complexity of systems under investigation, in&lt;br /&gt;
domains as diverse as condensed matter, astrophysics, biophysics, etc. Establishing adequate&lt;br /&gt;
models to describe these systems and being able to make quantitative predictions from those models&lt;br /&gt;
is extremely challenging. The goal of the course is to provide the tools and concepts necessary to tackle those systems.&lt;br /&gt;
&lt;br /&gt;
== Course description ==&lt;br /&gt;
&lt;br /&gt;
We will first cover many algorithms used in many-body problems and complex systems, with special emphasis on Monte Carlo methods, molecular dynamics, and optimization in complex landscapes. &lt;br /&gt;
&lt;br /&gt;
Second, we will provide statistical inference and machine learning tools to harness the growing availability of experimental data to design accurate models of the underlying, complex, strongly non-homogeneous and interacting systems. &lt;br /&gt;
&lt;br /&gt;
Each theoretical lecture will be followed by a tutorial illustrating the concepts with practical applications&lt;br /&gt;
borrowed from various domains of physics. We will focus on methods and algorithms and physics, not&lt;br /&gt;
on programming and heavy numerics!  You will have to hand in 3 homeworks.&lt;br /&gt;
&lt;br /&gt;
== The Team ==&lt;br /&gt;
&lt;br /&gt;
* [http://lptms.u-psud.fr/alberto_rosso/ Alberto Rosso] (Computational physics)&lt;br /&gt;
* [http://www.phys.ens.fr/~monasson/ Rémi Monasson] (Data-driven physics)&lt;br /&gt;
*  [http://www.lps.ens.fr/~cocco/ Simona Cocco] &amp;amp; [https://www.pct.espci.fr/~david/ David Lacoste] &amp;amp; [https://www.cpht.polytechnique.fr/?q=en/node/110 Michel Ferrero] (Tutorials)&lt;br /&gt;
&lt;br /&gt;
== Where and When ==&lt;br /&gt;
&lt;br /&gt;
* Lectures on Fridays: 14:00-16:00&lt;br /&gt;
* Tutorials on Fridays: 16:00-18:00&lt;br /&gt;
* ENS, 29 rue D&#039;Ulm, salle Borel + Djebar&lt;br /&gt;
&lt;br /&gt;
== Slack ==&lt;br /&gt;
&lt;br /&gt;
If you have questions or want to discuss topics related to the lecture, to the exercises or to the homeworks, you can use the&lt;br /&gt;
[http://computational-ozw2847.slack.com Computational and Data Driven Physics Slack]. In order to join the Slack&lt;br /&gt;
use the following [https://join.slack.com/t/computational-ozw2847/shared_invite/zt-vegija8y-cx_vbF2BI6FJewx4W6coSA invitation link].&lt;br /&gt;
&lt;br /&gt;
== Computer Requirements ==&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;No previous experience in programming is required.&#039;&#039;&#039; &amp;lt;br&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Programming Language: Python&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
For practical installation, we recommand either to use  Anaconda (See [[Memento Python]]) or use google colab. &amp;lt;br&amp;gt;&lt;br /&gt;
The Collaboratory platform from Google is quite good way to use powerful computer without buying one: It requires no specific hardware or software, and even allows you to use GPU computing for free,  all by writting a jupyter notebook that you can then share.&lt;br /&gt;
&lt;br /&gt;
== Grading ==&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Computational Physics:&#039;&#039;&#039;&lt;br /&gt;
* Homework 1: 5 points &lt;br /&gt;
* Homework 2: 5 points&lt;br /&gt;
* Multiple Choice Questions in November: 10 points&lt;br /&gt;
&lt;br /&gt;
Here you find the MCQ proposed last year &lt;br /&gt;
[https://colab.research.google.com/drive/1Ru_-IQ001XEJd9VAn4nvbBNI_3XA9QSK?usp=sharing The Quiz]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Data Driven Physics:&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Final exam in January: 20 points&lt;br /&gt;
&lt;br /&gt;
== Schedule ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 3, 2021 &#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1X9h3lKD0OZLTKtxb7DWPfynY42rRuE7j/view?usp=sharing Lecture 1]   Introduction to Monte Carlo&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1sIv3qOdyE-XYkjYC-dkNsR72f4BgaQ_y/view?usp=sharing Tutorial 1] Markov Matrix&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 10, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Introductory notebooks: [https://colab.research.google.com/drive/1Ovrh1JjLzMMnxtasDgR1j84CHGU6hMxA python], [https://colab.research.google.com/drive/14PWu-C171pYhV8ven-Txc4wz5Tv1DCsK numpy] and [https://colab.research.google.com/drive/1fPjwrdxQPSyfXniyAHmyOcF_gK2fqjts matplotlib]&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1gf7oRQIpvSvMScyJa5hexB9CCZvdozPs#scrollTo=lDznlLouvlFx Tutorial 2] - Markov matrices ([https://colab.research.google.com/drive/1x9iEHG_F522uFCvD_jGdvHaMETAHfO6-#scrollTo=eSu-nLZ6vm8X solutions])&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1tjqbjAi50C4qOqVRtTxEkTeTb10qpTms#scrollTo=uYpaubGkvogU Tutorial 3] - Thumb rule ([https://colab.research.google.com/drive/1aWVtz4ZGcpIarWiRVAnxrp1t0GDOqZxu#scrollTo=f7ohlMuZvqTr solutions])&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1g7HXFUBQUBF0fhy5h2jYbfIAVBTqvb7-#scrollTo=U9LFX8OFhHOG Homework 1] (deadline October 1)&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
* [https://colab.research.google.com/drive/1aMo4Ur-0_b4dGhdIfxAmCC2ci1rOda_v?usp=sharing Tutorial 2] Markov matrix [https://colab.research.google.com/drive/1Q5ajzxRGXBBorA9cQ9o8V5VUVJhUXpPS?usp=sharing problems]&lt;br /&gt;
* [https://colab.research.google.com/drive/1k60-ChM3aUWjGsiRsf2Idx9jxHHtwyAb?usp=sharing Tutorial 3] Thumb rule [https://colab.research.google.com/drive/1fdKJlp0lD4k530oRuu50_Hm_T8t3jixa?usp=sharing problems]&lt;br /&gt;
--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 17, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/15wrgivn6FSnuBUnMwjjhadmD-g1fkS7T/view?usp=sharing Lecture 2] Basic Sampling&lt;br /&gt;
&lt;br /&gt;
*  [https://drive.google.com/file/d/1ALR_QKLXdHby54xNux39NUOk4L-Ne1EW/view?usp=sharing  Lecture 3]: Errors and Precision&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 24, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1DijhG_856OAuj42WqY1UM47APmMy3A8B/view?usp=sharing Lecture 4]: Ising model and phase transitions &lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1sRUEs768Z6PKdJ3k7MixYeFGlufgjFrG Tutorial 4]: Ising model and phase transitions ([https://colab.research.google.com/drive/1KAQRog_YlAjKZ_hL1FMYurWdPBLNUocI solutions])&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
* [https://colab.research.google.com/drive/1nU4E_pFWjSFPNigzy8-LcJpef26IKY6x?usp=sharing Tutorial 4]: Ising model and phase transitions [https://colab.research.google.com/drive/1AEUX3U7hxDR_YYy8ld3knTEVR1KYa9SP?usp=sharing problems] &lt;br /&gt;
--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 1, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1PTya42ZS2kU87A-BxQFFIUDTs_k47men?usp=sharing Lecture 5]: Optimization &amp;amp; Dijkstra algorithm&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1ieT5BlfJsOehsa8r-LHGsFsn1dwYnawT Tutorial 5]: Simulated annealing ([https://colab.research.google.com/drive/1JNVl42KNASZiwTtqYo71z_vggjbGfKul solutions])&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
* [https://colab.research.google.com/drive/1p0ooWAXF9KNh-FztMHmVoA9yBzYOM8PC?usp=sharing Tutorial 5]: Simulated annealing [https://colab.research.google.com/drive/1txJGpzreHurWux7ev6sDsX8TjzpeQhZZ?usp=sharing problems]&lt;br /&gt;
--&amp;gt;&lt;br /&gt;
* Send your copy of Homework 1 to numphys.icfp  at   gmail.com  Thanks!&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1EPgj3la7vxDIqSQYNlOFz4rR0vHXAeae Homework 2] (deadline October 22)&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 8, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 6: Introduction to Bayesian inference&lt;br /&gt;
&lt;br /&gt;
* Tutorial 6: Bayesian inference and single-particle tracking. [https://drive.google.com/file/d/1q9Quq5mvJ4Avv2qWgzTocU-DVIxJIVWi/view?usp=sharing Questions]. [https://drive.google.com/file/d/1xYb4wfNBysse6Q7frTw_V9TPdUQU5lUx/view?usp=sharing Data]. [https://drive.google.com/file/d/1Ba_kRo3_XMIaDLNYZlbZEw-wGXKS-29I/view?usp=sharing Starting Notebook]. [https://colab.research.google.com/drive/1VePL9X1JT6yl8LmROeZyMyf4Epcu3yOL#scrollTo=1XQNGa_fyEkJ Google colab version]. Solutions [https://drive.google.com/file/d/1Q9IjVUeL7AA8uWk8DX9Vy9vuUQ21RYh2/view?usp=sharing]. Notebook [https://drive.google.com/file/d/1ZJmpdaTQVUttEaaI1ch-reFfZGI93454/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 15, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1eY5cuNcJqYw7df0PBkxq03tEnqzTOC-5/view?usp=sharing Lecture 7]: Importance sampling&lt;br /&gt;
&lt;br /&gt;
* Tutorial 7: Faster than the clock algorithms&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
* [https://colab.research.google.com/drive/1KyT442vB4EuGKBy_Xj3j8cLtMMl4gbac?usp=sharing Tutorial 6]: Faster than the clock algorithms [https://colab.research.google.com/drive/1C-ieAwaAKwkX5MFm8aX2kNO2GNeO9CdY?usp=sharing problems]&lt;br /&gt;
--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 22, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 8: Asymptotic inference and information&lt;br /&gt;
&lt;br /&gt;
* Tutorial 8:&lt;br /&gt;
&lt;br /&gt;
* Send your copy of Homework 2 to numphys.icfp  at   gmail.com  Thanks!&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 29, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 9: High-dimensional inference and Principal Component Analysis&lt;br /&gt;
&lt;br /&gt;
* Tutorial 9:&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, November 26, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 10: Priors, regularisation, sparsity&lt;br /&gt;
&lt;br /&gt;
* Tutorial 10:&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, December 3, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 11: Network inference&lt;br /&gt;
&lt;br /&gt;
* Tutorial 11:&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, December 10, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 12: Supervised learning and phase transitions&lt;br /&gt;
&lt;br /&gt;
* Tutorial 12:&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, December 17, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 13: Unsupervised learning and representations&lt;br /&gt;
&lt;br /&gt;
* Tutorial 13:&lt;/div&gt;</summary>
		<author><name>Alberto</name></author>
	</entry>
	<entry>
		<id>http://www.lptms.universite-paris-saclay.fr//wiki-cours/index.php?title=CoDaDri&amp;diff=1582</id>
		<title>CoDaDri</title>
		<link rel="alternate" type="text/html" href="http://www.lptms.universite-paris-saclay.fr//wiki-cours/index.php?title=CoDaDri&amp;diff=1582"/>
		<updated>2021-10-12T14:59:21Z</updated>

		<summary type="html">&lt;p&gt;Alberto: /* Grading */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;= Computational and Data Driven Physics =&lt;br /&gt;
&lt;br /&gt;
Modern physics is characterized by an increasing complexity of systems under investigation, in&lt;br /&gt;
domains as diverse as condensed matter, astrophysics, biophysics, etc. Establishing adequate&lt;br /&gt;
models to describe these systems and being able to make quantitative predictions from those models&lt;br /&gt;
is extremely challenging. The goal of the course is to provide the tools and concepts necessary to tackle those systems.&lt;br /&gt;
&lt;br /&gt;
== Course description ==&lt;br /&gt;
&lt;br /&gt;
We will first cover many algorithms used in many-body problems and complex systems, with special emphasis on Monte Carlo methods, molecular dynamics, and optimization in complex landscapes. &lt;br /&gt;
&lt;br /&gt;
Second, we will provide statistical inference and machine learning tools to harness the growing availability of experimental data to design accurate models of the underlying, complex, strongly non-homogeneous and interacting systems. &lt;br /&gt;
&lt;br /&gt;
Each theoretical lecture will be followed by a tutorial illustrating the concepts with practical applications&lt;br /&gt;
borrowed from various domains of physics. We will focus on methods and algorithms and physics, not&lt;br /&gt;
on programming and heavy numerics!  You will have to hand in 3 homeworks.&lt;br /&gt;
&lt;br /&gt;
== The Team ==&lt;br /&gt;
&lt;br /&gt;
* [http://lptms.u-psud.fr/alberto_rosso/ Alberto Rosso] (Computational physics)&lt;br /&gt;
* [http://www.phys.ens.fr/~monasson/ Rémi Monasson] (Data-driven physics)&lt;br /&gt;
*  [http://www.lps.ens.fr/~cocco/ Simona Cocco] &amp;amp; [https://www.pct.espci.fr/~david/ David Lacoste] &amp;amp; [https://www.cpht.polytechnique.fr/?q=en/node/110 Michel Ferrero] (Tutorials)&lt;br /&gt;
&lt;br /&gt;
== Where and When ==&lt;br /&gt;
&lt;br /&gt;
* Lectures on Fridays: 14:00-16:00&lt;br /&gt;
* Tutorials on Fridays: 16:00-18:00&lt;br /&gt;
* ENS, 29 rue D&#039;Ulm, salle Borel + Djebar&lt;br /&gt;
&lt;br /&gt;
== Slack ==&lt;br /&gt;
&lt;br /&gt;
If you have questions or want to discuss topics related to the lecture, to the exercises or to the homeworks, you can use the&lt;br /&gt;
[http://computational-ozw2847.slack.com Computational and Data Driven Physics Slack]. In order to join the Slack&lt;br /&gt;
use the following [https://join.slack.com/t/computational-ozw2847/shared_invite/zt-vegija8y-cx_vbF2BI6FJewx4W6coSA invitation link].&lt;br /&gt;
&lt;br /&gt;
== Computer Requirements ==&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;No previous experience in programming is required.&#039;&#039;&#039; &amp;lt;br&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Programming Language: Python&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
For practical installation, we recommand either to use  Anaconda (See [[Memento Python]]) or use google colab. &amp;lt;br&amp;gt;&lt;br /&gt;
The Collaboratory platform from Google is quite good way to use powerful computer without buying one: It requires no specific hardware or software, and even allows you to use GPU computing for free,  all by writting a jupyter notebook that you can then share.&lt;br /&gt;
&lt;br /&gt;
== Grading ==&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Computational Physics:&#039;&#039;&#039;&lt;br /&gt;
* Homework 1: 5 points &lt;br /&gt;
* Homework 2: 5 points&lt;br /&gt;
* Multiple Choice Questions in November: 10 points&lt;br /&gt;
&lt;br /&gt;
Here you find the MCQ proposed last year [&lt;br /&gt;
https://colab.research.google.com/drive/1Ru_-IQ001XEJd9VAn4nvbBNI_3XA9QSK?usp=sharing The Quiz]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Data Driven Physics:&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Final exam in January: 20 points&lt;br /&gt;
&lt;br /&gt;
== Schedule ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 3, 2021 &#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1X9h3lKD0OZLTKtxb7DWPfynY42rRuE7j/view?usp=sharing Lecture 1]   Introduction to Monte Carlo&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1sIv3qOdyE-XYkjYC-dkNsR72f4BgaQ_y/view?usp=sharing Tutorial 1] Markov Matrix&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 10, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Introductory notebooks: [https://colab.research.google.com/drive/1Ovrh1JjLzMMnxtasDgR1j84CHGU6hMxA python], [https://colab.research.google.com/drive/14PWu-C171pYhV8ven-Txc4wz5Tv1DCsK numpy] and [https://colab.research.google.com/drive/1fPjwrdxQPSyfXniyAHmyOcF_gK2fqjts matplotlib]&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1gf7oRQIpvSvMScyJa5hexB9CCZvdozPs#scrollTo=lDznlLouvlFx Tutorial 2] - Markov matrices ([https://colab.research.google.com/drive/1x9iEHG_F522uFCvD_jGdvHaMETAHfO6-#scrollTo=eSu-nLZ6vm8X solutions])&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1tjqbjAi50C4qOqVRtTxEkTeTb10qpTms#scrollTo=uYpaubGkvogU Tutorial 3] - Thumb rule ([https://colab.research.google.com/drive/1aWVtz4ZGcpIarWiRVAnxrp1t0GDOqZxu#scrollTo=f7ohlMuZvqTr solutions])&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1g7HXFUBQUBF0fhy5h2jYbfIAVBTqvb7-#scrollTo=U9LFX8OFhHOG Homework 1] (deadline October 1)&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
* [https://colab.research.google.com/drive/1aMo4Ur-0_b4dGhdIfxAmCC2ci1rOda_v?usp=sharing Tutorial 2] Markov matrix [https://colab.research.google.com/drive/1Q5ajzxRGXBBorA9cQ9o8V5VUVJhUXpPS?usp=sharing problems]&lt;br /&gt;
* [https://colab.research.google.com/drive/1k60-ChM3aUWjGsiRsf2Idx9jxHHtwyAb?usp=sharing Tutorial 3] Thumb rule [https://colab.research.google.com/drive/1fdKJlp0lD4k530oRuu50_Hm_T8t3jixa?usp=sharing problems]&lt;br /&gt;
--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 17, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/15wrgivn6FSnuBUnMwjjhadmD-g1fkS7T/view?usp=sharing Lecture 2] Basic Sampling&lt;br /&gt;
&lt;br /&gt;
*  [https://drive.google.com/file/d/1ALR_QKLXdHby54xNux39NUOk4L-Ne1EW/view?usp=sharing  Lecture 3]: Errors and Precision&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 24, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1DijhG_856OAuj42WqY1UM47APmMy3A8B/view?usp=sharing Lecture 4]: Ising model and phase transitions &lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1sRUEs768Z6PKdJ3k7MixYeFGlufgjFrG Tutorial 4]: Ising model and phase transitions ([https://colab.research.google.com/drive/1KAQRog_YlAjKZ_hL1FMYurWdPBLNUocI solutions])&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
* [https://colab.research.google.com/drive/1nU4E_pFWjSFPNigzy8-LcJpef26IKY6x?usp=sharing Tutorial 4]: Ising model and phase transitions [https://colab.research.google.com/drive/1AEUX3U7hxDR_YYy8ld3knTEVR1KYa9SP?usp=sharing problems] &lt;br /&gt;
--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 1, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1PTya42ZS2kU87A-BxQFFIUDTs_k47men?usp=sharing Lecture 5]: Optimization &amp;amp; Dijkstra algorithm&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1ieT5BlfJsOehsa8r-LHGsFsn1dwYnawT Tutorial 5]: Simulated annealing ([https://colab.research.google.com/drive/1JNVl42KNASZiwTtqYo71z_vggjbGfKul solutions])&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
* [https://colab.research.google.com/drive/1p0ooWAXF9KNh-FztMHmVoA9yBzYOM8PC?usp=sharing Tutorial 5]: Simulated annealing [https://colab.research.google.com/drive/1txJGpzreHurWux7ev6sDsX8TjzpeQhZZ?usp=sharing problems]&lt;br /&gt;
--&amp;gt;&lt;br /&gt;
* Send your copy of Homework 1 to numphys.icfp  at   gmail.com  Thanks!&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1EPgj3la7vxDIqSQYNlOFz4rR0vHXAeae Homework 2] (deadline October 22)&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 8, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 6: Introduction to Bayesian inference&lt;br /&gt;
&lt;br /&gt;
* Tutorial 6: Bayesian inference and single-particle tracking. [https://drive.google.com/file/d/1q9Quq5mvJ4Avv2qWgzTocU-DVIxJIVWi/view?usp=sharing Questions]. [https://drive.google.com/file/d/1xYb4wfNBysse6Q7frTw_V9TPdUQU5lUx/view?usp=sharing Data]. [https://drive.google.com/file/d/1Ba_kRo3_XMIaDLNYZlbZEw-wGXKS-29I/view?usp=sharing Starting Notebook]. [https://colab.research.google.com/drive/1VePL9X1JT6yl8LmROeZyMyf4Epcu3yOL#scrollTo=1XQNGa_fyEkJ Google colab version]. Solutions [https://drive.google.com/file/d/1Q9IjVUeL7AA8uWk8DX9Vy9vuUQ21RYh2/view?usp=sharing]. Notebook [https://drive.google.com/file/d/1ZJmpdaTQVUttEaaI1ch-reFfZGI93454/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 15, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1eY5cuNcJqYw7df0PBkxq03tEnqzTOC-5/view?usp=sharing Lecture 7]: Importance sampling&lt;br /&gt;
&lt;br /&gt;
* Tutorial 7: Faster than the clock algorithms&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
* [https://colab.research.google.com/drive/1KyT442vB4EuGKBy_Xj3j8cLtMMl4gbac?usp=sharing Tutorial 6]: Faster than the clock algorithms [https://colab.research.google.com/drive/1C-ieAwaAKwkX5MFm8aX2kNO2GNeO9CdY?usp=sharing problems]&lt;br /&gt;
--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 22, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 8: Asymptotic inference and information&lt;br /&gt;
&lt;br /&gt;
* Tutorial 8:&lt;br /&gt;
&lt;br /&gt;
* Send your copy of Homework 2 to numphys.icfp  at   gmail.com  Thanks!&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 29, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 9: High-dimensional inference and Principal Component Analysis&lt;br /&gt;
&lt;br /&gt;
* Tutorial 9:&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, November 26, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 10: Priors, regularisation, sparsity&lt;br /&gt;
&lt;br /&gt;
* Tutorial 10:&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, December 3, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 11: Network inference&lt;br /&gt;
&lt;br /&gt;
* Tutorial 11:&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, December 10, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 12: Supervised learning and phase transitions&lt;br /&gt;
&lt;br /&gt;
* Tutorial 12:&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, December 17, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 13: Unsupervised learning and representations&lt;br /&gt;
&lt;br /&gt;
* Tutorial 13:&lt;/div&gt;</summary>
		<author><name>Alberto</name></author>
	</entry>
	<entry>
		<id>http://www.lptms.universite-paris-saclay.fr//wiki-cours/index.php?title=CoDaDri&amp;diff=1581</id>
		<title>CoDaDri</title>
		<link rel="alternate" type="text/html" href="http://www.lptms.universite-paris-saclay.fr//wiki-cours/index.php?title=CoDaDri&amp;diff=1581"/>
		<updated>2021-10-12T14:58:40Z</updated>

		<summary type="html">&lt;p&gt;Alberto: /* Grading */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;= Computational and Data Driven Physics =&lt;br /&gt;
&lt;br /&gt;
Modern physics is characterized by an increasing complexity of systems under investigation, in&lt;br /&gt;
domains as diverse as condensed matter, astrophysics, biophysics, etc. Establishing adequate&lt;br /&gt;
models to describe these systems and being able to make quantitative predictions from those models&lt;br /&gt;
is extremely challenging. The goal of the course is to provide the tools and concepts necessary to tackle those systems.&lt;br /&gt;
&lt;br /&gt;
== Course description ==&lt;br /&gt;
&lt;br /&gt;
We will first cover many algorithms used in many-body problems and complex systems, with special emphasis on Monte Carlo methods, molecular dynamics, and optimization in complex landscapes. &lt;br /&gt;
&lt;br /&gt;
Second, we will provide statistical inference and machine learning tools to harness the growing availability of experimental data to design accurate models of the underlying, complex, strongly non-homogeneous and interacting systems. &lt;br /&gt;
&lt;br /&gt;
Each theoretical lecture will be followed by a tutorial illustrating the concepts with practical applications&lt;br /&gt;
borrowed from various domains of physics. We will focus on methods and algorithms and physics, not&lt;br /&gt;
on programming and heavy numerics!  You will have to hand in 3 homeworks.&lt;br /&gt;
&lt;br /&gt;
== The Team ==&lt;br /&gt;
&lt;br /&gt;
* [http://lptms.u-psud.fr/alberto_rosso/ Alberto Rosso] (Computational physics)&lt;br /&gt;
* [http://www.phys.ens.fr/~monasson/ Rémi Monasson] (Data-driven physics)&lt;br /&gt;
*  [http://www.lps.ens.fr/~cocco/ Simona Cocco] &amp;amp; [https://www.pct.espci.fr/~david/ David Lacoste] &amp;amp; [https://www.cpht.polytechnique.fr/?q=en/node/110 Michel Ferrero] (Tutorials)&lt;br /&gt;
&lt;br /&gt;
== Where and When ==&lt;br /&gt;
&lt;br /&gt;
* Lectures on Fridays: 14:00-16:00&lt;br /&gt;
* Tutorials on Fridays: 16:00-18:00&lt;br /&gt;
* ENS, 29 rue D&#039;Ulm, salle Borel + Djebar&lt;br /&gt;
&lt;br /&gt;
== Slack ==&lt;br /&gt;
&lt;br /&gt;
If you have questions or want to discuss topics related to the lecture, to the exercises or to the homeworks, you can use the&lt;br /&gt;
[http://computational-ozw2847.slack.com Computational and Data Driven Physics Slack]. In order to join the Slack&lt;br /&gt;
use the following [https://join.slack.com/t/computational-ozw2847/shared_invite/zt-vegija8y-cx_vbF2BI6FJewx4W6coSA invitation link].&lt;br /&gt;
&lt;br /&gt;
== Computer Requirements ==&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;No previous experience in programming is required.&#039;&#039;&#039; &amp;lt;br&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Programming Language: Python&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
For practical installation, we recommand either to use  Anaconda (See [[Memento Python]]) or use google colab. &amp;lt;br&amp;gt;&lt;br /&gt;
The Collaboratory platform from Google is quite good way to use powerful computer without buying one: It requires no specific hardware or software, and even allows you to use GPU computing for free,  all by writting a jupyter notebook that you can then share.&lt;br /&gt;
&lt;br /&gt;
== Grading ==&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Computational Physics:&#039;&#039;&#039;&lt;br /&gt;
* Homework 1: 5 points &lt;br /&gt;
* Homework 2: 5 points&lt;br /&gt;
* Multiple Choice Questions in November: 10 points&lt;br /&gt;
&lt;br /&gt;
Here you find the MCQ proposed last year&lt;br /&gt;
https://colab.research.google.com/drive/1Ru_-IQ001XEJd9VAn4nvbBNI_3XA9QSK?usp=sharing&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Data Driven Physics:&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Final exam in January: 20 points&lt;br /&gt;
&lt;br /&gt;
== Schedule ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 3, 2021 &#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1X9h3lKD0OZLTKtxb7DWPfynY42rRuE7j/view?usp=sharing Lecture 1]   Introduction to Monte Carlo&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1sIv3qOdyE-XYkjYC-dkNsR72f4BgaQ_y/view?usp=sharing Tutorial 1] Markov Matrix&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 10, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Introductory notebooks: [https://colab.research.google.com/drive/1Ovrh1JjLzMMnxtasDgR1j84CHGU6hMxA python], [https://colab.research.google.com/drive/14PWu-C171pYhV8ven-Txc4wz5Tv1DCsK numpy] and [https://colab.research.google.com/drive/1fPjwrdxQPSyfXniyAHmyOcF_gK2fqjts matplotlib]&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1gf7oRQIpvSvMScyJa5hexB9CCZvdozPs#scrollTo=lDznlLouvlFx Tutorial 2] - Markov matrices ([https://colab.research.google.com/drive/1x9iEHG_F522uFCvD_jGdvHaMETAHfO6-#scrollTo=eSu-nLZ6vm8X solutions])&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1tjqbjAi50C4qOqVRtTxEkTeTb10qpTms#scrollTo=uYpaubGkvogU Tutorial 3] - Thumb rule ([https://colab.research.google.com/drive/1aWVtz4ZGcpIarWiRVAnxrp1t0GDOqZxu#scrollTo=f7ohlMuZvqTr solutions])&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1g7HXFUBQUBF0fhy5h2jYbfIAVBTqvb7-#scrollTo=U9LFX8OFhHOG Homework 1] (deadline October 1)&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
* [https://colab.research.google.com/drive/1aMo4Ur-0_b4dGhdIfxAmCC2ci1rOda_v?usp=sharing Tutorial 2] Markov matrix [https://colab.research.google.com/drive/1Q5ajzxRGXBBorA9cQ9o8V5VUVJhUXpPS?usp=sharing problems]&lt;br /&gt;
* [https://colab.research.google.com/drive/1k60-ChM3aUWjGsiRsf2Idx9jxHHtwyAb?usp=sharing Tutorial 3] Thumb rule [https://colab.research.google.com/drive/1fdKJlp0lD4k530oRuu50_Hm_T8t3jixa?usp=sharing problems]&lt;br /&gt;
--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 17, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/15wrgivn6FSnuBUnMwjjhadmD-g1fkS7T/view?usp=sharing Lecture 2] Basic Sampling&lt;br /&gt;
&lt;br /&gt;
*  [https://drive.google.com/file/d/1ALR_QKLXdHby54xNux39NUOk4L-Ne1EW/view?usp=sharing  Lecture 3]: Errors and Precision&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, September 24, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1DijhG_856OAuj42WqY1UM47APmMy3A8B/view?usp=sharing Lecture 4]: Ising model and phase transitions &lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1sRUEs768Z6PKdJ3k7MixYeFGlufgjFrG Tutorial 4]: Ising model and phase transitions ([https://colab.research.google.com/drive/1KAQRog_YlAjKZ_hL1FMYurWdPBLNUocI solutions])&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
* [https://colab.research.google.com/drive/1nU4E_pFWjSFPNigzy8-LcJpef26IKY6x?usp=sharing Tutorial 4]: Ising model and phase transitions [https://colab.research.google.com/drive/1AEUX3U7hxDR_YYy8ld3knTEVR1KYa9SP?usp=sharing problems] &lt;br /&gt;
--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 1, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1PTya42ZS2kU87A-BxQFFIUDTs_k47men?usp=sharing Lecture 5]: Optimization &amp;amp; Dijkstra algorithm&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1ieT5BlfJsOehsa8r-LHGsFsn1dwYnawT Tutorial 5]: Simulated annealing ([https://colab.research.google.com/drive/1JNVl42KNASZiwTtqYo71z_vggjbGfKul solutions])&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
* [https://colab.research.google.com/drive/1p0ooWAXF9KNh-FztMHmVoA9yBzYOM8PC?usp=sharing Tutorial 5]: Simulated annealing [https://colab.research.google.com/drive/1txJGpzreHurWux7ev6sDsX8TjzpeQhZZ?usp=sharing problems]&lt;br /&gt;
--&amp;gt;&lt;br /&gt;
* Send your copy of Homework 1 to numphys.icfp  at   gmail.com  Thanks!&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1EPgj3la7vxDIqSQYNlOFz4rR0vHXAeae Homework 2] (deadline October 22)&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 8, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 6: Introduction to Bayesian inference&lt;br /&gt;
&lt;br /&gt;
* Tutorial 6: Bayesian inference and single-particle tracking. [https://drive.google.com/file/d/1q9Quq5mvJ4Avv2qWgzTocU-DVIxJIVWi/view?usp=sharing Questions]. [https://drive.google.com/file/d/1xYb4wfNBysse6Q7frTw_V9TPdUQU5lUx/view?usp=sharing Data]. [https://drive.google.com/file/d/1Ba_kRo3_XMIaDLNYZlbZEw-wGXKS-29I/view?usp=sharing Starting Notebook]. [https://colab.research.google.com/drive/1VePL9X1JT6yl8LmROeZyMyf4Epcu3yOL#scrollTo=1XQNGa_fyEkJ Google colab version]. Solutions [https://drive.google.com/file/d/1Q9IjVUeL7AA8uWk8DX9Vy9vuUQ21RYh2/view?usp=sharing]. Notebook [https://drive.google.com/file/d/1ZJmpdaTQVUttEaaI1ch-reFfZGI93454/view?usp=sharing]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 15, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1eY5cuNcJqYw7df0PBkxq03tEnqzTOC-5/view?usp=sharing Lecture 7]: Importance sampling&lt;br /&gt;
&lt;br /&gt;
* Tutorial 7: Faster than the clock algorithms&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
* [https://colab.research.google.com/drive/1KyT442vB4EuGKBy_Xj3j8cLtMMl4gbac?usp=sharing Tutorial 6]: Faster than the clock algorithms [https://colab.research.google.com/drive/1C-ieAwaAKwkX5MFm8aX2kNO2GNeO9CdY?usp=sharing problems]&lt;br /&gt;
--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 22, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 8: Asymptotic inference and information&lt;br /&gt;
&lt;br /&gt;
* Tutorial 8:&lt;br /&gt;
&lt;br /&gt;
* Send your copy of Homework 2 to numphys.icfp  at   gmail.com  Thanks!&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 29, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 9: High-dimensional inference and Principal Component Analysis&lt;br /&gt;
&lt;br /&gt;
* Tutorial 9:&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, November 26, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 10: Priors, regularisation, sparsity&lt;br /&gt;
&lt;br /&gt;
* Tutorial 10:&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, December 3, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 11: Network inference&lt;br /&gt;
&lt;br /&gt;
* Tutorial 11:&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, December 10, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 12: Supervised learning and phase transitions&lt;br /&gt;
&lt;br /&gt;
* Tutorial 12:&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, December 17, 2021&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
* Lecture 13: Unsupervised learning and representations&lt;br /&gt;
&lt;br /&gt;
* Tutorial 13:&lt;/div&gt;</summary>
		<author><name>Alberto</name></author>
	</entry>
</feed>