17.02.2025 talk
46 views
Skip to first unread message
kozmath
Feb 9, 2025, 9:32:27 AM2/9/25
to Kolmogorov seminar on complexity
Hi all,
On Monday February 17, Time: 18:30 (MSK), 16:30 (CET)
we have a talk of Sasha Kozachinskiy on
computable online learning.
Zoom:
https://u-bordeaux-fr.zoom.us/j/88402787361?pwd=WktCdEhBT3pXN0pLUGg4Z3RuMlpsQT09
In the online learning setting, a learner receives an input x_1 to an unknown function f from a known hypothesis class H. The learner has to guess f(x_1). Then the learner receives the real value f(x_1), and the process repeats for x_2, x_3, and so on. The minimal number of mistakes that one can achieve on a hypothesis class H is known to be equal to the so-called Littlestone dimension of H.
What if the learner has to be computable? Or if the Littlestone dimension ``effective''? We will establish relationships between different versions of online learning when we impose computability conditions. Joint with Valentino Delle Rose and Tomasz Steifer.
On Monday February 17, Time: 18:30 (MSK), 16:30 (CET)
we have a talk of Sasha Kozachinskiy on
computable online learning.
Zoom:
https://u-bordeaux-fr.zoom.us/j/88402787361?pwd=WktCdEhBT3pXN0pLUGg4Z3RuMlpsQT09
In the online learning setting, a learner receives an input x_1 to an unknown function f from a known hypothesis class H. The learner has to guess f(x_1). Then the learner receives the real value f(x_1), and the process repeats for x_2, x_3, and so on. The minimal number of mistakes that one can achieve on a hypothesis class H is known to be equal to the so-called Littlestone dimension of H.
What if the learner has to be computable? Or if the Littlestone dimension ``effective''? We will establish relationships between different versions of online learning when we impose computability conditions. Joint with Valentino Delle Rose and Tomasz Steifer.
Sasha
Nikolay Vereshchagin
Feb 17, 2025, 5:57:39 AM2/17/25
to Kolmogorov seminar on complexity
Reminder: today we have Sasha Kozachinsky's talk at 18:30 (MSK), 16:30 (CET)
--
Вы получили это сообщение, поскольку подписаны на группу "Kolmogorov seminar on complexity".
Чтобы отменить подписку на эту группу и больше не получать от нее сообщения, отправьте письмо на электронный адрес kolmogorov-seminar-on-...@googlegroups.com.
Чтобы посмотреть обсуждение, перейдите по ссылке https://groups.google.com/d/msgid/kolmogorov-seminar-on-complexity/TF5d2s6mgTywYkh8dc_BfhLo1xAcMuCaH1-hvGCLMlAE465onODQEdh5Vbq3NvM4faaaOufTmZ7fvH2k1GbCWk5Bn_hr4CWuZ8sLPeinHxY%3D%40proton.me.
Вы получили это сообщение, поскольку подписаны на группу "Kolmogorov seminar on complexity".
Чтобы отменить подписку на эту группу и больше не получать от нее сообщения, отправьте письмо на электронный адрес kolmogorov-seminar-on-...@googlegroups.com.
Чтобы посмотреть обсуждение, перейдите по ссылке https://groups.google.com/d/msgid/kolmogorov-seminar-on-complexity/TF5d2s6mgTywYkh8dc_BfhLo1xAcMuCaH1-hvGCLMlAE465onODQEdh5Vbq3NvM4faaaOufTmZ7fvH2k1GbCWk5Bn_hr4CWuZ8sLPeinHxY%3D%40proton.me.
Н.В.
Reply all
Reply to author
Forward
0 new messages