Chasing convex bodies and other random topics with Dr. Sébastien Bubeck
1 557
15.7
Microsoft Research330 тыс
Следующее
13.12.18 – 87731:48Популярные
198 дней – 57646:03
207 дней – 9365:33Опубликовано 13 декабря 2018, 12:57
Episode 53 | December 5, 2018
Dr. Sébastien Bubeck explains the difficulty of the multi-armed bandit problem in the context of a parameter- and data-rich online world. He also discusses a host of topics from randomness and convex optimization to metrical task systems and log n competitiveness to the surprising connection between Gaussian kernels and what he calls some of the most beautiful objects in mathematics.
Dr. Sébastien Bubeck explains the difficulty of the multi-armed bandit problem in the context of a parameter- and data-rich online world. He also discusses a host of topics from randomness and convex optimization to metrical task systems and log n competitiveness to the surprising connection between Gaussian kernels and what he calls some of the most beautiful objects in mathematics.
Свежие видео
2 дня – 4 4050:48
4 дня – 1312:20
4 дня – 9402:36
Случайные видео
22.08.23 – 13 3460:13
23.06.23 – 28 02145:29
14.05.23 – 13 5100:35
24.04.23 – 149 81414:39
14.12.21 – 2 8130:49
24 дня – 6 4010:32
12 часов – 40610:30
3 дня – 1 9170:40
6 дней – 35234:03
8 дней – 1 97446:33
9 дней – 19 1427:15
11 дней – 3 7053:44
11 дней – 496 6010:19