arXiv subjects

Rui Zhu

Publications and source records attributed to Rui Zhu.

At least 55 records · Page 3Linked to original sources

arXiv2026

Reducing the Computational Cost Scaling of Tensor Network Algorithms via Field-Programmable Gate Array Parallelism

Improving the computational efficiency of quantum many-body calculations from a hardware perspective remains a critical challenge. Although field-programmable gate arrays (FPGAs) have recently been exploited to improve the computational scaling of algorithms such as Monte Carlo methods, their application to tensor network algorithms is still at an early stage. In this work, we propose a fine-grained parallel tensor network design based on FPGAs to substantially enhance the computational efficiency of two representative tensor network algorithms: the infinite time-evolving block decimation (iTEBD) and the higher-order tensor renormalization group (HOTRG). By employing a quad-tile partitioning strategy to decompose tensor elements and map them onto hardware circuits, our approach effectively translates algorithmic computational complexity into scalable hardware resource utilization, enabling an extremely high degree of parallelism on FPGAs. Compared with conventional CPU-based implementations, our scheme exhibits superior scalability in computation time, reducing the bond-dimension scaling of the computational cost from $O(D_b^3)$ to $O(D_b)$ for iTEBD and from $O(D_b^6)$ to $O(D_b^2)$ for HOTRG. This work provides a theoretical foundation for future hardware implementations of large-scale tensor network computations.

cond-mat.str-el↗

arXiv2026

Planning-Augmented Sampling with Early Guidance for High-Reward Discovery

Generative Flow Networks (GFlowNets) enable structured generation with inherent diversity, but existing sampling strategies often rely on weak guided exploration, slowing early discovery of high-reward candidates. In tasks such as molecular design, rapid and consistent generation of high-reward solutions can outweigh faithful distribution matching. We propose a planning-augmented framework in which Monte Carlo Tree Search using polynomial upper confidence bounds provides online value estimates, and a controllable soft-greedy mechanism integrates these planning signals into the GFlowNets forward policy. This design fosters early exploration of high-reward trajectories and gradually shifts to policy-driven exploitation as experience accumulates. Empirical results show that our method accelerates early high-reward discovery, sustains top-quality sample generation, and preserves diversity across representative tasks. All implementations are available at https://github.com/ZRNB/PLUS.

cs.LG↗

arXiv2026

Gear-tuning meta-shaft for low-frequency torsional vibration suppression

Metastructures with band gaps provide a new solution for the torsional vibration attenuation in shaft systems, while tunable band gaps remain challenging, typically relying on additional physical fields or complex assembly processes. In this study, a gear-shifting tunable meta-shaft with self-locking gear (SLG) resonators is proposed, where a simple gear-shifting mechanism replaces complex tuning methods to achieve low-frequency torsional vibration suppression in tunable frequency ranges. First, as the key components of the SLG resonator, six inner curved beams are designed to provide precisely tunable torsional stiffness of the resonator through their deformed shapes controlled by shifting the gear teeth on the edge of the resonator. Also, based on the gear-shifting mechanism, the SLG resonator achieves resonant frequency modulation and opens tunable low-frequency torsional band gaps consistent with theoretical predictions. Then, the SLG resonators are periodically attached to a uniform shaft to construct a gear-shifting tunable meta-shaft, whose dynamic response is obtained using numerical simulations to evaluate its torsional wave attenuation performance. Finally, a gear-shifting tunable meta-shaft prototype is fabricated and experiments are carried out to study the propagation characteristics of torsional waves therein. Through the consistency observed among theoretical analysis, numerical simulations, and experimental results, the gear-shifting tunable meta-shaft is found to exhibit excellent attenuation performance in the tunable low-frequency band gaps. Therefore, the proposed gear-shifting tunable meta-shaft paves a new way for low-frequency torsional vibration suppression.

physics.app-ph↗

arXiv2026

Coarse-graining particulate two-phase flow

To acquire the ability to numerically study the rheology of particulate two-phase flows that lack scale separation, we present a general method to average or coarse-grain the equations of motion of a mixture of a continuous fluid of arbitrary rheology and non-Brownian particles, interacting via contacts, of arbitrary shapes and compositions. It universally covers ensemble and typical spatio-temporal averaging procedures and overcomes two shortcomings of existing methods. First, the derived micromechanical expressions for the coarse-grained fields are mathematically exact and formulated in a manner that allows a computationally cheap extraction from Direct Numerical Simulation-Discrete Element Method (DNS-DEM) simulations, avoiding the unlimited-order derivatives appearing in previous exact formulations. Second, the microscopic volume fraction of each particle is its corresponding indicator function, rather than the traditional volume-weighted delta distribution at its center of mass, to ensure that the resulting macroscopic fluid and solid volume fractions add precisely to unity. This leads to an additional contact stress contribution not seen in standard coarse-grained expressions for granular matter, and, for non-spherical particles, to particle-rotational contributions to translational solid phase balance equations. Many implementations of DNS-DEM simulations are based on Immersed Boundary Methods (IBMs), for which modifications of the coarse-graining method are necessary due to certain peculiarities of IBMs, such as the replacement of the particles' interiors by pseudo-fluid. We therefore derive mathematically exact adaptations of the coarse-graining method for two distinct common IBM versions, implement one version to obtain coarse-grained fields from sediment transport simulations based on this version, and validate the implementation.

physics.flu-dyn↗

arXiv2026

UVE: Are MLLMs Unified Evaluators for AI-Generated Videos?

With the rapid growth of video generative models (VGMs), it is essential to develop reliable and comprehensive automatic metrics for AI-generated videos (AIGVs). Existing methods either use off-the-shelf models optimized for other tasks or rely on human assessment data to train specialized evaluators. These approaches are constrained to specific evaluation aspects and are difficult to scale with the increasing demands for finer-grained and more comprehensive evaluations. To address this issue, this work investigates the feasibility of using multimodal large language models (MLLMs) as a unified evaluator for AIGVs, leveraging their strong visual perception and language understanding capabilities. To evaluate the performance of automatic metrics in unified AIGV evaluation, we introduce a benchmark called UVE-Bench. UVE-Bench collects videos generated by state-of-the-art VGMs and provides pairwise human preference annotations across 15 evaluation aspects. Using UVE-Bench, we extensively evaluate 18 MLLMs. Our empirical results suggest that while advanced MLLMs (e.g., Qwen2VL-72B and InternVL2.5-78B) still lag behind human evaluators, they demonstrate promising ability in unified AIGV evaluation, significantly surpassing existing specialized evaluation methods. Additionally, we conduct an in-depth analysis of key design choices that impact the performance of MLLM-driven evaluators, offering valuable insights for future research on AIGV evaluation.

cs.CV↗

arXiv2026

Video-MSR: Benchmarking Multi-hop Spatial Reasoning Capabilities of MLLMs

Spatial reasoning has emerged as a critical capability for Multimodal Large Language Models (MLLMs), drawing increasing attention and rapid advancement. However, existing benchmarks primarily focus on single-step perception-to-judgment tasks, leaving scenarios requiring complex visual-spatial logical chains significantly underexplored. To bridge this gap, we introduce Video-MSR, the first benchmark specifically designed to evaluate Multi-hop Spatial Reasoning (MSR) in dynamic video scenarios. Video-MSR systematically probes MSR capabilities through four distinct tasks: Constrained Localization, Chain-based Reference Retrieval, Route Planning, and Counterfactual Physical Deduction. Our benchmark comprises 3,052 high-quality video instances with 4,993 question-answer pairs, constructed via a scalable, visually-grounded pipeline combining advanced model generation with rigorous human verification. Through a comprehensive evaluation of 20 state-of-the-art MLLMs, we uncover significant limitations, revealing that while models demonstrate proficiency in surface-level perception, they exhibit distinct performance drops in MSR tasks, frequently suffering from spatial disorientation and hallucination during multi-step deductions. To mitigate these shortcomings and empower models with stronger MSR capabilities, we further curate MSR-9K, a specialized instruction-tuning dataset, and fine-tune Qwen-VL, achieving a +7.82% absolute improvement on Video-MSR. Our results underscore the efficacy of multi-hop spatial instruction data and establish Video-MSR as a vital foundation for future research. The code and data will be available at https://github.com/ruiz-nju/Video-MSR.

cs.CV↗

arXiv2026

Learning the Basis: A Kolmogorov-Arnold Network Approach Embedding Green's Function Priors

The Method of Moments (MoM) is constrained by the usage of static, geometry-defined basis functions, such as the Rao-Wilton-Glisson (RWG) basis. This letter reframes electromagnetic modeling around a learnable basis representation rather than solving for the coefficients over a fixed basis. We first show that the RWG basis is essentially a static and piecewise-linear realization of the Kolmogorov-Arnold representation theorem. Inspired by this insight, we propose PhyKAN, a physics-informed Kolmogorov-Arnold Network (KAN) that generalizes RWG into a learnable and adaptive basis family. Derived from the EFIE, PhyKAN integrates a local KAN branch with a global branch embedded with Green's function priors to preserve physical consistency. It is demonstrated that, across canonical geometries, PhyKAN achieves sub-0.01 reconstruction errors as well as accurate, unsupervised radar cross section predictions, offering an interpretable, physics-consistent bridge between classical solvers and modern neural network models for electromagnetic modeling.

cs.LG↗

arXiv2025

Space Object Detection using Multi-frame Temporal Trajectory Completion Method

Space objects in Geostationary Earth Orbit (GEO) present significant detection challenges in optical imaging due to weak signals, complex stellar backgrounds, and environmental interference. In this paper, we enhance high-frequency features of GEO targets while suppressing background noise at the single-frame level through wavelet transform. Building on this, we propose a multi-frame temporal trajectory completion scheme centered on the Hungarian algorithm for globally optimal cross-frame matching. To effectively mitigate missing and false detections, a series of key steps including temporal matching and interpolation completion, temporal-consistency-based noise filtering, and progressive trajectory refinement are designed in the post-processing pipeline. Experimental results on the public SpotGEO dataset demonstrate the effectiveness of the proposed method, achieving an F_1 score of 90.14%.

cs.CV↗

arXiv2025

Probing compressed Higgsinos at the FASER experiment

In the Minimal Supersymmetric Standard Model (MSSM), compressed Higgsinos spectrum ($Δm^0 \lesssim 1$ GeV) occurs when $|μ| \ll |M_1|, |M_2|$ and ${\rm sign}(M_1\cdot M_2)<0$, which leads to a long-lived next-to-lightest neutralino. Such a long-lived neutralino could be copiously produced at the LHC, however escape the detection at the LHC main detectors. We examine the discovery potential at the FASER experiment and find that the FASER 2 could cover the neutral Higgsino mass up to about 130 GeV with mass splitting between 4 to 30 MeV. It is complementary to both the LHC Higgsino search in the $Δm^{0,\pm} \gtrsim 1$ GeV region, and displaced vertex and disappearing track searches of charginos with $Δm^\pm \lesssim 1$ GeV.

hep-ph↗

arXiv2025

RobustMask: Certified Robustness against Adversarial Neural Ranking Attack via Randomized Masking

Neural ranking models have achieved remarkable progress and are now widely deployed in real-world applications such as Retrieval-Augmented Generation (RAG). However, like other neural architectures, they remain vulnerable to adversarial manipulations: subtle character-, word-, or phrase-level perturbations can poison retrieval results and artificially promote targeted candidates, undermining the integrity of search engines and downstream systems. Existing defenses either rely on heuristics with poor generalization or on certified methods that assume overly strong adversarial knowledge, limiting their practical use. To address these challenges, we propose RobustMask, a novel defense that combines the context-prediction capability of pretrained language models with a randomized masking-based smoothing mechanism. Our approach strengthens neural ranking models against adversarial perturbations at the character, word, and phrase levels. Leveraging both the pairwise comparison ability of ranking models and probabilistic statistical analysis, we provide a theoretical proof of RobustMask's certified top-K robustness. Extensive experiments further demonstrate that RobustMask successfully certifies over 20% of candidate documents within the top-10 ranking positions against adversarial perturbations affecting up to 30% of their content. These results highlight the effectiveness of RobustMask in enhancing the adversarial robustness of neural ranking models, marking a significant step toward providing stronger security guarantees for real-world retrieval systems.

cs.CR↗

arXiv2025

COMPARE: Clinical Optimization with Modular Planning and Assessment via RAG-Enhanced AI-OCT: Superior Decision Support for Percutaneous Coronary Intervention Compared to ChatGPT-5 and Junior Operators

Background: While intravascular imaging, particularly optical coherence tomography (OCT), improves percutaneous coronary intervention (PCI) outcomes, its interpretation is operator-dependent. General-purpose artificial intelligence (AI) shows promise but lacks domain-specific reliability. We evaluated the performance of CA-GPT, a novel large model deployed on an AI-OCT system, against that of the general-purpose ChatGPT-5 and junior physicians for OCT-guided PCI planning and assessment. Methods: In this single-center analysis of 96 patients who underwent OCT-guided PCI, the procedural decisions generated by the CA-GPT, ChatGPT-5, and junior physicians were compared with an expert-derived procedural record. Agreement was assessed using ten pre-specified metrics across pre-PCI and post-PCI phases. Results: For pre-PCI planning, CA-GPT demonstrated significantly higher median agreement scores (5[IQR 3.75-5]) compared to both ChatGPT-5 (3[2-4], P<0.001) and junior physicians (4[3-4], P<0.001). CA-GPT significantly outperformed ChatGPT-5 across all individual pre-PCI metrics and showed superior performance to junior physicians in stent diameter (90.3% vs. 72.2%, P<0.05) and length selection (80.6% vs. 52.8%, P<0.01). In post-PCI assessment, CA-GPT maintained excellent overall agreement (5[4.75-5]), significantly higher than both ChatGPT-5 (4[4-5], P<0.001) and junior physicians (5[4-5], P<0.05). Subgroup analysis confirmed CA-GPT's robust performance advantage in complex scenarios. Conclusion: The CA-GPT-based AI-OCT system achieved superior decision-making agreement versus a general-purpose large language model and junior physicians across both PCI planning and assessment phases. This approach provides a standardized and reliable method for intravascular imaging interpretation, demonstrating significant potential to augment operator expertise and optimize OCT-guided PCI.

cs.AI↗

arXiv2025

SimFlow: Simplified and End-to-End Training of Latent Normalizing Flows

Normalizing Flows (NFs) learn invertible mappings between the data and a Gaussian distribution. Prior works usually suffer from two limitations. First, they add random noise to training samples or VAE latents as data augmentation, introducing complex pipelines including extra noising and denoising steps. Second, they use a pretrained and frozen VAE encoder, resulting in suboptimal reconstruction and generation quality. In this paper, we find that the two issues can be solved in a very simple way: just fixing the variance (which would otherwise be predicted by the VAE encoder) to a constant (e.g., 0.5). On the one hand, this method allows the encoder to output a broader distribution of tokens and the decoder to learn to reconstruct clean images from the augmented token distribution, avoiding additional noise or denoising design. On the other hand, fixed variance simplifies the VAE evidence lower bound, making it stable to train an NF with a VAE jointly. On the ImageNet $256 \times 256$ generation task, our model SimFlow obtains a gFID score of 2.15, outperforming the state-of-the-art method STARFlow (gFID 2.40). Moreover, SimFlow can be seamlessly integrated with the end-to-end representation alignment (REPA-E) method and achieves an improved gFID of 1.91, setting a new state of the art among NFs.

cs.CV↗

arXiv2025

Adversarial Attack-Defense Co-Evolution for LLM Safety Alignment via Tree-Group Dual-Aware Search and Optimization

Large Language Models (LLMs) have developed rapidly in web services, delivering unprecedented capabilities while amplifying societal risks. Existing works tend to focus on either isolated jailbreak attacks or static defenses, neglecting the dynamic interplay between evolving threats and safeguards in real-world web contexts. To mitigate these challenges, we propose ACE-Safety (Adversarial Co-Evolution for LLM Safety), a novel framework that jointly optimize attack and defense models by seamlessly integrating two key innovative procedures: (1) Group-aware Strategy-guided Monte Carlo Tree Search (GS-MCTS), which efficiently explores jailbreak strategies to uncover vulnerabilities and generate diverse adversarial samples; (2) Adversarial Curriculum Tree-aware Group Policy Optimization (AC-TGPO), which jointly trains attack and defense LLMs with challenging samples via curriculum reinforcement learning, enabling robust mutual improvement. Evaluations across multiple benchmarks demonstrate that our method outperforms existing attack and defense approaches, and provides a feasible pathway for developing LLMs that can sustainably support responsible AI ecosystems.

cs.CR↗

arXiv2025

FingerCap: Fine-grained Finger-level Hand Motion Captioning

Understanding fine-grained human hand motion is fundamental to visual perception, embodied intelligence, and multimodal communication. In this work, we propose Fine-grained Finger-level Hand Motion Captioning (FingerCap), which aims to generate textual descriptions that capture detailed finger-level semantics of hand actions. To support this task, we curate FingerCap-40K, a large-scale corpus of 40K paired hand-motion videos and captions spanning two complementary sources: concise instruction-style finger motions and diverse, naturalistic hand-object interactions. To enable effective evaluation, we employ HandJudge, a LLM-based rubric that measures finger-level correctness and motion completeness. Temporal sparsity remains a fundamental bottleneck for current Video-MLLMs, since sparse RGB sampling is insufficient to capture the subtle, high-frequency dynamics underlying fine finger motions. As a simple and compute-friendly remedy, we introduce FiGOP (Finger Group-of-Pictures), which pairs each RGB keyframe with subsequent hand keypoints until the next keyframe. A lightweight temporal encoder converts the keypoints into motion embeddings and integrates them with RGB features. FiGOP adapts the classic GOP concept to finger motion, recovering fine temporal cues without increasing RGB density. Experiments on FingerCap-40K show that strong open- and closed-source Video-MLLMs still struggle with finger-level reasoning, while our FiGOP-augmented model yield consistent gains under HandJudge and human studies.

cs.CV↗

arXiv2025

QHSC: The Quasar Candidate Catalog for the Hyper Suprime-Cam Subaru Strategic Program

The Hyper Suprime-Cam Subaru Strategic Program (HSC-SSP) is a deep wide-field multi-band imaging survey consisting of three layers (Wide, Deep, and UltraDeep), with the Wide layer covering $\sim 1470$ deg$^2$ to a depth of $i \sim 26$ mag. We present the QHSC catalog, a machine-learning selected sample of quasar candidates with photometric redshifts in the Wide layer of the HSC-SSP survey (Public Data Release 3). The full QHSC catalog contains four distinct samples: a master sample with HSC-only photometry, an HSC+WISE sample, and two samples including near-infrared data from UKIDSS and VISTA, denoted as GoldenU and GoldenV. For each sample, an XGBoost classifier is trained and evaluated using independent spectroscopic test sets from HETDEX, VVDS, and zCOSMOS-bright. The numbers of quasar candidates in the QHSC catalog are 1,184,574 (master), 371,777 (HSC+WISE), 87,460 (GoldenU), and 120,572 (GoldenV), with respective completeness values of 85.3%, 92.7%, 89.8%, and 91.3%. We develop ensemble photometric redshift estimators based on bootstrap aggregating (bagging) of multiple XGBoost regressors, achieving outlier fractions of 21.7%, 13.1%, 9.5%, and 10.7% for these samples. The catalog provides quasar classification probabilities (p_QSO), enabling construction of purer subsamples via thresholding. This work offers a valuable resource for studies of quasars and cosmology, and highlights the effectiveness of machine learning for quasar selection in future wide and deep imaging surveys. The catalog is publicly available at https://doi.org/10.5281/zenodo.17515028.

astro-ph.GA↗

arXiv2025

Near-Lossless Model Compression Enables Longer Context Inference in DNA Large Language Models

Trained on massive cross-species DNA corpora, DNA large language models (LLMs) learn the fundamental "grammar" and evolutionary patterns of genomic sequences. This makes them powerful priors for DNA sequence modeling, particularly over long ranges. However, two major constraints hinder their use in practice: the quadratic computational cost of self-attention and the growing memory required for key-value (KV) caches during autoregressive decoding. These constraints force the use of heuristics such as fixed-window truncation or sliding windows, which compromise fidelity on ultra-long sequences by discarding distant information. We introduce FOCUS (Feature-Oriented Compression for Ultra-long Self-attention), a progressive context-compression module that can be plugged into pretrained DNA LLMs. FOCUS combines the established k-mer representation in genomics with learnable hierarchical compression: it inserts summary tokens at k-mer granularity and progressively compresses attention key and value activations across multiple Transformer layers, retaining only the summary KV states across windows while discarding ordinary-token KV. A shared-boundary windowing scheme yields a stationary cross-window interface that propagates long-range information with minimal loss. We validate FOCUS on an Evo-2-based DNA LLM fine-tuned on GRCh38 chromosome 1 with self-supervised training and randomized compression schedules to promote robustness across compression ratios. On held-out human chromosomes, FOCUS achieves near-lossless fidelity: compressing a 1 kb context into only 10 summary tokens (about 100x) shifts the average per-nucleotide probability by only about 0.0004. Compared to a baseline without compression, FOCUS reduces KV-cache memory and converts effective inference scaling from O(N^2) to near-linear O(N), enabling about 100x longer inference windows on commodity GPUs with near-lossless fidelity.

q-bio.GN↗

arXiv2025

Systematic Analysis of Changing-look AGN Variability Using ZTF Light Curves

Changing-look active galactic nuclei (CLAGNs) are a unique population of AGNs that exhibit the appearance (turn-on) or disappearance (turn-off) of broad emission lines. This study aims to explore the intrinsic mechanisms of CLAGNs by investigating their photometric variability using data from the Zwicky Transient Facility (ZTF), which has provided high-cadence observations over the past five years. By visual inspections, we construct a sample of 152 CLAGNs from the literature, all of which show spectral transitions and large optical variability in their ZTF light curves. By analyzing 90 of these CLAGNs and the control samples of Type 1 AGNs, Type 2 AGNs, and extremely variable quasars (EVQs), matched in redshift ($0.2<z<0.8$) and supermassive black hole mass, we compare the color variability, structure function (SF), and variability metric $σ_{\mathrm{QSO}}$, which quantifies how closely the light curves resemble a damped random walk (DRW) model. We find that while CLAGNs and EVQs differ from typical Type 1 and Type 2 AGNs in bolometric luminosity and Eddington ratio, the on/off-state CLAGNs share similar variability patterns with the overall CLAGN population, and distinct from EVQ, Type 1 and Type 2 AGNs. This suggests that 'on' and 'off' CLAGNs are not simply equivalent to Type 1 and Type 2 AGNs, respectively. Instead of undergoing genuine transitions between two AGN types, CLAGNs may inhabit a critical state where moderate fluctuations in accretion rate lead to the temporary spectral changes.

astro-ph.GA↗

arXiv2025

Transfer learning discovery of molecular modulators for perovskite solar cells

The discovery of effective molecular modulators is essential for advancing perovskite solar cells (PSCs), but the research process is hindered by the vastness of chemical space and the time-consuming and expensive trial-and-error experimental screening. Concurrently, machine learning (ML) offers significant potential for accelerating materials discovery. However, applying ML to PSCs remains a major challenge due to data scarcity and limitations of traditional quantitative structure-property relationship (QSPR) models. Here, we apply a chemical informed transfer learning framework based on pre-trained deep neural networks, which achieves high accuracy in predicting the molecular modulator's effect on the power conversion efficiency (PCE) of PSCs. This framework is established through systematical benchmarking of diverse molecular representations, enabling lowcost and high-throughput virtual screening over 79,043 commercially available molecules. Furthermore, we leverage interpretability techniques to visualize the learned chemical representation and experimentally characterize the resulting modulator-perovskite interactions. The top molecular modulators identified by the framework are subsequently validated experimentally, delivering a remarkably improved champion PCE of 26.91% in PSCs.

cond-mat.mtrl-sci↗