The FT-Mollification Method
206
Microsoft Research324 тыс
Следующее
17.08.16 – 1049:48Популярные
154 дня – 1 5553:17
17.02.23 – 2 5631:01:27Опубликовано 17 августа 2016, 0:33
We discuss a recent technique for dealing with k-independent families of random variables. The basic idea in showing that F is fooled by k-independence is to approximate by a smooth function F~ and note that the expectation of the Taylor polynomials are determined by k-independence. F~ can be obtained by convolving F with the Fourier transform of a compactly supported bump function. We discuss the development of this technique, leading up to the proof that limited independence fools degree 2 polynomial threshold functions.
Свежие видео
2 дня – 87932:45
2 дня – 540:37
5 дней – 3 4160:58
12 дней – 2 4040:16Случайные видео
15 дней – 1 3730:24
22.05.23 – 3 0150:57
08.12.22 – 1 6235:18
21.10.22 – 8 4590:29
20.05.22 – 9211:58
17.09.15 – 922 4621:30
2 дня – 64946:21
2 дня – 1821:26
6 дней – 29 4278:23
7 дней – 5920:53
