# Seminar • Algorithms and Complexity — New Nearly-Optimal Coreset for Kernel Density Estimation

Wednesday, September 9, 2020 — 10:00 AM EDT

## Please note: This seminar will be given online.

Wai Ming Tai, School of Computing
University of Utah

Seminar host: Professor Lap Chi Lau

Given a point set $P \subset \mathbb{R}^d$, kernel density estimation for Gaussian kernel is defined as $\overline{\mathcal{G}}_P(x) = \frac{1}{\left|P\right|}\sum_{p\inP}e^{-\left\lVert x-p \right\rVert^2}$ for any $x\in\mathbb{R}^d$. We study how to construct a small subset $Q$ of $P$ such that the kernel density estimation of $P$ can be approximated by the kernel density estimation of $Q$. This subset $Q$ is called \emph{coreset}. The primary technique in this work is to construct $\pm 1$ coloring on the point set $P$ by the discrepancy theory and apply this coloring algorithm recursively.

Our result leverages Banaszczyk’s Theorem. When $d>1$ is constant, our construction gives a coreset of size $O\left(\frac{1}{\varepsilon}\sqrt{\log\log\frac{1}{\varepsilon}}\right)$as opposed to the best-known result of $O\left(\frac{1}{\varepsilon}\sqrt{\log\frac{1}{\varepsilon}}\right)$. It is the first to give a breakthrough on the barrier of $\sqrt{\log}$ factor even when $d=2$.

To join this seminar virtually on Zoom, please go to https://zoom.us/j/96151296749.

Meeting ID: 961 5129 6749

Location
Online seminar
200 University Avenue West

Waterloo, ON N2L 3G1

### February 2023

S M T W T F S
29
30
31
2
4
5
8
10
11
12
13
15
16
18
19
20
21
22
23
24
25
26
27
28
1
2
3
4
1. 2023 (33)
1. March (1)
2. February (10)
3. January (22)
2. 2022 (245)
1. December (20)
2. November (28)
3. October (15)
4. September (12)
5. August (29)
6. July (23)
7. June (17)
8. May (20)
9. April (24)
10. March (22)
11. February (16)
12. January (19)
3. 2021 (210)
4. 2020 (217)
5. 2019 (255)
6. 2018 (217)
7. 2017 (36)
8. 2016 (21)
9. 2015 (36)
10. 2014 (33)
11. 2013 (23)
12. 2012 (4)
13. 2011 (1)
14. 2010 (1)
15. 2009 (1)
16. 2008 (1)