activity
20202024
most citedConditional graph entropy as an alternating minimization problem

1 citations · 2 across the 7 of their papers we have counts for

collaborators

7 papers

cs.IT2024

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…

cs.IT2023

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…

math.CO2023

Phase Transitions of Structured Codes of Graphs

Bo Bai, Yu Gao, Jie Ma +1

We consider the symmetric difference of two graphs on the same vertex set , which is the graph on whose edge set consists of all edges that belong to exactly one of the…

cs.IT2023

Computation of Rate-Distortion-Perception Functions With Wasserstein Barycenter

Chunhui Chen, Xueyan Niu, Wenhao Ye +4

The nascent field of Rate-Distortion-Perception (RDP) theory is seeing a surge of research interest due to the application of machine learning techniques in the area of lossy compr…

cs.IT2022★ 1 cited

Conditional graph entropy as an alternating minimization problem

Viktor Harangi, Xueyan Niu, Bo Bai

Conditional graph entropy is known to be the minimal rate for a natural functional compression problem with side information at the receiver. In this paper we show that it can be f…

math.CO2022★ 1 cited

Generalizing Körner's graph entropy to graphons

Viktor Harangi, Xueyan Niu, Bo Bai

Körner introduced the notion of graph entropy in 1973 as the minimal code rate of a natural coding problem where not all pairs of letters can be distinguished in the alphabet. Late…

math.CO2020

Cut Bounds for Some Weighted Graphs

Chicheng Ma, Yucong Tang, Guanghui Wang +2

In communication field, an important issue is to group users and base stations to as many as possible subnetworks satisfying certain interference constraints. These problems are us…