activity
20152026
most citedMC2G: An Efficient Algorithm for Matrix Completion with Social and Item Similarity Graphs

19 citations · 26 across the 16 of their papers we have counts for

collaborators

16 papers

cs.IT2026

Second-Order Asymptotics for Covert Communication over Quasi-Static Multiple-Antenna Fading Channels

Changhong Liu, Jingjing Wang, Qiaosheng Zhang +2

We study the second-order asymptotics of optimal codes for covert communication over quasi-static multi-antenna fading channels, under the covertness metric of Kullback--Leibler (K…

stat.ML2022

Mutual Information Learned Regressor: an Information-theoretic Viewpoint of Training Regression Systems

Jirong Yi, Qiaosheng Zhang, Zhen Chen +4

As one of the central tasks in machine learning, regression finds lots of applications in different fields. An existing common practice for solving regression problems is the mean…

cs.LG2022

Mutual Information Learned Classifiers: an Information-theoretic Viewpoint of Training Deep Learning Classification Systems

Jirong Yi, Qiaosheng Zhang, Zhen Chen +2

Deep learning systems have been reported to acheive state-of-the-art performances in many applications, and one of the keys for achieving this is the existence of well trained clas…

cs.IT2022

Covert Communication Gains from Adversary's Uncertainty of Phase Angles

Sen Qiao, Daming Cao, Qiaosheng Zhang +2

This work investigates the phase gain of intelligent reflecting surface (IRS) covert communication over complex-valued additive white Gaussian noise (AWGN) channels. The transmitte…

cs.LG2022

Mutual Information Learned Classifiers: an Information-theoretic Viewpoint of Training Deep Learning Classification Systems

Jirong Yi, Qiaosheng Zhang, Zhen Chen +2

Deep learning systems have been reported to achieve state-of-the-art performances in many applications, and a key is the existence of well trained classifiers on benchmark datasets…

cs.IT2021

Covert Communication With Mismatched Decoders

Qiaosheng Zhang, Vincent Y. F. Tan

This paper considers the problem of covert communication with mismatched decoding, in which a sender wishes to reliably communicate with a receiver whose decoder is fixed and possi…

cs.IT2021★ 1 cited

Exact Recovery in the General Hypergraph Stochastic Block Model

Qiaosheng Zhang, Vincent Y. F. Tan

This paper investigates fundamental limits of exact recovery in the general d-uniform hypergraph stochastic block model (d-HSBM), wherein n nodes are partitioned into k disjoint co…

cs.IT2020

Covert Identification over Binary-Input Discrete Memoryless Channels

Qiaosheng Zhang, Vincent Y. F. Tan

This paper considers the covert identification problem in which a sender aims to reliably convey an identification (ID) message to a set of receivers via a binary-input discrete me…

cs.LG2020★ 19 cited

MC2G: An Efficient Algorithm for Matrix Completion with Social and Item Similarity Graphs

Qiaosheng Zhang, Geewon Suh, Changho Suh +1

In this paper, we design and analyze MC2G (Matrix Completion with 2 Graphs), an algorithm that performs matrix completion in the presence of social and item similarity graphs. MC2G…

cs.IT2020

Optimal Change-Point Detection with Training Sequences in the Large and Moderate Deviations Regimes

Haiyun He, Qiaosheng Zhang, Vincent Y. F. Tan

This paper investigates a novel offline change-point detection problem from an information-theoretic perspective. In contrast to most related works, we assume that the knowledge of…

cs.IT2020

Undetectable Radios: Covert Communication under Spectral Mask Constraints

Qiaosheng, Zhang, Matthieu R. Bloch +2

We consider the problem of covert communication over continuous-time additive white Gaussian noise (AWGN) channels under spectral mask constraints, wherein two legitimate parties a…

cs.IT2019

Community Detection and Matrix Completion with Social and Item Similarity Graphs

Qiaosheng Zhang, Vincent Y. F. Tan, Changho Suh

We consider the problem of recovering a binary rating matrix as well as clusters of users and items based on a partially observed matrix together with side-information in the form…

cs.IT2018

Stealthy Communication over Adversarially Jammed Multipath Networks

Jianhan Song, Qiaosheng Zhang, Swanand Kadhe +2

We consider the problem of stealthy communication over a multipath network in the presence of an active adversary. The multipath network consists of multiple parallel noiseless lin…

cs.IT2018

Covert Communication over Adversarially Jammed Channels

Qiaosheng Zhang, Mayank Bakshi, Sidharth Jaggi

Suppose that a transmitter Alice potentially wishes to communicate with a receiver Bob over an adversarially jammed binary channel. An active adversary James eavesdrops on their co…

cs.IT2016★ 2 cited

Computationally Efficient Covert Communication

Qiaosheng Zhang, Mayank Bakshi, Sidharth Jaggi

In this paper, we design the first computationally efficient codes for simultaneously reliable and covert communication over Binary Symmetric Channels (BSCs). Our setting is as fol…

cs.IT2015★ 4 cited

Coding against a Limited-view Adversary: The Effect of Causality and Feedback

Qiaosheng Zhang, Swanand Kadhe, Mayank Bakshi +2

We consider the problem of communication over a multi-path network in the presence of a causal adversary. The limited-view causal adversary is able to eavesdrop on a subset of link…