Huawei-Kolmogorov-complexity-fall-2024 - История изменений

Bauwens в 12:14, 22 октября 2024

2024-10-22T12:14:52Z

← Предыдущая версия		Версия от 12:14, 22 октября 2024
Строка 9:		Строка 9:
	= Course Materials =		= Course Materials =

			See [http://wiki.cs.hse.ru/Kolmogorov_complexity_24/25 other wiki]
	{\| class="wikitable"		<!-- {\| class="wikitable"
	\|-		\|-
	! Rec !! Summary !! Notes !! Problem list !! Solutions		! Rec !! Summary !! Notes !! Problem list !! Solutions
Строка 18:		Строка 18:
	\|\| 17.10 \|\| Optimality of Solomonoff induction for reinforcement learning. \|\| \|\| [https://www.dropbox.com/scl/fi/fi1ypu9jadr0yfi4pva1o/02sem.pdf?rlkey=n6u95tz8bgafbvn68wa9964dg&st=3gny8d3y&dl=0 sem02] \|\|		\|\| 17.10 \|\| Optimality of Solomonoff induction for reinforcement learning. \|\| \|\| [https://www.dropbox.com/scl/fi/fi1ypu9jadr0yfi4pva1o/02sem.pdf?rlkey=n6u95tz8bgafbvn68wa9964dg&st=3gny8d3y&dl=0 sem02] \|\|
	\|}		\|}
			-->

	= Grading =		= Grading =

Bauwens в 13:51, 14 октября 2024

2024-10-14T13:51:43Z

← Предыдущая версия		Версия от 13:51, 14 октября 2024
Строка 16:		Строка 16:
	\|\| 10.10 \|\| Course overview, (universal) Turing machines, computable and non-computable sets and functions. [https://www.dropbox.com/scl/fi/0fxjeu8h1ekawcueto4yn/01slides.pdf?rlkey=ww3ec2ngtoysexwoc6wahcfg4&st=7t55t5bi&dl=0 slides] \|\| [https://www.dropbox.com/scl/fi/n1vhfvtfagv2ji6x30exn/00notes.pdf?rlkey=pvd79gi91567mut35n87j1vfo&st=ypsaw36s&dl=0 ch00] [https://www.dropbox.com/scl/fi/cm2xfnegccktu3s7h00wy/01notes.pdf?rlkey=87ctjsio681ee821tzlomufqp&st=jvdlwdnn&dl=0 ch01]\|\| [https://www.dropbox.com/scl/fi/2alcydgfglcxs8rst99kk/01sem.pdf?rlkey=pe1xwmex19wi32bppr5s4bmdz&st=mzww1qix&dl=0 sem01]\|\|		\|\| 10.10 \|\| Course overview, (universal) Turing machines, computable and non-computable sets and functions. [https://www.dropbox.com/scl/fi/0fxjeu8h1ekawcueto4yn/01slides.pdf?rlkey=ww3ec2ngtoysexwoc6wahcfg4&st=7t55t5bi&dl=0 slides] \|\| [https://www.dropbox.com/scl/fi/n1vhfvtfagv2ji6x30exn/00notes.pdf?rlkey=pvd79gi91567mut35n87j1vfo&st=ypsaw36s&dl=0 ch00] [https://www.dropbox.com/scl/fi/cm2xfnegccktu3s7h00wy/01notes.pdf?rlkey=87ctjsio681ee821tzlomufqp&st=jvdlwdnn&dl=0 ch01]\|\| [https://www.dropbox.com/scl/fi/2alcydgfglcxs8rst99kk/01sem.pdf?rlkey=pe1xwmex19wi32bppr5s4bmdz&st=mzww1qix&dl=0 sem01]\|\|
	\|-		\|-
	\|\| 17.10 \|\| Optimality of Solomonoff induction for reinforcement learning. \|\| [https://www.dropbox.com/scl/fi/fi1ypu9jadr0yfi4pva1o/02sem.pdf?rlkey=n6u95tz8bgafbvn68wa9964dg&st=3gny8d3y&dl=0 sem02] \|\|		\|\| 17.10 \|\| Optimality of Solomonoff induction for reinforcement learning. \|\| \|\| [https://www.dropbox.com/scl/fi/fi1ypu9jadr0yfi4pva1o/02sem.pdf?rlkey=n6u95tz8bgafbvn68wa9964dg&st=3gny8d3y&dl=0 sem02] \|\|
	\|}		\|}

Bauwens в 13:51, 14 октября 2024

2024-10-14T13:51:27Z

← Предыдущая версия		Версия от 13:51, 14 октября 2024
Строка 16:		Строка 16:
	\|\| 10.10 \|\| Course overview, (universal) Turing machines, computable and non-computable sets and functions. [https://www.dropbox.com/scl/fi/0fxjeu8h1ekawcueto4yn/01slides.pdf?rlkey=ww3ec2ngtoysexwoc6wahcfg4&st=7t55t5bi&dl=0 slides] \|\| [https://www.dropbox.com/scl/fi/n1vhfvtfagv2ji6x30exn/00notes.pdf?rlkey=pvd79gi91567mut35n87j1vfo&st=ypsaw36s&dl=0 ch00] [https://www.dropbox.com/scl/fi/cm2xfnegccktu3s7h00wy/01notes.pdf?rlkey=87ctjsio681ee821tzlomufqp&st=jvdlwdnn&dl=0 ch01]\|\| [https://www.dropbox.com/scl/fi/2alcydgfglcxs8rst99kk/01sem.pdf?rlkey=pe1xwmex19wi32bppr5s4bmdz&st=mzww1qix&dl=0 sem01]\|\|		\|\| 10.10 \|\| Course overview, (universal) Turing machines, computable and non-computable sets and functions. [https://www.dropbox.com/scl/fi/0fxjeu8h1ekawcueto4yn/01slides.pdf?rlkey=ww3ec2ngtoysexwoc6wahcfg4&st=7t55t5bi&dl=0 slides] \|\| [https://www.dropbox.com/scl/fi/n1vhfvtfagv2ji6x30exn/00notes.pdf?rlkey=pvd79gi91567mut35n87j1vfo&st=ypsaw36s&dl=0 ch00] [https://www.dropbox.com/scl/fi/cm2xfnegccktu3s7h00wy/01notes.pdf?rlkey=87ctjsio681ee821tzlomufqp&st=jvdlwdnn&dl=0 ch01]\|\| [https://www.dropbox.com/scl/fi/2alcydgfglcxs8rst99kk/01sem.pdf?rlkey=pe1xwmex19wi32bppr5s4bmdz&st=mzww1qix&dl=0 sem01]\|\|
	\|-		\|-
	\|\| 17.10 \|\| Optimality of Solomonoff induction for reinforcement learning. \|\| \|\|		\|\| 17.10 \|\| Optimality of Solomonoff induction for reinforcement learning. \|\| [https://www.dropbox.com/scl/fi/fi1ypu9jadr0yfi4pva1o/02sem.pdf?rlkey=n6u95tz8bgafbvn68wa9964dg&st=3gny8d3y&dl=0 sem02] \|\|
	\|}		\|}

Bauwens в 21:24, 10 октября 2024

2024-10-10T21:24:26Z

← Предыдущая версия		Версия от 21:24, 10 октября 2024
Строка 14:		Строка 14:
	! Rec !! Summary !! Notes !! Problem list !! Solutions		! Rec !! Summary !! Notes !! Problem list !! Solutions
	\|-		\|-
	\|\| 10.10 \|\| Course overview, (universal) Turing machines, computable and non-computable sets and functions. [https://www.dropbox.com/scl/fi/~~kea3f2888zrfmiu7kbuaw~~/01slides.pdf?rlkey=~~8wohccfrcwt5j5fvr0ltqxb2j~~&st=~~ndcob512~~&dl=0 slides] \|\| [https://www.dropbox.com/scl/fi/~~0bbgs9q2tvs7462nov6ml~~/00notes.pdf?rlkey=~~59eg45qm420rmvgik8062fdra~~&st=~~cbvunx5z~~&dl=0 ch00] [https://www.dropbox.com/scl/fi/~~2ipwvmn6i4z5uoc5ehvsq~~/01notes.pdf?rlkey=~~ao740xt6abqir89nh9a90ls0j~~&st=~~4wqf1ssl~~&dl=0 ch01]\|\| \|\|		\|\| 10.10 \|\| Course overview, (universal) Turing machines, computable and non-computable sets and functions. [https://www.dropbox.com/scl/fi/0fxjeu8h1ekawcueto4yn/01slides.pdf?rlkey=ww3ec2ngtoysexwoc6wahcfg4&st=7t55t5bi&dl=0 slides] \|\| [https://www.dropbox.com/scl/fi/n1vhfvtfagv2ji6x30exn/00notes.pdf?rlkey=pvd79gi91567mut35n87j1vfo&st=ypsaw36s&dl=0 ch00] [https://www.dropbox.com/scl/fi/cm2xfnegccktu3s7h00wy/01notes.pdf?rlkey=87ctjsio681ee821tzlomufqp&st=jvdlwdnn&dl=0 ch01]\|\| [https://www.dropbox.com/scl/fi/2alcydgfglcxs8rst99kk/01sem.pdf?rlkey=pe1xwmex19wi32bppr5s4bmdz&st=mzww1qix&dl=0 sem01]\|\|
	\|-		\|-
	\|\| 17.10 \|\| Optimality of Solomonoff induction for reinforcement learning. \|\|		\|\| 17.10 \|\| Optimality of Solomonoff induction for reinforcement learning. \|\| \|\|
	\|}		\|}

Bauwens в 09:08, 10 октября 2024

2024-10-10T09:08:14Z

← Предыдущая версия		Версия от 09:08, 10 октября 2024
Строка 18:		Строка 18:
	\|\| 17.10 \|\| Optimality of Solomonoff induction for reinforcement learning. \|\|		\|\| 17.10 \|\| Optimality of Solomonoff induction for reinforcement learning. \|\|
	\|}		\|}



Строка 24:		Строка 23:

	Final score = 0.35 * [score homework] + 0.35 * [score colloquium] + 0.3 * [score exam] <br>		Final score = 0.35 * [score homework] + 0.35 * [score colloquium] + 0.3 * [score exam] <br>

	Some homework assignments contain extra problems. Each solution of an extra problem will give 1 extra points on the final exam (which is graded out of 10). There will be around 10 extra problems. Rounding is applied only when the final score is transferred to the official grade. Arithmetic rounding is used. Autogrades. If only 6/10 for the exam is needed to get a final score of 10/10, then this will be given automatically.

Bauwens в 09:07, 10 октября 2024

2024-10-10T09:07:47Z

← Предыдущая версия		Версия от 09:07, 10 октября 2024
Строка 20:		Строка 20:


	~~= Homeworks =~~

	~~Deadlines: every 2 weeks, before the lecture at 18h00. Submit in pdf or fotos of handwritten to brbauwens@gmail.com with the subject line starting with KOLM-HW. Link with results will be here.~~

	~~Tasks are in the problem lists from the seminar. Deadlines: problem lists 1 and 2: at the start of 3rd lecture, lists 3 and 4 at the start of the 5th lecture, etc.~~

	~~Late policy: 1 homework can be submitted at most 24h late without explanations.~~



	~~= References =~~

	~~Todo~~

	= Grading =		= Grading =
Строка 39:		Строка 26:

	Some homework assignments contain extra problems. Each solution of an extra problem will give 1 extra points on the final exam (which is graded out of 10). There will be around 10 extra problems. Rounding is applied only when the final score is transferred to the official grade. Arithmetic rounding is used. Autogrades. If only 6/10 for the exam is needed to get a final score of 10/10, then this will be given automatically.		Some homework assignments contain extra problems. Each solution of an extra problem will give 1 extra points on the final exam (which is graded out of 10). There will be around 10 extra problems. Rounding is applied only when the final score is transferred to the official grade. Arithmetic rounding is used. Autogrades. If only 6/10 for the exam is needed to get a final score of 10/10, then this will be given automatically.


	~~= Colloquium and exam =~~

	~~Colloquium: in the middel of December, a list with about 10 questions will be provided.~~

	~~Exam: Problems similar to the homework. You may use main references, lecture notes, and handwritten notes.~~

Bauwens в 09:06, 10 октября 2024

2024-10-10T09:06:54Z

← Предыдущая версия		Версия от 09:06, 10 октября 2024
Строка 14:		Строка 14:
	! Rec !! Summary !! Notes !! Problem list !! Solutions		! Rec !! Summary !! Notes !! Problem list !! Solutions
	\|-		\|-
	\|\| 10.10 \|\| Course overview, (universal) Turing machines, computable and non-computable sets and functions. [https://www.dropbox.com/scl/fi/kea3f2888zrfmiu7kbuaw/01slides.pdf?rlkey=8wohccfrcwt5j5fvr0ltqxb2j&st=ndcob512&dl=0 slides] \|\| [https://www.dropbox.com/scl/fi/0bbgs9q2tvs7462nov6ml/00notes.pdf?rlkey=59eg45qm420rmvgik8062fdra&st=cbvunx5z&dl=0 ch00] [https://www.dropbox.com/scl/fi/2ipwvmn6i4z5uoc5ehvsq/01notes.pdf?rlkey=ao740xt6abqir89nh9a90ls0j&st=4wqf1ssl&dl=0 ch01]\|\|		\|\| 10.10 \|\| Course overview, (universal) Turing machines, computable and non-computable sets and functions. [https://www.dropbox.com/scl/fi/kea3f2888zrfmiu7kbuaw/01slides.pdf?rlkey=8wohccfrcwt5j5fvr0ltqxb2j&st=ndcob512&dl=0 slides] \|\| [https://www.dropbox.com/scl/fi/0bbgs9q2tvs7462nov6ml/00notes.pdf?rlkey=59eg45qm420rmvgik8062fdra&st=cbvunx5z&dl=0 ch00] [https://www.dropbox.com/scl/fi/2ipwvmn6i4z5uoc5ehvsq/01notes.pdf?rlkey=ao740xt6abqir89nh9a90ls0j&st=4wqf1ssl&dl=0 ch01]\|\| \|\|
			\|-
	\|\| 17.10 \|\| Optimality of Solomonoff induction for reinforcement learning. \|\|		\|\| 17.10 \|\| Optimality of Solomonoff induction for reinforcement learning. \|\|
	\|}		\|}

Bauwens в 09:06, 10 октября 2024

2024-10-10T09:06:37Z

← Предыдущая версия		Версия от 09:06, 10 октября 2024
Строка 14:		Строка 14:
	! Rec !! Summary !! Notes !! Problem list !! Solutions		! Rec !! Summary !! Notes !! Problem list !! Solutions
	\|-		\|-
	\|\| 10.10 \|\| Course overview, (universal) Turing machines, computable and non-computable sets and functions. [https://www.dropbox.com/scl/fi/kea3f2888zrfmiu7kbuaw/01slides.pdf?rlkey=8wohccfrcwt5j5fvr0ltqxb2j&st=ndcob512&dl=0 slides] \|\| [https://www.dropbox.com/scl/fi/~~kea3f2888zrfmiu7kbuaw~~/~~01slides~~.pdf?rlkey=~~8wohccfrcwt5j5fvr0ltqxb2j~~&st=~~ndcob512~~&dl=0 ch00] [https://www.dropbox.com/scl/fi/2ipwvmn6i4z5uoc5ehvsq/01notes.pdf?rlkey=ao740xt6abqir89nh9a90ls0j&st=4wqf1ssl&dl=0 ch01]\|\|		\|\| 10.10 \|\| Course overview, (universal) Turing machines, computable and non-computable sets and functions. [https://www.dropbox.com/scl/fi/kea3f2888zrfmiu7kbuaw/01slides.pdf?rlkey=8wohccfrcwt5j5fvr0ltqxb2j&st=ndcob512&dl=0 slides] \|\| [https://www.dropbox.com/scl/fi/0bbgs9q2tvs7462nov6ml/00notes.pdf?rlkey=59eg45qm420rmvgik8062fdra&st=cbvunx5z&dl=0 ch00] [https://www.dropbox.com/scl/fi/2ipwvmn6i4z5uoc5ehvsq/01notes.pdf?rlkey=ao740xt6abqir89nh9a90ls0j&st=4wqf1ssl&dl=0 ch01]\|\|
	\|\| 17.10 \|\| Optimality of Solomonoff induction for reinforcement learning. \|\|		\|\| 17.10 \|\| Optimality of Solomonoff induction for reinforcement learning. \|\|
	\|}		\|}

Bauwens: Новая страница: « = Classes = Lectures: Thursday 14h00 -- 15h20, Smolenskaya and online Invite link for telegram group for announcements and discussions (will be soon) = Cour…»

2024-10-10T09:05:26Z

Новая страница: « = Classes = Lectures: Thursday 14h00 -- 15h20, Smolenskaya and online Invite link for telegram group for announcements and discussions (will be soon) = Cour…»

Новая страница

= Classes =

Lectures: Thursday 14h00 -- 15h20, Smolenskaya and online

Invite link for telegram group for announcements and discussions (will be soon)

= Course Materials =

{| class="wikitable"
|-
! Rec !! Summary !! Notes !! Problem list !! Solutions
|-
|| 10.10 || Course overview, (universal) Turing machines, computable and non-computable sets and functions. [https://www.dropbox.com/scl/fi/kea3f2888zrfmiu7kbuaw/01slides.pdf?rlkey=8wohccfrcwt5j5fvr0ltqxb2j&st=ndcob512&dl=0 slides] || [https://www.dropbox.com/scl/fi/kea3f2888zrfmiu7kbuaw/01slides.pdf?rlkey=8wohccfrcwt5j5fvr0ltqxb2j&st=ndcob512&dl=0 ch00] [https://www.dropbox.com/scl/fi/2ipwvmn6i4z5uoc5ehvsq/01notes.pdf?rlkey=ao740xt6abqir89nh9a90ls0j&st=4wqf1ssl&dl=0 ch01]||
|| 17.10 || Optimality of Solomonoff induction for reinforcement learning. ||
|}

= Homeworks =

Deadlines: every 2 weeks, before the lecture at 18h00. Submit in pdf or fotos of handwritten to brbauwens@gmail.com with the subject line starting with KOLM-HW. Link with results will be here.

Tasks are in the problem lists from the seminar. Deadlines: problem lists 1 and 2: at the start of 3rd lecture, lists 3 and 4 at the start of the 5th lecture, etc.

Late policy: 1 homework can be submitted at most 24h late without explanations.

= References =

Todo

= Grading =

Final score = 0.35 * [score homework] + 0.35 * [score colloquium] + 0.3 * [score exam] <br>

Some homework assignments contain extra problems. Each solution of an extra problem will give 1 extra points on the final exam (which is graded out of 10). There will be around 10 extra problems. Rounding is applied only when the final score is transferred to the official grade. Arithmetic rounding is used. Autogrades. If only 6/10 for the exam is needed to get a final score of 10/10, then this will be given automatically.

= Colloquium and exam =

Colloquium: in the middel of December, a list with about 10 questions will be provided.

Exam: Problems similar to the homework. You may use main references, lecture notes, and handwritten notes.

= Office hours =

Bruno Bauwens: Tuesday 12h -- 20h. Wednesday 16h -- 18h. Friday 11h -- 17h. Better send me an email in advance.