5 February 2025 in IEEE Transactions on Neural Networks and Learning Systems
The accuracy of on-grid frequency estimation methods suffers from the quantization error of discrete grids. In this article, a deep unfolded network for off-grid frequency estimation is proposed, dubbed OGFreq. In the OGFreq, there exist two kinds of variables. One is the batch-oriented dictionary for frequency-domain transform, and the other one is the instance-specific on-grid frequency and off-grid bias. As the dictionary is required to be universally applicable among all observed signals, network layers are designed and network weights are updated to approximate the transform bases in a data-driven way. Besides, instance-specific on-grid frequencies and off-grid biases are solved by unfolding the iterative soft-threshold algorithm (ISTA). In addition, the instance-specific hyperparameters for sparsity in ISTA are obtained by an encoder–decoder soft-threshold (EDS) module with the attention mechanism. In this way, the dictionary, on-grid frequency, and off-grid bias are learned in a unified data-driven framework. Numerical experiments show that the OGFreq obtains 4% lower false negative rate (FNR) when the SNR is 20 dB. Moreover, the computational complexity is one order of magnitude lower than the iteration-based off-grid frequency estimation methods. Finally, the robustness of the OGFreq is discussed when extended to the impulse noise and damped signals.
14 November 2023 in IEEE Transactions on Network Science and Engineering
Complex machine learning tasks for knowledge discovery in networked data, such as community detection, node categorization, network visualization, and dimension reduction, have been successfully addressed by coarsening algorithms. It iteratively reduces the original network into a hierarchy of smaller networks, resulting in informative simplifications of the original network at various degrees of detail. Few of these algorithms, however, have been specially built to cope with bipartite networks. Besides of this, current coarsening algorithms present the following theoretical limitations that should be addressed: 1) A high-cost search strategy in dense networks; 2) current coarsening algorithms are usually based on label propagation, which is limited to propagate single-labels; and 3) the synchronous label propagation scheme yields the cyclic oscillation problem. To overcome such limitations, we propose a coarsening algorithm based on multi-label propagation, which is more suitable for large-scale bipartite networks and allows a time-effective implementation. Furthermore, our proposal improves the standard semi-synchronous strategy and simultaneously propagates multiple labels to create the coarsened network representation. The empirical analysis of synthetic and real-world networks provides evidence that our coarsening strategy leads to significant gains regarding accuracy and runtime against standard techniques.