Searcharxiv⌕ Search

arXiv subjects

Rui Zhang

Publications and source records attributed to Rui Zhang.

At least 451 records · Page 25Linked to original sources

A Systematic Survey on Federated Sequential Recommendation

Sequential recommendation is an advanced recommendation technique that utilizes the sequence of user behaviors to generate personalized suggestions by modeling the temporal dependencies and patterns in user preferences. However, it requires a server to centrally collect users' data, which poses a threat to the data privacy of different users. In recent years, federated learning has emerged as a distributed architecture that allows participants to train a global model while keeping their private data locally. This survey pioneers Federated Sequential Recommendation (FedSR), where each user joins as a participant in federated training to achieve a recommendation service that balances data privacy and model performance. We begin with an introduction to the background and unique challenges of FedSR. Then, we review existing solutions from two levels, each of which includes two specific techniques. Additionally, we discuss the critical challenges and future research directions in FedSR.

cs.IR↗

Power-Measurement-Based Channel Autocorrelation Estimation for IRS-Assisted Wideband Communications

Channel state information (CSI) is essential to the performance optimization of intelligent reflecting surface (IRS)-aided wireless communication systems. However, the passive and frequency-flat reflection of IRS, as well as the high-dimensional IRS-reflected channels, have posed practical challenges for efficient IRS channel estimation, especially in wideband communication systems with significant multi-path channel delay spread. To tackle the above challenge, we propose a novel neural network (NN)-empowered IRS channel estimation and passive reflection design framework for the wideband orthogonal frequency division multiplexing (OFDM) communication system based only on the user's reference signal received power (RSRP) measurements with time-varying random IRS training reflections. In particular, we show that the average received signal power over all OFDM subcarriers at the user terminal can be represented as the prediction of a single-layer NN composed of multiple subnetworks with the same structure, such that the autocorrelation matrix of the wideband IRS channel can be recovered as their weights via supervised learning. To exploit the potential sparsity of the channel autocorrelation matrix, a progressive training method is proposed by gradually increasing the number of subnetworks until a desired accuracy is achieved, thus reducing the training complexity. Based on the estimates of IRS channel autocorrelation matrix, the IRS passive reflection is then optimized to maximize the average channel power gain over all subcarriers. Numerical results indicate the effectiveness of the proposed IRS channel autocorrelation matrix estimation and passive reflection design under wideband channels, which can achieve significant performance improvement compared to the existing IRS reflection designs based on user power measurements.

cs.IT↗

Phase diagram of solution of oppositely charged polyelectrolytes

We study a solution of long polyanions (PA) with shorter polycations (PC) and focus on the role of Coulomb interaction. A good example is solutions of DNA and PC which are widely studied for gene therapy. In the solution, each PA attracts many PCs to form a complex. When the ratio of total charges of PA and PC in the solution, $x$, equals to 1, complexes are neutral and they condense in a macroscopic drop. When $x$ is far away from 1, complexes are strongly charged. The Coulomb repulsion is large and free complexes are stable. As $x$ approaches to 1, PCs attached to PA disproportionate themselves in two competing ways. One way is inter-complex disproportionation, in which PCs make some complexes neutral and therefore condensed in a macroscopic drop while other complexes become even stronger charged and stay free. The other way is intra-complex disproportionation, in which PCs make one end of a complex neutral and condensed in a small droplet while the rest of the complex forms a strongly charged tail. Thus each complex becomes a "tadpole". These two ways can also combine together to give even lower free energy. We get a phase diagram of PA-PC solution in a plane of $x$ and inverse screening radius of the monovalent salt, which includes phases or phase coexistence with both kinds of disproportionation.

cond-mat.soft↗

DiffZOO: A Purely Query-Based Black-Box Attack for Red-teaming Text-to-Image Generative Model via Zeroth Order Optimization

Current text-to-image (T2I) synthesis diffusion models raise misuse concerns, particularly in creating prohibited or not-safe-for-work (NSFW) images. To address this, various safety mechanisms and red teaming attack methods are proposed to enhance or expose the T2I model's capability to generate unsuitable content. However, many red teaming attack methods assume knowledge of the text encoders, limiting their practical usage. In this work, we rethink the case of \textit{purely black-box} attacks without prior knowledge of the T2l model. To overcome the unavailability of gradients and the inability to optimize attacks within a discrete prompt space, we propose DiffZOO which applies Zeroth Order Optimization to procure gradient approximations and harnesses both C-PRV and D-PRV to enhance attack prompts within the discrete prompt domain. We evaluated our method across multiple safety mechanisms of the T2I diffusion model and online servers. Experiments on multiple state-of-the-art safety mechanisms show that DiffZOO attains an 8.5% higher average attack success rate than previous works, hence its promise as a practical red teaming tool for T2l models.

cs.CR↗

Learning to Compress Contexts for Efficient Knowledge-based Visual Question Answering

Multimodal large language models (MLLMs) have demonstrated great performance on visual question answering (VQA). When it comes to knowledge-based Visual Question Answering (KB-VQA), MLLMs may lack the specialized domain knowledge needed to answer questions, necessitating the retrieval of necessary information from external knowledge sources. Previous works like Retrival-Augmented VQA-v2 (RAVQA-v2) focus on utilizing as much input information, such as image-based textual descriptions and retrieved knowledge, as possible to improve performance, but they all overlook the issue that with the number of input tokens increasing, inference efficiency significantly decreases, which contradicts the demands of practical applications. To address this issue, we propose \textbf{R}etrieval-\textbf{A}ugmented MLLMs with Compressed Contexts (RACC). RACC learns to compress and aggregate retrieved knowledge for a given image-question pair, generating a compact modulation in the form of Key-Value (KV) cache to adapt the downstream frozen MLLM, thereby achieving effective and efficient inference. RACC achieves a state-of-the-art (SOTA) performance of 63.92\% on OK-VQA. Moreover, it significantly reduces inference latency by 22.0\%-59.7\% compared to the prominent RAVQA-v2. Abundant experiments show RACC's broad applicability. It is compatible with various off-the-shelf MLLMs and can also handle different knowledge sources including textual and multimodal documents.

cs.CV↗

Continually Evolved Multimodal Foundation Models for Cancer Prognosis

Cancer prognosis is a critical task that involves predicting patient outcomes and survival rates. To enhance prediction accuracy, previous studies have integrated diverse data modalities, such as clinical notes, medical images, and genomic data, leveraging their complementary information. However, existing approaches face two major limitations. First, they struggle to incorporate newly arrived data with varying distributions into training, such as patient records from different hospitals, thus rendering sub-optimal generalizability and limited utility in real-world applications. Second, most multimodal integration methods rely on simplistic concatenation or task-specific pipelines, which fail to capture the complex interdependencies across modalities. To address these, we propose a continually evolving multi-modal foundation model. Extensive experiments on the TCGA dataset demonstrate the effectiveness of our approach, highlighting its potential to advance cancer prognosis by enabling robust and adaptive multimodal integration.

cs.LG↗

HHH Whitepaper

We here report on the progress of the HHH Workshop, that took place in Dubrovnik in July 2023. After the discovery of a particle that complies with the properties of the Higgs boson of the Standard Model, all Standard Model (SM) parameters are in principle determined. However, in order to verify or falsify the model, the full form of the potential has to be determined. This includes the measurement of the triple and quartic scalar couplings. We here report on ongoing progress of measurements for multi-scalar final states, with an emphasis on three SM-like scalar bosons at 125 GeV, but also mentioning other options. We discuss both experimental progress and challenges as well as theoretical studies and models that can enhance such rates with respect to the SM predictions

hep-ph↗

AGON: Automated Design Framework for Customizing Processors from ISA Documents

Customized processors are attractive solutions for vast domain-specific applications due to their high energy efficiency. However, designing a processor in traditional flows is time-consuming and expensive. To address this, researchers have explored methods including the use of agile development tools like Chisel or SpinalHDL, high-level synthesis (HLS) from programming languages like C or SystemC, and more recently, leveraging large language models (LLMs) to generate hardware description language (HDL) code from natural language descriptions. However, each method has limitations in terms of expressiveness, correctness, and performance, leading to a persistent contradiction between the level of automation and the effectiveness of the design. Overall, how to automatically design highly efficient and practical processors with minimal human effort remains a challenge. In this paper, we propose AGON, a novel framework designed to leverage LLMs for the efficient design of out-of-order (OoO) customized processors with minimal human effort. Central to AGON is the nano-operator function (nOP function) based Intermediate Representation (IR), which bridges high-level descriptions and hardware implementations while decoupling functionality from performance optimization, thereby providing an automatic design framework that is expressive and efficient, has correctness guarantees, and enables PPA (Power, Performance, and Area) optimization. Experimental results show that superior to previous LLM-assisted automatic design flows, AGON facilitates designing a series of customized OoO processors that achieve on average 2.35 $\times$ speedup compared with BOOM, a general-purpose CPU designed by experts, with minimal design effort.

cs.AR↗

Movable Antenna Enhanced Integrated Sensing and Communication Via Antenna Position Optimization

In this paper, we propose an integrated sensing and communication (ISAC) system aided by the movable-antenna (MA) array, which can improve the communication and sensing performance via flexible antenna movement over conventional fixed-position antenna (FPA) array. First, we consider the downlink multiuser communication, where each user is randomly distributed within a given three-dimensional zone with local movement. To reduce the overhead of frequent antenna movement, the antenna position vector (APV) is designed based on users' statistical channel state information (CSI), so that the antennas only need to be moved in a large timescale. Then, for target sensing, the Cramer-Rao bounds (CRBs) of the estimation mean square error for different spatial angles of arrival (AoAs) are derived as functions of MAs' positions. Based on the above, we formulate an optimization problem to maximize the expected minimum achievable rate among all communication users, with given constraints on the maximum acceptable CRB thresholds for target sensing. An alternating optimization algorithm is proposed to iteratively optimize one of the horizontal and vertical APVs of the MA array with the other being fixed. Numerical results demonstrate that our proposed MA arrays can significantly enlarge the trade-off region between communication and sensing performance compared to conventional FPA arrays with different inter-antenna spacing. It is also revealed that the steering vectors of the designed MA arrays exhibit low correlation in the angular domain, thus effectively reducing channel correlation among communication users to enhance their achievable rates, while alleviating ambiguity in target angle estimation to achieve improved sensing accuracy.

cs.IT↗

From Lazy to Prolific: Tackling Missing Labels in Open Vocabulary Extreme Classification by Positive-Unlabeled Sequence Learning

Open-vocabulary Extreme Multi-label Classification (OXMC) extends traditional XMC by allowing prediction beyond an extremely large, predefined label set (typically $10^3$ to $10^{12}$ labels), addressing the dynamic nature of real-world labeling tasks. However, self-selection bias in data annotation leads to significant missing labels in both training and test data, particularly for less popular inputs. This creates two critical challenges: generation models learn to be "lazy'" by under-generating labels, and evaluation becomes unreliable due to insufficient annotation in the test set. In this work, we introduce Positive-Unlabeled Sequence Learning (PUSL), which reframes OXMC as an infinite keyphrase generation task, addressing the generation model's laziness. Additionally, we propose to adopt a suite of evaluation metrics, F1@$\mathcal{O}$ and newly proposed B@$k$, to reliably assess OXMC models with incomplete ground truths. In a highly imbalanced e-commerce dataset with substantial missing labels, PUSL generates 30% more unique labels, and 72% of its predictions align with actual user queries. On the less skewed EURLex-4.3k dataset, PUSL demonstrates superior F1 scores, especially as label counts increase from 15 to 30. Our approach effectively tackles both the modeling and evaluation challenges in OXMC with missing labels.

cs.IR↗

3DMambaIPF: A State Space Model for Iterative Point Cloud Filtering via Differentiable Rendering

Noise is an inevitable aspect of point cloud acquisition, necessitating filtering as a fundamental task within the realm of 3D vision. Existing learning-based filtering methods have shown promising capabilities on small-scale synthetic or real-world datasets. Nonetheless, the effectiveness of these methods is constrained when dealing with a substantial quantity of point clouds. This limitation primarily stems from their limited denoising capabilities for large-scale point clouds and their inclination to generate noisy outliers after denoising. The recent introduction of State Space Models (SSMs) for long sequence modeling in Natural Language Processing (NLP) presents a promising solution for handling large-scale data. Encouraged by iterative point cloud filtering methods, we introduce 3DMambaIPF, firstly incorporating Mamba (Selective SSM) architecture to sequentially handle extensive point clouds from large scenes, capitalizing on its strengths in selective input processing and long sequence modeling capabilities. Additionally, we integrate a robust and fast differentiable rendering loss to constrain the noisy points around the surface. In contrast to previous methodologies, this differentiable rendering loss enhances the visual realism of denoised geometric structures and aligns point cloud boundaries more closely with those observed in real-world objects. Extensive evaluation on datasets comprising small-scale synthetic and real-world models (typically with up to 50K points) demonstrate that our method achieves state-of-the-art results. Moreover, we showcase the superior scalability and efficiency of our method on large-scale models with about 500K points, where the majority of the existing learning-based denoising methods are unable to handle.

cs.MM↗

Watch Out for Your Guidance on Generation! Exploring Conditional Backdoor Attacks against Large Language Models

Mainstream backdoor attacks on large language models (LLMs) typically set a fixed trigger in the input instance and specific responses for triggered queries. However, the fixed trigger setting (e.g., unusual words) may be easily detected by human detection, limiting the effectiveness and practicality in real-world scenarios. To enhance the stealthiness of backdoor activation, we present a new poisoning paradigm against LLMs triggered by specifying generation conditions, which are commonly adopted strategies by users during model inference. The poisoned model performs normally for output under normal/other generation conditions, while becomes harmful for output under target generation conditions. To achieve this objective, we introduce BrieFool, an efficient attack framework. It leverages the characteristics of generation conditions by efficient instruction sampling and poisoning data generation, thereby influencing the behavior of LLMs under target conditions. Our attack can be generally divided into two types with different targets: Safety unalignment attack and Ability degradation attack. Our extensive experiments demonstrate that BrieFool is effective across safety domains and ability domains, achieving higher success rates than baseline methods, with 94.3 % on GPT-3.5-turbo

cs.CL↗

MAJL: A Model-Agnostic Joint Learning Framework for Music Source Separation and Pitch Estimation

Music source separation and pitch estimation are two vital tasks in music information retrieval. Typically, the input of pitch estimation is obtained from the output of music source separation. Therefore, existing methods have tried to perform these two tasks simultaneously, so as to leverage the mutually beneficial relationship between both tasks. However, these methods still face two critical challenges that limit the improvement of both tasks: the lack of labeled data and joint learning optimization. To address these challenges, we propose a Model-Agnostic Joint Learning (MAJL) framework for both tasks. MAJL is a generic framework and can use variant models for each task. It includes a two-stage training method and a dynamic weighting method named Dynamic Weights on Hard Samples (DWHS), which addresses the lack of labeled data and joint learning optimization, respectively. Experimental results on public music datasets show that MAJL outperforms state-of-the-art methods on both tasks, with significant improvements of 0.92 in Signal-to-Distortion Ratio (SDR) for music source separation and 2.71% in Raw Pitch Accuracy (RPA) for pitch estimation. Furthermore, comprehensive studies not only validate the effectiveness of each component of MAJL, but also indicate the great generality of MAJL in adapting to different model architectures.

cs.SD↗

Contribution of Unresolved Sources to Diffuse Gamma-Ray Emission from the Galactic Plane

The diffuse gamma-ray emission from the Milky Way serves as a crucial probe for understanding the propagation and interactions of cosmic rays within our galaxy. The Galactic diffuse gamma-ray emission between 10 TeV and 1 PeV has been recently measured by the square kilometer array (KM2A) of the Large High Altitude Air Shower Observatory (LHAASO). The flux is higher than predicted for cosmic rays interacting with the interstellar medium. In this work, we utilize a non-parametric method to derive the source count distribution using the published first LHAASO source catalog. Based on this distribution, we calculate the contribution of unresolved sources to the diffuse emission measured by KM2A. When comparing our results to the measured diffuse gamma-ray emission, we demonstrate that for the outer Galactic region, the contributions from unresolved sources and those predicted by models are roughly consistent with experimental observations within the uncertainty. However, for the inner Galactic region, additional components are required to account for the observed data.

astro-ph.HE↗

Channel Estimation for Movable-Antenna MIMO Systems Via Tensor Decomposition

In this letter, we investigate the channel estimation problem for MIMO wireless communication systems with movable antennas (MAs) at both the transmitter (Tx) and receiver (Rx). To achieve high channel estimation accuracy with low pilot training overhead, we propose a tensor decomposition-based method for estimating the parameters of multi-path channel components, including their azimuth and elevation angles, as well as complex gain coefficients, thereby reconstructing the wireless channel between any pair of Tx and Rx MA positions in the Tx and Rx regions. First, we introduce a two-stage Tx-Rx successive antenna movement pattern for pilot training, such that the received pilot signals in both stages can be expressed as a third-order tensor. Then, we obtain the factor matrices of the tensor via the canonical polyadic decomposition, and thereby estimate the angle/gain parameters for enabling the channel reconstruction between arbitrary Tx/Rx MA positions. In addition, we analyze the uniqueness condition of the tensor decomposition, which ensures the complete channel reconstruction between the whole Tx and Rx regions based on the channel measurements at only a finite number of Tx/Rx MA positions. Finally, simulation results are presented to evaluate the proposed tensor decomposition-based method as compared to existing methods, in terms of channel estimation accuracy and pilot overhead.

eess.SP↗

Movable Superdirective Pairs: A Phase Shifter-Free Approach to mmWave Communications

In this letter, we propose a novel Movable Superdirective Pairs (MSP) approach that combines movable antennas with superdirective pair arrays to enhance the performance of millimeter-wave (mmWave) communications on the user side. By controlling the rotation angles and positions of superdirective antenna pairs, the proposed MSP approach maximizes the received signal-to-noise ratio (SNR) of multipath signals without relying on phase shifters or attenuators. This approach addresses the limitations of traditional superdirective antennas, which are typically restricted to the endfire direction and suffer from reduced scanning bandwidth and increased complexity. An efficient algorithm based on alternating optimization and the gradient projection method is developed to solve the non-convex optimization problem of antennas' joint rotating positioning. Simulation results demonstrate that the MSP approach achieves significant performance gains over fixed-position array (FPA) employing Maximum Ratio Combining (MRC), while reducing system complexity and hardware costs.

cs.IT↗

Attributed Graph Clustering in Collaborative Settings

Graph clustering is an unsupervised machine learning method that partitions the nodes in a graph into different groups. Despite achieving significant progress in exploiting both attributed and structured data information, graph clustering methods often face practical challenges related to data isolation. Moreover, the absence of collaborative methods for graph clustering limits their effectiveness. In this paper, we propose a collaborative graph clustering framework for attributed graphs, supporting attributed graph clustering over vertically partitioned data with different participants holding distinct features of the same data. Our method leverages a novel technique that reduces the sample space, improving the efficiency of the attributed graph clustering method. Furthermore, we compare our method to its centralized counterpart under a proximity condition, demonstrating that the successful local results of each participant contribute to the overall success of the collaboration. We fully implement our approach and evaluate its utility and efficiency by conducting experiments on four public datasets. The results demonstrate that our method achieves comparable accuracy levels to centralized attributed graph clustering methods. Our collaborative graph clustering framework provides an efficient and effective solution for graph clustering challenges related to data isolation.

cs.LG↗

An Overview of Cellular ISAC for Low-Altitude UAV: New Opportunities and Challenges

Low-altitude unmanned aerial vehicles (UAVs) are expected to play an important role in future wireless networks, either as aerial base stations (BSs) or aerial users connected to the cellular network. In addition, integrated sensing and communication (ISAC) has been identified as one of the six usage scenarios for the forthcoming sixth-generation (6G) mobile networks, aimed at improving network functionalities and realizing situational awareness of the physical world. While most existing research efforts focus on terrestrial two-dimensional (2D) communication and sensing, UAV as an aerial platform offers a new degree of freedom for designing three-dimensional (3D) air-ground (AG) ISAC networks. In this article, we provide an overview of cellular-connected UAV ISAC, by elaborating the UAV's roles as a target to be sensed and as an aerial anchor to provide sensing functionality, respectively. In particular, we pay attention to the network coverage issue and topics specific to UAV networking, emphasizing the new opportunities as well as unique challenges to be addressed.

cs.IT↗