papers

Publications (80)

cs.SI2022

Trading off Quality for Efficiency of Community Detection: An Inductive Method across Graphs

Meng Qin, Chaorui Zhang, Bo Bai +2

Many network applications can be formulated as NP-hard combinatorial optimization problems of community detection (CD). Due to the NP-hardness, to balance the CD quality and effici…

cs.LG2024

Beyond Scaling Laws: Understanding Transformer Performance with Associative Memory

Xueyan Niu, Bo Bai, Lei Deng +1

Increasing the size of a Transformer does not always lead to enhanced performance. This phenomenon cannot be explained by the empirical scaling laws. Furthermore, the model's enhan…

cs.IT2023

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…

cs.CV2022

GPPF: A General Perception Pre-training Framework via Sparsely Activated Multi-Task Learning

Benyuan Sun, Jin Dai, Zihao Liang +3

Pre-training over mixtured multi-task, multi-domain, and multi-modal data remains an open challenge in vision perception pre-training. In this paper, we propose GPPF, a General Per…

cs.IT2022

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…

cs.IT2015

Smoothed Lp-Minimization for Green Cloud-RAN with User Admission Control

Yuanming Shi, Jinkun Cheng, Jun Zhang +3

The cloud radio access network (Cloud-RAN) has recently been proposed as one cost-effective and energy-efficient technique for 5G wireless networks. By moving the signal processing…

cs.IT2024

Set Transformation: Trade-off Between Repair Bandwidth and Sub-packetization

Hao Shi, Zhengyi Jiang, Zhongyi Huang +3

Maximum distance separable (MDS) codes facilitate the achievement of elevated levels of fault tolerance in storage systems while incurring minimal redundancy overhead. Reed-Solomon…

cs.CL2023

Extending Context Window of Large Language Models via Semantic Compression

Weizhi Fei, Xueyan Niu, Pingyi Zhou +4

Transformer-based Large Language Models (LLMs) often impose limitations on the length of the text input to ensure the generation of fluent and relevant responses. This constraint r…

cs.IT2021

Structural Entropy of the Stochastic Block Models

Jie Han, Tao Guo, Qiaoqiao Zhou +3

With the rapid expansion of graphs and networks and the growing magnitude of data from all areas of science, effective treatment and compression schemes of context-dependent data i…

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…

eess.IV2024

High Perceptual Quality Wireless Image Delivery with Denoising Diffusion Models

Selim F. Yilmaz, Xueyan Niu, Bo Bai +3

We consider the image transmission problem over a noisy wireless channel via deep learning-based joint source-channel coding (DeepJSCC) along with a denoising diffusion probabilist…

cs.IT2023

A Hybrid Wireless Image Transmission Scheme with Diffusion

Xueyan Niu, Xu Wang, Deniz Gündüz +3

We propose a hybrid joint source-channel coding (JSCC) scheme, in which the conventional digital communication scheme is complemented with a generative refinement component to impr…

math.OC2021

Simplex Initialization: A Survey of Techniques and Trends

Mengyu Huang, Yuxing Zhong, Huiwen Yang +4

The simplex method is one of the most fundamental technologies for solving linear programming (LP) problems and has been widely applied to different practical applications. In the…

cs.IT2022

Clustered Cell-Free Networking: A Graph Partitioning Approach

Junyuan Wang, Lin Dai, Lu Yang +1

By moving to millimeter wave (mmWave) frequencies, base stations (BSs) will be densely deployed to provide seamless coverage in sixth generation (6G) mobile communication systems,…

cs.IT2022

PMDS Array Codes With Small Sub-packetization, Small Repair Bandwidth/Rebuilding Access

Jie Li, Xiaohu Tang, Hanxu Hou +3

Partial maximum distance separable (PMDS) codes are a kind of erasure codes where the nodes are divided into multiple groups with each forming an MDS code with a smaller code lengt…

cs.SI2021

Algorithms for Interference Minimization in Future Wireless Network Decomposition

Péter L. Erdős, Tamás Róbert Mezei, Yiding Yu +3

We propose a simple and fast method for providing a high quality solution for the sum-interference minimization problem. As future networks are deployed in high density urban areas…

cs.IT2020

Deep Reinforcement Learning for Fresh Data Collection in UAV-assisted IoT Networks

Mengjie Yi, Xijun Wang, Juan Liu +2

Due to the flexibility and low operational cost, dispatching unmanned aerial vehicles (UAVs) to collect information from distributed sensors is expected to be a promising solution…

cs.CL2024

Retrieval Meets Reasoning: Dynamic In-Context Editing for Long-Text Understanding

Weizhi Fei, Xueyan Niu, Guoqing Xie +4

Current Large Language Models (LLMs) face inherent limitations due to their pre-defined context lengths, which impede their capacity for multi-hop reasoning within extensive textua…

cs.IT2025

Grid-like Error-Correcting Codes for Matrix Multiplication with Better Correcting Capability

Hao Shi, Zhengyi Jiang, Zhongyi Huang +3

Matrix multiplication over the real field constitutes a foundational operation in the training of deep learning models, serving as a computational cornerstone for both forward and…

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.IR2025

ER-RAG: Enhance RAG with ER-Based Unified Modeling of Heterogeneous Data Sources

Yikuan Xia, Jiazun Chen, Yirui Zhan +6

Large language models (LLMs) excel in question-answering (QA) tasks, and retrieval-augmented generation (RAG) enhances their precision by incorporating external evidence from diver…

cs.IT2022

TOSE: A Fast Capacity Determination Algorithm Based on Random Matrix Theory

Dandan Jiang, Han Hao, Lu Yang +3

Wireless network capacity is one of the most important performance metrics for wireless communication networks. Future wireless networks will be composed of extremely large number…

cs.SI2023

RaftGP: Random Fast Graph Partitioning

Yu Gao, Meng Qin, Yibin Ding +6

Graph partitioning (GP), a.k.a. community detection, is a classic problem that divides the node set of a graph into densely-connected blocks. Following prior work on the IEEE HPEC…

cs.IT2023

Capacity-Achieving Sparse Regression Codes via Vector Approximate Message Passing

Yizhou Xu, YuHao Liu, ShanSuo Liang +4

Sparse regression codes (SPARCs) are a promising coding scheme that can approach the Shannon limit over Additive White Gaussian Noise (AWGN) channels. Previous works have proven th…

cond-mat.str-el2024

Giant domain wall anomalous Hall effect in an antiferromagnet

Wei Xia, Bo Bai, Xuejiao Chen +25

Generally, the dissipationless Hall effect in solids requires time-reversal symmetry breaking (TRSB), where TRSB induced by external magnetic field results in ordinary Hall effect,…

cs.CL2025

Efficient Prompt Compression with Evaluator Heads for Long-Context Transformer Inference

Weizhi Fei, Xueyan Niu, Guoqing Xie +3

Although applications involving long-context inputs are crucial for the effective utilization of large language models (LLMs), they also result in increased computational costs and…

cs.IT2022

An Efficient Two-Stage SPARC Decoder for Massive MIMO Unsourced Random Access

Juntao You, Wenjie Wang, Shansuo Liang +2

In this paper, we study a concatenate coding scheme based on sparse regression code (SPARC) and tree code for unsourced random access in massive multiple-input and multiple-output…

cs.IT2022

Lossy Computing with Side Information via Multi-Hypergraphs

Deheng Yuan, Tao Guo, Bo Bai +1

We consider a problem of coding for computing, where the decoder wishes to estimate a function of its local message and the source message at the encoder within a given distortion.…

cs.IT2023

MDS Array Codes With Small Sub-packetization Levels and Small Repair Degrees

Jie Li, Yi Liu, Xiaohu Tang +3

High-rate minimum storage regenerating (MSR) codes are known to require a large sub-packetization level, which can make meta-data management difficult and hinder implementation in…

eess.SP2021

A Tensor-BTD-based Modulation for Massive Unsourced Random Access

Zhenting Luan, Yuchi Wu, Shansuo Liang +3

In this letter, we propose a novel tensor-based modulation scheme for massive unsourced random access. The proposed modulation can be deemed as a summation of third-order tensors,…

cs.IT2023

MDS Array Codes With (Near) Optimal Repair Bandwidth for All Admissible Repair Degrees

Jie Li, Yi Liu, Xiaohu Tang +3

Abundant high-rate (n, k) minimum storage regenerating (MSR) codes have been reported in the literature. However, most of them require contacting all the surviving nodes during a n…

eess.IV2022

Asymmetric Gained Deep Image Compression With Continuous Rate Adaptation

Ze Cui, Jing Wang, Shangyin Gao +3

With the development of deep learning techniques, the combination of deep learning with image compression has drawn lots of attention. Recently, learned image compression methods h…

cs.IT2022

Two Piggybacking Codes with Flexible Sub-Packetization to Achieve Lower Repair Bandwidth

Hao Shi, Zhengyi Jiang, Zhongyi Huang +2

As a special class of array codes, piggybacking codes are MDS codes (i.e., any out of nodes can retrieve all data symbols) that can achieve low repair bandwidth f…

cond-mat.str-el2025

Multi-origin driven giant planar Hall effect in topological antiferromagnet EuAl2Si2 with tunable spin texture

Xiangqi Liu, Ziyi Zhu, Yixuan Luo +11

In topological materials, the planar Hall effect (PHE) is often regarded as a hallmark of profound quantum phenomena-most notably the Adler-Bell-Jackiw chiral anomaly and Berry cur…

math.MG2021

Uniform tight frames as optimal signals

Gergely Ambrus, Bo Bai, Jianfeng Hou

Non-orthogonal communication is a promising technique for future wireless networks (e.g., 6G and Wi-Fi 7). In the vector channel model, designing efficient non-orthogonal communica…

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…

cs.IT2024

Error Correction Decoding Algorithms of RS Codes Based on An Earlier Termination Algorithm to Find The Error Locator Polynomial

Zhengyi Jiang, Hao Shi, Zhongyi Huang +4

Reed-Solomon (RS) codes are widely used to correct errors in storage systems. Finding the error locator polynomial is one of the key steps in the error correction procedure of RS c…

cs.IT2021

What Should Future Wireless Network Architectures Be?

Lu Yang, Ping Li, Miaomiao Dong +5

The accelerated convergence of digital and real-world lifestyles has imposed unprecedented demands on today's wireless network architectures, as it is highly desirable for such arc…

cs.NI2023

dMAPAR-HMM: Reforming Traffic Model for Improving Performance Bound with Stochastic Network Calculus

Qingqing Yang, Xi Peng, Huiwen Yang +2

A popular branch of stochastic network calculus (SNC) utilizes moment-generating functions (MGFs) to characterize arrivals and services, which enables end-to-end performance analys…

cs.IT2023

Conditional Rate-Distortion-Perception Trade-Off

Xueyan Niu, Deniz Gündüz, Bo Bai +1

Recent advances in machine learning-aided lossy compression are incorporating perceptual fidelity into the rate-distortion theory. In this paper, we study the rate-distortion-perce…

cs.LG2024

Towards Faster Graph Partitioning via Pre-training and Inductive Inference

Meng Qin, Chaorui Zhang, Yu Gao +5

Graph partitioning (GP) is a classic problem that divides the node set of a graph into densely-connected blocks. Following the IEEE HPEC Graph Challenge and recent advances in pre-…

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…

cs.LG2024

A Mean Field Ansatz for Zero-Shot Weight Transfer

Xingyuan Chen, Wenwei Kuang, Lei Deng +3

The pre-training cost of large language models (LLMs) is prohibitive. One cutting-edge approach to reduce the cost is zero-shot weight transfer, also known as model growth for some…

cs.IT2013

Outage Exponent: A Unified Performance Metric for Parallel Fading Channels

Bo Bai, Wei Chen, Khaled B. Letaief +1

The parallel fading channel, which consists of finite number of subchannels, is very important, because it can be used to formulate many practical communication systems. The outage…

cs.IT2022

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…

cs.IT2023

Localization and Discrete Beamforming with a Large Reconfigurable Intelligent Surface

Baojia Luo, Yili Deng, Miaomiao Dong +4

In millimeter-wave (mmWave) cellular systems, reconfigurable intelligent surfaces (RISs) are foreseeably deployed with a large number of reflecting elements to achieve high beamfor…

cs.IT2023

Generalized Simple Regenerating Codes: Trading Sub-packetization and Fault Tolerance

Zhengyi Jiang, Hao Shi, Zhongyi Huang +3

Maximum distance separable (MDS) codes have the optimal trade-off between storage efficiency and fault tolerance, which are widely used in distributed storage systems. As typical n…

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…

math.OC2022

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…

eess.IV2024

Extreme Video Compression with Pre-trained Diffusion Models

Bohan Li, Yiming Liu, Xueyan Niu +3

Diffusion models have achieved remarkable success in generating high quality image and video data. More recently, they have also been used for image compression with high perceptua…

cs.IT2013

An Outage Exponent Region based Coded f-Matching Framework for Channel Allocation in Multi-carrier Multi-access Channels

Bo Bai, Wei Chen, Khaled B. Letaief +1

The multi-carrier multi-access technique is widely adopt in future wireless communication systems, such as IEEE 802.16m and 3GPP LTE-A. The channel resources allocation in multi-ca…

math.CO2023

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. Lat…

cs.IT2026

Forget BIT, It is All about TOKEN: Towards Semantic Information Theory for LLMs

Bo Bai

Despite the empirical successes of Large Language Models (LLMs), the prevailing paradigm is heuristic and experiment-driven, tethered to massive compute and data, while a first-pri…

cs.IT2022

Semantic Compression with Side Information: A Rate-Distortion Perspective

Tao Guo, Yizhu Wang, Jie Han +3

We consider the semantic rate-distortion problem motivated by task-oriented video compression. The semantic information corresponding to the task, which is not observable to the en…

eess.SP2021

Harmonic Retrieval with -Tucker Tensor Decomposition

Zhenting Luan, Zhenyu Ming, Yuchi Wu +4

Harmonic retrieval (HR) has a wide range of applications in the scenes where signals are modelled as a summation of sinusoids. Past works have developed a number of approaches to r…

cs.IT2018

Age-Optimal Trajectory Planning for UAV-Assisted Data Collection

Juan Liu, Xijun Wang, Bo Bai +1

Unmanned aerial vehicle (UAV)-aided data collection is a new and promising application in many practical scenarios. In this work, we study the age-optimal trajectory planning probl…

cs.CL2025

NeuralDB: Scaling Knowledge Editing in LLMs to 100,000 Facts with Neural KV Database

Weizhi Fei, Hao Shi, Jing Xu +7

Efficiently editing knowledge stored in large language models (LLMs) enables model updates without large-scale training. One possible solution is Locate-and-Edit (L\&E), allowing s…

cs.IT2022

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…

cs.IT2019

Coded Caching in Fog-RAN: b-Matching Approach

Bo Bai, Wanyi Li, Li Wang +1

Fog radio access network (Fog-RAN), which pushes the caching and computing capabilities to the network edge, is capable of efficiently delivering contents to users by using careful…

math.OC2021

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…

cs.IT2024

A Constrained BA Algorithm for Rate-Distortion and Distortion-Rate Functions

Lingyi Chen, Shitong Wu, Wenhao Ye +4

The Blahut-Arimoto (BA) algorithm has played a fundamental role in the numerical computation of rate-distortion (RD) functions. This algorithm possesses a desirable monotonic conve…

cs.IT2026

Tight Lower Bounds on The Single-Error Detection Threshold for Analog Error-Correcting Codes

Zhengyi Jiang, Wenhao Liu, Zhongyi Huang +3

Analog error-correcting codes (Analog ECCs) for approximate vector-matrix multiplication have been extensively studied as means to achieve fault-tolerant in-memory computation. The…

math.PR2022

Tail Quantile Estimation for Non-preemptive Priority Queues

Jin Guang, Guiyu Hong, Xinyun Chen +4

Motivated by applications in computing and telecommunication systems, we investigate the problem of estimating p-quantile of steady-state sojourn times in a single-server multi-cla…

cs.LG2026

On the Non-decoupling of Supervised Fine-tuning and Reinforcement Learning in Post-training

Xueyan Niu, Bo Bai, Wei Han +1

Post-training of large language models routinely interleaves supervised fine-tuning (SFT) with reinforcement learning (RL). These two methods have different objectives: SFT minimiz…

cs.IT2014

How Much Frequency Can Be Reused in 5G Cellular Networks---A Matrix Graph Model

Yaoqing Yang, Bo Bai, Wei Chen

The 5th Generation cellular network may have the key feature of smaller cell size and denser resource employment, resulted from diminishing resource and increasing communication de…

cs.IT2015

Large-Scale Convex Optimization for Ultra-Dense Cloud-RAN

Yuanming Shi, Jun Zhang, Khaled B. Letaief +2

The heterogeneous cloud radio access network (Cloud-RAN) provides a revolutionary way to densify radio access networks. It enables centralized coordination and signal processing fo…

cs.AI2026

Memo-SQL: Structured Decomposition and Experience-Driven Self-Correction for Training-Free NL2SQL

Zerui Yang, Weichuan Wang, Yanwei Xu +4

Existing NL2SQL systems face two critical limitations: (1) they rely on in-context learning with only correct examples, overlooking the rich signal in historical error-fix pairs th…

math.OC2022

Improving Primal Heuristics for Mixed Integer Programming Problems based on Problem Reduction: A Learning-based Approach

Lingying Huang, Xiaomeng Chen, Wei Huo +4

In this paper, we propose a Bi-layer Predictionbased Reduction Branch (BP-RB) framework to speed up the process of finding a high-quality feasible solution for Mixed Integer Progra…

cs.SI2019

GCN-GAN: A Non-linear Temporal Link Prediction Model for Weighted Dynamic Networks

Kai Lei, Meng Qin, Bo Bai +2

In this paper, we generally formulate the dynamics prediction problem of various network systems (e.g., the prediction of mobility, traffic and topology) as the temporal link predi…

cs.IT2019

A Survey of Optimization Approaches for Wireless Physical Layer Security

Dong Wang, Bo Bai, Wenbo Zhao +1

Due to the malicious attacks in wireless networks, physical layer security has attracted increasing concerns from both academia and industry. The research on physical layer securit…

cs.IT2022

Two New Piggybacking Designs with Lower Repair Bandwidth

Zhengyi Jiang, Hanxu Hou, Yunghsiang S. Han +3

Piggybacking codes are a special class of MDS array codes that can achieve small repair bandwidth with small sub-packetization by first creating some instances of an MDS co…

cs.LG2021

Branch and Bound in Mixed Integer Linear Programming Problems: A Survey of Techniques and Trends

Lingying Huang, Xiaomeng Chen, Wei Huo +4

In this paper, we surveyed the existing literature studying different approaches and algorithms for the four critical components in the general branch and bound (B&B) algorithm, na…

eess.SP2017

Cache Placement in Fog-RANs: From Centralized to Distributed Algorithms

Juan Liu, Bo Bai, Jun Zhang +1

To deal with the rapid growth of high-speed and/or ultra-low latency data traffic for massive mobile users, fog radio access networks (Fog-RANs) have emerged as a promising archite…

cs.IT2022

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…

math.OC2022

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,…

cs.IR2026

DB3 Team's Solution For Meta KDD Cup' 25

Yikuan Xia, Jiazun Chen, Yirui Zhan +6

This paper presents the db3 team's winning solution for the Meta CRAG-MM Challenge 2025 at KDD Cup'25. Addressing the challenge's unique multi-modal, multi-turn question answering…

cs.CL2026

ChLogic: Evaluating Robustness of Logical Reasoning in Chinese Expressions

Peixian Zhou, Yuxu Chen, Chaorui Zhang +3

Large language models perform increasingly well on standardized logical reasoning benchmarks, but whether this ability remains robust beyond English is unclear. We introduce ChLogi…

cs.IT2021

Lower Bound on the Optimal Access Bandwidth of ()-MDS Array Code with Degraded Read Friendly

Ting-Yi Wu, Yunghsiang S. Han, Zhengrui Li +4

Accessing the data in the failed disk (degraded read) with low latency is crucial for an erasure-coded storage system. In this work, the maximum distance separable (MDS) array code…

cs.IT2023

Cooperative Data Collection with Multiple UAVs for Information Freshness in the Internet of Things

Xijun Wang, Mengjie Yi, Juan Liu +3

Maintaining the freshness of information in the Internet of Things (IoT) is a critical yet challenging problem. In this paper, we study cooperative data collection using multiple U…

math.OC2022

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…