Search arXiv⌕ Search

arXiv subjects

Fan Liu

Publications and source records attributed to Fan Liu.

At least 235 records · Page 13Linked to original sources

SNR-Adaptive Ranging Waveform Design Based on Ziv-Zakai Bound Optimization

Location-awareness is essential in various wireless applications. The capability of performing precise ranging is substantial in achieving high-accuracy localization. Due to the notorious ambiguity phenomenon, optimal ranging waveforms should be adaptive to the signal-to-noise ratio (SNR). In this letter, we propose to use the Ziv-Zakai bound (ZZB) as the ranging performance metric, as well as an associated waveform design algorithm having theoretical guarantee of achieving the optimal ZZB at a given SNR. Numerical results suggest that, in stark contrast to the well-known high-SNR design philosophy, the detection probability of the ranging signal becomes more important than the resolution in the low-SNR regime.

cs.IT↗

Supersymmetric partition function hierarchies and character expansions

We construct the supersymmetric $β$ and $(q,t)$-deformed Hurwitz-Kontsevich partition functions through $W$-representations and present the corresponding character expansions with respect to the Jack and Macdonald superpolynomials, respectively. Based on the constructed $β$ and $(q,t)$-deformed superoperators, we further give the supersymmetric $β$ and $(q,t)$-deformed partition function hierarchies through $W$-representations. We also present the generalized super Virasoro constraints, where the constraint operators obey the generalized super Virasoro algebra and null super 3-algebra. Moreover, the superintegrability for these (non-deformed) supersymmetric hierarchies is shown by their character expansions, i.e., $ \sim character$.

hep-th↗

C3PO: Towards a complete census of co-moving pairs of stars. I. High precision stellar parameters for 250 stars

We conduct a line-by-line differential analysis of a sample of 125 co-moving pairs of stars (dwarfs and subgiants near solar metallicity). We obtain high precision stellar parameters with average uncertainties in effective temperature, surface gravity and metallicity of 16.5 K, 0.033 dex and 0.014 dex, respectively. We classify the co-moving pairs of stars into two groups, chemically homogeneous (conatal; |Delta[Fe/H]| $\le$ 0.04 dex) and inhomogeneous (non-conatal), and examine the fraction of chemically homogeneous pairs as a function of separation and effective temperature. The four main conclusions from this study are: (1) A spatial separation of \ds = 10$^6$ AU is an approximate boundary between homogeneous and inhomogeneous pairs of stars, and we restrict our conclusions to only consider the 91 pairs with \ds $\le$ 10$^6$ AU; (2) There is no trend between velocity separation and the fraction of chemically homogeneous pairs in the range \dv $\le$ 4 \kms; (3) We confirm that the fraction of chemically inhomogeneous pairs increases with increasing \teff\ and the trend matches a toy model of that expected from planet ingestion; (4) Atomic diffusion is not the main cause of the chemical inhomogeneity. A major outcome from this study is a sample of 56 bright co-moving pairs of stars with chemical abundance differences $\leq$ 0.02 dex (5\%) which is a level of chemical homogeneity comparable to that of the Hyades open cluster. These important objects can be used, in conjunction with star clusters and the \gaia\ ``benchmark'' stars, to calibrate stellar abundances from large-scale spectroscopic surveys.

astro-ph.SR↗

Generalized Deterministic-Random Tradeoff in Integrated Sensing and Communications: The Sensing-Optimal Operating Point

Integrated sensing and communications (ISAC) has been recognized as a key component in the envisioned 6G communication systems. Understanding the fundamental performance tradeoff between sensing and communication functionalities is essential for designing practical cost-efficient ISAC systems. In this paper, we aim for augmenting the current understanding of the deterministic-random tradeoff (DRT) between sensing and communication, by analyzing the sensing-optimal operating point of the fundamental capacity-distortion region. We show that the DRT exists for generic sensing performance metrics that are in general not convex/concave in the ISAC waveform. Especially, we elaborate on a representative non-convex performance metric, namely the detection probability for target detection tasks.

cs.IT↗

Rethinking Dense Cells for Integrated Sensing and Communications: A Stochastic Geometric View

The inclusion of the sensing functionality in the coming generations of cellular networks necessitates a rethink of dense cell deployments. In this paper, we analyze and optimize dense cell topologies for dual-functional radar-communication (DFRC) cellular networks. With the aid of tools from stochastic geometry, we derive new analytical expressions of the potential area spectral efficiencies in (bit/sec/m2) of radar and communication systems. Based on the new formulations of the potential area spectral efficiencies, the energy efficiency (bit/Joule) of DFRC systems is provided in a closed-form formula. Then, an optimization problem to obtain the optimal base station (BS) density that maximizes the network-level energy efficiency is formulated and investigated. In this regard, the mathematical expression of the energy efficiency is shown to be a uni-modal and pseudo-concave function in the density of the BSs. Therefore, the optimal density of the BSs that maximizes the energy efficiency can be obtained. Our analytical and numerical results demonstrate that the inclusion of the sensing functionality clearly differentiates the optimal BS topologies for the DFRC systems against classical communication-only systems.

cs.IT↗

Semantic-Guided Feature Distillation for Multimodal Recommendation

Multimodal recommendation exploits the rich multimodal information associated with users or items to enhance the representation learning for better performance. In these methods, end-to-end feature extractors (e.g., shallow/deep neural networks) are often adopted to tailor the generic multimodal features that are extracted from raw data by pre-trained models for recommendation. However, compact extractors, such as shallow neural networks, may find it challenging to extract effective information from complex and high-dimensional generic modality features. Conversely, DNN-based extractors may encounter the data sparsity problem in recommendation. To address this problem, we propose a novel model-agnostic approach called Semantic-guided Feature Distillation (SGFD), which employs a teacher-student framework to extract feature for multimodal recommendation. The teacher model first extracts rich modality features from the generic modality feature by considering both the semantic information of items and the complementary information of multiple modalities. SGFD then utilizes response-based and feature-based distillation loss to effectively transfer the knowledge encoded in the teacher model to the student model. To evaluate the effectiveness of our SGFD, we integrate SGFD into three backbone multimodal recommendation models. Extensive experiments on three public real-world datasets demonstrate that SGFD-enhanced models can achieve substantial improvement over their counterparts.

cs.IR↗

Successive Pose Estimation and Beam Tracking for mmWave Vehicular Communication Systems

The millimeter wave (mmWave) radar sensing-aided communications in vehicular mobile communication systems is investigated. To alleviate the beam training overhead under high mobility scenarios, a successive pose estimation and beam tracking (SPEBT) scheme is proposed to facilitate mmWave communications with the assistance of mmWave radar sensing. The proposed SPEBT scheme first resorts to a Fast Conservative Filtering for Efficient and Accurate Radar odometry (Fast-CFEAR) approach to estimate the vehicle pose consisting of 2-dimensional position and yaw from radar point clouds collected by mmWave radar sensor. Then, the pose estimation information is fed into an extend Kalman filter to perform beam tracking for the line-of-sight channel. Owing to the intrinsic robustness of mmWave radar sensing, the proposed SPEBT scheme is capable of operating reliably under extreme weather/illumination conditions and large-scale global navigation satellite systems (GNSS)-denied environments. The practical deployment of the SPEBT scheme is verified through rigorous testing on a real-world sensing dataset. Simulation results demonstrate that the proposed SPEBT scheme is capable of providing precise pose estimation information and accurate beam tracking output, while reducing the proportion of beam training overhead to less than 5% averagely.

eess.SP↗

Optimizing Long-term Value for Auction-Based Recommender Systems via On-Policy Reinforcement Learning

Auction-based recommender systems are prevalent in online advertising platforms, but they are typically optimized to allocate recommendation slots based on immediate expected return metrics, neglecting the downstream effects of recommendations on user behavior. In this study, we employ reinforcement learning to optimize for long-term return metrics in an auction-based recommender system. Utilizing temporal difference learning, a fundamental reinforcement learning algorithm, we implement an one-step policy improvement approach that biases the system towards recommendations with higher long-term user engagement metrics. This optimizes value over long horizons while maintaining compatibility with the auction framework. Our approach is grounded in dynamic programming ideas which show that our method provably improves upon the existing auction-based base policy. Through an online A/B test conducted on an auction-based recommender system which handles billions of impressions and users daily, we empirically establish that our proposed method outperforms the current production system in terms of long-term user engagement metrics.

cs.IR↗

Symbol-Level Precoding for MU-MIMO System with RIRC Receiver

Consider a multiuser multiple-input multiple-output (MU-MIMO) downlink system in which the base station (BS) sends multiple data streams to multi-antenna users via symbol-level precoding (SLP), where the optimization of receive combining matrix becomes crucial, unlike in the single-antenna user scenario. We begin by introducing a joint optimization problem on the symbol-level transmit precoder and receive combiner. The problem is solved using the alternating optimization (AO) method, and the optimal solution structures for transmit precoding and receive combining matrices are derived by using Lagrangian and Karush-Kuhn-Tucker (KKT) conditions, based on which, the original problem is transformed into an equivalent quadratic programming problem, enabling more efficient solutions. To address the challenge that the above joint design is difficult to implement, we propose a more practical scheme where the receive combining optimization is replaced by the interference rejection combiner (IRC), which is however difficult to directly use because of the rank-one transmit precoding matrix. Therefore, we introduce a new regularized IRC (RIRC) receiver to circumvent the above issue. Numerical results demonstrate that the practical SLP-RIRC method enjoys only a slight communication performance loss compared to the joint transmit precoding and receive combining design, both offering substantial performance gains over the conventional BD-based approaches.

eess.SP↗

Landslide Surface Displacement Prediction Based on VSXC-LSTM Algorithm

Landslide is a natural disaster that can easily threaten local ecology, people's lives and property. In this paper, we conduct modelling research on real unidirectional surface displacement data of recent landslides in the research area and propose a time series prediction framework named VMD-SegSigmoid-XGBoost-ClusterLSTM (VSXC-LSTM) based on variational mode decomposition, which can predict the landslide surface displacement more accurately. The model performs well on the test set. Except for the random item subsequence that is hard to fit, the root mean square error (RMSE) and the mean absolute percentage error (MAPE) of the trend item subsequence and the periodic item subsequence are both less than 0.1, and the RMSE is as low as 0.006 for the periodic item prediction module based on XGBoost\footnote{Accepted in ICANN2023}.

cs.LG↗

Waveform Design for Communication-Assisted Sensing in 6G Perceptive Networks

The integrated sensing and communication (ISAC) technique has the potential to achieve coordination gain by exploiting the mutual assistance between sensing and communication (S&C) functions. While the sensing-assisted communications (SAC) technology has been extensively studied for high-mobility scenarios, the communication-assisted sensing (CAS) counterpart remains widely unexplored. This paper presents a waveform design framework for CAS in 6G perceptive networks, aiming to attain an optimal sensing quality of service (QoS) at the user after the target's parameters successively ``pass-through'' the S$\&$C channels. In particular, a pair of transmission schemes, namely, separated S&C and dual-functional waveform designs, are proposed to optimize the sensing QoS under the constraints of the rate-distortion and power budget. The first scheme reveals a power allocation trade-off, while the latter presents a water-filling trade-off. Numerical results demonstrate the effectiveness of the proposed algorithms, where the dual-functional scheme exhibits approximately 25% performance gain compared to its separated waveform design counterpart.

eess.SP↗

Cascading Residual Graph Convolutional Network for Multi-Behavior Recommendation

Multi-behavior recommendation exploits multiple types of user-item interactions to alleviate the data sparsity problem faced by the traditional models that often utilize only one type of interaction for recommendation. In real scenarios, users often take a sequence of actions to interact with an item, in order to get more information about the item and thus accurately evaluate whether an item fits personal preference. Those interaction behaviors often obey a certain order, and different behaviors reveal different information or aspects of user preferences towards the target item. Most existing multi-behavior recommendation methods take the strategy to first extract information from different behaviors separately and then fuse them for final prediction. However, they have not exploited the connections between different behaviors to learn user preferences. Besides, they often introduce complex model structures and more parameters to model multiple behaviors, largely increasing the space and time complexity. In this work, we propose a lightweight multi-behavior recommendation model named Cascading Residual Graph Convolutional Network (CRGCN for short), which can explicitly exploit the connections between different behaviors into the embedding learning process without introducing any additional parameters. In particular, we design a cascading residual graph convolutional network structure, which enables our model to learn user preferences by continuously refining user embeddings across different types of behaviors. The multi-task learning method is adopted to jointly optimize our model based on different behaviors. Extensive experimental results on two real-world benchmark datasets show that CRGCN can substantially outperform state-of-the-art methods. Further studies also analyze the effects of leveraging multi-behaviors in different numbers and orders on the final performance.

cs.IR↗

$(q,t)$-deformed (skew) Hurwitz $τ$-functions

We follow the general recipe for constructing commutative families of $W$-operators, which provides Hurwitz-like expansions in symmetric functions (Macdonald polynomials), in order to obtain a difference operator example that gives rise to a $(q,t)$-deformation of the earlier studied models. As before, a key role is played by an appropriate deformation of the cut-and-join rotation operator. We outline its expression both in terms of generators of the quantum toroidal algebra and in terms of the Macdonald difference operators.

hep-th↗

Specific Beamforming for Multi-UAV Networks: A Dual Identity-based ISAC Approach

Beam alignment is essential to compensate for the high path loss in the millimeter-wave (mmWave) Unmanned Aerial Vehicle (UAV) network. The integrated sensing and communication (ISAC) technology has been envisioned as a promising solution to enable efficient beam alignment in the dynamic UAV network. However, since the digital identity (D-ID) is not contained in the reflected echoes, the conventional ISAC solution has to either periodically feed back the D-ID to distinguish beams for multi-UAVs or suffer the beam errors induced by the separation of D-ID and physical identity (P-ID). This paper presents a novel dual identity association (DIA)-based ISAC approach, the first solution that enables specific, fast, and accurate beamforming towards multiple UAVs. In particular, the P-IDs extracted from echo signals are distinguished dynamically by calculating the feature similarity according to their prevalence, and thus the DIA is accurately achieved. We also present the extended Kalman filtering scheme to track and predict P-IDs, and the specific beam is thereby effectively aligned toward the intended UAVs in dynamic networks. Numerical results show that the proposed DIA-based ISAC solution significantly outperforms the conventional methods in association accuracy and communication performance.

eess.SP↗

Faster-Than-Nyquist Symbol-Level Precoding for Wideband Integrated Sensing and Communications

In this paper, we present an innovative symbol-level precoding (SLP) approach for a wideband multi-user multi-input multi-output (MU-MIMO) downlink Integrated Sensing and Communications (ISAC) system employing faster-than-Nyquist (FTN) signaling. Our proposed technique minimizes the minimum mean squared error (MMSE) for the sensed parameter estimation while ensuring the communication per-user quality-of-service through the utilization of constructive interference (CI) methodologies. While the formulated problem is non-convex in general, we tackle this issue using proficient minorization and successive convex approximation (SCA) strategies. Numerical results substantiate that our FTN-ISAC-SLP framework significantly enhances communication throughput while preserving satisfactory sensing performance.

eess.SP↗

Robust Spatiotemporal Traffic Forecasting with Reinforced Dynamic Adversarial Training

Machine learning-based forecasting models are commonly used in Intelligent Transportation Systems (ITS) to predict traffic patterns and provide city-wide services. However, most of the existing models are susceptible to adversarial attacks, which can lead to inaccurate predictions and negative consequences such as congestion and delays. Therefore, improving the adversarial robustness of these models is crucial for ITS. In this paper, we propose a novel framework for incorporating adversarial training into spatiotemporal traffic forecasting tasks. We demonstrate that traditional adversarial training methods designated for static domains cannot be directly applied to traffic forecasting tasks, as they fail to effectively defend against dynamic adversarial attacks. Then, we propose a reinforcement learning-based method to learn the optimal node selection strategy for adversarial examples, which simultaneously strengthens the dynamic attack defense capability and reduces the model overfitting. Additionally, we introduce a self-knowledge distillation regularization module to overcome the "forgetting issue" caused by continuously changing adversarial nodes during training. We evaluate our approach on two real-world traffic datasets and demonstrate its superiority over other baselines. Our method effectively enhances the adversarial robustness of spatiotemporal traffic forecasting models. The source code for our framework is available at https://github.com/usail-hkust/RDAT.

cs.LG↗

Radar Sensing via OTFS Signaling: A Delay Doppler Signal Processing Perspective

The recently proposed orthogonal time frequency space (OTFS) modulation multiplexes data symbols in the delay-Doppler (DD) domain. Since the range and velocity, which can be derived from the delay and Doppler shifts, are the parameters of interest for radar sensing, it is natural to consider implementing DD signal processing for radar sensing. In this paper, we investigate the potential connections between the OTFS and DD domain radar signal processing. Our analysis shows that the range-Doppler matrix computing process in radar sensing is exactly the demodulation of OTFS with a rectangular pulse shaping filter. Furthermore, we propose a two-dimensional (2D) correlation-based algorithm to estimate the fractional delay and Doppler parameters for radar sensing. Simulation results show that the proposed algorithm can efficiently obtain the delay and Doppler shifts associated with multiple targets.

eess.SP↗

Bkd-FedGNN: A Benchmark for Classification Backdoor Attacks on Federated Graph Neural Network

Federated Graph Neural Network (FedGNN) has recently emerged as a rapidly growing research topic, as it integrates the strengths of graph neural networks and federated learning to enable advanced machine learning applications without direct access to sensitive data. Despite its advantages, the distributed nature of FedGNN introduces additional vulnerabilities, particularly backdoor attacks stemming from malicious participants. Although graph backdoor attacks have been explored, the compounded complexity introduced by the combination of GNNs and federated learning has hindered a comprehensive understanding of these attacks, as existing research lacks extensive benchmark coverage and in-depth analysis of critical factors. To address these limitations, we propose Bkd-FedGNN, a benchmark for backdoor attacks on FedGNN. Specifically, Bkd-FedGNN decomposes the graph backdoor attack into trigger generation and injection steps, and extending the attack to the node-level federated setting, resulting in a unified framework that covers both node-level and graph-level classification tasks. Moreover, we thoroughly investigate the impact of multiple critical factors in backdoor attacks on FedGNN. These factors are categorized into global-level and local-level factors, including data distribution, the number of malicious attackers, attack time, overlapping rate, trigger size, trigger type, trigger position, and poisoning rate. Finally, we conduct comprehensive evaluations on 13 benchmark datasets and 13 critical factors, comprising 1,725 experimental configurations for node-level and graph-level tasks from six domains. These experiments encompass over 8,000 individual tests, allowing us to provide a thorough evaluation and insightful observations that advance our understanding of backdoor attacks on FedGNN.The Bkd-FedGNN benchmark is publicly available at https://github.com/usail-hkust/BkdFedGCN.

cs.LG↗