Search arXiv⌕ Search

arXiv subjects

Rui Zhang

Publications and source records attributed to Rui Zhang.

At least 127 records · Page 7Linked to original sources
arXiv2026

Performance Analysis for Heterogeneous Air-Ground ISAC in Coordinated Multipoint Networks

The emergence of the \textit{low-altitude economy} (LAE) calls for highly integrated and reliable wireless systems that can simultaneously support \textit{communication and sensing} (C\&S) functions. Although \textit{integrated sensing and communication} (ISAC) has been widely studied, most existing works focused on link-level or single-cell architectures in terrestrial environments, leaving the potential of network-level cooperative air-ground ISAC largely unexplored. To bridge this gap, a heterogeneous air-ground ISAC network architecture based on \textit{coordinated multipoint} (CoMP) is proposed, which incorporates a cooperative hybrid mono/bi-static sensing scheme to enhance spatial diversity and sensing capability. In the proposed architecture, a two-tier \textit{base station} (BS) deployment is adopted: master BSs are arranged in a hexagonal lattice, while slave BSs follow a Poisson point process distribution. This structure concurrently supports communication for terrestrial users and sensing for aerial targets. A holistic performance analysis framework for both C\&S is further developed, accounting for key channel and network parameters. Simulation results reveal inherent trade-offs between C\&S performance, especially under multi-BS cooperation and varying network density. These findings provide practical guidance for the deployment of scalable and efficient ISAC networks in LAE scenarios.

cs.IT↗
arXiv2026

CrypFormBench: Benchmarking Formal Analysis Capability of Large Language Models for Cryptographic Schemes

Manual formal analysis of cryptographic schemes is labor-intensive and requires substantial expertise. While model-checking tools (e.g., Scyther and Tamarin) and computational-security tools (e.g., CryptoVerif and EasyCrypt) improve the automation of security proofs, they still rely on experts to abstract schemes and write tool-specific formal descriptions. Large language models (LLMs) are a promising alternative, but their effectiveness in this domain remains unexplored due to the absence of standardized evaluation methodologies. To fill this gap, we introduce CrypFormBench (C.F.B for short), a comprehensive benchmark jointly covering symbolic and computational security to evaluate five core LLM capabilities: interpretation, generation, completion, transformation, and correction. It comprises 700 instances spanning 677 schemes, 7 mainstream formal verifier languages, and 160 security properties. The evaluation of 9 state-of-the-art LLMs reveals that most of them perform well on interpretation and completion, given their code-awareness advantages, but struggle with generation, transformation, and correction. Overall, their performance remains limited, with Claude-3.5 achieving the highest score at 48.7 out of 100. We further provide practical guidance, e.g., few-shot prompting, Pass@K sampling, and lightweight fine-tuning, to mitigate the executability bottleneck and improve tool-usable outputs. Taken together, our benchmark and analyses offer a grounded view of current progress and concrete directions toward reliable LLM-assisted formal cryptographic analysis.

cs.CR↗
arXiv2026

Capture Timing-Attention of Events in Clinical Time Series

The contemporary paradigm of trajectory learning operates fundamentally at the level of group dynamics, systematically reducing individual-level complexity to fit group-level models, thus rendering effective patient subtyping difficult and individual-level modeling largely out of reach. We propose a data-driven paradigm that introduces a dedicated individual-level temporal variable to capture \emph{Timing Attention} (i.e., the degree of concentration of an event's timing distribution across the patient cohort), thereby rendering timing a \emph{computable dimension} that enables individualized temporal features in trajectory learning. Instantiated as the Level-of-Individual Time Transformation (LITT) and applied to longitudinal EHR data from 3,276 breast cancer patients, the proposed paradigm demonstrates, for the first time to our knowledge: (1) automatic discovery of clinically significant patient trajectories, and (2) counterfactual timing deduction, that is, a \emph{What-If Machine}. Both results are purely data-driven, requiring no prior domain knowledge. LITT further achieves strong performance on timing prediction and survival analysis tasks.

cs.LG↗
arXiv2026

Kinematic enhancement for nucleon interpolators

The reliable treatment of highly boosted hadrons is crucial for many lattice QCD applications. For all these cases the kinematically enhanced interpolators promise very significant improvements and are, therefore, ever more often used in recent calculations, especially for highly boosted mesons like the pion. Motivated by, e.g., the physics program of the future Electron-Ion Collider (EIC) in the US and Electron-Ion collider in China (EIcC), we systematically benchmark our code for the unpolarized isovector nucleon quark matrix elements extracted at large source-sink separations, where excited state artifacts are significantly suppressed. We find that the precision of the renormalized nucleon matrix elements is typically improved by an order of magnitude at momentum $P_z\sim2.5$ GeV. By comparing the results from three CLS ensembles with different lattice spacings $a$ but the same pion mass, we observe no statistically significant dependence on $a$ in the renormalized matrix elements at nearly identical values of $P_z$. These encouraging results suggest that the use of kinematically improved operators is highly advantageous for parton physics calculations and can be extended to a broader class of baryon observables, making them a promising candidate for a standard component of modern lattice QCD.

hep-lat↗
arXiv2026

Movable Antennas for Robust Wireless Sensing via Joint Cramér-Rao Bound and Sidelobe Minimization

This paper presents a novel design approach for movable antenna (MA)-enabled wireless sensing systems by jointly minimizing the Cramér-Rao bound (CRB) and the maximum sidelobe level (MSL) of the ambiguity function via antenna position optimization. In particular, the mean squared error (MSE) of angle-of-arrival (AoA) estimation is decomposed into a local estimation error within the mainlobe of the ambiguity function (i.e., CRB) and an additional ambiguity error caused by its sidelobes. Since the MSE is dominated by the CRB in the high-signal-to-noise ratio (SNR) regime but by the sidelobes of the ambiguity function in the low-SNR regime, our analysis reveals a fundamental trade-off between CRB minimization and MSL minimization in the moderate-SNR regime. Specifically, minimizing the CRB prefers a narrower mainlobe, where antennas are concentrated near the two edges of the one-dimensional (1-D) movement region; whereas minimizing the MSL favors a wider mainlobe, where antennas are distributed more densely near the center of the movement region. Inspired by this and to ensure robust sensing performance across different SNR regimes, we formulate an optimization problem to minimize the CRB subject to a prescribed MSL constraint via antenna position optimization. An efficient successive convex approximation (SCA) algorithm is developed to optimize the antenna position vector (APV), and a 1-D linear search method is proposed to determine the optimal MSL threshold that minimizes the actual MSE for any given SNR. Numerical results demonstrate that the proposed scheme effectively balances the trade-off between MSL and CRB minimization, thus achieving a significantly lower AoA estimation MSE across the entire SNR range compared to conventional uniform and non-uniform fixed-position antenna (FPA) arrays.

cs.IT↗
arXiv2026

CallBench: A Benchmark for Dual-Goal Coordination in Phone Call Assistants

Target-oriented dialogue systems have demonstrated strong capabilities in completing user goals through interactive conversations. However, existing studies are primarily designed for single, explicit goal completion, while phone call assistants face a proxy setting that requires coordinating the device owner's explicit preset goal with the caller's implicit and dynamic goal. We introduce \textsc{CallBench}, a Chinese benchmark for evaluating dual-goal coordination in phone call assistants. \textsc{CallBench} contains 50,000 complete multi-turn phone call dialogues across six scenarios: takeout, delivery, taxi, work, life, and harassment. It covers regular presets, emergent presets, and no-preset cases, and includes diverse relations between owner-side and caller-side goals, such as alignment, complementarity, irrelevance, and conflict. We further design a preset-aware turn-level evaluation protocol covering semantic understanding, context use, active guidance, response quality, preset compliance, dialogue rhythm, and safety. Experiments on representative dialogue methods show that existing approaches still struggle with this task, highlighting the need for phone call assistants that can make reliable turn-level decisions between two independent goals under proxy constraints.

cs.AI↗
arXiv2026

Galactic Diffuse Gamma-Ray and Neutrino Emission from Cosmic-Ray Interactions in Stellar Atmospheres

The Galactic diffuse gamma-ray emission is conventionally modeled as the product of cosmic-ray interactions with the interstellar medium. However, the cumulative contribution of stellar atmospheres acting as hadronic interaction targets remains an unexplored multi-messenger background. In this work, we present the first systematic evaluation of this stellar diffuse emission by coupling MESA stellar evolution profiles and magnetic-field-modulated cosmic-ray transport with a 3D Galactic population synthesis framework. We find that the cumulative stellar contribution to the Galactic diffuse gamma-ray flux is negligible at 1 TeV, and the associated diffuse neutrino flux ($\sim 10^{-16}\;\mathrm{TeV\;cm^{-2}\;s^{-1}\;sr^{-1}}$) remains orders of magnitude below current IceCube limits. Nevertheless, at ultra-high energies ($>10\;\mathrm{TeV}$), this emission establishes an irreducible local background that overtakes the strongly attenuated extragalactic isotropic gamma-ray background. Our results demonstrate that the Galactic stellar ensemble is a strictly sub-dominant background, indicating that stellar subtraction templates are not required for identifying Galactic PeVatrons or constraining dark matter annihilation.

astro-ph.HE↗
arXiv2026

Improve Large Language Model Systems with User Logs

Scaling training data and model parameters has long driven progress in large language models (LLMs), but this paradigm is increasingly constrained by the scarcity of high-quality data and diminishing returns from rising computational costs. As a result, recent work is increasing the focus on continual learning from real-world deployment, where user interaction logs provide a rich source of authentic human feedback and procedural knowledge. However, learning from user logs is challenging due to their unstructured and noisy nature. Vanilla LLM systems often struggle to distinguish useful feedback signals from noisy user behavior, and the disparity between user log collection and model optimization (e.g., the off-policy optimization problem) further strengthens the problem. To this end, we propose UNO (User log-driveN Optimization), a unified framework for improving LLM systems (LLMsys) with user logs. UNO first distills logs into semi-structured rules and preference pairs, then employs query-and-feedback-driven clustering to manage data heterogeneity, and finally quantifies the cognitive gap between the model's prior knowledge and the log data. This assessment guides the LLMsys to adaptively filter out noisy feedback and construct different modules for primary and reflective experiences extracted from user logs, thereby improving future responses. Extensive experiments show that UNO achieves state-of-the-art effectiveness and efficiency, significantly outperforming Retrieval Augmented Generation (RAG) and memory-based baselines. We have open-sourced our code at https://github.com/bebr2/UNO .

cs.CL↗
arXiv2026

Direct calculation of parton distributions in momentum space from lattice QCD

Coulomb-gauge quasi-parton distributions can be computed directly in momentum space on a finite lattice, enabled by the commutativity of their renormalization and Fourier transform. This approach removes the formal inverse problem in coordinate-space methods. Our momentum-space pion quasi-distributions agree with coordinate-space results Fourier transformed with asymptotic extrapolation, indicating that the formal inverse problem in the latter is not a concern at this volume. We further extend the framework to higher dimensions and obtain the first 3D image of the pion directly from lattice QCD.

hep-lat↗
arXiv2026

UniDexTok: A Unified Dexterous Hand Tokenizer from Real Data

Dexterous hands are essential for fine-grained manipulation, but their hardware designs vary substantially across embodiments. Differences in kinematics, joint definitions, and degrees of freedom make it difficult to define a shared state representation compared with parallel grippers. As a result, dexterous-hand data remains fragmented and difficult to use for joint training. In this work, we propose the Unified Dexterous Hand Model (UDHM), which maps human and robot hand states into a shared 22-DoF semantic interface. Based on UDHM, we introduce UniDexTok, a retargeting-free state tokenizer that learns embodiment-conditioned discrete tokens from standardized real joint states. UniDexTok provides a unified representation for heterogeneous dexterous hands without relying on retargeting or simulation data. Compared with the recent baseline UniHM, UniDexTok reduces MPJAE from 15.63 degrees to 0.16 degrees and MPJPE from 18.51 mm to 0.18 mm, corresponding to error reductions of 98.98% and 99.03%, respectively. These results improve reconstruction from centimeter-scale to sub-millimeter accuracy. Experiments further show that data from other embodiments improves target-embodiment reconstruction accuracy, demonstrating the benefit of cross-embodiment tokenization. UniDexTok also shows strong zero-shot and few-shot reconstruction ability when new dexterous hands are introduced.

cs.RO↗
arXiv2026

Avatar V: Scaling Video-Reference Avatar Video Generation

Generating avatar videos that are not merely visually similar to a target individual but behaviorally recognizable, faithfully reproducing their talking rhythm, gestural tendencies, and expression dynamics, remains an open challenge. Existing methods predominantly condition on single static images, which provide insufficient identity information and cannot capture dynamic motion traits, while standard pixel-level objectives underserve the perceptually critical facial regions that determine avatar fidelity. We present Avatar V, a production-scale framework that addresses these limitations through video-reference-conditioned identity modeling. Rather than compressing identity into fixed-size embeddings, the model conditions directly on the full token sequence of a reference video, learning to reproduce both static identity attributes (facial geometry, skin texture) and dynamic behavioral patterns (talking rhythm, micro-expressions) through attention over the reference context. We introduce Sparse Reference Attention, an asymmetric mechanism achieving linear-complexity conditioning on arbitrarily long references; a motion representation stream enabling closed-loop talking style transfer; and an identity-aware super-resolution refiner inheriting the full reference conditioning. These are supported by a data engine curating 100M+ training clips from 50M raw videos, and a five-stage training pipeline with flow matching pre-training, personality fine-tuning, two-phase distillation (>10x acceleration), and RLHF alignment, deployed across thousands of GPUs. Avatar V generates 1080p videos of unlimited duration, achieving state-of-the-art identity preservation, lip synchronization, and generation quality on our cross-scene benchmark, consistently outperforming leading systems including Seedance 2.0, Kling O3 Pro, Veo 3.1, and OmniHuman 1.5 in both automated metrics and human evaluation.

cs.CV↗
arXiv2026

Unlocking the Potential of Movable Antennas: General and Practical Antenna Position Optimization

Recently, movable antenna (MA) has attracted wide attention in wireless communications due to its potential in enhancing wireless communication performance via local movement within a confined region. However, antenna position optimization (APO) has emerged as a major challenge for MAs, due to the lack of a tractable, analytical, and accurate channel model in terms of antenna positions. Although existing works have developed various algorithms for APO, most of them are based on simplified theoretical channel models, which limit their generality. To address this challenge, in this article, we present more general and effective APO algorithms for different purposes, categorized as continuous APO and discrete APO, respectively. Continuous APO is mainly applied for flexible array signal processing to boost large-scale communication performance, while discrete APO is applied for small-scale multi-path channel reshaping. Specifically, the discrete APO discretizes the antenna movement region into multiple sampling points and employs discrete algorithms to determine the optimal MA positions based on the point-wise channel state information (CSI), without the need for an analytical channel model. To reduce the overhead for CSI acquisition, we also present more efficient learning-based APO algorithms that operate without requiring full point-wise CSI. Finally, we compare the application scenarios of the proposed algorithms and validate their effectiveness with numerical results.

eess.SP↗
arXiv2026

Reconfigurable Antennas for Next-generation Mobile Communication Networks: A Comprehensive Survey and Tutorial

The transition to next-generation mobile communication networks, particularly 6G, demands advanced technologies to meet the requirements for ultra-reliable, low-latency communication, massive connectivity, and intelligent applications. Reconfigurable antennas (RAs) play a crucial role in achieving these objectives by enabling dynamic adjustments to the radio frequency (RF) characteristics of antennas, such as gain, radiation pattern, impedance, and polarization. Unlike traditional fixed-position antennas, RAs can alter both their radiation patterns and positions, offering flexibility in response to varying communication environments. This paper presents a comprehensive survey and tutorial on RAs, with a focus on fluid antennas (FAs), movable antennas (MAs), pinching antennas (PAs), and reconfigurable holographic antennas (RHAs), examining their potential in next-generation mobile networks. We explore the channel modelling and estimation, performance analysis, resource allocation strategies, and their synergy with other emerging wireless technologies for each type of RA. Finally, we provide a comparative analysis of different RAs and discuss the open challenges and future research directions, offering insights and guidance for future investigations in the exciting research area.

cs.IT↗
arXiv2026

ClinicalBench: Can LLMs Beat Traditional ML Models in Clinical Prediction?

Large Language Models (LLMs) hold great promise to revolutionize current clinical systems for their superior capacities on medical text processing tasks and medical licensing exams. Meanwhile, traditional ML models such as SVM and XGBoost have still been mainly adopted in clinical prediction tasks. An emerging question is: Can LLMs beat traditional ML models in clinical prediction? Thus, we build a new benchmark ClinicalBench to comprehensively study the clinical predictive modeling capacities of both general-purpose and medical LLMs, and compare them with traditional ML models. ClinicalBench embraces three common clinical prediction tasks, two databases, 14 general-purpose LLMs, 8 medical LLMs, and 11 traditional ML models. Through extensive empirical investigation, we discover that both general-purpose and medical LLMs, even with different model scales, diverse prompting or fine-tuning strategies, still cannot beat traditional ML models in clinical prediction yet, shedding light on their potential deficiency in clinical reasoning and decision-making. We call for caution when practitioners adopt LLMs in clinical applications. ClinicalBench can be utilized to bridge the gap between LLMs' development for healthcare and real-world clinical practice.

cs.CL↗
arXiv2026

Flexible Coupler Antenna Enhanced Wireless Communication: Modeling and Coupler Position Optimization

This paper proposes a novel flexible coupler antenna (FCA) that translates passive coupling elements around a fixed-position active antenna to reshape the induced currents on the passive elements for radiation. A new form of mechanical beamforming is achieved by moving only the passive coupling elements while keeping the active antenna stationary. The proposed design significantly reduces the antenna and radio-frequency (RF) chain costs of conventional active array beamforming with low mechanical control complexity and energy consumption. For the purpose of exposition, we consider a point-to-point communication system with one FCA at the transmitter and one fixed antenna at the receiver. Specifically, based on multi-port circuit theory, we establish both the line-of-sight (LoS) and multipath channel models and derive the mechanical beamforming weights of the passive couplers as functions of their positions. Then, we formulate a new problem to maximize the received signal-to-noise ratio (SNR) by optimizing the positions of passive couplers at the transmitter, subject to coupler movement and transmit power constraints. Solving the resulting problem is inherently difficult because coupled channel and mechanical beamforming create non-linearity in the objective function.To tackle this problem, we propose an efficient block-coordinate conditional gradient method to search for the best positions of all passive couplers by sequentially optimizing the position of each coupler with those of the other couplers fixed in an iterative manner.Simulation results demonstrate that the proposed system significantly outperforms benchmark schemes in terms of achievable rate, but with significantly reduced active antennas and RF chains.

cs.IT↗
arXiv2026

Rotatable Antenna-Enhanced Cell-Free Communication

Rotatable antenna (RA) is a promising technology that can exploit new spatial degrees-of-freedom (DoFs) by flexibly adjusting the three-dimensional (3D) boresight direction of antennas. In this letter, we investigate an RA-enhanced cell-free system for downlink transmission, where multiple RA-equipped access points (APs) cooperatively serve multiple single-antenna users over the same time-frequency resource. Specifically, we aim to maximize the sum rate of all users by jointly optimizing the AP-user associations and the RA boresight directions. Accordingly, we propose a two-stage strategy to solve the AP-user association problem, and then employ fractional programming (FP) and successive convex approximation (SCA) techniques to optimize the RA boresight directions. Numerical results demonstrate that the proposed RA-enhanced cell-free system significantly outperforms various benchmark schemes.

cs.IT↗
arXiv2026

AgentDS Technical Report: Benchmarking the Future of Human-AI Collaboration in Domain-Specific Data Science

Data science plays a critical role in transforming complex data into actionable insights across numerous domains. Recent developments in large language models (LLMs) and artificial intelligence (AI) agents have significantly automated data science workflow. However, it remains unclear to what extent AI agents can match the performance of human experts on domain-specific data science tasks, and in which aspects human expertise continues to provide advantages. We introduce AgentDS, a benchmark and competition designed to evaluate both AI agents and human-AI collaboration performance in domain-specific data science. AgentDS consists of 17 challenges across six industries: commerce, food production, healthcare, insurance, manufacturing, and retail banking. We conducted an open competition involving 29 teams and 80 participants, enabling systematic comparison between human-AI collaborative approaches and AI-only baselines. Our results show that current AI agents struggle with domain-specific reasoning. AI-only baselines perform below the top quartile of competition participants, while the strongest solutions arise from human-AI collaboration. These findings challenge the narrative of complete automation by AI and underscore the enduring importance of human expertise in data science, while illuminating directions for the next generation of AI. Visit the AgentDS website here: https://agentds.org/ and open source datasets here: https://huggingface.co/datasets/lainmn/AgentDS .

cs.LG↗
arXiv2026

An Ensembled Latent Factor Model via Differential Evolution and Gradient Descent Optimization

High-dimensional and incomplete (HDI) data are prevalent in many real-world big data scenarios. Latent factor models serve as a common representation learning approach, capable of uncovering informative latent factors from such data. Nevertheless, most existing latent factor models rely solely on gradient descent for optimization, which may lead to insufficient and biased representations, particularly when dealing with heterogeneous HDI data. Thus, this study proposes an Ensembled Latent Factor Model via Differential Evolution and Gradient Descent Optimization (ELFM-DEGDO) with two-fold designed: 1) two diverse latent factor models are independently modeled via differential evolution and gradient descent optimization, respectively, and 2) the two diverse latent factor models are combined via a customized self-adaptive weighting mechanism to effectively fuse their strengths. By leveraging the complementary advantages of both optimization paradigms, ELFM-DEGDO is able to produce more comprehensive and less biased representations for HDI data. Three HDI datasets are tested to show that ELFM-DEGDO consistently performs better than related several latent factor models.

cs.LG↗