Chasing convex bodies and other random topics with Dr. Sébastien Bubeck
1 567
15.8
Microsoft Research333 тыс
Следующее
13.12.18 – 87831:48Популярные
06.12.22 – 20819:28
06.12.22 – 25330:06Опубликовано 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.
Свежие видео
3 дня – 6942:11
3 дня – 86 8470:48
8 дней – 770:46
8 дней – 8 1675:07
11 дней – 15 39418:09
Случайные видео
8 дней – 3 04021:17
12 дней – 3270:19
209 дней – 3 500 8350:55
03.05.23 – 7088:00
13.06.22 – 11 0550:35
26.03.21 – 67 9030:16
1 час – 148:13
2 дня – 1 0911:24
3 дня – 2 8070:28
3 дня – 7480:32
7 дней – 1 9954:56
9 дней – 3281:18
11 дней – 9531:00