Liangyan Li

Dr. Liangyan Li

orcid

Research Focus & Metrics

Academic Career Length

1Year (2026-Present)

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

Representative Publications

View All Publications
12 January 2026 in IEEE Transactions on Communications
Verified
Journal Article
Closed access
LXLi Xie
Li Xie
LLLiangyan Li
Liangyan Li
Jun ChenJun Chen
Jun Chen
LYLei Yu
Lei Yu
ZZZhongshan Zhang
Zhongshan Zhang
This paper investigates the tightness of existing bounds on the quadratic Gaussian distortion-rate-perception functions with limited common randomness and the i.i.d. output constraint, under perception measures based on the Kullback–Leibler divergence and the squared Wasserstein-2 distance. For the squared Wasserstein-2 distance-based perception measure, we improve the best-known lower bound by introducing a tunable parameter. Moreover, via the connection between rate-distortion-perception coding and entropy-constrained scalar quantization, it is revealed that all existing bounds, including the improved one, are generally not tight in the weak perception constraint regime. Our findings shed light on the information-theoretic performance limits of rate-distortion-perception coding and offer guidelines for developing practical schemes.

2 June 2026 in Entropy
Verified
Journal Article
Open access
PDF file
LLLiangyan Li
Liangyan Li
YLYangyi Liu
Yangyi Liu
YNYimo Ning
Yimo Ning
SRStefano Rini
Stefano Rini
Jun ChenJun Chen
Jun Chen
We introduce the symmetric co-skewness moment (SCKM)—a third-order informational dissimilarity metric that consistently outperforms state-of-the-art client-selection heuristics in federated learning (FL) under heterogeneous data. Unlike similarity-driven schemes, SCKM minimizes redundancy by favoring clients with complementary gradients, delivering faster and more stable convergence even at high heterogeneity levels. Operating on highly compressed 0.5% gradient summaries, our framework provides two operating modes for different deployment scales: (i) SCKM-Select directly ranks and schedules a small candidate pool, whereas (ii) SCKM-Cluster adds a fast, elbow-guided clustering step to scalably choose from thousands of users. We evaluate both variants on a VGG-16 model across multiple non-IID partition schemes and initializations, observing consistent gains over leading cosine-similarity, loss-sketch, and max-diversity baselines—without increasing the communication budget.