<?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=Mmedenjak</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=Mmedenjak"/>
	<link rel="alternate" type="text/html" href="http://www.lptms.universite-paris-saclay.fr//wiki-cours/index.php/Special:Contributions/Mmedenjak"/>
	<updated>2026-05-17T04:40:52Z</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=NUMPHYsandML&amp;diff=1379</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=1379"/>
		<updated>2020-12-02T16:14:02Z</updated>

		<summary type="html">&lt;p&gt;Mmedenjak: &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 (10 points each) + 1 MCQ (30 points)&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039; Here you can find a trial of the MCQ&#039;&#039;&#039; [https://drive.google.com/file/d/1ShlhE6PnR34SVGeT3aoJAuyg5n3QCUZl/view?usp=sharing  10 Questions about numerical physics]&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;you can find a short presentation video of the MCQ on the Dropbox by  A. Rosso&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
== Schedule ==&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039; Project in Markox Chain Monte Carlo&#039;&#039;&#039; [https://drive.google.com/file/d/1YHERixzqAwGHeEHZYIZwHXl11Ezt_m3h/view?usp=sharing Manon Michel&#039;s Project]&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: follow the link [https://epfl.zoom.us/my/krzakalaflorent]&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: the final test&#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>Mmedenjak</name></author>
	</entry>
	<entry>
		<id>http://www.lptms.universite-paris-saclay.fr//wiki-cours/index.php?title=NUMPHYsandML&amp;diff=1373</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=1373"/>
		<updated>2020-11-24T17:38:37Z</updated>

		<summary type="html">&lt;p&gt;Mmedenjak: &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 (10 points each) + 1 MCQ (30 points)&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039; Here you can find a trial of the MCQ&#039;&#039;&#039; [https://drive.google.com/file/d/1ShlhE6PnR34SVGeT3aoJAuyg5n3QCUZl/view?usp=sharing  10 Questions about numerical physics]&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;you can find a short presentation video of the MCQ on the Dropbox by  A. Rosso&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
== Schedule ==&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039; Project in Markox Chain Monte Carlo&#039;&#039;&#039; [https://drive.google.com/file/d/1YHERixzqAwGHeEHZYIZwHXl11Ezt_m3h/view?usp=sharing Manon Michel&#039;s Project]&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: follow the link [https://epfl.zoom.us/my/krzakalaflorent]&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;
[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;
Modern neural networks&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: the final test&#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>Mmedenjak</name></author>
	</entry>
	<entry>
		<id>http://www.lptms.universite-paris-saclay.fr//wiki-cours/index.php?title=NUMPHYsandML&amp;diff=1370</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=1370"/>
		<updated>2020-11-17T14:41:53Z</updated>

		<summary type="html">&lt;p&gt;Mmedenjak: &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 (10 points each) + 1 MCQ (30 points)&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039; Here you can find a trial of the MCQ&#039;&#039;&#039; [https://drive.google.com/file/d/1ShlhE6PnR34SVGeT3aoJAuyg5n3QCUZl/view?usp=sharing  10 Questions about numerical physics]&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;you can find a short presentation video of the MCQ on the Dropbox by  A. Rosso&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
== Schedule ==&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039; Project in Markox Chain Monte Carlo&#039;&#039;&#039; [https://drive.google.com/file/d/1YHERixzqAwGHeEHZYIZwHXl11Ezt_m3h/view?usp=sharing Manon Michel&#039;s Project]&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: follow the link [https://epfl.zoom.us/my/krzakalaflorent]&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;
&#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;
&#039;&#039;&#039;Friday, November 27, 2020&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
Kernel methods and neural networks&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, December 4, 2020&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
Modern neural networks&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;
&#039;&#039;&#039;Friday, December 11, 2020&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Multiple Choice Questions: the final test&#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>Mmedenjak</name></author>
	</entry>
	<entry>
		<id>http://www.lptms.universite-paris-saclay.fr//wiki-cours/index.php?title=NUMPHYsandML&amp;diff=1369</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=1369"/>
		<updated>2020-11-17T14:39:26Z</updated>

		<summary type="html">&lt;p&gt;Mmedenjak: &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 (10 points each) + 1 MCQ (30 points)&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039; Here you can find a trial of the MCQ&#039;&#039;&#039; [https://drive.google.com/file/d/1ShlhE6PnR34SVGeT3aoJAuyg5n3QCUZl/view?usp=sharing  10 Questions about numerical physics]&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;you can find a short presentation video of the MCQ on the Dropbox by  A. Rosso&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
== Schedule ==&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039; Project in Markox Chain Monte Carlo&#039;&#039;&#039; [https://drive.google.com/file/d/1YHERixzqAwGHeEHZYIZwHXl11Ezt_m3h/view?usp=sharing Manon Michel&#039;s Project]&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: follow the link [https://epfl.zoom.us/my/krzakalaflorent]&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;
&#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;
&#039;&#039;&#039;Friday, November 27, 2020&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
Kernel methods and neural networks&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday, December 4, 2020&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
Modern neural networks&lt;br /&gt;
&lt;br /&gt;
Due: Homework 3 (send it to me (Marko))&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: the final test&#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>Mmedenjak</name></author>
	</entry>
	<entry>
		<id>http://www.lptms.universite-paris-saclay.fr//wiki-cours/index.php?title=NUMPHYsandML&amp;diff=1364</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=1364"/>
		<updated>2020-11-13T13:15:27Z</updated>

		<summary type="html">&lt;p&gt;Mmedenjak: &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 (10 points each) + 1 MCQ (20 points)&lt;br /&gt;
&lt;br /&gt;
== Schedule ==&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039; Project in Markox Chain Monte Carlo&#039;&#039;&#039; [https://drive.google.com/file/d/1YHERixzqAwGHeEHZYIZwHXl11Ezt_m3h/view?usp=sharing Manon Michel&#039;s Project]&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: follow the link [https://epfl.zoom.us/my/krzakalaflorent]&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;
&#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;Friday, December 11, 2020&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Multiple Choice Questions: the final test&#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>Mmedenjak</name></author>
	</entry>
	<entry>
		<id>http://www.lptms.universite-paris-saclay.fr//wiki-cours/index.php?title=NUMPHYsandML&amp;diff=1363</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=1363"/>
		<updated>2020-11-13T13:14:31Z</updated>

		<summary type="html">&lt;p&gt;Mmedenjak: &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 (10 points each) + 1 MCQ (20 points)&lt;br /&gt;
&lt;br /&gt;
== Schedule ==&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039; Project in Markox Chain Monte Carlo&#039;&#039;&#039; [https://drive.google.com/file/d/1YHERixzqAwGHeEHZYIZwHXl11Ezt_m3h/view?usp=sharing Manon Michel&#039;s Project]&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: follow the link [https://epfl.zoom.us/my/krzakalaflorent]&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;
&#039;&#039;&#039;Friday, November 13, 2020&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
Lecture 10: &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;Friday, December 11, 2020&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Multiple Choice Questions: the final test&#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>Mmedenjak</name></author>
	</entry>
	<entry>
		<id>http://www.lptms.universite-paris-saclay.fr//wiki-cours/index.php?title=NUMPHYsandML&amp;diff=1357</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=1357"/>
		<updated>2020-11-03T17:48:52Z</updated>

		<summary type="html">&lt;p&gt;Mmedenjak: &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 (10 points each) + 1 MCQ (20 points)&lt;br /&gt;
&lt;br /&gt;
== Schedule ==&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039; Project in Markox Chain Monte Carlo&#039;&#039;&#039; [https://drive.google.com/file/d/1YHERixzqAwGHeEHZYIZwHXl11Ezt_m3h/view?usp=sharing Manon Michel&#039;s Project]&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: follow the link [https://epfl.zoom.us/my/krzakalaflorent]&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;
&#039;&#039;&#039;Friday, December 11, 2020&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Multiple Choice Questions: the final test&#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>Mmedenjak</name></author>
	</entry>
	<entry>
		<id>http://www.lptms.universite-paris-saclay.fr//wiki-cours/index.php?title=NUMPHYsandML&amp;diff=1353</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=1353"/>
		<updated>2020-10-19T18:54:07Z</updated>

		<summary type="html">&lt;p&gt;Mmedenjak: &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/lecture room.&#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 (10 points each) + 1 MCQ (20 points)&lt;br /&gt;
&lt;br /&gt;
== Schedule ==&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039; Project in Markox Chain Monte Carlo&#039;&#039;&#039; [https://drive.google.com/file/d/1YHERixzqAwGHeEHZYIZwHXl11Ezt_m3h/view?usp=sharing Manon Michel&#039;s Project]&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;
TUtorial 9: Restricted Boltzmann machines&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: the final test&#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>Mmedenjak</name></author>
	</entry>
	<entry>
		<id>http://www.lptms.universite-paris-saclay.fr//wiki-cours/index.php?title=NUMPHYsandML&amp;diff=1352</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=1352"/>
		<updated>2020-10-19T09:49:17Z</updated>

		<summary type="html">&lt;p&gt;Mmedenjak: &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/lecture room.&#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 (10 points each) + 1 MCQ (20 points)&lt;br /&gt;
&lt;br /&gt;
== Schedule ==&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039; Project in Markox Chain Monte Carlo&#039;&#039;&#039; [https://drive.google.com/file/d/1YHERixzqAwGHeEHZYIZwHXl11Ezt_m3h/view?usp=sharing Manon Michel&#039;s Project]&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 Likelihood estimation&lt;br /&gt;
&lt;br /&gt;
[https://colab.research.google.com/drive/1m2YBrQLfhVSMBpTEsfvOf4hXVZplp1D7?usp=sharing#scrollTo=-cLvGNzqh2Ah Tutorial 8]: Maximum Likelihood 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;
TUtorial 9: Restricted Boltzmann machines&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: the final test&#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>Mmedenjak</name></author>
	</entry>
	<entry>
		<id>http://www.lptms.universite-paris-saclay.fr//wiki-cours/index.php?title=NUMPHYsandML&amp;diff=1351</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=1351"/>
		<updated>2020-10-19T09:48:38Z</updated>

		<summary type="html">&lt;p&gt;Mmedenjak: &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&lt;br /&gt;
https://epfl.zoom.us/my/krzakalaflorent&lt;br /&gt;
Tutorials will take place as usual on the gotomeeting/lecture room.&#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 (10 points each) + 1 MCQ (20 points)&lt;br /&gt;
&lt;br /&gt;
== Schedule ==&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039; Project in Markox Chain Monte Carlo&#039;&#039;&#039; [https://drive.google.com/file/d/1YHERixzqAwGHeEHZYIZwHXl11Ezt_m3h/view?usp=sharing Manon Michel&#039;s Project]&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 Likelihood estimation&lt;br /&gt;
&lt;br /&gt;
[https://colab.research.google.com/drive/1m2YBrQLfhVSMBpTEsfvOf4hXVZplp1D7?usp=sharing#scrollTo=-cLvGNzqh2Ah Tutorial 8]: Maximum Likelihood 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;
TUtorial 9: Restricted Boltzmann machines&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: the final test&#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>Mmedenjak</name></author>
	</entry>
	<entry>
		<id>http://www.lptms.universite-paris-saclay.fr//wiki-cours/index.php?title=NUMPHYsandML&amp;diff=1350</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=1350"/>
		<updated>2020-10-19T09:44:27Z</updated>

		<summary type="html">&lt;p&gt;Mmedenjak: &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;
&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 (10 points each) + 1 MCQ (20 points)&lt;br /&gt;
&lt;br /&gt;
== Schedule ==&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039; Project in Markox Chain Monte Carlo&#039;&#039;&#039; [https://drive.google.com/file/d/1YHERixzqAwGHeEHZYIZwHXl11Ezt_m3h/view?usp=sharing Manon Michel&#039;s Project]&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 Likelihood estimation&lt;br /&gt;
&lt;br /&gt;
[https://colab.research.google.com/drive/1m2YBrQLfhVSMBpTEsfvOf4hXVZplp1D7?usp=sharing#scrollTo=-cLvGNzqh2Ah Tutorial 8]: Maximum Likelihood 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;
TUtorial 9: Restricted Boltzmann machines&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: the final test&#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>Mmedenjak</name></author>
	</entry>
	<entry>
		<id>http://www.lptms.universite-paris-saclay.fr//wiki-cours/index.php?title=NUMPHYsandML&amp;diff=1347</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=1347"/>
		<updated>2020-10-15T19:26:52Z</updated>

		<summary type="html">&lt;p&gt;Mmedenjak: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;= Numerical Physics and Machine Learning =&lt;br /&gt;
&lt;br /&gt;
= IMPORTANT=&lt;br /&gt;
 &lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039; Starting from Friday (25-09-2020) we are changing  lecture&amp;amp;tutorial&#039;s room. Our new room is L367 (third floor)&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
The advantage of the new location is that L367 is better equipped (the camera, the video-projector...). The disadvantage is that L367 can only accommodate 24 students and we are slightly overbooking your presence, but from the experience of these weeks we think it is OK.  &lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;If you want to come on Friday, we ask you to write your name in the list below:&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
[https://docs.google.com/spreadsheets/d/1V7LLpfvIm1becvJyoz0BLVEdkWrSHk2YdhrzNcpOfaE/edit?usp=sharing List of participants] &lt;br /&gt;
&lt;br /&gt;
If you do not find a place, please let us know. Thank you very much for your cooperation!&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;
&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 (10 points each) + 1 MCQ (20 points)&lt;br /&gt;
&lt;br /&gt;
== Schedule ==&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039; Project in Markox Chain Monte Carlo&#039;&#039;&#039; [https://drive.google.com/file/d/1YHERixzqAwGHeEHZYIZwHXl11Ezt_m3h/view?usp=sharing Manon Michel&#039;s Project]&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 Likelihood estimation&lt;br /&gt;
&lt;br /&gt;
Tutorial 8: Maximum Likelihood estimation&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039; Due: Homework 2&#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;
TUtorial 9: Restricted Boltzmann machines&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: the final test&#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>Mmedenjak</name></author>
	</entry>
	<entry>
		<id>http://www.lptms.universite-paris-saclay.fr//wiki-cours/index.php?title=NUMPHYsandML&amp;diff=1346</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=1346"/>
		<updated>2020-10-15T19:26:13Z</updated>

		<summary type="html">&lt;p&gt;Mmedenjak: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;= Numerical Physics and Machine Learning =&lt;br /&gt;
&lt;br /&gt;
= IMPORTANT=&lt;br /&gt;
 &lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039; Starting from Friday (25-09-2020) we are changing  lecture&amp;amp;tutorial&#039;s room. Our new room is L367 (third floor)&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
The advantage of the new location is that L367 is better equipped (the camera, the video-projector...). The disadvantage is that L367 can only accommodate 24 students and we are slightly overbooking your presence, but from the experience of these weeks we think it is OK.  &lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;If you want to come on Friday, we ask you to write your name in the list below:&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
[https://docs.google.com/spreadsheets/d/1V7LLpfvIm1becvJyoz0BLVEdkWrSHk2YdhrzNcpOfaE/edit?usp=sharing List of participants] &lt;br /&gt;
&lt;br /&gt;
If you do not find a place, please let us know. Thank you very much for your cooperation!&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;
&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 (10 points each) + 1 MCQ (20 points)&lt;br /&gt;
&lt;br /&gt;
== Schedule ==&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039; Project in Markox Chain Monte Carlo&#039;&#039;&#039; [https://drive.google.com/file/d/1YHERixzqAwGHeEHZYIZwHXl11Ezt_m3h/view?usp=sharing Manon Michel&#039;s Project]&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;
&lt;br /&gt;
&#039;&#039;&#039;Friday, October 23, 2020&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
Lecture 8: Maximum Likelihood estimation&lt;br /&gt;
&lt;br /&gt;
Tutorial 8: Maximum Likelihood estimation&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039; Due: Homework 2&#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;
TUtorial 9: Restricted Boltzmann machines&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: the final test&#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>Mmedenjak</name></author>
	</entry>
	<entry>
		<id>http://www.lptms.universite-paris-saclay.fr//wiki-cours/index.php?title=NUMPHYsandML&amp;diff=1345</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=1345"/>
		<updated>2020-10-15T17:07:40Z</updated>

		<summary type="html">&lt;p&gt;Mmedenjak: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;= Numerical Physics and Machine Learning =&lt;br /&gt;
&lt;br /&gt;
= IMPORTANT=&lt;br /&gt;
 &lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039; Starting from Friday (25-09-2020) we are changing  lecture&amp;amp;tutorial&#039;s room. Our new room is L367 (third floor)&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
The advantage of the new location is that L367 is better equipped (the camera, the video-projector...). The disadvantage is that L367 can only accommodate 24 students and we are slightly overbooking your presence, but from the experience of these weeks we think it is OK.  &lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;If you want to come on Friday, we ask you to write your name in the list below:&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
[https://docs.google.com/spreadsheets/d/1V7LLpfvIm1becvJyoz0BLVEdkWrSHk2YdhrzNcpOfaE/edit?usp=sharing List of participants] &lt;br /&gt;
&lt;br /&gt;
If you do not find a place, please let us know. Thank you very much for your cooperation!&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;
&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 (10 points each) + 1 MCQ (20 points)&lt;br /&gt;
&lt;br /&gt;
== Schedule ==&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039; Project in Markox Chain Monte Carlo&#039;&#039;&#039; [https://drive.google.com/file/d/1YHERixzqAwGHeEHZYIZwHXl11Ezt_m3h/view?usp=sharing Manon Michel&#039;s Project]&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&lt;br /&gt;
&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 Likelihood estimation&lt;br /&gt;
&lt;br /&gt;
Tutorial 8: Maximum Likelihood estimation&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039; Due: Homework 2&#039;&#039;&#039;&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;
TUtorial 9: Restricted Boltzmann machines&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: the final test&#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>Mmedenjak</name></author>
	</entry>
	<entry>
		<id>http://www.lptms.universite-paris-saclay.fr//wiki-cours/index.php?title=NUMPHYsandML&amp;diff=1344</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=1344"/>
		<updated>2020-10-15T17:07:01Z</updated>

		<summary type="html">&lt;p&gt;Mmedenjak: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;= Numerical Physics and Machine Learning =&lt;br /&gt;
&lt;br /&gt;
= IMPORTANT=&lt;br /&gt;
 &lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039; Starting from Friday (25-09-2020) we are changing  lecture&amp;amp;tutorial&#039;s room. Our new room is L367 (third floor)&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
The advantage of the new location is that L367 is better equipped (the camera, the video-projector...). The disadvantage is that L367 can only accommodate 24 students and we are slightly overbooking your presence, but from the experience of these weeks we think it is OK.  &lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;If you want to come on Friday, we ask you to write your name in the list below:&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
[https://docs.google.com/spreadsheets/d/1V7LLpfvIm1becvJyoz0BLVEdkWrSHk2YdhrzNcpOfaE/edit?usp=sharing List of participants] &lt;br /&gt;
&lt;br /&gt;
If you do not find a place, please let us know. Thank you very much for your cooperation!&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;
&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 (10 points each) + 1 MCQ (20 points)&lt;br /&gt;
&lt;br /&gt;
== Schedule ==&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039; Project in Markox Chain Monte Carlo&#039;&#039;&#039; [https://drive.google.com/file/d/1YHERixzqAwGHeEHZYIZwHXl11Ezt_m3h/view?usp=sharing Manon Michel&#039;s Project]&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&lt;br /&gt;
&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 Likelihood estimation&lt;br /&gt;
&lt;br /&gt;
Tutorial 8: Maximum Likelihood estimation&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039; Due: Homework 2&#039;&#039;&#039;&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;
TUtorial 9: Restricted Boltzmann machines&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: the final test&#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>Mmedenjak</name></author>
	</entry>
	<entry>
		<id>http://www.lptms.universite-paris-saclay.fr//wiki-cours/index.php?title=NUMPHYsandML&amp;diff=1337</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=1337"/>
		<updated>2020-10-08T14:07:19Z</updated>

		<summary type="html">&lt;p&gt;Mmedenjak: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;= Numerical Physics and Machine Learning =&lt;br /&gt;
&lt;br /&gt;
= IMPORTANT=&lt;br /&gt;
 &lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039; Starting from Friday (25-09-2020) we are changing  lecture&amp;amp;tutorial&#039;s room. Our new room is L367 (third floor)&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
The advantage of the new location is that L367 is better equipped (the camera, the video-projector...). The disadvantage is that L367 can only accommodate 24 students and we are slightly overbooking your presence, but from the experience of these weeks we think it is OK.  &lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;If you want to come on Friday, we ask you to write your name in the list below:&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
[https://docs.google.com/spreadsheets/d/1V7LLpfvIm1becvJyoz0BLVEdkWrSHk2YdhrzNcpOfaE/edit?usp=sharing List of participants] &lt;br /&gt;
&lt;br /&gt;
If you do not find a place, please let us know. Thank you very much for your cooperation!&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;
&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 (10 points each) + 1 MCQ (20 points)&lt;br /&gt;
&lt;br /&gt;
== Schedule ==&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;
&#039;&#039;&#039;GoToMeeting link&#039;&#039;&#039; [https://global.gotomeeting.com/join/854835733] (Room 1 M2 ICFP)&lt;br /&gt;
&lt;br /&gt;
Do you want to discuss with us during the homeworks? &lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Slack Forum&#039;s link&#039;&#039;&#039;  [https://join.slack.com/t/mastericfp-ens-paris/shared_invite/zt-h99lnbzo-aXKoDXd9Q5R8kKmk9UlikA]. &#039;&#039;&#039;Last Call&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039; Due: Homework 1&#039;&#039;&#039;&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;
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;
Lecture 7: Optimization &amp;amp; Dijkstra algorithm&lt;br /&gt;
&lt;br /&gt;
Tutorial 7: Simulated annealing&lt;br /&gt;
&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;
MACHINE LEARNING CLASS&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039; Due: Homework 2&#039;&#039;&#039;&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: the final test&#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>Mmedenjak</name></author>
	</entry>
	<entry>
		<id>http://www.lptms.universite-paris-saclay.fr//wiki-cours/index.php?title=NUMPHYsandML&amp;diff=1329</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=1329"/>
		<updated>2020-10-01T18:11:16Z</updated>

		<summary type="html">&lt;p&gt;Mmedenjak: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;= Numerical Physics and Machine Learning =&lt;br /&gt;
&lt;br /&gt;
= IMPORTANT=&lt;br /&gt;
 &lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039; Starting from Friday (25-09-2020) we are changing  lecture&amp;amp;tutorial&#039;s room. Our new room is L367 (third floor)&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
The advantage of the new location is that L367 is better equipped (the camera, the video-projector...). The disadvantage is that L367 can only accommodate 24 students and we are slightly overbooking your presence, but from the experience of these weeks we think it is OK.  &lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;If you want to come on Friday, we ask you to write your name in the list below:&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
[https://docs.google.com/spreadsheets/d/1V7LLpfvIm1becvJyoz0BLVEdkWrSHk2YdhrzNcpOfaE/edit?usp=sharing List of participants] &lt;br /&gt;
&lt;br /&gt;
If you do not find a place, please let us know. Thank you very much for your cooperation!&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;
&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 (10 points each) + 1 MCQ (20 points)&lt;br /&gt;
&lt;br /&gt;
== Schedule ==&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;
&#039;&#039;&#039;GoToMeeting link&#039;&#039;&#039; [https://global.gotomeeting.com/join/854835733] (Room 1 M2 ICFP)&lt;br /&gt;
&lt;br /&gt;
Do you want to discuss with us during the homeworks? &lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Slack Forum&#039;s link&#039;&#039;&#039;  [https://join.slack.com/t/mastericfp-ens-paris/shared_invite/zt-h99lnbzo-aXKoDXd9Q5R8kKmk9UlikA]. &#039;&#039;&#039;Last Call&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039; Due: Homework 1&#039;&#039;&#039;&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;
Lecture 6: Importance sampling&lt;br /&gt;
&lt;br /&gt;
Tutorial 6: Faster than the clock algorithms&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;
Lecture 7: Optimization &amp;amp; Dijkstra algorithm&lt;br /&gt;
&lt;br /&gt;
Tutorial 7: Simulated annealing&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039; Due: Homework 2&#039;&#039;&#039;&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;
?????????????????????????&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>Mmedenjak</name></author>
	</entry>
	<entry>
		<id>http://www.lptms.universite-paris-saclay.fr//wiki-cours/index.php?title=NUMPHYsandML&amp;diff=1328</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=1328"/>
		<updated>2020-10-01T15:13:55Z</updated>

		<summary type="html">&lt;p&gt;Mmedenjak: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;= Numerical Physics and Machine Learning =&lt;br /&gt;
&lt;br /&gt;
= IMPORTANT=&lt;br /&gt;
 &lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039; Starting from Friday (25-09-2020) we are changing  lecture&amp;amp;tutorial&#039;s room. Our new room is L367 (third floor)&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
The advantage of the new location is that L367 is better equipped (the camera, the video-projector...). The disadvantage is that L367 can only accommodate 24 students and we are slightly overbooking your presence, but from the experience of these weeks we think it is OK.  &lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;If you want to come on Friday, we ask you to write your name in the list below:&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
[https://docs.google.com/spreadsheets/d/1V7LLpfvIm1becvJyoz0BLVEdkWrSHk2YdhrzNcpOfaE/edit?usp=sharing List of participants] &lt;br /&gt;
&lt;br /&gt;
If you do not find a place, please let us know. Thank you very much for your cooperation!&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;
&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 (10 points each) + 1 MCQ (20 points)&lt;br /&gt;
&lt;br /&gt;
== Schedule ==&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;
&#039;&#039;&#039;GoToMeeting link&#039;&#039;&#039; [https://global.gotomeeting.com/join/854835733] (Room 1 M2 ICFP)&lt;br /&gt;
&lt;br /&gt;
Do you want to discuss with us during the homeworks? &lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Slack Forum&#039;s link&#039;&#039;&#039;  [https://join.slack.com/t/mastericfp-ens-paris/shared_invite/zt-h99lnbzo-aXKoDXd9Q5R8kKmk9UlikA]. &#039;&#039;&#039;Last Call&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039; Due: Homework 1&#039;&#039;&#039;&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:&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;
Lecture 6: Importance sampling&lt;br /&gt;
&lt;br /&gt;
Tutorial 6: Faster than the clock algorithms&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;
Lecture 7: Optimization &amp;amp; Dijkstra algorithm&lt;br /&gt;
&lt;br /&gt;
Tutorial 7: Simulated annealing&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039; Due: Homework 2&#039;&#039;&#039;&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;
?????????????????????????&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>Mmedenjak</name></author>
	</entry>
	<entry>
		<id>http://www.lptms.universite-paris-saclay.fr//wiki-cours/index.php?title=NUMPHYsandML&amp;diff=1323</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=1323"/>
		<updated>2020-09-25T12:42:17Z</updated>

		<summary type="html">&lt;p&gt;Mmedenjak: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;= Numerical Physics and Machine Learning =&lt;br /&gt;
&lt;br /&gt;
= IMPORTANT=&lt;br /&gt;
 &lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039; Starting from Friday (25-09-2020) we are changing  lecture&amp;amp;tutorial&#039;s room. Our new room is L367 (third floor)&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
The advantage of the new location is that L367 is better equipped (the camera, the video-projector...). The disadvantage is that L367 can only accommodate 24 students and we are slightly overbooking your presence, but from the experience of these weeks we think it is OK.  &lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;If you want to come on Friday, we ask you to write your name in the list below:&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
[https://docs.google.com/spreadsheets/d/1V7LLpfvIm1becvJyoz0BLVEdkWrSHk2YdhrzNcpOfaE/edit?usp=sharing List of participants] &lt;br /&gt;
&lt;br /&gt;
If you do not find a place, please let us know. Thank you very much for your cooperation!&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;
&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 (10 points each) + 1 MCQ (20 points)&lt;br /&gt;
&lt;br /&gt;
== Schedule ==&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;
Today we try with &#039;&#039;&#039;GoToMeeting&#039;&#039;&#039; (GoToMeeting link [https://global.gotomeeting.com/join/854835733] Room 1 M2 ICFP). Zoom&#039;s links are just in case...&lt;br /&gt;
&lt;br /&gt;
* [https://drive.google.com/file/d/1DijhG_856OAuj42WqY1UM47APmMy3A8B/view?usp=sharing Lecture 4]: Ising model and phase transitions (Zoom link [https://zoom.us/j/97382020537?pwd=MXNTdWoxLy9Od0lONDhnU2tXVlJXdz09])&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] (Zoom link [https://zoom.us/j/97033444403?pwd=NzJPQ3Yxa2JrQW56aVlGOGV0Mk40dz09])&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;
Lecture 3: Quantum particle&lt;br /&gt;
&lt;br /&gt;
Tutorial 3: Time evolution (quantum)&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039; Due: Homework 1&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Homework 2:&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;
Lecture 4: Importance sampling&lt;br /&gt;
&lt;br /&gt;
Tutorial 4: Faster than the clock algorithms&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;
Lecture 5: Optimization &amp;amp; Dijkstra algorithm&lt;br /&gt;
&lt;br /&gt;
Tutorial 5: Simulated annealing&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039; Due: Homework 2&#039;&#039;&#039;&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;
&#039;&#039;&#039;QCM: 2 hours, 20 questions for 20 points&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
Lecture 5: more on ptimization&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>Mmedenjak</name></author>
	</entry>
	<entry>
		<id>http://www.lptms.universite-paris-saclay.fr//wiki-cours/index.php?title=NUMPHYsandML&amp;diff=1319</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=1319"/>
		<updated>2020-09-25T00:27:54Z</updated>

		<summary type="html">&lt;p&gt;Mmedenjak: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;= Numerical Physics and Machine Learning =&lt;br /&gt;
&lt;br /&gt;
= IMPORTANT=&lt;br /&gt;
 &lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039; Starting from Friday (25-09-2020) we are changing  lecture&amp;amp;tutorial&#039;s room. Our new room is L367 (third floor)&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
The advantage of the new location is that L367 is better equipped (the camera, the video-projector...). The disadvantage is that L367 can only accommodate 24 students and we are slightly overbooking your presence, but from the experience of these weeks we think it is OK.  &lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;If you want to come on Friday, we ask you to write your name in the list below:&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
[https://docs.google.com/spreadsheets/d/1V7LLpfvIm1becvJyoz0BLVEdkWrSHk2YdhrzNcpOfaE/edit?usp=sharing List of participants] &lt;br /&gt;
&lt;br /&gt;
If you do not find a place, please let us know. Thank you very much for your cooperation!&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;
&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 (10 points each) + 1 MCQ (20 points)&lt;br /&gt;
&lt;br /&gt;
== Schedule ==&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;
* [https://drive.google.com/file/d/1DijhG_856OAuj42WqY1UM47APmMy3A8B/view?usp=sharing Lecture 4]: Ising model and phase transitions (Zoom link [https://zoom.us/j/97382020537?pwd=MXNTdWoxLy9Od0lONDhnU2tXVlJXdz09])&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1nU4E_pFWjSFPNigzy8-LcJpef26IKY6x?usp=sharing Tutorial 4]: Ising model and phase transitions (Zoom link [https://zoom.us/j/97033444403?pwd=NzJPQ3Yxa2JrQW56aVlGOGV0Mk40dz09])&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;
Lecture 3: Quantum particle&lt;br /&gt;
&lt;br /&gt;
Tutorial 3: Time evolution (quantum)&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039; Due: Homework 1&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Homework 2:&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;
Lecture 4: Importance sampling&lt;br /&gt;
&lt;br /&gt;
Tutorial 4: Faster than the clock algorithms&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;
Lecture 5: Optimization &amp;amp; Dijkstra algorithm&lt;br /&gt;
&lt;br /&gt;
Tutorial 5: Simulated annealing&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039; Due: Homework 2&#039;&#039;&#039;&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;
&#039;&#039;&#039;QCM: 2 hours, 20 questions for 20 points&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
Lecture 5: more on ptimization&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>Mmedenjak</name></author>
	</entry>
	<entry>
		<id>http://www.lptms.universite-paris-saclay.fr//wiki-cours/index.php?title=NUMPHYsandML&amp;diff=1315</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=1315"/>
		<updated>2020-09-21T12:36:31Z</updated>

		<summary type="html">&lt;p&gt;Mmedenjak: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;= Numerical Physics and Machine Learning =&lt;br /&gt;
&lt;br /&gt;
= IMPORTANT=&lt;br /&gt;
 &lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039; Starting from Friday (25-09-2020) we are changing  lecture&amp;amp;tutorial&#039;s room. Our new room is L367 (third floor)&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
The advantage of the new location is that L367 is better equipped (the camera, the video-projector...). The disadvantage is that L367 can only accommodate 24 students and we are slightly overbooking your presence, but from the experience of these weeks we think it is OK.  &lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;If you want to come on Friday, we ask you to write your name in the list below:&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
[https://docs.google.com/spreadsheets/d/1V7LLpfvIm1becvJyoz0BLVEdkWrSHk2YdhrzNcpOfaE/edit?usp=sharing List of participants] &lt;br /&gt;
&lt;br /&gt;
If you do not find a place, please let us know. Thank you very much for your cooperation!&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;
&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 (10 points each) + 1 MCQ (20 points)&lt;br /&gt;
&lt;br /&gt;
== Schedule ==&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 (Zoom link [https://zoom.us/j/97382020537?pwd=MXNTdWoxLy9Od0lONDhnU2tXVlJXdz09])&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] (Zoom link [https://zoom.us/j/97033444403?pwd=NzJPQ3Yxa2JrQW56aVlGOGV0Mk40dz09])&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;
* [https://drive.google.com/file/d/1DijhG_856OAuj42WqY1UM47APmMy3A8B/view?usp=sharing Lecture 4]: Ising model and phase transitions&lt;br /&gt;
&lt;br /&gt;
Tutorial 3: Ising model and phase transitions&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;
Lecture 3: Quantum particle&lt;br /&gt;
&lt;br /&gt;
Tutorial 3: Time evolution (quantum)&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039; Due: Homework 1&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Homework 2:&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;
Lecture 4: Importance sampling&lt;br /&gt;
&lt;br /&gt;
Tutorial 4: Faster than the clock algorithms&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;
Lecture 5: Optimization &amp;amp; Dijkstra algorithm&lt;br /&gt;
&lt;br /&gt;
Tutorial 5: Simulated annealing&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039; Due: Homework 2&#039;&#039;&#039;&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;
&#039;&#039;&#039;QCM: 2 hours, 20 questions for 20 points&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
Lecture 5: more on ptimization&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>Mmedenjak</name></author>
	</entry>
	<entry>
		<id>http://www.lptms.universite-paris-saclay.fr//wiki-cours/index.php?title=NUMPHYsandML&amp;diff=1310</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=1310"/>
		<updated>2020-09-18T13:14:33Z</updated>

		<summary type="html">&lt;p&gt;Mmedenjak: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;= Numerical Physics and Machine Learning =&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;
&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 Conf IV (2nd 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 (10 points each) + 1 MCQ (20 points)&lt;br /&gt;
&lt;br /&gt;
== Schedule ==&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 (Zoom link [https://zoom.us/j/97382020537?pwd=MXNTdWoxLy9Od0lONDhnU2tXVlJXdz09])&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] (Zoom link [https://zoom.us/j/97033444403?pwd=NzJPQ3Yxa2JrQW56aVlGOGV0Mk40dz09])&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;
Lecture 3: Ising model and phase transitions&lt;br /&gt;
&lt;br /&gt;
Tutorial 3: Ising model and phase transitions&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;
Lecture 3: Quantum particle&lt;br /&gt;
&lt;br /&gt;
Tutorial 3: Time evolution (quantum)&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039; Due: Homework 1&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Homework 2:&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;
Lecture 4: Importance sampling&lt;br /&gt;
&lt;br /&gt;
Tutorial 4: Faster than the clock algorithms&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;
Lecture 5: Optimization &amp;amp; Dijkstra algorithm&lt;br /&gt;
&lt;br /&gt;
Tutorial 5: Simulated annealing&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039; Due: Homework 2&#039;&#039;&#039;&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;
&#039;&#039;&#039;QCM: 2 hours, 20 questions for 20 points&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
Lecture 5: more on ptimization&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>Mmedenjak</name></author>
	</entry>
	<entry>
		<id>http://www.lptms.universite-paris-saclay.fr//wiki-cours/index.php?title=NUMPHYsandML&amp;diff=1309</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=1309"/>
		<updated>2020-09-18T12:24:45Z</updated>

		<summary type="html">&lt;p&gt;Mmedenjak: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;= Numerical Physics and Machine Learning =&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;
&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 Conf IV (2nd 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 (10 points each) + 1 MCQ (20 points)&lt;br /&gt;
&lt;br /&gt;
== Schedule ==&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 with 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 (Zoom link [https://zoom.us/j/97382020537?pwd=MXNTdWoxLy9Od0lONDhnU2tXVlJXdz09])&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1k60-ChM3aUWjGsiRsf2Idx9jxHHtwyAb?usp=sharing Tutorial 3] Thumb rule (Zoom link [https://zoom.us/j/97033444403?pwd=NzJPQ3Yxa2JrQW56aVlGOGV0Mk40dz09])&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;
Lecture 3: Ising model and phase transitions&lt;br /&gt;
&lt;br /&gt;
Tutorial 3: Ising model and phase transitions&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;
Lecture 3: Quantum particle&lt;br /&gt;
&lt;br /&gt;
Tutorial 3: Time evolution (quantum)&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039; Due: Homework 1&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Homework 2:&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;
Lecture 4: Importance sampling&lt;br /&gt;
&lt;br /&gt;
Tutorial 4: Faster than the clock algorithms&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;
Lecture 5: Optimization &amp;amp; Dijkstra algorithm&lt;br /&gt;
&lt;br /&gt;
Tutorial 5: Simulated annealing&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039; Due: Homework 2&#039;&#039;&#039;&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;
&#039;&#039;&#039;QCM: 2 hours, 20 questions for 20 points&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
Lecture 5: more on ptimization&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>Mmedenjak</name></author>
	</entry>
	<entry>
		<id>http://www.lptms.universite-paris-saclay.fr//wiki-cours/index.php?title=NUMPHYsandML&amp;diff=1307</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=1307"/>
		<updated>2020-09-17T16:00:48Z</updated>

		<summary type="html">&lt;p&gt;Mmedenjak: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;= Numerical Physics and Machine Learning =&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;
&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 Conf IV (2nd 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 (10 points each) + 1 MCQ (20 points)&lt;br /&gt;
&lt;br /&gt;
== Schedule ==&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&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 (Zoom link [https://zoom.us/j/97382020537?pwd=MXNTdWoxLy9Od0lONDhnU2tXVlJXdz09])&lt;br /&gt;
&lt;br /&gt;
* [https://colab.research.google.com/drive/1k60-ChM3aUWjGsiRsf2Idx9jxHHtwyAb?usp=sharing Tutorial 3] Thumb rule (Zoom link [https://zoom.us/j/97033444403?pwd=NzJPQ3Yxa2JrQW56aVlGOGV0Mk40dz09])&lt;br /&gt;
&lt;br /&gt;
Homework: [ 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;
Lecture 3: Ising model and phase transitions&lt;br /&gt;
&lt;br /&gt;
Tutorial 3: Ising model and phase transitions&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;
Lecture 3: Quantum particle&lt;br /&gt;
&lt;br /&gt;
Tutorial 3: Time evolution (quantum)&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039; Due: Homework 1&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Homework 2:&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;
Lecture 4: Importance sampling&lt;br /&gt;
&lt;br /&gt;
Tutorial 4: Faster than the clock algorithms&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;
Lecture 5: Optimization &amp;amp; Dijkstra algorithm&lt;br /&gt;
&lt;br /&gt;
Tutorial 5: Simulated annealing&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039; Due: Homework 2&#039;&#039;&#039;&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;
&#039;&#039;&#039;QCM: 2 hours, 20 questions for 20 points&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
Lecture 5: more on ptimization&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>Mmedenjak</name></author>
	</entry>
	<entry>
		<id>http://www.lptms.universite-paris-saclay.fr//wiki-cours/index.php?title=NUMPHYsandML&amp;diff=1293</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=1293"/>
		<updated>2020-09-10T15:28:24Z</updated>

		<summary type="html">&lt;p&gt;Mmedenjak: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;= Numerical Physics and Machine Learning =&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;
&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 Conf IV (2nd 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 (10 points each) + 1 MCQ (20 points)&lt;br /&gt;
&lt;br /&gt;
== Schedule ==&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;
Zoom link [https://zoom.us/j/91787445341?pwd=YzJiazFhdGpQeCtqeHgwQllqQTlSQT09]&lt;br /&gt;
&lt;br /&gt;
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&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;
Lecture 2: Error evaluation&lt;br /&gt;
&lt;br /&gt;
Tutorial 2: Thumb rule&lt;br /&gt;
&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;
Lecture 3: Ising model and phase transitions&lt;br /&gt;
&lt;br /&gt;
Tutorial 3: Ising model and phase transitions&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039; Due: Homework 1&#039;&#039;&#039;&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;
Lecture 3: Quantum particle&lt;br /&gt;
&lt;br /&gt;
Tutorial 3: Time evolution (quantum)&lt;br /&gt;
&lt;br /&gt;
Homework 2:&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;
Lecture 4: Importance sampling&lt;br /&gt;
&lt;br /&gt;
Tutorial 4: Faster than the clock algorithms&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;
Lecture 5: Optimization &amp;amp; Dijkstra algorithm&lt;br /&gt;
&lt;br /&gt;
Tutorial 5: Simulated annealing&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039; Due: Homework 2&#039;&#039;&#039;&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;
&#039;&#039;&#039;QCM: 2 hours, 20 questions for 20 points&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
Lecture 5: more on ptimization&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>Mmedenjak</name></author>
	</entry>
	<entry>
		<id>http://www.lptms.universite-paris-saclay.fr//wiki-cours/index.php?title=NUMPHYsandML&amp;diff=1291</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=1291"/>
		<updated>2020-09-09T15:22:48Z</updated>

		<summary type="html">&lt;p&gt;Mmedenjak: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;= Numerical Physics and Machine Learning =&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;
&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 Conf IV (2nd 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 (10 points each) + 1 MCQ (20 points)&lt;br /&gt;
&lt;br /&gt;
== Schedule ==&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;
Zoom link [https://zoom.us/j/4583355667 https://zoom.us/j/4583355667]&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;
Tutorial 2: Markov matrix &amp;amp; thumb rule&lt;br /&gt;
&lt;br /&gt;
Homework 1: Page Rank &amp;amp; Errors&lt;br /&gt;
&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;
Lecture 2: Error evaluation&lt;br /&gt;
&lt;br /&gt;
Tutorial 2: Sampling non uniform distribution&lt;br /&gt;
&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;
Lecture 3: Ising model and phase transitions&lt;br /&gt;
&lt;br /&gt;
Tutorial 3: Ising model and phase transitions&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039; Due: Homework 1&#039;&#039;&#039;&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;
Lecture 3: Quantum particle&lt;br /&gt;
&lt;br /&gt;
Tutorial 3: Time evolution (quantum)&lt;br /&gt;
&lt;br /&gt;
Homework 2:&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;
Lecture 4: Importance sampling&lt;br /&gt;
&lt;br /&gt;
Tutorial 4: Faster than the clock algorithms&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;
Lecture 5: Optimization &amp;amp; Dijkstra algorithm&lt;br /&gt;
&lt;br /&gt;
Tutorial 5: Simulated annealing&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039; Due: Homework 2&#039;&#039;&#039;&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;
&#039;&#039;&#039;QCM: 2 hours, 20 questions for 20 points&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
Lecture 5: more on ptimization&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>Mmedenjak</name></author>
	</entry>
</feed>