activity
20142023
most citedFinding the Mode of a Kernel Density Estimate

2 citations · 5 across the 6 of their papers we have counts for

collaborators

8 papers

cs.CG2023

On Mergable Coresets for Polytope Distance

Benwei Shi, Aditya Bhaskara, Wai Ming Tai +1

We show that a constant-size constant-error coreset for polytope distance is simple to maintain under merges of coresets. However, increasing the size cannot improve the error boun…

cs.DS2019★ 2 cited

Finding the Mode of a Kernel Density Estimate

Jasper C. H. Lee, Jerry Li, Christopher Musco +2

Given points in , how do we find a point which maximizes ? In other words, how do we find the maxim…

cs.LG2019★ 1 cited

Approximate Guarantees for Dictionary Learning

Aditya Bhaskara, Wai Ming Tai

In the dictionary learning (or sparse coding) problem, we are given a collection of signals (vectors in ), and the goal is to find a "basis" in which the signals have…

cs.LG2019★ 1 cited

Learning In Practice: Reasoning About Quantization

Annie Cherkaev, Waiming Tai, Jeff Phillips +1

There is a mismatch between the standard theoretical analyses of statistical machine learning and how learning is used in practice. The foundational assumption supporting the theor…

cs.LG2018★ 1 cited

The GaussianSketch for Almost Relative Error Kernel Distance

Jeff M. Phillips, Wai Ming Tai

We introduce two versions of a new sketch for approximately embedding the Gaussian kernel into Euclidean inner product space. These work by truncating infinite expansions of the Ga…

cs.LG2018

Near-Optimal Coresets of Kernel Density Estimates

Jeff M. Phillips, Wai Ming Tai

We construct near-optimal coresets for kernel density estimates for points in when the kernel is positive definite. Specifically we show a polynomial time constructi…

cs.LG2017

Improved Coresets for Kernel Density Estimates

Jeff M. Phillips, Wai Ming Tai

We study the construction of coresets for kernel density estimates. That is we show how to approximate the kernel density estimate described by a large point set with another kerne…

cs.DS2014

Tracking the Frequency Moments at All Times

Zengfeng Huang, Wai Ming Tai, Ke Yi

The traditional requirement for a randomized streaming algorithm is just {\em one-shot}, i.e., algorithm should be correct (within the stated $\eps$-error bound) at the end of the…