3 citations · 3 across the 10 of their papers we have counts for
10 papers
Computation and Critical Transitions of Rate-Distortion-Perception Functions With Wasserstein Barycenter
Chunhui Chen, Xueyan Niu, Wenhao Ye +2
The information rate-distortion-perception (RDP) function characterizes the three-way trade-off between description rate, average distortion, and perceptual quality measured by dis…
Information Bottleneck Revisited: Posterior Probability Perspective with Optimal Transport
Lingyi Chen, Shitong Wu, Wenhao Ye +5
Information bottleneck (IB) is a paradigm to extract information in one target random variable from another relevant random variable, which has aroused great interest due to its po…
A Communication Optimal Transport Approach to the Computation of Rate Distortion Functions
Shitong Wu, Wenhao Ye, Hao Wu +3
In this paper, we propose a new framework named Communication Optimal Transport (CommOT) for computing the rate distortion (RD) function. This work is motivated by observing the fa…
The Double Regularization Method for Capacity Constrained Optimal Transport
Tianhao Wu, Qihao Cheng, Zihao Wang +4
Capacity constrained optimal transport is a variant of optimal transport, which adds extra constraints on the set of feasible couplings in the original optimal transport problem to…
An Optimal Transport Approach to the Computation of the LM Rate
Wenhao Ye, Huihui Wu, Shitong Wu +4
Mismatch capacity characterizes the highest information rate for a channel under a prescribed decoding metric, and is thus a highly relevant fundamental performance metric when dea…
The Moment Passing Method for Wireless Channel Capacity Estimation
Han Hao, Dandan Jiang, Lu Yang +2
Wireless network capacity can be regarded as the most important performance metric for wireless communication systems. With the fast development of wireless communication technolog…
Fast Sinkhorn II: Collinear Triangular Matrix and Linear Time Accurate Computation of Optimal Transport
Qichen Liao, Zihao Wang, Jing Chen +3
In our previous work [arXiv:2202.10042], the complexity of Sinkhorn iteration is reduced from to the optimal by leveraging the special structure of the kernel matri…
CGN: A Capacity-Guaranteed Network Architecture for Future Ultra-Dense Wireless Systems
Chaowen Deng, Lu Yang, Hao Wu +3
The sixth generation (6G) era is envisioned to be a fully intelligent and autonomous era, with physical and digital lifestyles merged together. Future wireless network architecture…
Fast Sinkhorn I: An O(N) algorithm for the Wasserstein-1 metric
Qichen Liao, Jing Chen, Zihao Wang +3
The Wasserstein metric is broadly used in optimal transport for comparing two probabilistic distributions, with successful applications in various fields such as machine learning,…
A Convergent Semi-Proximal Alternating Direction Method of Multipliers for Recovering Internet Traffics from Link Measurements
Zhenyu Ming, Liping Zhang, Hao Wu +4
It is challenging to recover the large-scale internet traffic data purely from the link measurements. With the rapid growth of the problem scale, it will be extremely difficult to…