20 citations · 79 across the 26 of their papers we have counts for
9 papers · 1 filter
Communication-Efficient Weighted Sampling and Quantile Summary for GBDT
Ziyue Huang, Ke Yi
Gradient boosting decision tree (GBDT) is a powerful and widely-used machine learning model, which has achieved state-of-the-art performance in many academic areas and production e…
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…
Equivalence between Priority Queues and Sorting in External Memory
Zhewei Wei, Ke Yi
A priority queue is a fundamental data structure that maintains a dynamic ordered set of keys and supports the followig basic operations: insertion of a key, deletion of a key, and…
The Space Complexity of 2-Dimensional Approximate Range Counting
Zhewei Wei, Ke Yi
We study the problem of -dimensional orthogonal range counting with additive error. Given a set of points drawn from an grid and an error parameter $\eps$, t…
Randomized Algorithms for Tracking Distributed Count, Frequencies, and Ranks
Zengfeng Huang, Ke Yi, Qin Zhang
We show that randomization can lead to significant improvements for a few fundamental problems in distributed tracking. Our basis is the {\em count-tracking} problem, where there a…
Clustering with diversity
Jian Li, Ke Yi, Qin Zhang
We consider the {\em clustering with diversity} problem: given a set of colored points in a metric space, partition them into clusters such that each cluster has at least po…