Search arXiv⌕ Search

arXiv subjects

Rui Zhang

Publications and source records attributed to Rui Zhang.

At least 37 records · Page 2Linked to original sources
arXiv2026

Large language models exhibit unreliable updating of clinical judgment as patient evidence evolves

Large language models (LLMs) are increasingly explored for clinical reasoning, but whether they appropriately revise judgments as patient evidence evolves remains unclear. We evaluated longitudinal belief updating using matched intensive-care trajectories from electronic health records. Across diverse LLMs, conditioning on a preceding judgment more often increased than reduced prediction error when estimates changed, replicated for a second endpoint. Controlled interventions revealed two failure modes. First, with preceding assessment fixed, models responded more strongly to worsening than matched improving respiratory evidence; this asymmetry persisted after headroom normalization at moderate and strong evidence levels. Second, with current evidence fixed, increasing prior risk from 10% to 90% shifted estimates by 26.2 percentage points, demonstrating causal influence of prior model beliefs. Prompting did not restore reliable updating. Evidence-Validated Longitudinal Update (EVLU) identified fewer, more reliable revisions, revealing a reliability-coverage trade-off. These findings establish longitudinal belief updating as a distinct dimension of LLM reliability.

cs.AI↗
arXiv2026

Optimal initial states for quantum Fisher information in linearized cavity optomechanics

We find the optimal initial states of a linearized cavity-optomechanical system for estimating the single-photon coupling by quantum Fisher information. In the red-detuned (beam-splitter) regime the interaction exchanges excitations between the two modes, and for pure inputs the Fisher information is four times the variance of the excitation-exchange operator, reducing the optimization to variance maximization with a closed-form solution. With the mechanical mode in a Fock state the probe is degenerate: any state saturating the photon-number constraint is optimal, and a Fock reference with many phonons enhances the per-photon sensitivity linearly. For an arbitrary fixed mechanical reference it becomes a phase-matched squeezed vacuum, from an exact bound on that coherence obtained by a Lagrange-dual argument. Jointly optimizing both modes at fixed total excitation number, the quantum Fisher information obeys a Heisenberg bound quadratic in the energy, saturated by equal superpositions of the two extremal eigenstates of the generator, equivalently a two-mode NOON state after a balanced beam splitter; balanced product Fock states reach only a linear enhancement. Exact diagonalization in truncated Fock spaces confirms all the results, the familiar single-photon input being the simplest saturating case. Three extensions are worked out: the blue sideband has an unbounded two-mode-squeezing spectrum, so the entangled optimum becomes impossible and the balanced product Fock state is exactly optimal at definite energy; under cavity loss the information accumulation turns linear on the cavity-lifetime timescale, at a renewal-optimal duration of about two and a half lifetimes; and for a state-of-the-art quantum-coherent coupling experiment the per-hour relative precision lies between one part in a million and ten parts in a million, number and thermal references being the most robust.

quant-ph↗
arXiv2026

Rotatable Antenna-Enabled Space-Air-Ground Integrated Networks: Opportunities and Challenges

Space-air-ground integrated networks (SAGINs) are expected to support ubiquitous three-dimensional (3D) communication and sensing services in future sixth-generation (6G) wireless networks. However, heterogeneous mobility and service requirements across the space, air, and ground segments challenge fixed-boresight or fixed-sector antennas in supporting wide-area coverage, maintaining directional alignment over time-varying communication links, and flexibly adjusting observation directions for sensing tasks. To address these limitations, 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 emerged as a promising solution by enabling mechanical or electronic boresight adjustment while keeping the antenna positions fixed. This article investigates the roles of RA technology in enabling communication and sensing in SAGINs. Specifically, we first explain how RA boresight control complements platform mobility and supports wide-area coverage, dynamic directional transmission, cross-segment cooperative operation, and cooperative sensing. We then discuss the main design challenges, potential approaches, and future research directions, including channel acquisition and predictive tracking, joint orientation control and access/handover coordination, cross-segment coordination and resource management, as well as deployment tradeoffs and practical implementation. Finally, an RA array prototype and two representative simulation studies are presented to illustrate the feasibility and potential performance gains of RA-enabled SAGINs.

cs.IT↗
arXiv2026

Herschel: Continuous Optimization of Production LLM Inference through On-Demand Profiling

Model-as-a-service platforms call for continuous optimization as complex serving conditions expose inefficiencies missed before deployment. Detailed always-on profiling can incur substantial overhead, while lightweight collection omits information needed for diagnosis. We present Herschel, a continuous optimization system for production large language model (LLM) inference. Our key insight is that adaptive, on-demand profiling can provide rich full-stack evidence without continuous collection. Herschel safely attaches to and detaches from selected running processes without engine changes or restarts, and adapts coverage as investigations reveal missing evidence. Herschel reconstructs operator executions and cross-process dependencies to identify inefficiency mechanisms and suggest solutions using applicable reference fixes. AI agents implement and test engine and kernel changes under controlled conditions that preserve the triggering workload and dependencies, with expert review before deployment. Controlled tests show active-collection overhead below 0.5% for time to first token and 7% for time per output token. Bounded windows, typically 30 s, avoid the continuous cost of always-on tracing. Over six months, Herschel collected approximately 17,000 traces across over 120 model variants and more than 10 accelerator types, identifying inefficiency patterns in 23% of the traces. Representative findings guide widely deployed optimizations, including restructured synchronization, removal of unused computation, and improved operator implementations.

cs.OS↗
arXiv2026

Universal CKM for Environment-Aware Wireless Networks: Enabling Cross-Device and Cross-Task Channel Knowledge Transfer

Channel knowledge map (CKM) is a promising technology for environment-aware sixth-generation (6G) wireless networks. However, existing CKMs are tightly coupled with wireless devices and downstream tasks, which limit their scalability and reusability in wireless networks. To address these limitations, this article proposes the concept of universal CKM (uCKM) as a foundational wireless environment prior, which aims to enable cross-device and cross-task channel knowledge transfer for environment-aware wireless networks. We first revisit the representative CKMs and discuss their limitations. Then, the uCKM-enabled new paradigm for environment-aware wireless networks is introduced, and its benefits are highlighted from the perspectives of uCKM construction and utilization phases, for which we propose the visions of ``All for uCKM'' and ``uCKM for All'', i.e., the data acquired by all devices and tasks should contribute to the construction of uCKM, while the constructed uCKM, in turn, can be utilized to support all devices and tasks. Subsequently, we discuss the main challenges of uCKM and propose potential solutions. Last, we provide simulation results to demonstrate the feasibility and performance gains brought by uCKM and outline future research directions.

cs.IT↗
arXiv2026

Beyond Sub-Gaussian Detector Scores: Robust Weighted Profile-Loss Change Point Detection for Human-LLM Text Segmentation

Mixed human-LLM documents require locating authorship transitions from detector scores whose reliability varies across text units. Existing weighted mean contrasts are vulnerable to extreme scores, while directly replacing means with robust centers obscures how a misplaced boundary changes the population objective. We propose Robust Weighted Profile-Loss Change Point Detection (RWCP), which combines capped reliability weights, Huber profile gains, and narrowest-over-threshold search in reliability coordinates. Our key analysis expresses the population gap between a true and a displaced split as a merge cost, avoiding a closed-form solution for the nonlinear center of a mixed segment. Under explicit curvature, spacing, and dependence conditions, core RWCP recovers the number of changes and localizes their boundaries; its quadratic-loss limit recovers squared weighted CUSUM. We also study RWCP-R, a separately evaluated decoder that shares source centers across nonadjacent passages. Across five retrospective cached-score benchmark families, core RWCP reduces family-macro WindowDiff by 17.6\% relative to weighted change-point detection, and RWCP-R lowers it further. Boundary recovery improves most clearly for isolated changes, while both fixed configurations miss changes in collaborative and densely alternating text.

cs.AI↗
arXiv2026

Toward Robust LLM-Based Judges: Taxonomic Bias Evaluation and Debiasing Optimization

Large language model (LLM)-based judges are widely adopted for automated evaluation and reward modeling, yet their judgments are often affected by judgment biases. Accurately evaluating these biases is essential for ensuring the reliability of LLM-based judges. However, existing studies typically investigate limited biases under a single judge formulation, either generative or discriminative, lacking a comprehensive evaluation. To bridge this gap, we propose JudgeBiasBench, a benchmark for systematically quantifying biases in LLM-based judges. JudgeBiasBench defines a taxonomy of judgment biases across 4 dimensions, and constructs bias-augmented evaluation instances through a controlled bias injection pipeline, covering 12 representative bias types. We conduct extensive experiments across both generative and discriminative judges, revealing that current judges exhibit significant and diverse bias patterns that often compromise the reliability of automated evaluation. To mitigate judgment bias, we propose bias-aware training that explicitly incorporates bias-related attributes into the training process, encouraging judges to disentangle task-relevant quality from bias-correlated cues. By adopting reinforcement learning for generative judges and contrastive learning for discriminative judges, our methods effectively reduce judgment biases while largely preserving general evaluation capability.

cs.CL↗
arXiv2026

Intelligent Beamforming and Handover via Physics-Informed Beam-Aware CKM Diffusion

Downlink communications from base stations (BSs) to unmanned aerial vehicles (UAVs) in sixth-generation (6G) networks require precise beam alignment to overcome severe mobile communication path loss. However, traditional exhaustive beam sweeping relies on discrete codebooks and consumes valuable air-interface resources for online measurements, rendering it inefficient for highly dynamic aerial environments. In this paper, we propose BeamCKMDiff, a physics-informed generative diffusion framework designed to construct high-fidelity continuous beam-aware channel knowledge maps (BeamCKMs). Unlike existing empirical approaches, BeamCKMDiff employs a diffusion transformer (DiT) architecture featuring a dual-path conditioning mechanism. It integrates an analytical line-of-sight (LoS) beam prior with environmental topologies, while simultaneously embedding continuous beamforming vectors through an adaptive layer normalization (adaLN) mechanism. Building upon this differentiable generative mapping, we propose a CKM-based end-to-end continuous beamforming and proactive dual-BS handover algorithm. By analytically propagating gradients through the reverse diffusion process, the proposed framework enables successive convex approximation (SCA)-based beamforming optimization in the computational domain, effectively bypassing physical pilot scanning. Simulation results demonstrate that BeamCKMDiff achieves a normalized mean square error (NMSE) of --23.96 dB, establishing a highly reliable spatial prior. Compared to discrete beam sweeping and LoS-assumed baselines, the proposed CKM-based beamforming adapts to non-LoS (NLoS) conditions, providing accurate beam alignment and higher spectral efficiency. Furthermore, the integrated dual-BS handover mechanism eliminates blockage-induced link outages, ensuring robust connectivity for high-mobility aerial platforms.

eess.SP↗
arXiv2026

KernelZero: Co-Evolving Proposer and Coder for Continuously Improved GPU Kernel Generation

High-performance GPU kernels are essential to modern machine learning systems, yet automatically generating kernels that are both correct and efficient remains challenging. Existing LLM-based approaches face two major limitations: the scarcity of high-quality training data aligned with the model's current capabilities, and the inherent trade-off between kernel correctness and performance. To address these challenges, we propose KernelZero, a co-evolution framework that continuously improves GPU kernel generation through two specialized models: a Proposer that generates Torch modules from API sets and a Coder that translates them into CUDA or Triton kernels. KernelZero uses a frontier-driven module generation mechanism to continuously produce capability-aligned training modules based on the Coder's current weaknesses. It further introduces Correctness-Aware Group Relative Policy Optimization (CA-GRPO), which optimizes performance only after correctness becomes sufficiently reliable. By alternating the optimization of the Proposer and Coder, KernelZero forms an automatic curriculum that enables targeted and training-efficient capability improvement. Empirically, KernelZero-7B surpasses Claude-4.5-Sonnet on CUDA and DeepSeek-V4-Pro on Triton. On KernelBench Level 1 and 2, it achieves CUDA pass@1 scores of 75.8% and 69.6%, respectively, with pass@10 reaching 100% and 97%. On Triton, it achieves pass@1 scores of 77.2% and 72.5%, respectively.

cs.LG↗
arXiv2026

Neural Decentralized Conditions for Power System Stability Analysis

This letter proposes a novel method to establish decentralized stability conditions (DSCs) of power systems. This method formulates DSCs with meticulously crafted neural networks, based on the insight into the structure and properties of the existing analytically derived DSCs. A tailored loss function is further devised to iteratively train the neural networks, ensuring validity and reducing conservatism of the DSCs. Numerical results demonstrate that the resultant neural DSCs are less conservative than the conventional analytical DSCs, and become generalizable if a relatively large-scale system is used for training.

eess.SY↗
arXiv2026

Neural-Analytica Energy Functions for Power System Stability Analysis

This letter proposes a novel form of energy function (EF), called neural-analytic EF, for the stability analysis of power systems. The neural-analytic EF is designed as the sum of neural networks (NNs)-based components and an analytic EF, with the structure informed by the existing EFs derived analytically. It thus integrates NN's expressivity with the generalizability and scalability of analytic EFs. The satisfactory neural-analytic EF is further derived by iterative NN training with a tailored loss function. Numerical results finally demonstrate its superiority.

eess.SY↗
arXiv2026

FragToken: Amplifying LLM Inference Costs through Noncanonical Token Generation

As large language model (LLM) inference becomes increasingly expensive, resource-consumption attacks pose a growing threat to model providers. Existing attacks typically amplify cost by inducing abnormally long or repetitive outputs on attacker-controlled or triggered requests, making them easier to detect and limiting their deployment-wide impact when benign traffic dominates. In this work, we uncover a previously overlooked token-level attack surface arising from the many-to-one mapping from token sequences to decoded text. Although standard LLMs predominantly generate the canonical token sequences induced by their tokenizers, the same text can also be represented by substantially longer non-canonical sequences. This representational flexibility exposes a new avenue for resource-consumption attacks: an attacker can train the model to favor such sequences, systematically increasing the number of autoregressive decoding steps without a proportional increase in visible response length. However, we empirically find that directly maximizing token fragmentation substantially degrades model utility, producing conspicuous answer-quality failures that undermine attack stealthiness. To address this challenge, we propose FragToken, a training-time framework that combines source-model self-distillation, capacity-aware filtering and budgeting, and BPE-Aligned Merging to induce fragmented generation under ordinary prompts while largely preserving model utility. We evaluate FragToken on four LLMs across three benchmarks. Across the four models, FragToken achieves a three-benchmark average token inflation ratio (TIR) ranging from 1.99 to 2.46, while causing only minor degradation in model utility. Our work reveals a covert LLM supply-chain threat that increases inference cost without requiring large volumes of attack requests while largely preserving utility.

cs.CR↗
arXiv2026

AgentWorld: Benchmarking Long-Horizon Collaboration of Multi-agent LLMs

Existing multi-agent benchmarks primarily test in competitive settings, short-horizon interactions under 20 steps, or simply aggregate individual performance, failing to isolate and highlight genuine collaboration capabilities of LLM-based agents. We introduce AgentWorld, a benchmark of 100 human-annotated tasks (with 100 augmented variants) for evaluating long-horizon, multi-agent collaboration. Tasks span 50+ interaction rounds across a rich MMORPG sandbox and require 3-20 agents with asymmetric roles and abilities to coordinate through communication, joint planning, and resource sharing under a blackbox setting where each agent acts independently without access to others' internal states. To quantify collaboration effectiveness in addition to conventional binary task success, we propose Causal Collaboration Effectiveness (CCE), a graph-based metric that traces causal dependencies between agent actions and measures what fraction of a team's effort actually contributed to the outcome. Experiments with Gemini 3 Flash, Claude Haiku 4.5, GPT-5 Mini, and DeepSeek R1-70B show that even the best model achieves only 52.0% task success, with systematic failure modes including communication breakdowns, role confusion, and inability to maintain shared plans across rounds. AgentWorld is fully open-source.

cs.MA↗
arXiv2026

Uni-Macro-FRPN: Full-Resolution and Cross-Scale Learning for Polymers

Polymer properties emerge from interactions across scales, yet existing polymer models typically preserve either detailed monomer chemistry without an explicit polymer graph or polymer connectivity with simplified monomer representations, due to computational constraints, as polymers typically contain tens of thousands of atoms. We present Uni-Macro-FRPN (FRPN), a Full-Resolution Polymer Network that retains both detailed atom-level and monomer-level features and explicit polymer structure information within a unified framework. Two Transformers jointly learn atom-informed monomer semantics, sequence order, and chain topology from BigSMILES-derived representations. On the Block Copolymer Database (BCDB) lamellar-versus-non-lamellar classification task, FRPN achieves 86.4% accuracy and 90.6% ROC-AUC, establishing state-of-the-art performance. Ablation results indicate that the gain is not explained solely by increased parameter count. On a linear homopolymer benchmark, monomer-centric learning remains competitive, highlighting a boundary case where polymer-scale organization is simple. To test generalization beyond linear polymers, we further construct an all-atom molecular-dynamics benchmark of 1640 datapoints spanning diverse monomer chemistries, sequence orderings, chain topologies, and physical properties. FRPN achieves the strongest overall performance on this topology-rich benchmark, with diagnostics supporting the benefit of jointly modeling monomer chemistry and polymer structure. Taken together, FRPN provides a practical route for moving polymer representation learning beyond monomer-centric representations. The leading performance of FRPN also suggests a promising direction for polymer informatics: future polymer prediction models should treat polymers not only as collections of monomer descriptors, but as complete multiscale chemical and topological objects.

cond-mat.soft↗
arXiv2026

VLA-Precision: Asymmetric Co-Bootstrapping for Efficient Real-World Online RL of Vision-Language-Action Models

Pretrained vision-language-action (VLA) models enable broad manipulation but remain unreliable in tasks demanding precision and repeatability. Applying real-world online reinforcement learning (RL) to VLA post-training enables autonomous trial-and-error improvement beyond demonstrations alone, but exposes two bottlenecks: 1) unreliable value signals can induce policy drift; 2) large-VLA overhead constrains throughput and sample efficiency. To address these challenges, we present VLA-Precision, an efficient real-world online RL framework featuring the Asymmetric Co-Bootstrapping (ACoB) algorithm and the ACoB-Stream architecture. Specifically, ACoB establishes asymmetric co-bootstrapping across timescales: early intervention-guided behavioral learning rapidly improves policy performance while enhancing online experience quality. As autonomous experience accumulates, global return propagation and local preference ranking progressively calibrate value estimates, yielding relative action advantages for reference-regularized policy improvement while suppressing drift. To enable ACoB on large VLAs, we develop ACoB-Stream, a closed-loop experience--policy architecture that establishes invariant-state decoupling and on-demand streaming as design principles, delivering up to 10.9$\times$ improvements in throughput and computational efficiency. Extensive evaluations on nine high-precision chemistry tasks across four categories and four robot embodiments show that VLA-Precision achieves 98.3\% mean success rate in 45.8 min/task, with 27.6 s episodes running at 1.2$\times$ and 1.8$\times$ the speeds of VLA and RL baselines. Resources are available at https://vla-precision.github.io.

cs.RO↗
arXiv2026

Q-VGM: Q-Guided Value-Gradient Matching for Offline-to-Online RL of Flow-Matching VLA Policies

We propose Q-Guided Value-Gradient Matching (Q-VGM), an offline-to-online RL method for fine-tuning flow-matching vision-language-action policies with a learned critic. Directly applying critic gradients to flow policies requires backpropagation through the multi-step denoising process (BPTT), which is costly and unstable at VLA scale. Motivated by an optimal-control view of denoising, we derive a local approximation connecting clean-action value gradients to local velocity corrections at late denoising steps. Q-VGM uses this connection to construct critic-guided targets for fine-tuning the pretrained action expert through velocity matching. Gradients pass only through local velocity predictions, avoiding backpropagation through the denoising trajectory. An action-sensitive chunk critic is trained with IQL offline and TD learning online. On LIBERO, Q-VGM improves the few-shot-SFT four-suite average from 84.6% to 90.7% offline using 150 policy rollouts per suite, and reaches 98.4% after online training. Compared with on-policy RL, Q-VGM achieves 5.3x higher sample efficiency on average across four LIBERO suites, measured by the episode budget for 95% rollout success rate. On three real-world bimanual tasks, offline Q-VGM improves average success from 66.7% to 98.3%.

cs.RO↗
arXiv2026

Computability of GPDs near $x=\pmξ$ in Lattice QCD

In lattice QCD computations of generalized parton distributions (GPDs), the large momentum expansion generally requires all hard scales, $2|x\pmξ|P^z$ and $2|1\pm x|P^z$, to be much larger than $Λ_{\rm QCD}$. We show that this condition can be relaxed for $2|x\pmξ|P^z$ at large $ξ$, making the important $x\sim\pmξ$ regions accessible to lattice calculations and considerably expanding the region of computability. Revisiting previous lattice results with complete one-loop matching, we obtain the expected partonic threshold behavior---GPDs continuous at $x=\pmξ$ but with discontinuous derivatives---which has not previously been observed on the lattice. We thus obtain, for the first time, important prediction for GPDs in the distribution-amplitude-like region, which smoothly connects the quark and antiquark PDF-like behaviors.

hep-lat↗
arXiv2026

Pinching-Antenna System With Movable Waveguides: Modeling and Optimization

This paper proposes a movable waveguide (MW)-enabled pinching-antenna system (PASS), in which each waveguide is connected via a flexible cable and can be linearly moved by drivers. By simultaneously moving the MWs and the pinching antennas (PAs) on them, MW-enabled PASS can effectively track user locations and form flexible array geometries for efficient beamforming. We first examine the special case with a single user and derive the closed-form solutions for the optimal MW positions as well as an upper bound on the user rate. Furthermore, we develop a two-step optimization algorithm to maximize the achievable rate for the user, where the first step determines the optimal MW positions using the derived closed-form solutions, and the second step alternately optimizes the PA positions through a one-dimensional (1D) local search based on the user location. Then, for the general multi-user scenario, we derive the upper bounds on the minimum rate among all users. To maximize their minimum rate, we propose a low-complexity two-scale optimization algorithm, where the large-scale global search coarsely determines the MW and PA positions, followed by a small-scale local search to finely tune them. In addition, a two-timescale optimization scheme based on statistical channel information is investigated to reduce the mechanical movement overhead of the MWs. Simulation results demonstrate that the proposed scheme achieves performance close to the derived bounds. It also flexibly adapts to different user distributions compared with the conventional PASS employing dense or sparse fixed-position waveguides (FPWs), as well as fixed-position antenna (FPA) schemes.

eess.SP↗