<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="ru">
	<id>https://wikicshse.ru/index.php?action=history&amp;feed=atom&amp;title=Statistical_learning_theory_2021</id>
	<title>Statistical learning theory 2021 - История изменений</title>
	<link rel="self" type="application/atom+xml" href="https://wikicshse.ru/index.php?action=history&amp;feed=atom&amp;title=Statistical_learning_theory_2021"/>
	<link rel="alternate" type="text/html" href="https://wikicshse.ru/index.php?title=Statistical_learning_theory_2021&amp;action=history"/>
	<updated>2026-06-06T11:04:22Z</updated>
	<subtitle>История изменений этой страницы в вики</subtitle>
	<generator>MediaWiki 1.45.3</generator>
	<entry>
		<id>https://wikicshse.ru/index.php?title=Statistical_learning_theory_2021&amp;diff=713&amp;oldid=prev</id>
		<title>imported&gt;Bbauwens: Migrated current public revision from wiki.cs.hse.ru</title>
		<link rel="alternate" type="text/html" href="https://wikicshse.ru/index.php?title=Statistical_learning_theory_2021&amp;diff=713&amp;oldid=prev"/>
		<updated>2022-12-16T11:35:59Z</updated>

		<summary type="html">&lt;p&gt;Migrated current public revision from wiki.cs.hse.ru&lt;/p&gt;
&lt;p&gt;&lt;b&gt;Новая страница&lt;/b&gt;&lt;/p&gt;&lt;div&gt;&lt;br /&gt;
== General Information ==&lt;br /&gt;
&lt;br /&gt;
[https://www.dropbox.com/s/a8dd33ousa76qad/grading.pdf?dl=0 Grading]&lt;br /&gt;
&lt;br /&gt;
Teachers: [https://www.hse.ru/en/org/persons/160550073 Bruno Bauwens] and [https://www.hse.ru/en/org/persons/225553845 Nikita Lukianenko] &lt;br /&gt;
&lt;br /&gt;
Lectures: Saturday 14:40 - 16:00. The lectures are in zoom. &lt;br /&gt;
&lt;br /&gt;
Seminars: Tuesday 16:20 - 17:40. The seminars are [https://meet.google.com/ber-yzns-hxz here] in google.meet.&lt;br /&gt;
&lt;br /&gt;
Practical information on a telegram group. &lt;br /&gt;
&lt;br /&gt;
The course is similar [http://wiki.cs.hse.ru/Statistical_learning_theory_2020 last year], except for the order of topics and part 3.&lt;br /&gt;
&lt;br /&gt;
== Problems exam ==&lt;br /&gt;
&lt;br /&gt;
Dec 22, 12:00 -- 15:30&lt;br /&gt;
&lt;br /&gt;
During the exam&amp;lt;br&amp;gt;&lt;br /&gt;
-- You may consult notes, books and search on the internet &amp;lt;br&amp;gt;&lt;br /&gt;
-- You may not interact with other humans (e.g. by phone, forums, etc) &lt;br /&gt;
&lt;br /&gt;
== Colloquium ==&lt;br /&gt;
&lt;br /&gt;
Saturday December 11&lt;br /&gt;
&lt;br /&gt;
[https://www.dropbox.com/s/u8hyo1omvaoujle/colloqQuest.pdf?dl=0 rules and list of questions] (version Dec 10)&lt;br /&gt;
&lt;br /&gt;
== Homeworks ==&lt;br /&gt;
&lt;br /&gt;
Email to brbauwens-at-gmail.com. Start the subject line with SLT-HW. [https://www.dropbox.com/s/prsmzhtr5p5uome/scores.pdf?dl=0 Results]&lt;br /&gt;
&lt;br /&gt;
Deadline before the lecture, every other lecture.&lt;br /&gt;
&lt;br /&gt;
25 Sept: see problem lists 1 and 2 &amp;lt;br&amp;gt;&lt;br /&gt;
09 Oct: see problem lists 3 and 4  &amp;lt;br&amp;gt;&lt;br /&gt;
29 Oct: see problem lists 5 and 6 &amp;lt;br&amp;gt; &lt;br /&gt;
13 Nov: see problem lists 7 and 8 &amp;lt;br&amp;gt;&lt;br /&gt;
30 Nov, 08:00 [extended]: see problem lists 9 and 10 &lt;br /&gt;
&lt;br /&gt;
== Course materials ==&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! Video !! Summary !! Slides !! Lecture notes !! Problem list !! Solutions&lt;br /&gt;
|-&lt;br /&gt;
| &lt;br /&gt;
|| &amp;#039;&amp;#039;Part 1. Online learning&amp;#039;&amp;#039; &lt;br /&gt;
|-&lt;br /&gt;
| [https://drive.google.com/file/d/1WL9LSNDD1B_q6LdpfDQ8BPluNfhjWrD9/view?usp=sharing 4 Sept] &lt;br /&gt;
|| Lecture: philosophy. Seminar: the online mistake bound model, the weighted majority, and perceptron algorithms [https://drive.google.com/drive/folders/1NXiLbhmO2Ml7jFmnLtjqhOgCoHg7yn9T?usp=sharing movies]&lt;br /&gt;
|| [https://www.dropbox.com/s/uk9awkfa827pmtf/01allSlides.pdf?dl=0 sl01]&lt;br /&gt;
|| [https://www.dropbox.com/s/uvsfzb997kantoa/00book_intro.pdf?dl=0 ch00] [https://www.dropbox.com/s/6ah70h5loyrz5lx/01book_onlineMistakeBound.pdf?dl=0 ch01]&lt;br /&gt;
|| [https://www.dropbox.com/s/aoma8ma8mkd3885/01sem.pdf?dl=0 01prob (9 Sept)]&lt;br /&gt;
|| [https://www.dropbox.com/s/sqzqlrtzr2nu8cq/01sol.pdf?dl=0 01sol]&lt;br /&gt;
|-&lt;br /&gt;
| [https://drive.google.com/file/d/16OoCqhh16BKQzyF-HM8RozigyJ3BBVxA/view?usp=sharing 11 Sept]&lt;br /&gt;
|| The perceptron algorithm in the agnostic setting. Kernels. The standard optimal algorithm.&lt;br /&gt;
|| [https://www.dropbox.com/s/sy959ee81mov5cr/02slides.pdf?dl=0 sl02] &lt;br /&gt;
|| [https://www.dropbox.com/s/0029k15cbnxj2v1/02book_sequentialOptimalAlgorithm.pdf?dl=0 ch02] [https://www.dropbox.com/s/eggk7kctgox8aza/03book_perceptron.pdf?dl=0 ch03]&lt;br /&gt;
|| [https://www.dropbox.com/s/415nws7qi589bme/02sem.pdf?dl=0 02prob (23 Sept)]&lt;br /&gt;
|| [https://www.dropbox.com/s/ofcctflbnxt0kx3/02sol.pdf?dl=0 02sol]&lt;br /&gt;
|-&lt;br /&gt;
| 18 Sept (rec to do)&lt;br /&gt;
|| Prediction with expert advice and the exponentially weighted majority algorithm. Recap probability theory. &lt;br /&gt;
|| [https://www.dropbox.com/s/a60p9b76cxusgqy/03slides.pdf?dl=0 sl03]&lt;br /&gt;
|| [https://www.dropbox.com/s/ytl6q83q6gkax3w/04book_predictionWithExperts.pdf?dl=0 ch04] [https://www.dropbox.com/s/l11afq1d0qn6za7/05book_introProbability.pdf?dl=0 ch05]&lt;br /&gt;
|| [https://www.dropbox.com/s/nsrcy3yxgey67lp/03sem.pdf?dl=0 03prob(30 Sept)]&lt;br /&gt;
|| [https://www.dropbox.com/s/bg9nd01h1fhzjsi/03sol.pdf?dl=0 03sol]&lt;br /&gt;
|-&lt;br /&gt;
| &lt;br /&gt;
|| &amp;#039;&amp;#039;Part 2. Risk bounds for binary classification&amp;#039;&amp;#039; &lt;br /&gt;
|-&lt;br /&gt;
| [https://drive.google.com/file/d/1RHz8NgfianUQFlx8VswjiiPRvt0DoBvc/view?usp=sharing 25 Sept]&lt;br /&gt;
|| Sample complexity in the realizable setting, simple examples and bounds using VC-dimension&lt;br /&gt;
|| [https://www.dropbox.com/s/pi0f3wab1xna6d7/04slides.pdf?dl=0 sl04]&lt;br /&gt;
|| [https://www.dropbox.com/s/8xrgcugs4xv2r2p/06book_sampleComplexity.pdf?dl=0 ch06] &lt;br /&gt;
|| [https://www.dropbox.com/s/7qn2yz5fxc93rez/04sem.pdf?dl=0 04prob]&lt;br /&gt;
|| [https://www.dropbox.com/s/xm3nhgj5d6h49nz/04sol.pdf?dl=0 04sol]&lt;br /&gt;
|- &lt;br /&gt;
| [https://drive.google.com/drive/folders/1jjyJ3eIaed64ogpR11g8M44IOikt5Mj2?usp=sharing 2 Oct]&lt;br /&gt;
|| Growth functions, VC-dimension and the characterization of sample comlexity with VC-dimensions&lt;br /&gt;
|| [https://www.dropbox.com/s/rpnh6288rdb3j8m/05slides.pdf?dl=0 sl05]&lt;br /&gt;
|| [https://www.dropbox.com/s/ctc48w1d2vvyiyt/07book_growthFunctions.pdf?dl=0 ch07] [https://www.dropbox.com/s/jofixf9tstz0f8z/08book_VCdimension.pdf?dl=0 ch08]&lt;br /&gt;
|| [https://www.dropbox.com/s/zbyqxy3qp3pz79i/05sem.pdf?dl=0 05prob]&lt;br /&gt;
|| [https://www.dropbox.com/s/a8efm18dof2zeox/05sol.pdf?dl=0 05sol]&lt;br /&gt;
|-&lt;br /&gt;
| [https://drive.google.com/file/d/17zynIg_CZ6cCNBig5QXmBx7VFS8peyuU/view?usp=sharing 9 Oct]&lt;br /&gt;
|| Risk decomposition and the fundamental theorem of statistical learning theory&lt;br /&gt;
|| [https://www.dropbox.com/s/jxijka88vfanv5n/06slides.pdf?dl=0 sl06]&lt;br /&gt;
|| [https://www.dropbox.com/s/r44bwxz34qj98gg/09book_riskBounds.pdf?dl=0 ch09]&lt;br /&gt;
|| [https://www.dropbox.com/s/x87txc8v5v6u8vb/06sem.pdf?dl=0 06prob]&lt;br /&gt;
|| [https://www.dropbox.com/s/ydlqu8oce3xj6ix/06sol.pdf?dl=0 06sol]&lt;br /&gt;
|-&lt;br /&gt;
| 16 Oct&lt;br /&gt;
|| Bounded differences inequality and Rademacher complexity&lt;br /&gt;
|| [https://www.dropbox.com/s/kfithyq0dgcq6h8/07slides.pdf?dl=0 sl07]&lt;br /&gt;
|| [https://www.dropbox.com/s/5quc1jfkrvm3t71/10book_measureConcentration.pdf?dl=0 ch10] [https://www.dropbox.com/s/km0fns8n3aihauv/11book_RademacherComplexity.pdf?dl=0 ch11]&lt;br /&gt;
|| [https://www.dropbox.com/s/d1rsxceqmbk5llw/07sem.pdf?dl=0 07prob]&lt;br /&gt;
|| [https://www.dropbox.com/s/sftaa8b92ru3ii5/07sol.pdf?dl=0 07sol]&lt;br /&gt;
|-&lt;br /&gt;
| [https://drive.google.com/file/d/1L-BeDxhoHcoDrdlVTlfoMFwnWXKV46cr/view?usp=sharing 30 Oct]&lt;br /&gt;
|| Simple regression, support vector machines, margin risk bounds, and neural nets &lt;br /&gt;
|| [https://www.dropbox.com/s/0xrhe4732d0jshb/08slides.pdf?dl=0 sl08]&lt;br /&gt;
|| [https://www.dropbox.com/s/cvqlwst3e69709t/12book_regression.pdf?dl=0 ch12] [https://www.dropbox.com/s/dwwxgriiaj4efn0/13book_SVM.pdf?dl=0 ch13]&lt;br /&gt;
|| [https://www.dropbox.com/s/qqdbrh2ll0dv03a/08sem.pdf?dl=0 08prob]&lt;br /&gt;
|| [https://www.dropbox.com/s/9o8fyd0ff735hxu/08sol.pdf?dl=0 08sol]&lt;br /&gt;
|-&lt;br /&gt;
| [https://youtu.be/9FhFxLHR4eE 6 Nov]&lt;br /&gt;
|| Kernels: risk bounds, RKHS, representer theorem, design&lt;br /&gt;
|| [https://www.dropbox.com/s/nhqtbekclekf6k7/09slides.pdf?dl=0 sl09]&lt;br /&gt;
|| [https://www.dropbox.com/s/bpb9ijn2p7k19j3/14book_kernels.pdf?dl=0 ch14]&lt;br /&gt;
|| [https://www.dropbox.com/s/d2dmh017lw207ns/09sem.pdf?dl=0 09prob] (Nov 23)&lt;br /&gt;
|| [https://www.dropbox.com/s/2wq9mxrqchsqujr/09sol.pdf?dl=0 09sol]&lt;br /&gt;
|- &lt;br /&gt;
| [https://youtu.be/ZBHe5RhTuzI 13 Nov]&lt;br /&gt;
|| AdaBoost and risk bounds&lt;br /&gt;
|| [https://www.dropbox.com/s/umum3kd9439dt42/10slides.pdf?dl=0 sl10]&lt;br /&gt;
|| Mohri et al, chapt 7&lt;br /&gt;
|| [https://www.dropbox.com/s/j8s197e0mjv9qla/10sem.pdf?dl=0 10prob] (Nov 23)&lt;br /&gt;
|| [https://www.dropbox.com/s/7lw1u8750k7s8qt/10sol.pdf?dl=0 10sol]&lt;br /&gt;
|-&lt;br /&gt;
|&lt;br /&gt;
|| &amp;#039;&amp;#039;Part 3. Other topics&amp;#039;&amp;#039; &lt;br /&gt;
|-&lt;br /&gt;
| [https://youtu.be/L4o7dXcaQrk 20 Nov]&lt;br /&gt;
|| Clustering  &lt;br /&gt;
|| [https://www.dropbox.com/s/5a9flvg95iihz7m/11slides.pdf?dl=0 sl11]&lt;br /&gt;
|| Mohri et al, ch7; [https://people.csail.mit.edu/dsontag/courses/ml12/slides/lecture14.pdf lecture]&lt;br /&gt;
|| &amp;lt;!-- [https://www.dropbox.com/s/a9459keof3omav1/11sem.pdf?dl=0 11prob] --&amp;gt;&lt;br /&gt;
|| &amp;lt;!-- [https://www.dropbox.com/s/kredac52pbn7qvk/11sol.pdf?dl=0 11sol] --&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
| [https://youtu.be/FN6l4Ceq5lE 27 Nov]&lt;br /&gt;
|| Dimensionality reduction and the Johnson-Lindenstrauss lemma&lt;br /&gt;
|| [https://www.dropbox.com/s/wbgwwk7a9mjo1bv/12slides.pdf?dl=0 sl12] &lt;br /&gt;
|| Mohri et al, ch15; [https://ramanlab.wustl.edu/Lectures/Lecture12_LDA_CCA.pdf lecture]&lt;br /&gt;
|| [https://www.dropbox.com/s/c5anx2htaw9rslr/12sem.pdf?dl=0 12prob]&lt;br /&gt;
||&lt;br /&gt;
|-&lt;br /&gt;
| 4 Dec&lt;br /&gt;
|| No lecture&lt;br /&gt;
||&lt;br /&gt;
||&lt;br /&gt;
||&lt;br /&gt;
||&lt;br /&gt;
|-&lt;br /&gt;
| 11 Dec&lt;br /&gt;
|| Colloquium &lt;br /&gt;
||&lt;br /&gt;
||&lt;br /&gt;
||&lt;br /&gt;
||&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!-- A gentle introduction to the materials of the first 3 lectures and an overview of probability theory, can be found in chapters 1-6 and 11-12 of the following book:&lt;br /&gt;
Sanjeev Kulkarni and Gilbert Harman: An Elementary Introduction to Statistical Learning Theory, 2012.--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
The lectures in October and November are based on the book:&lt;br /&gt;
Foundations of machine learning 2nd ed, Mehryar Mohri, Afshin Rostamizadeh, and Ameet Talwalker, 2018. This book can be downloaded from http://gen.lib.rus.ec/ .&lt;br /&gt;
&lt;br /&gt;
== Office hours ==&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! Person !! Monday !! Tuesday !! Wednesday !! Thursday !! Friday !! &lt;br /&gt;
|-&lt;br /&gt;
|  [https://www.hse.ru/en/org/persons/160550073 Bruno Bauwens], [https://zoom.us/j/5579743402 Zoom] ||  || 12h30-14h30 || || || 14h-20h || Room&amp;amp;nbsp;S834 Pokrovkaya 11&lt;br /&gt;
|-&lt;br /&gt;
|  [https://www.hse.ru/org/persons/225553845 Nikita Lukianenko], [https://t.me/vaulty Telegram] ||  || 14h30-16h30 || 14h30-16h30 || || || Room&amp;amp;nbsp;S831 Pokrovkaya 11&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
It is always good to send an email in advance. Questions and feedback are welcome. &lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
== Russian texts  ==&lt;br /&gt;
&lt;br /&gt;
The following links might help students who have trouble with English.  A [http://www.machinelearning.ru/wiki/images/d/d9/Voron-2011-tnop.pdf  lecture] on VC-dimensions was given by K. Vorontsov.&lt;br /&gt;
A [http://machinelearning.ru/wiki/index.php?title=%D0%A2%D0%B5%D0%BE%D1%80%D0%B8%D1%8F_%D1%81%D1%82%D0%B0%D1%82%D0%B8%D1%81%D1%82%D0%B8%D1%87%D0%B5%D1%81%D0%BA%D0%BE%D0%B3%D0%BE_%D0%BE%D0%B1%D1%83%D1%87%D0%B5%D0%BD%D0%B8%D1%8F_(%D0%BA%D1%83%D1%80%D1%81_%D0%BB%D0%B5%D0%BA%D1%86%D0%B8%D0%B9%2C_%D0%9D._%D0%9A._%D0%96%D0%B8%D0%B2%D0%BE%D1%82%D0%BE%D0%B2%D1%81%D0%BA%D0%B8%D0%B9) course] on Statistical Learning Theory by Nikita Zhivotovsky is given at MIPT. Some short description about PAC learning on p136 in the [http://gen.lib.rus.ec/search.php?req=%D0%9D%D0%B0%D1%83%D0%BA%D0%B0+%D0%B8+%D0%B8%D1%81%D0%BA%D1%83%D1%81%D1%81%D1%82%D0%B2%D0%BE+%D0%BF%D0%BE%D1%81%D1%82%D1%80%D0%BE%D0%B5%D0%BD%D0%B8%D1%8F+%D0%B0%D0%BB%D0%B3%D0%BE%D1%80%D0%B8%D1%82%D0%BC%D0%BE%D0%B2%2C+%D0%BA%D0%BE%D1%82%D0%BE%D1%80%D1%8B%D0%B5+%D0%B8%D0%B7%D0%B2%D0%BB%D0%B5%D0%BA%D0%B0%D1%8E%D1%82+%D0%B7%D0%BD%D0%B0%D0%BD%D0%B8%D1%8F+%D0%B8%D0%B7+%D0%B4%D0%B0%D0%BD%D0%BD%D1%8B%D1%85&amp;amp;lg_topic=libgen&amp;amp;open=0&amp;amp;view=simple&amp;amp;res=25&amp;amp;phrase=0&amp;amp;column=def book] &lt;br /&gt;
``Наука и искусство построения алгоритмов, которые извлекают знания из данных&amp;#039;&amp;#039;, Петер Флах. On [http://www.machinelearning.ru machinelearning.ru] &lt;br /&gt;
you can find brief and clear definitions.&lt;br /&gt;
--&amp;gt;&lt;/div&gt;</summary>
		<author><name>imported&gt;Bbauwens</name></author>
	</entry>
</feed>