Weihao Kong

most citedLearning Populations of Parameters

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

collaborators

2 papers

cs.DS2017

Approximating the Spectrum of a Graph

David Cohen-Steiner, Weihao Kong, Christian Sohler +1

The spectrum of a network or graph $G = (V, E)$ with adjacency matrix $A$ , consists of the eigenvalues of the normalized Laplacian $L = I - D^{- 1/2} A D^{- 1/2}$ . This set of eigenvalue…

cs.LG2017★ 5 cited

Learning Populations of Parameters

Kevin Tian, Weihao Kong, Gregory Valiant

Consider the following estimation problem: there are $n$ entities, each with an unknown parameter $p_{i} \in [0, 1]$ , and we observe $n$ independent random variables, $X_{1}, \dots, X_{n}$ …