activity
20152026
most citedAchieving Adversarial Robustness via Sparsity

14 citations · 36 across the 11 of their papers we have counts for

collaborators

12 papers

cs.DC2026

Distributed Linearly Separable Computation with Arbitrary Heterogeneous Data Assignment

Ziting Zhang, Kai Wan, Minquan Cheng +2

Distributed linearly separable computation is a fundamental problem in large-scale distributed systems, requiring the computation of linearly separable functions over different dat…

cs.LG2021

Cascading Bandit under Differential Privacy

Kun Wang, Jing Dong, Baoxiang Wang +2

This paper studies \emph{differential privacy (DP)} and \emph{local differential privacy (LDP)} in cascading bandits. Under DP, we propose an algorithm which guarantees -indisti…

cs.LG2020★ 14 cited

Achieving Adversarial Robustness via Sparsity

Shufan Wang, Ningyi Liao, Liyao Xiang +2

Network pruning has been known to produce compact models without much accuracy degradation. However, how the pruning process affects a network's robustness and the working mechanis…

cs.IT2020★ 1 cited

On the Fundamental Limits of Coded Caching Systems with Restricted Demand Types

Shuo Shao, Jesús Gómez-Vilardebó, Kai Zhang +1

Caching is a technique to reduce the communication load in peak hours by prefetching contents during off-peak hours. An information-theoretic framework for coded caching was introd…

cs.LG2020★ 3 cited

Infomax Neural Joint Source-Channel Coding via Adversarial Bit Flip

Yuxuan Song, Minkai Xu, Lantao Yu +3

Although Shannon theory states that it is asymptotically optimal to separate the source and channel coding as two independent processes, in many practical communication scenarios t…

cs.IT2020

Symmetric uncoded caching schemes with low subpacketization levels

Tai Do Duc, Shuo Shao, Chaoping Xing

Caching is a commonly used technique in content-delivery networks which aims to deliver information from hosting servers to users in the most efficient way. In 2014, Maddah-Ali and…

cs.LG2019★ 10 cited

Improving Unsupervised Domain Adaptation with Variational Information Bottleneck

Yuxuan Song, Lantao Yu, Zhangjie Cao +5

Domain adaptation aims to leverage the supervision signal of source domain to obtain an accurate model for target domain, where the labels are not available. To leverage and adapt…

cs.IT2019★ 5 cited

Secure Coded Caching with Colluding Users

Kangning Ma, Shuo Shao

In a secure coded caching system, a central server balances the traffic flow between peak and off-peak periods by distributing some public data to the users' caches in advance. Mea…

cs.IT2018

New Results on Multilevel Diversity Coding with Secure Regeneration

Shuo Shao, Tie Liu, Chao Tian +1

The problem of multilevel diversity coding with secure regeneration is revisited. Under the assumption that the eavesdropper can access the repair data for all compromised storage…

cs.IT2017★ 3 cited

Multilevel Diversity Coding with Secure Regeneration: Separate Coding Achieves the MBR Point

Shuo Shao, Tie Liu, Chao Tian +1

The problem of multilevel diversity coding with secure regeneration (MDC-SR) is considered, which includes the problems of multilevel diversity coding with regeneration (MDC-R) and…

cs.IT2017

On the Tradeoff Region of Secure Exact-Repair Regenerating Codes

Shuo Shao, Tie Liu, Chao Tian +1

We consider the secure exact-repair regenerating code problem, which generalizes the exact-repair regenerating code problem with the additional constraint…

cs.IT2015

Multilevel Diversity Coding with Regeneration: Separate Coding Achieves the MBR Point

Shuo Shao, Tie Liu, Chao Tian

The problem of multilevel diversity coding with regeneration is considered in this work. Two new outer bounds on the optimal tradeoffs between the normalized storage capacity and r…