6 citations · 20 across the 25 of their papers we have counts for
4 papers · 1 filter
Gadgetless Lifting Beats Round Elimination: Improved Lower Bounds for Pointer Chasing
Xinyu Mao, Guangxu Yang, Jiapeng Zhang
We prove an Ω(n/k+k) communication lower bound on (k-1)-round distributional complexity of the k-step pointer chasing problem under uniform input distribution, improving the Ω(n/k…
A multi-core periphery perspective: Ranking via relative centrality
Chandra Sekhar Mukherjee, Jiapeng Zhang
Community and core-periphery are two widely studied graph structures, with their coexistence observed in real-world graphs (Rombach, Porter, Fowler \& Mucha [SIAM J. App. Math. 201…
FedMPQ: Secure and Communication-Efficient Federated Learning with Multi-codebook Product Quantization
Xu Yang, Jiapeng Zhang, Qifeng Zhang +1
In federated learning, particularly in cross-device scenarios, secure aggregation has recently gained popularity as it effectively defends against inference attacks by malicious ag…
A New Information Complexity Measure for Multi-pass Streaming with Applications
Mark Braverman, Sumegha Garg, Qian Li +3
We introduce a new notion of information complexity for multi-pass streaming problems and use it to resolve several important questions in data streams. In the coin problem, one se…