Xueyan Niu

Dr. Xueyan Niu

Theory Lab, Huawei Technologies (China), Shenzhen, Guangdong, China
orcid

Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 January 2024
Verified
Conference Paper
Open access
PDF file
WFWeizhi Fei
Weizhi Fei
Xueyan NiuXueyan Niu
Xueyan Niu
PZPingyi Zhou
Pingyi Zhou
LHLu Hou
Lu Hou
BBBo Bai
Bo Bai
WHWei Han
Wei Han
Weizhi Fei, Xueyan Niu, Pingyi Zhou, Lu Hou, Bo Bai, Lei Deng, Wei Han. Findings of the Association for Computational Linguistics ACL 2024. 2024.

31 March 2025 in Entropy
Verified
Journal Article
Open access
PDF file
Xueyan NiuXueyan Niu
Xueyan Niu
BBBai Bai
Bai Bai
NGNian Guo
Nian Guo
WZWeixi Zhang
Weixi Zhang
WHWei Han
Wei Han
Traditional rate–distortion (RD) theory examines the trade-off between the average length of the compressed representation of a source and the additive distortions of its reconstruction. The rate–distortion–perception (RDP) framework, which integrates the perceptual dimension into the RD paradigm, has garnered significant attention due to recent advancements in machine learning, where perceptual fidelity is assessed by the divergence between input and reconstruction distributions. In communication systems where downstream tasks involve generative modeling, high perceptual fidelity is essential, despite distortion constraints. However, while zero distortion implies perfect realism, the converse is not true, highlighting an imbalance in the significance of distortion and perceptual constraints. This article clarifies that incorporating perceptual constraints does not decrease the necessary rate; instead, under certain conditions, additional rate is required, even with the aid of common and private randomness, which are key elements in generative models. Consequently, we project an increase in expected traffic in intelligent communication networks with the consideration of perceptual quality. Nevertheless, a modest increase in rate can enable generative models to significantly enhance the perceptual quality of reconstructions. By exploring the synergies between generative modeling and communication through the lens of information-theoretic results, this article demonstrates the benefits of intelligent communication systems and advocates for the application of the RDP framework in advancing compression and semantic communication research.

14 September 2023 in IEEE Transactions on Information Theory
Verified
Journal Article
Closed access
VHViktor Harangi
Viktor Harangi
Xueyan NiuXueyan Niu
Xueyan Niu
BBBai Bai
Bai 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 formulated as an alternating minimization problem, which gives rise to a simple iterative algorithm for numerically computing (conditional) graph entropy. This also leads to a new formula which shows that conditional graph entropy is part of a more general framework: the solution of an optimization problem over a convex corner. In the special case of graph entropy (i.e., unconditioned version) this was known due to Csiszár, Körner, Lovász, Marton, and Simonyi. In that case the role of the convex corner was played by the so-called vertex packing polytope. In the conditional version it is a more intricate convex body but the function to minimize is the same. Furthermore, we describe a dual problem that leads to an optimality check and an error bound for the iterative algorithm.

2 September 2024 in IEEE Journal on Selected Areas in Information Theory
Verified
Journal Article
Closed access
RZRuze Zhang
Ruze Zhang
XGXuan Guang
Xuan Guang
Shenghao YangShenghao Yang
Shenghao Yang
Xueyan NiuXueyan Niu
Xueyan Niu
BBBai Bai
Bai Bai
In this paper, the problem of zero-error network function computation is considered, where in a directed acyclic network, a single sink node is required to compute with zero error a function of the source messages that are separately generated by multiple source nodes. From the information-theoretic point of view, we are interested in the fundamental computing capacity, which is defined as the average number of times that the function can be computed with zero error for one use of the network. The explicit characterization of the computing capacity in general is overwhelming difficult. The best known upper bound applicable to arbitrary network topologies and arbitrary target functions is the one proved by Guang et al. in using an approach of the cut-set strong partition. This bound is tight for all previously considered network function computation problems whose computing capacities are known. In this paper, we consider the model of computing the binary arithmetic sum over an asymmetric diamond network, which is of great importance to illustrate the combinatorial nature of network function computation problem. First, we prove a corrected upper bound 1 by using a linear programming approach, which corrects an invalid bound previously claimed in the literature. Nevertheless, this upper bound cannot bring any improvement over the best known upper bound for this model, which is also equal to 1. Further, by developing a different graph coloring approach, we obtain an improved upper bound 1/log32+log3-1 (≈0.822). We thus show that the best known upper bound proved by Guang et al. is not tight for this model which answers the open problem that whether this bound in general is tight. On the other hand, we present an explicit code construction, which implies a lower bound 1/2log36 (≈0.815) on the computing capacity. Comparing the improved upper and lower bounds thus obtained, there exists a rough 0.007 gap between them.

20 February 2024 in Entropy
Verified
Journal Article
Open access
PDF file
YDYanan Dou
Yanan Dou
YLYanqing Liu
Yanqing Liu
Xueyan NiuXueyan Niu
Xueyan Niu
BBBai Bai
Bai Bai
WHWei Han
Wei Han
Yanlin GengYanlin Geng
Yanlin Geng
The celebrated Blahut–Arimoto algorithm computes the capacity of a discrete memoryless point-to-point channel by alternately maximizing the objective function of a maximization problem. This algorithm has been applied to degraded broadcast channels, in which the supporting hyperplanes of the capacity region are again cast as maximization problems. In this work, we consider general broadcast channels and extend this algorithm to compute inner and outer bounds on the capacity regions. Our main contributions are as follows: first, we show that the optimization problems are max–min problems and that the exchange of minimum and maximum holds; second, we design Blahut–Arimoto algorithms for the maximization part and gradient descent algorithms for the minimization part; third, we provide convergence analysis for both parts. Numerical experiments validate the effectiveness of our algorithms.

20 November 2024 in IEEE Network
Verified
Journal Article
Closed access
Nikolaos PappasNikolaos Pappas
Nikolaos Pappas
MKMarios Kountouris
Marios Kountouris
Xueyan NiuXueyan Niu
Xueyan Niu
AEAnthony Ephremides
Anthony Ephremides