6 citations · 20 across the 25 of their papers we have counts for
Showing 2023Show all
3 papers · 1 filter
cs.LG2023
On the Power of SVD in the Stochastic Block Model
Xinyu Mao, Jiapeng Zhang
A popular heuristic method for improving clustering results is to apply dimensionality reduction before running clustering algorithms. It has been observed that spectral-based dime…
cs.CC2023★ 1 cited
Lifting Theorems Meet Information Complexity: Known and New Lower Bounds of Set-disjointness
Guangxu Yang, Jiapeng Zhang
Set-disjointness problems are one of the most fundamental problems in communication complexity and have been extensively studied in past decades. Given its importance, many lower b…
cs.CC2023
Streaming Lower Bounds and Asymmetric Set-Disjointness
Shachar Lovett, Jiapeng Zhang
Frequency estimation in data streams is one of the classical problems in streaming algorithms. Following much research, there are now almost matching upper and lower bounds for the…