Xizixiang Wei
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Xizixiang Wei has a total of 12 co-authors. Here are the top co-authors by number of shared publications:
- Cong Shen
Charles L. Brown Department of Electrical and Computer Engineering, University of Virginia, Charlottesville, VA, USA
6 shared publications - Jing Yang
University of Virginia, Charlottesville, Virginia, USA
3 shared publications - Harold Vincent Poor
Princeton University
2 shared publications - Tianhao Wang
University of Virginia, Charlottesville, USA
2 shared publications - Xin Wang
Fudan University
2 shared publications - Yi Jiang
Key Laboratory for Information Science of Electromagnetic Waves (MoE), School of Information Science and Technology, Fudan University, Shanghai, China
2 shared publications
Latest Publications
- Open Access
- 18 May 2026
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Management of Data
- Vol. 4 (3) , 1-26
HeteroFedSyn: Differentially Private Tabular Data Synthesis for Heterogeneous Federated Settings
Traditional Differential Privacy (DP) mechanisms are typically tailored to specific analysis tasks, which limits the reusability of protected data. DP tabular data synthesis overcomes this by generating synthetic datasets that can be shared for arbitrary downstream tasks. However, existing synthesis methods predominantly assume centralized or local settings and overlook the more practical horizontal federated scenario. Naïvely synthesizing data locally or perturbing individual records either produces biased mixtures or introduces excessive noise, especially under heterogeneous data distributions across participants. We propose HeteroFedSyn, the first DP tabular data synthesis framework designed specifically for the horizontal federated setting. Built upon the PrivSyn paradigm of 2-way marginal–based synthesis, HeteroFedSyn introduces three key innovations for distributed marginal selection: (i) an l 2 -based dependency metric with random projection for noise-efficient correlation measurement, (ii) an unbiased estimator to correct multiplicative noise, and (iii) an adaptive selection strategy that dynamically updates dependency scores to avoid redundancy. Extensive experiments on range queries, Wasserstein fidelity, and machine learning tasks show that, despite the increased noise inherent to federated execution, HeteroFedSyn achieves utility comparable to centralized synthesis. Our code is open-sourced via the link.
- 18 May 2026
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Management of Data
- Vol. 4 (3) , 1-26
Open AccessHeteroFedSyn: Differentially Private Tabular Data Synthesis for Heterogeneous Federated Settings
Traditional Differential Privacy (DP) mechanisms are typically tailored to specific analysis tasks, which limits the reusability of protected data. DP tabular data synthesis overcomes this by generating synthetic datasets that can be shared for arbitrary downstream tasks. However, existing synthesis methods predominantly assume centralized or local settings and overlook the more practical horizontal federated scenario. Naïvely synthesizing data locally or perturbing individual records either produces biased mixtures or introduces excessive noise, especially under heterogeneous data distributions across participants. We propose HeteroFedSyn, the first DP tabular data synthesis framework designed specifically for the horizontal federated setting. Built upon the PrivSyn paradigm of 2-way marginal–based synthesis, HeteroFedSyn introduces three key innovations for distributed marginal selection: (i) an l 2 -based dependency metric with random projection for noise-efficient correlation measurement, (ii) an unbiased estimator to correct multiplicative noise, and (iii) an adaptive selection strategy that dynamically updates dependency scores to avoid redundancy. Extensive experiments on range queries, Wasserstein fidelity, and machine learning tasks show that, despite the increased noise inherent to federated execution, HeteroFedSyn achieves utility comparable to centralized synthesis. Our code is open-sourced via the link.
- 27 February 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 72 (5) , 3175-3194
Differentially Private Wireless Federated Learning Using Orthogonal Sequences
We propose a privacy-preserving uplink over-the-air computation (AirComp) method, termed FLORAS, for single-input single-output (SISO) wireless federated learning (FL) systems. From the perspective of communication designs, FLORASeliminates the requirement of channel state information at the transmitters (CSIT) by leveraging the properties of orthogonal sequences. From the privacy perspective, we prove that FLORASoffers both item-level and client-level differential privacy (DP) guarantees. Moreover, by properly adjusting the system parameters, FLORAScan flexibly achieve different DP levels at no additional cost. A new FL convergence bound is derived which, combined with the privacy guarantees, allows for a smooth tradeoff between the achieved convergence rate and differential privacy levels. Experimental results demonstrate the advantages of FLORAScompared with the baseline AirComp method, and validate that the analytical results can guide the design of privacy-preserving FL with different tradeoff requirements on the model convergence and privacy levels.
- 27 February 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 72 (5) , 3175-3194
Differentially Private Wireless Federated Learning Using Orthogonal Sequences
We propose a privacy-preserving uplink over-the-air computation (AirComp) method, termed FLORAS, for single-input single-output (SISO) wireless federated learning (FL) systems. From the perspective of communication designs, FLORASeliminates the requirement of channel state information at the transmitters (CSIT) by leveraging the properties of orthogonal sequences. From the privacy perspective, we prove that FLORASoffers both item-level and client-level differential privacy (DP) guarantees. Moreover, by properly adjusting the system parameters, FLORAScan flexibly achieve different DP levels at no additional cost. A new FL convergence bound is derived which, combined with the privacy guarantees, allows for a smooth tradeoff between the achieved convergence rate and differential privacy levels. Experimental results demonstrate the advantages of FLORAScompared with the baseline AirComp method, and validate that the analytical results can guide the design of privacy-preserving FL with different tradeoff requirements on the model convergence and privacy levels.
- 11 August 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Wireless Communications
- Vol. 23 (3) , 2469-2485
Random Orthogonalization for Federated Learning in Massive MIMO Systems
We propose a novel communication design, termed random orthogonalization , for federated learning (FL) in a massive multiple-input and multiple-output (MIMO) wireless system. The key novelty of random orthogonalization comes from the tight coupling of FL and two unique characteristics of massive MIMO - channel hardening and favorable propagation. As a result, random orthogonalization can achieve natural over-the-air model aggregation without requiring transmitter side channel state information (CSI) for the uplink phase of FL, while significantly reducing the channel estimation overhead at the receiver. We extend this principle to the downlink communication phase and develop a simple but highly effective model broadcast method for FL. We also relax the massive MIMO assumption by proposing an enhanced random orthogonalization design for both uplink and downlink FL communications, that does not rely on channel hardening or favorable propagation. Theoretical analyses with respect to both communication and machine learning performance are carried out. In particular, an explicit relationship among the convergence rate, the number of clients, and the number of antennas is established. Experimental results validate the effectiveness and efficiency of random orthogonalization for FL in massive MIMO.
- 11 August 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Wireless Communications
- Vol. 23 (3) , 2469-2485
Random Orthogonalization for Federated Learning in Massive MIMO Systems
We propose a novel communication design, termed random orthogonalization , for federated learning (FL) in a massive multiple-input and multiple-output (MIMO) wireless system. The key novelty of random orthogonalization comes from the tight coupling of FL and two unique characteristics of massive MIMO - channel hardening and favorable propagation. As a result, random orthogonalization can achieve natural over-the-air model aggregation without requiring transmitter side channel state information (CSI) for the uplink phase of FL, while significantly reducing the channel estimation overhead at the receiver. We extend this principle to the downlink communication phase and develop a simple but highly effective model broadcast method for FL. We also relax the massive MIMO assumption by proposing an enhanced random orthogonalization design for both uplink and downlink FL communications, that does not rely on channel hardening or favorable propagation. Theoretical analyses with respect to both communication and machine learning performance are carried out. In particular, an explicit relationship among the convergence rate, the number of clients, and the number of antennas is established. Experimental results validate the effectiveness and efficiency of random orthogonalization for FL in massive MIMO.
- 6 January 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cognitive Communications and Networking
- Vol. 8 (2) , 1253-1268
Federated Learning Over Noisy Channels: Convergence Analysis and Design Examples
Does Federated Learning (FL) work when both uplink and downlink communications have errors? How much communication noise can FL handle and what is its impact on the learning performance? This work is devoted to answering these practically important questions by explicitly incorporating both uplink and downlink noisy channels in the FL pipeline. We present several novel convergence analyses of FL over simultaneous uplink and downlink noisy communication channels, which encompass full and partial clients participation, direct model and model differential transmissions, and non-independent and identically distributed (IID) local datasets. These analyses characterize the sufficient conditions for FL over noisy channels to have the same convergence behavior as the ideal case of no communication error. More specifically, in order to maintain the$\mathcal {O}({1}/{T})$ convergence rate of FED AVG with perfect communications, the uplink and downlink signal-to-noise ratio (SNR) for direct model transmissions should be controlled such that they scale as$\mathcal {O}(t^{2})$ where${t}$ is the index of communication rounds, but can stay$\mathcal {O}(1)$ (i.e., constant) for model differential transmissions. The key insight of these theoretical results is a “flying under the radar” principle – stochastic gradient descent (SGD) is an inherent noisy process and uplink/downlink communication noises can be tolerated as long as they do not dominate the time-varying SGD noise. We exemplify these theoretical findings with two widely adopted communication techniques – transmit power control and receive diversity combining – and further validate their performance advantages over the standard methods via numerical experiments using several real-world FL tasks.- 6 January 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cognitive Communications and Networking
- Vol. 8 (2) , 1253-1268
Federated Learning Over Noisy Channels: Convergence Analysis and Design Examples
Does Federated Learning (FL) work when both uplink and downlink communications have errors? How much communication noise can FL handle and what is its impact on the learning performance? This work is devoted to answering these practically important questions by explicitly incorporating both uplink and downlink noisy channels in the FL pipeline. We present several novel convergence analyses of FL over simultaneous uplink and downlink noisy communication channels, which encompass full and partial clients participation, direct model and model differential transmissions, and non-independent and identically distributed (IID) local datasets. These analyses characterize the sufficient conditions for FL over noisy channels to have the same convergence behavior as the ideal case of no communication error. More specifically, in order to maintain the$\mathcal {O}({1}/{T})$ convergence rate of FED AVG with perfect communications, the uplink and downlink signal-to-noise ratio (SNR) for direct model transmissions should be controlled such that they scale as$\mathcal {O}(t^{2})$ where${t}$ is the index of communication rounds, but can stay$\mathcal {O}(1)$ (i.e., constant) for model differential transmissions. The key insight of these theoretical results is a “flying under the radar” principle – stochastic gradient descent (SGD) is an inherent noisy process and uplink/downlink communication noises can be tolerated as long as they do not dominate the time-varying SGD noise. We exemplify these theoretical findings with two widely adopted communication techniques – transmit power control and receive diversity combining – and further validate their performance advantages over the standard methods via numerical experiments using several real-world FL tasks.- 2 December 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Wireless Communications Letters
- Vol. 11 (2) , 431-435
Tx-Rx Reciprocity Calibration for Hybrid Massive MIMO Systems
In this letter, we focus on calibrating the analog-digital hybrid transceiver in a massive multiple-input multiple-output (MIMO) system for ensuring the transmit-receive (Tx-Rx) reciprocity of the time division duplex (TDD) channel. Taking the imperfection of the practical phase shifter network (PSN) into consideration, we formulate the estimation of the Tx-Rx mismatches as a non-convex problem, for which we propose two novel algorithms: one is simple with closed-form solution; the other is iterative with higher complexity traded for better performance. We also derive the Cramer-Rao lower bounds (CRLBs) for the estimation of the Tx-Rx mismatches. Numerical results validate the effectiveness of the two approaches. In particular, the proposed iterative algorithm achieves the mean squared errors (MSEs) very close to the CRLBs.
- 2 December 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Wireless Communications Letters
- Vol. 11 (2) , 431-435
Tx-Rx Reciprocity Calibration for Hybrid Massive MIMO Systems
In this letter, we focus on calibrating the analog-digital hybrid transceiver in a massive multiple-input multiple-output (MIMO) system for ensuring the transmit-receive (Tx-Rx) reciprocity of the time division duplex (TDD) channel. Taking the imperfection of the practical phase shifter network (PSN) into consideration, we formulate the estimation of the Tx-Rx mismatches as a non-convex problem, for which we propose two novel algorithms: one is simple with closed-form solution; the other is iterative with higher complexity traded for better performance. We also derive the Cramer-Rao lower bounds (CRLBs) for the estimation of the Tx-Rx mismatches. Numerical results validate the effectiveness of the two approaches. In particular, the proposed iterative algorithm achieves the mean squared errors (MSEs) very close to the CRLBs.
- 3 April 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 68 (1053587X) , 2302-2315
Calibration of Phase Shifter Network for Hybrid Beamforming in mmWave Massive MIMO Systems
For the millimeter wave (mmWave) massive multiple-input multiple-output (MIMO) systems, hybrid beam- forming has been proposed to reap a great gain of the large number of antennas with a limited number of radio frequency (RF) chains. The hybrid beamforming relies on a phase shifter network (PSN) in the RF domain to steer the signal power along the desired direction (or subspace). However, the RF circuits connecting the antennas and the RF chains can introduce distinct phase deviations, which need to be calibrated for the effective hybrid beamforming. This paper develops two novel approaches to the estimation and calibration of the PSN in mmWave massive MIMO communication systems under line-of-sight (LOS) and non-LOS channel scenarios. Specifically, we formulate the core phase deviation estimation problem in the calibration task as an optimization program with constant modulus constraints. Efficient algorithms are then developed to estimate the phase deviations that need to be calibrated. To gauge the performance of the proposed schemes, we also derive the Cramer-Rao lower bounds (CRLBs) for the phase estimates. The numerical results validate the effectiveness of our approaches by showing that the proposed algorithms yield estimates whose mean squared errors (MSEs) are close to the CRLBs.
- 3 April 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 68 (1053587X) , 2302-2315
Calibration of Phase Shifter Network for Hybrid Beamforming in mmWave Massive MIMO Systems
For the millimeter wave (mmWave) massive multiple-input multiple-output (MIMO) systems, hybrid beam- forming has been proposed to reap a great gain of the large number of antennas with a limited number of radio frequency (RF) chains. The hybrid beamforming relies on a phase shifter network (PSN) in the RF domain to steer the signal power along the desired direction (or subspace). However, the RF circuits connecting the antennas and the RF chains can introduce distinct phase deviations, which need to be calibrated for the effective hybrid beamforming. This paper develops two novel approaches to the estimation and calibration of the PSN in mmWave massive MIMO communication systems under line-of-sight (LOS) and non-LOS channel scenarios. Specifically, we formulate the core phase deviation estimation problem in the calibration task as an optimization program with constant modulus constraints. Efficient algorithms are then developed to estimate the phase deviations that need to be calibrated. To gauge the performance of the proposed schemes, we also derive the Cramer-Rao lower bounds (CRLBs) for the phase estimates. The numerical results validate the effectiveness of our approaches by showing that the proposed algorithms yield estimates whose mean squared errors (MSEs) are close to the CRLBs.