arXiv subjects

Rui Zhang

Publications and source records attributed to Rui Zhang.

At least 289 records · Page 16Linked to original sources

arXiv2025

QiMeng-NeuComBack: Self-Evolving Translation from IR to Assembly Code

Compilers, while essential, are notoriously complex systems that demand prohibitively expensive human expertise to develop and maintain. The recent advancements in Large Language Models (LLMs) offer a compelling new paradigm: Neural Compilation, which could potentially simplify compiler development for new architectures and facilitate the discovery of innovative optimization techniques. However, several critical obstacles impede its practical adoption. Firstly, a significant lack of dedicated benchmarks and robust evaluation methodologies hinders objective assessment and tracking of progress in the field. Secondly, systematically enhancing the reliability and performance of LLM-generated assembly remains a critical challenge. Addressing these challenges, this paper introduces NeuComBack, a novel benchmark dataset specifically designed for IR-to-assembly compilation. Leveraging this dataset, we first define a foundational Neural Compilation workflow and conduct a comprehensive evaluation of the capabilities of recent frontier LLMs on Neural Compilation, establishing new performance baselines. We further propose a self-evolving prompt optimization method that enables LLMs to iteratively evolve their internal prompt strategies by extracting insights from prior self-debugging traces, thereby enhancing their neural compilation capabilities. Experiments demonstrate that our method significantly improves both the functional correctness and the performance of LLM-generated assembly code. Compared to baseline prompts, the functional correctness rates improved from 44% to 64% on x86_64 and from 36% to 58% on aarch64, respectively. More significantly, among the 16 correctly generated x86_64 programs using our method, 14 (87.5%) surpassed clang-O3 performance.

cs.AI↗

arXiv2025

UNGER: Generative Recommendation with A Unified Code via Semantic and Collaborative Integration

With the rise of generative paradigms, generative recommendation has garnered increasing attention. The core component is the item code, generally derived by quantizing collaborative or semantic representations to serve as candidate items identifiers in the context. However, existing methods typically construct separate codes for each modality, leading to higher computational and storage costs and hindering the integration of their complementary strengths. Considering this limitation, we seek to integrate two different modalities into a unified code, fully unleashing the potential of complementary nature among modalities. Nevertheless, the integration remains challenging: the integrated embedding obtained by the common concatenation method would lead to underutilization of collaborative knowledge, thereby resulting in limited effectiveness. To address this, we propose a novel method, named UNGER, which integrates semantic and collaborative knowledge into a unified code for generative recommendation. Specifically, we propose to adaptively learn an integrated embedding through the joint optimization of cross-modality knowledge alignment and next item prediction tasks. Subsequently, to mitigate the information loss caused by the quantization process, we introduce an intra-modality knowledge distillation task, using the integrated embeddings as supervised signals to compensate. Extensive experiments on three widely used benchmarks demonstrate the superiority of our approach compared to existing methods.

cs.IR↗

arXiv2025

Experimental Quantum Channel Purification

Quantum networks, which integrate multiple quantum computers and the channels connecting them, are crucial for distributed quantum information processing but remain inherently susceptible to channel noise. Channel purification emerges as a promising technique for suppressing noise in quantum channels without complex encoding and decoding operations, making it particularly suitable for remote quantum information transmission in optical systems. In this work, we introduce an experimental setup for efficient channel purification, harnessing the spatial and polarization properties of photons. Our design employs two Fredkin gates to enable coherent interference between independent noise channels, achieving effective noise suppression across a wide range of noise levels and types. Through application to entanglement distribution, our protocol demonstrates a superior capability to preserve entanglement against channel noise compared to conventional entanglement purification methods.

quant-ph↗

arXiv2025

6D Channel Knowledge Map Construction via Bidirectional Wireless Gaussian Splatting

This paper investigates the construction of channel knowledge map (CKM) from sparse channel measurements. Dif ferent from conventional two-/three-dimensional (2D/3D) CKM approaches assuming fixed base station configurations, we present a six-dimensional (6D) CKM framework named bidirectional wireless Gaussian splatting (BiWGS), which is capable of mod eling wireless channels across dynamic transmitter (Tx) and receiver (Rx) positions in 3D space. BiWGS uses Gaussian el lipsoids to represent virtual scatterer clusters and environmental obstacles in the wireless environment. By properly learning the bidirectional scattering patterns and complex attenuation profiles based on channel measurements, these ellipsoids inherently cap ture the electromagnetic transmission characteristics of wireless environments, thereby accurately modeling signal transmission under varying transceiver configurations. Experiment results show that BiWGS significantly outperforms classic multi-layer perception (MLP) for the construction of 6D channel power gain map with varying Tx-Rx positions, and achieves spatial spectrum prediction accuracy comparable to the state-of-the art wireless radiation field Gaussian splatting (WRF-GS) for 3D CKM construction. This validates the capability of the proposed BiWGS in accomplishing dimensional expansion of 6D CKM construction, without compromising fidelity.

eess.SP↗

arXiv2025

Accumulative SGD Influence Estimation for Data Attribution

Modern data-centric AI needs precise per-sample influence. Standard SGD-IE approximates leave-one-out effects by summing per-epoch surrogates and ignores cross-epoch compounding, which misranks critical examples. We propose ACC-SGD-IE, a trajectory-aware estimator that propagates the leave-one-out perturbation across training and updates an accumulative influence state at each step. In smooth strongly convex settings it achieves geometric error contraction and, in smooth non-convex regimes, it tightens error bounds; larger mini-batches further reduce constants. Empirically, on Adult, 20 Newsgroups, and MNIST under clean and corrupted data and both convex and non-convex training, ACC-SGD-IE yields more accurate influence estimates, especially over long epochs. For downstream data cleansing it more reliably flags noisy samples, producing models trained on ACC-SGD-IE cleaned data that outperform those cleaned with SGD-IE.

cs.LG↗

arXiv2025

Entanglement Superactivation in Multiphoton Distillation Networks

In quantum networks, after passing through noisy channels or information processing, residual states may lack sufficient entanglement for further tasks, yet they may retain hidden quantum resources that can be recycled. Efficiently recycling these states to extract entanglement resources such as genuine multipartite entanglement or Einstein-Podolsky-Rosen pairs is essential for optimizing network performance. Here, we develop a tripartite entanglement distillation scheme using an eight-photon quantum platform, demonstrating entanglement superactivation phenomena which are unique to multipartite systems. We successfully generate a three-photon genuinely entangled state from two bi-separable states via local operations and classical communication, demonstrating superactivation of genuine multipartite entanglement. Furthermore, we extend our scheme to generate a three-photon state capable of extracting an Einstein-Podolsky-Rosen pair from two initial states lacking this capability, revealing a previously unobserved entanglement superactivation phenomenon. Our methods and findings offer not only practical applications for quantum networks, but also lead to a deeper understanding of multipartite entanglement structures.

quant-ph↗

arXiv2025

A New Neural Network Paradigm for Scalable and Generalizable Stability Analysis of Power Systems

This paper presents a new neural network (NN) paradigm for scalable and generalizable stability analysis of power systems. The paradigm consists of two parts: the neural stability descriptor and the sample-augmented iterative training scheme. The first part, based on system decomposition, constructs the object (such as a stability function or condition) for stability analysis as a scalable aggregation of multiple NNs. These NNs remain fixed across varying power system structures and parameters, and are repeatedly shared within each system instance defined by these variations, thereby enabling the generalization of the neural stability descriptor across a class of power systems. The second part learns the neural stability descriptor by iteratively training the NNs with sample augmentation, guided by the tailored conservativeness-aware loss function. The training set is strategically constructed to promote the descriptor's generalizability, which is systematically evaluated by verification and validation during the training process. Specifically, the proposed NN paradigm is implemented for large-disturbance stability analysis of the bulk power grid and small-disturbance stability conditions of the microgrid system. Finally, numerical studies for the two implementations demonstrate the applicability and effectiveness of the proposed NN paradigm.

eess.SY↗

arXiv2025

Comments on "Non-local Nucleon Matrix Elements in the Rest Frame"

In a recent paper, "Non-local Nucleon Matrix Elements in the Rest Frame" (Phys. Rev. D 111, 5 (2025)), it was observed that the next-to-leading order calculations of the renormalization factor can describe, to a few percent accuracy, the logarithm of the lattice QCD rest frame matrix elements with separations up to distances of 0.6 fm on multiple lattice spacings. We argue that perturbative QCD breaks down at such a distance scale after resumming the associated large logarithms, while the ansatz used in the analysis there is not justified in perturbation theory. Besides, we explain the observation in Phys. Rev. D 111, 5 (2025) and demonstrate that the ansatz fails to describe the data for $z>0.3$ fm, showing an opposite trend. Finally, although Phys. Rev. D 111, 5 (2025) proposes multiplying the ansatz by a Gaussian correction model, which is shown to reduce the discrepancy with the data, this does not legitimize the use of perturbative QCD at such distance scales.

hep-lat↗

arXiv2025

Benchmarking GPT-5 for biomedical natural language processing

Biomedical literature and clinical narratives pose multifaceted challenges for natural language understanding, from precise entity extraction and document synthesis to multi-step diagnostic reasoning. This study extends a unified benchmark to evaluate GPT-5 and GPT-4o under zero-, one-, and five-shot prompting across five core biomedical NLP tasks: named entity recognition, relation extraction, multi-label document classification, summarization, and simplification, and nine expanded biomedical QA datasets covering factual knowledge, clinical reasoning, and multimodal visual understanding. Using standardized prompts, fixed decoding parameters, and consistent inference pipelines, we assessed model performance, latency, and token-normalized cost under official pricing. GPT-5 consistently outperformed GPT-4o, with the largest gains on reasoning-intensive datasets such as MedXpertQA and DiagnosisArena and stable improvements in multimodal QA. In core tasks, GPT-5 achieved better chemical NER and ChemProt scores but remained below domain-tuned baselines for disease NER and summarization. Despite producing longer outputs, GPT-5 showed comparable latency and 30 to 50 percent lower effective cost per correct prediction. Fine-grained analyses revealed improvements in diagnosis, treatment, and reasoning subtypes, whereas boundary-sensitive extraction and evidence-dense summarization remain challenging. Overall, GPT-5 approaches deployment-ready performance for biomedical QA while offering a favorable balance of accuracy, interpretability, and economic efficiency. The results support a tiered prompting strategy: direct prompting for large-scale or cost-sensitive applications, and chain-of-thought scaffolds for analytically complex or high-stakes scenarios, highlighting the continued need for hybrid solutions where precision and factual fidelity are critical.

cs.CL↗

arXiv2025

QiMeng-MuPa: Mutual-Supervised Learning for Sequential-to-Parallel Code Translation

The rise of GPU-based high-performance computing (HPC) has driven the widespread adoption of parallel programming models such as CUDA. Yet, the inherent complexity of parallel programming creates a demand for the automated sequential-to-parallel approaches. However, data scarcity poses a significant challenge for machine learning-based sequential-to-parallel code translation. Although recent back-translation methods show promise, they still fail to ensure functional equivalence in the translated code. In this paper, we propose \textbf{QiMeng-MuPa}, a novel \textbf{Mu}tual-Supervised Learning framework for Sequential-to-\textbf{Pa}rallel code translation, to address the functional equivalence issue. QiMeng-MuPa consists of two models, a Translator and a Tester. Through an iterative loop consisting of Co-verify and Co-evolve steps, the Translator and the Tester mutually generate data for each other and improve collectively. The Tester generates unit tests to verify and filter functionally equivalent translated code, thereby evolving the Translator, while the Translator generates translated code as augmented input to evolve the Tester. Experimental results demonstrate that QiMeng-MuPa significantly enhances the performance of the base models: when applied to Qwen2.5-Coder, it not only improves Pass@1 by up to 28.91% and boosts Tester performance by 68.90%, but also outperforms the previous state-of-the-art method CodeRosetta by 1.56 and 6.92 in BLEU and CodeBLEU scores, while achieving performance comparable to DeepSeek-R1 and GPT-4.1. Our code is available at https://github.com/kcxain/mupa.

cs.SE↗

arXiv2025

Evaluation of Quantum Offset in Velocity Imaging-Based Electron Spectrometry

Velocity-map imaging of electrons is a pivotal technique in chemical physics. A recent study reported a quantum offset as large as 0.2 cm-1 in velocity imaging-based electron spectrometry [Phys. Rev. Lett. 134, 043001 (2025)]. In this work, we assess the existence this offset through a combination of simulations and experiments. Our simulations reveal that the velocity imaging results reconstructed using the maximum entropy velocity Legendre reconstruction (MEVELER) method exhibit no such offset. Furthermore, experimental measurements of the electron affinity of oxygen conducted at various imaging voltages show no discernible offset attributable to the electric field in the photodetachment region. Therefore, we conclude that there is no evidence for the claimed quantum offset in properly analyzed velocity imaging-based electron spectrometry.

physics.atom-ph↗

arXiv2025

Movable and Reconfigurable Antennas for 6G: Unlocking Electromagnetic-Domain Design and Optimization

The growing demands of 6G mobile communication networks necessitate advanced antenna technologies. Movable antennas (MAs) and reconfigurable antennas (RAs) enable dynamic control over antenna's position, orientation, radiation, polarization, and frequency response, introducing rich electromagnetic-domain degrees of freedom for the design and performance enhancement of wireless systems. This article overviews their application scenarios, hardware architectures, and design methods. Field test and simulation results highlight their performance benefits over conventional fixed/non-reconfigurable antennas.

cs.IT↗

arXiv2025

Resource-Constrained Federated Continual Learning: What Does Matter?

Federated Continual Learning (FCL) aims to enable sequentially privacy-preserving model training on streams of incoming data that vary in edge devices by preserving previous knowledge while adapting to new data. Current FCL literature focuses on restricted data privacy and access to previously seen data while imposing no constraints on the training overhead. This is unreasonable for FCL applications in real-world scenarios, where edge devices are primarily constrained by resources such as storage, computational budget, and label rate. We revisit this problem with a large-scale benchmark and analyze the performance of state-of-the-art FCL approaches under different resource-constrained settings. Various typical FCL techniques and six datasets in two incremental learning scenarios (Class-IL and Domain-IL) are involved in our experiments. Through extensive experiments amounting to a total of over 1,000+ GPU hours, we find that, under limited resource-constrained settings, existing FCL approaches, with no exception, fail to achieve the expected performance. Our conclusions are consistent in the sensitivity analysis. This suggests that most existing FCL methods are particularly too resource-dependent for real-world deployment. Moreover, we study the performance of typical FCL techniques with resource constraints and shed light on future research directions in FCL.

cs.LG↗

arXiv2025

Throughput Maximization for Multiuser Communications with Flexible-Sector 6DMA

This paper presents a cost-effective and easily-deployable flexible-sector six-dimensional movable antenna (6DMA) architecture for future wireless communication networks, which enables flexible antenna configurations to match users' spatial distribution for capacity enhancement. Different from conventional sectorized base station (BS) with fixed-position antennas (FPAs), the flexible-sector 6DMA-enabled BS employs multiple directional sector antenna arrays that can flexibly move along a common circular track. By properly moving antennas across sectors and rotating all sector antenna arrays synchronously, the flexible-sector BS can adjust the coverage regions of all sectors with flexible antenna allocations over them. In particular, we consider the multiuser downlink communication employing the orthogonal multiple access (OMA) to serve users in each sector. Under this setup, we jointly optimize the sector rotation and the antenna allocation at the flexible-sector BS to maximize the average common throughput achievable for all users based on their spatial distribution. We solve this non-convex optimization problem by deriving closed-form solutions and thereby analyze the effect of users' spatial distribution on the achievable common throughput. It is shown that equal user distribution over sectors is optimal for maximizing the common throughput. Motivated by this result, we further develop a low-complexity suboptimal solution for the sector rotation that minimizes the variance of user numbers across sectors. Finally, we provide simulation results to verify our analytical results and validate the performance of our proposed solutions. It is demonstrated that the flexible-sector BS significantly improves the network throughput as compared to other benchmark schemes.

cs.IT↗

arXiv2025

Neural Beam Field for Spatial Beam RSRP Prediction

Accurately predicting beam-level reference signal received power (RSRP) is essential for beam management in dense multi-user wireless networks, yet challenging due to high measurement overhead and fast channel variations. This paper proposes Neural Beam Field (NBF), a hybrid neural-physical framework for efficient and interpretable spatial beam RSRP prediction. Central to our approach is the introduction of the Multi-path Conditional Power Profile (MCPP), a learnable physical intermediary representing the site-specific propagation environment. This approach decouples the environment from specific antenna/beam configurations, which helps the model learn site-specific multipath features and enhances its generalization capability. We adopt a decoupled ``blackbox-whitebox" design: a Transformer-based deep neural network (DNN) learns the MCPP from sparse user measurements and positions, while a physics-inspired module analytically infers beam RSRP statistics. To improve convergence and adaptivity, we further introduce a Pretrain-and-Calibrate (PaC) strategy that leverages ray-tracing priors for physics-grounded pretraining and then RSRP data for on-site calibration. Extensive simulation results demonstrate that NBF significantly outperforms conventional table-based channel knowledge maps (CKMs) and pure blackbox DNNs in prediction accuracy, training efficiency, and generalization, while maintaining a compact model size. The proposed framework offers a scalable and physically grounded solution for intelligent beam management in next-generation dense wireless networks.

cs.IT↗

arXiv2025

Rotatable Antenna-Enabled Spectrum Sharing in Cognitive Radio Systems

Non-fixed flexible antenna architectures, such as fluid antenna system (FAS), movable antenna (MA), and pinching antenna, have garnered significant interest in recent years. Among them, rotatable antenna (RA) technology has recently drawn significant attention in wireless systems owing to its unique ability to exploit additional spatial degrees-of-freedom (DoFs) by dynamically adjusting the three-dimensional (3D) boresight direction of each antenna. In this letter, we propose a new RA-assisted cognitive radio (CR) system designed to achieve efficient spectrum sharing while mitigating interference between primary and secondary communication links. Specifically, we formulate an optimization problem for the joint design of the transmit beamforming and the boresight directions of RAs at the secondary transmitter (ST), aimed at maximizing the received signal-to-interference-plus-noise ratio (SINR) at the secondary receiver (SR), while satisfying both interference constraint at the primary receiver (PR) and the maximum transmit power constraint at the ST. Although the formulated problem is challenging to solve due to its non-convexity and coupled variables, we develop an efficient algorithm by leveraging alternating optimization (AO) and successive convex approximation (SCA) techniques to acquire high-quality solutions. Numerical results demonstrate that the proposed RA-assisted system substantially outperforms conventional benchmark schemes in spectrum-sharing CR systems, validating RA's capability to simultaneously enhance the communication quality at the SR and mitigate interference at the PR.

eess.SP↗

arXiv2025

Large deviations and almost sure convergence for the extremes of branching Lévy processes

In this paper, we investigate the asymptotic behavior of supercritical branching Markov processes $\{\mathbb{X}_t, t \ge0\}$ whose spatial motions are Lévy processes with regularly varying tails. Recently, Ren et al. [Appl. Probab. 61 (2024)] studied the weak convergence of the extremes of $\{\mathbb{X}_t, t \ge0\}$. In this paper, we establish the large deviation of $\{\mathbb{X}_t, t \ge0\}$ as well as some almost sure convergence results of the maximum of $\mathbb{X}_t$.

math.PR↗

arXiv2025

MinerU2.5: A Decoupled Vision-Language Model for Efficient High-Resolution Document Parsing

We introduce MinerU2.5, a 1.2B-parameter document parsing vision-language model that achieves state-of-the-art recognition accuracy while maintaining exceptional computational efficiency. Our approach employs a coarse-to-fine, two-stage parsing strategy that decouples global layout analysis from local content recognition. In the first stage, the model performs efficient layout analysis on downsampled images to identify structural elements, circumventing the computational overhead of processing high-resolution inputs. In the second stage, guided by the global layout, it performs targeted content recognition on native-resolution crops extracted from the original image, preserving fine-grained details in dense text, complex formulas, and tables. To support this strategy, we developed a comprehensive data engine that generates diverse, large-scale training corpora for both pretraining and fine-tuning. Ultimately, MinerU2.5 demonstrates strong document parsing ability, achieving state-of-the-art performance on multiple benchmarks, surpassing both general-purpose and domain-specific models across various recognition tasks, while maintaining significantly lower computational overhead.

cs.CV↗