SWShixiong Wang

Shixiong Wang

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Shixiong Wang has a total of 17 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Robust Processing and Learning: Principles, Methods, and Wireless Applications

    by Shixiong Wang, Wei Dai, Li-Chun Wang, Geoffrey Ye Li

    This tutorial-style overview article examines the fundamental principles and methods of robustness, using wireless sensing and communication (WSC) as the narrative and exemplifying framework. First, we formalize the conceptual and mathematical foundations of robustness, highlighting the interpretations and relations across robust statistics, optimization, and machine learning. Key techniques, such as robust estimation and testing, distributionally robust optimization, and regularized and adversary training, are investigated. Together, the costs of robustness in system design, for example, the compromised nominal performances and the extra computational burdens, are discussed. Second, we review recent robust signal processing solutions for WSC that address model mismatch, data scarcity, adversarial perturbation, and distributional shift. Specific applications include robust ranging-based localization, modality sensing, channel estimation, receive combining, waveform design, and federated learning. Through this effort, we aim to introduce the classical developments and recent advances in robustness theory to the general signal processing community, exemplifying how robust statistical, optimization, and machine learning approaches can address the uncertainties inherent in WSC systems.

  • Open Access

    A New Particle Filter for Target Tracking in MIMO OFDM Integrated Sensing and Communications

    by Shixiong Wang, Wei Dai, Geoffrey Ye Li

    Particle filtering for target tracking using multi-input multi-output (MIMO) pulse-Doppler radars faces three long-standing obstacles: a) the absence of reliable likelihood models for raw radar data; b) the computational and statistical complications that arise when nuisance parameters (e.g., complex path gains) are augmented into state vectors; and c) the prohibitive computational burden of extracting noisy measurements of range, Doppler, and angles from snapshots. Motivated by an optimization-centric interpretation of Bayes' rule, this article addresses these challenges by proposing a new particle filtering framework that evaluates each hypothesized state using a tailored cost function, rather than relying on an explicit likelihood relation. The framework yields substantial reductions in both running time and tracking error compared to existing schemes. In addition, we examine the implementation of the proposed particle filter in MIMO orthogonal frequency-division multiplexing (OFDM) systems, aiming to equip modern communication infrastructure with integrated sensing and communications (ISAC) capabilities. Experiments suggest that MIMO-OFDM with pulse-Doppler processing holds considerable promise for ISAC, particularly when wide bandwidth, extended on-target time, and large antenna aperture are utilized.

  • Distributionally Robust Adaptive Beamforming

    by Shixiong Wang, Wei Dai, Geoffrey Ye Li

    As a fundamental technique in array signal processing, beamforming plays a crucial role in amplifying signals of interest (SoI) while mitigating interference plus noise (IPN). When uncertainties exist in the signal model or the data size of snapshots is limited, the performance of beamformers significantly degrades. In this article, we comprehensively study the conceptual system, theoretical analysis, and algorithmic design for robust beamforming against uncertainties in the assumed snapshot or IPN covariances. Since such robustness is specific to the probabilistic uncertainties of snapshots or IPN signals, it is referred to as distributional robustness. Particularly, four technical approaches for distributionally robust beamforming are proposed, including locally distributionally robust beamforming, globally distributionally robust beamforming, regularized beamforming, and Bayesian-nonparametric beamforming. In addition, we investigate the equivalence among the four technical approaches and suggest a unified distributionally robust beamforming framework. Moreover, we show that the resolution of power spectra estimation using distributionally robust beamforming can be greatly refined by incorporating the characteristics of subspace methods, and hence, the accuracy of IPN covariance reconstruction can be improved, especially when the interferers are close to the SoI. As a result, the robustness of beamformers based on IPN covariance estimation can be further enhanced.


  • Distributionally Robust Receive Combining

    by Shixiong Wang, Wei Dai, Geoffrey Ye Li

    This article investigates signal estimation in wireless transmission (i.e., receive combining) from the perspective of statistical machine learning, where the transmit signals may be from an integrated sensing and communication system; that is, 1) signals may be not only discrete constellation points but also arbitrary complex values; 2) signals may be spatially correlated. Particular attention is paid to handling various uncertainties such as the uncertainty of the transmit signal covariance, the uncertainty of the channel matrix, the uncertainty of the channel noise covariance, the existence of channel impulse noises, the non-ideality of the power amplifiers, and the limited sample size of pilots. To proceed, a distributionally robust receive combining framework that is insensitive to the above uncertainties is proposed, which reveals that channel estimation is not a necessary operation. For optimal linear estimation, the proposed framework includes several existing combiners as special cases such as diagonal loading and eigenvalue thresholding. For optimal nonlinear estimation, estimators are limited in reproducing kernel Hilbert spaces and neural network function spaces, and corresponding uncertainty-aware solutions (e.g., kernelized diagonal loading) are derived. In addition, we prove that the ridge and kernel ridge regression methods in machine learning are distributionally robust against diagonal perturbation in feature covariance.


  • Learning Against Distributional Uncertainty: On the Trade-Off Between Robustness and Specificity

    by Shixiong Wang, Haowei Wang, Xinke Li, Jean Honorio

    Trustworthy machine learning aims at combating distributional uncertainties in training data distributions compared to population distributions. Typical treatment frameworks include the Bayesian approach, (min-max) distributionally robust optimization (DRO), and regularization. However, three issues have to be raised: 1) the prior distribution in the Bayesian method and the regularizer in the regularization method are difficult to specify; 2) the DRO method tends to be overly conservative; 3) all the three methods are biased estimators of the true optimal cost. This paper studies a new framework that unifies the three approaches and addresses the three challenges above. The asymptotic properties (e.g., consistencies and asymptotic normalities), non-asymptotic properties (e.g., generalization bounds and unbiasedness), and solution methods of the proposed model are studied. The new model reveals the trade-off between the robustness to the unseen data and the specificity to the training data. Experiments on various real-world tasks validate the superiority of the proposed learning framework.


  • Robust Waveform Design for Integrated Sensing and Communication

    by Shixiong Wang, Wei Dai, Haowei Wang, Geoffrey Ye Li

    Integrated sensing and communication (ISAC), which enables hardware, resources (e.g., spectra), and waveforms sharing, is becoming a key feature in future-generation communication systems. This paper investigates performance characterization and waveform design for ISAC systems when the underlying true communication channels are not accurately known. With uncertainty in a nominal communication channel, the nominal Pareto frontier of the sensing and communication performances cannot represent the true performance trade-off of a real-world operating ISAC system. Therefore, this paper portrays the robust (i.e., conservative) Pareto frontier considering the uncertainty in the communication channel. To be specific, the lower bound of the true (but unknown) Pareto frontier is investigated, technically by studying robust waveform design problems that find the best waveforms under the worst-case channels. The robust waveform design problems examined in this paper are shown to be non-convex and high-dimensional, which cannot be solved using existing optimization techniques. As such, we propose a computationally efficient solution framework to approximately solve them. Simulation results show that by solving the robust waveform design problems, the lower bound of the true but unknown Pareto frontier, which characterizes the sensing-communication performance trade-off under communication channel uncertainty, can be obtained.


  • Open Access

    Distributional Robustness Bounds Generalization Errors

    by Shixiong Wang, Haowei Wang

    Bayesian methods, distributionally robust optimization methods, and regularization methods are three pillars of trustworthy machine learning combating distributional uncertainty, e.g., the uncertainty of an empirical distribution compared to the true underlying distribution. This paper investigates the connections among the three frameworks and, in particular, explores why these frameworks tend to have smaller generalization errors. Specifically, first, we suggest a quantitative definition for "distributional robustness", propose the concept of "robustness measure", and formalize several philosophical concepts in distributionally robust optimization. Second, we show that Bayesian methods are distributionally robust in the probably approximately correct (PAC) sense; in addition, by constructing a Dirichlet-process-like prior in Bayesian nonparametrics, it can be proven that any regularized empirical risk minimization method is equivalent to a Bayesian method. Third, we show that generalization errors of machine learning models can be characterized using the distributional uncertainty of the nominal distribution and the robustness measures of these machine learning models, which is a new perspective to bound generalization errors, and therefore, explain the reason why distributionally robust machine learning models, Bayesian models, and regularization models tend to have smaller generalization errors in a unified manner.

  • A Railway Accident Prevention System Using an Intelligent Pilot Vehicle

    by Shixiong Wang, Xinke Li, Zhirui Chen, Yang Liu

    Railway transportation, as a pillar of modern civilization, unavoidably suffers from external risk factors such as natural disasters, track breakages, and train collisions, which lead to substantial loss of life and property. Therefore, there is an urgent need to design a mechanism for warning and preventing railway accidents in order to diminish costs. We propose an add-on solution to the current system, which equips a train with a multifunctional pilot vehicle in the front: the vehicle pilots its mother train, warning it of impending danger, and stopping it if required. Specifically, the pilot vehicle is equipped with a wireless communication device to converse with the mother train, a ranging device for measuring the real-time distance from the mother train, a camera to capture the railway conditions ahead and recognize anomaly situations, and other sensors ( e.g. , collision detector and tiltmeter) to monitor its own conditions. Based on the above equipment, an efficient autonomous driving method is designed for the pilot vehicle to adjust the distance from the train. The autonomous driving problem can be formulated into a multi-objective functional optimization, where the objective is to minimize the total energy consumption and the experienced jerk of the pilot vehicle, and the decision is a continuous-time function that represents the traction or braking force imposed on the pilot vehicle. Additionally, a vision-based deep learning method is devised to automatically detect the mentioned railway anomalies using the ego-view camera of the pilot vehicle. To control the operational and maintenance costs, we propose to deploy pilot vehicles only for trains running in potentially dangerous environments, e.g. , mountainous areas during rainy days. By implementing the proposed scheme, we anticipate a reduction in accident rates within railway systems.


  • Distributionally Robust State Estimation for Jump Linear Systems

    by Shixiong Wang

    In practice, the designed nominal model set for a jump (Markov) linear system might be uncertain: 1) Every candidate model might be inexact due to, e.g., mismatched modeling assumptions or model’s identification errors; 2) The nominal model set might be incomplete (e.g., the true system has three operating modes but the designed model set includes only two of them). Moreover, the designed model transition probability matrix (TPM) might be uncertain: There is a discrepancy between the designed and true TPMs. Neglecting such model uncertainties and employing nominally optimal multi-model state estimators may cause significant performance losses. Therefore, this paper proposes a robust state estimation framework for jump linear systems that is insensitive to these three types of model uncertainty, technically by leveraging the distributionally robust optimization theory. Specifically, the model uncertainties are quantified by a collection of mixture distributions lying in a distributional ball centered at the nominal mixture distribution, where the nominal mixture distribution represents the nominal state-measurement distribution defined by nominal candidate models and their nominal model weights. Then, the robust state estimation is taken over the least-favorable distribution in the employed distributional ball. We show that the distributionally robust state estimation problem for jump linear systems can be reformulated into a tractable optimization equivalent such as a quadratic program or a positive semi-definite program, and in a special case, it can be analytically solved. Simulated and real-world experiments suggest that the proposed method is particularly useful when large model uncertainties exist.


  • Distributionally Robust State Estimation for Nonlinear Systems

    by Shixiong Wang

    Uncertainties unavoidably exist in modeling for nonlinear systems: state equation, measurement equation, and/or noises statistics might be uncertain. Such model mismatches render the performance of nominally optimal state estimators being deteriorated or even unsatisfactory. Therefore, robust filters that are insensitive to modeling uncertainties have to be designed. The challenge is to quantitatively describe the uncertainties and then design accordingly efficient robust filters. Since uncertainties in nominal models make prior state distributions and likelihood distributions uncertain as well, this article proposes a distributionally robust particle filtering framework for nonlinear systems subject to modeling uncertainties. Specifically, we use worst-case prior state distributions (near the nominal prior state distributions) to generate prior state particles and/or determine their weights. Likewise, worst-case likelihood distributions (near the nominal likelihood distributions) are used to evaluate the worst-case likelihoods of prior state particles at given measurements. The “worst-case” scenario is quantified by entropy of distributions, and maximum entropy distributions are found in balls centered at nominal distributions with radii defined by statistical similarity measures such as moments-based similarity, Wasserstein distance, and Kullback-Leibler divergence. We prove that Gaussian approximation filters (e.g., unscented/cubature/ensemble Kalman filter) are distributionally robust in the sense that they use maximum entropy prior state distributions and maximum entropy likelihood distributions. Moreover, we show that the distributionally robust particle filtering framework provides a likelihood evaluation method for general nonlinear measurement equation with non-additive and non-multiplicative measurement noises. At last, we discuss measurement outlier treatment strategies in the distributionally robust particle filtering framework.