5 June 2024 in IEEE Transactions on Signal Processing
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.
31 October 2022 in Computer Communications
14 February 2025 in IEEE Transactions on Cybernetics
Discovering clusters remains challenging when dealing with complex data structures, including those with varying densities, arbitrary shapes, weak separability, or the presence of noise. In this article, we propose a novel clustering algorithm called representative point-based clustering with neighborhood information (RPC-NI), which highlights the significance of neighborhood information often overlooked by existing clustering methods. The proposed algorithm first introduces a new local centrality metric that integrates both neighborhood density and topological convergence to identify core representative points, effectively capturing the structural characteristics of the data. Subsequently, a density-adaptive distance is defined to evaluate dissimilarities between these core representative points, and such distance is used to construct a minimum spanning tree (MST) over these points. Finally, an MST-based clustering algorithm is employed to yield the desired clusters. Incorporating neighborhood information enables RPC-NI to comprehensively determine representative points, and having multiple representative points per cluster allows RPC-NI to adapt to clusters of arbitrary shapes, varying densities, and different sizes. Extensive experiments on widely used datasets demonstrate that RPC-NI outperforms baseline algorithms in terms of clustering accuracy and robustness. These results provide further evidence for the importance of incorporating neighborhood information discovering clusters with complex structures.
5 May 2025 in IEEE Journal of Selected Topics in Signal Processing
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.
10 October 2025 in European Journal of Operational Research
20 May 2024 in IEEE Transactions on Industrial Informatics
Classical clustering methods such as k-means, spectral clustering, DBSCAN, and DPC often operate under specific assumptions about data characteristics. However, the increasing diversity and complex characteristic of data, coupled with limited prior knowledge, hinder the direct application of these clustering algorithms. Existing data processing approaches, such as ReScale and CDF-TS, are capable of homogenizing cluster density, but tailor to density-based algorithms that does not perform well on weakly separated or manifold clusters. To overcome these issues, we propose a novel data processing method (ReShape) facilitating the direct application of well-known clustering algorithms without modifications. The ReShape integrates three key components: a homogenization factor for uniforming varying cluster densities, a separation factor for enhancing cluster separations, and a joint distance considering both global and local consistency to measure distances in manifold datasets. The proposed method is universally applicable, and can match implicit assumptions of existing clustering algorithms. Extensive experiments and a case study for fault diagnosis involving k-means, spectral clustering, DBSCAN, and DPC demonstrates the efficacy of the ReShape approach.