activity
20092021
most citedOn the Optimal Compressions in the Compress-and-Forward Relay Schemes

14 citations · 28 across the 10 of their papers we have counts for

collaborators

11 papers

cs.LG2021

Understanding Entropic Regularization in GANs

Daria Reshetova, Yikun Bai, Xiugang Wu +1

Generative Adversarial Networks are a popular method for learning distributions from data by modeling the target distribution as a function of a known distribution. The function, o…

cs.IT2020★ 2 cited

Information Constrained Optimal Transport: From Talagrand, to Marton, to Cover

Yikun Bai, Xiugang Wu, Ayfer Ozgur

The optimal transport problem studies how to transport one measure to another in the most cost-effective way and has wide range of applications from economics to machine learning.…

math.PR2018★ 2 cited

An Isoperimetric Result on High-Dimensional Spheres

Leighton Pate Barnes, Ayfer Ozgur, Xiugang Wu

We consider an extremal problem for subsets of high-dimensional spheres that can be thought of as an extension of the classical isoperimetric problem on the sphere. Let be a su…

cs.IT2018

Minimax Learning for Remote Prediction

Cheuk Ting Li, Xiugang Wu, Ayfer Ozgur +1

The classical problem of supervised learning is to infer an accurate predictor of a target variable from a measured variable by using a finite number of labeled training sa…

cs.IT2017

"The Capacity of the Relay Channel": Solution to Cover's Problem in the Gaussian Case

Xiugang Wu, Leighton Pate Barnes, Ayfer Ozgur

Consider a memoryless relay channel, where the relay is connected to the destination with an isolated bit pipe of capacity . Let denote the capacity of this channel a…

cs.IT2016★ 3 cited

Cut-Set Bound Is Loose for Gaussian Relay Networks

Xiugang Wu, Ayfer Ozgur

The cut-set bound developed by Cover and El Gamal in 1979 has since remained the best known upper bound on the capacity of the Gaussian relay channel. We develop a new upper bound…

cs.IT2015

Cut-Set Bound Is Loose for Gaussian Relay Networks

Xiugang Wu, Ayfer Ozgur

The cut-set bound developed by Cover and El Gamal in 1979 has since remained the best known upper bound on the capacity of the Gaussian relay channel. We develop a new upper bound…

cs.NI2015

STAC: Simultaneous Transmitting and Air Computing in Wireless Data Center Networks

Shengli Zhang, Xiugang Wu, Ayfer Ozgur

The data center network (DCN), wired or wireless, features large amounts of Many-to-One (M2O) sessions. Each M2O session is currently operated based on Point-to-Point (P2P) communi…

cs.IT2012

A Unified Relay Framework with both D-F and C-F Relay Nodes

Xiugang Wu, Liang-Liang Xie

Decode-and-forward (D-F) and compress-and-forward (C-F) are two fundamentally different relay strategies proposed by (Cover and El Gamal, 1979). Individually, either of them has be…

cs.IT2010★ 14 cited

On the Optimal Compressions in the Compress-and-Forward Relay Schemes

Xiugang Wu, Liang-Liang Xie

..... joint decoding provides more freedom in choosing the compression at the relay. However, the question remains whether this freedom of selecting the compression necessarily imp…

cs.IT2009★ 7 cited

Asymptotic Equipartition Property of Output when Rate is above Capacity

Xiugang Wu, Liang-Liang Xie

The output distribution, when rate is above capacity, is investigated. It is shown that there is an asymptotic equipartition property (AEP) of the typical output sequences, indepen…