arXiv subjects

Yue Zhang

Publications and source records attributed to Yue Zhang.

At least 127 records · Page 7Linked to original sources

arXiv2026

Neural Refractive Index Primitives for Flame Field Reconstruction Using Background-Oriented Schlieren

An improved neural refractive-index-primitive method for background-oriented schlieren tomography is presented, enabling continuous three-dimensional reconstruction of refractive-index fields using a compact multilayer perceptron. The method adopts the refractive-index field as the sole neural primitive and integrates multiresolution hash encoding, automatic-discrete gradient losses, and a three-dimensional mask to enable fast convergence and high-resolution, spatially coherent reconstructions. Tests on numerical combustion phantoms and real flame data demonstrate accurate recovery of both large-scale structures and fine-scale turbulence, strong robustness to noise, and clear advantages over frequency-encoding-based and voxel-based reconstruction methods.

physics.flu-dyn↗

arXiv2026

Usability as a Weapon: Attacking the Safety of LLM-Based Code Generation via Usability Requirements

Large Language Models (LLMs) are increasingly used for automated software development, making their ability to preserve secure coding practices critical. In practice, however, many security requirements are implicit or underspecified, whereas usability requirements are explicit and high-signal. This asymmetry motivates our investigation of usability pressure as a practical attack surface: realistic usability-oriented requirements (e.g., new features, performance constraints, or simplicity demands) can cause coding LLMs to satisfy explicit usability goals while silently dropping implicit security constraints -- a form of reward hacking. We formalize this threat as UPAttack and propose U-SPLOIT, an automated framework to craft UPAttack that (i) selects tasks where a model is initially secure, (ii) synthesizes usability pressures by identifying usability rewards of insecure alternatives across three vectors (Functionality, Implementation, Trade-off), and (iii) verifies security regression via both existing test cases and dynamically generated exploit payloads. Across 75 seed scenarios (25 CWEs x 3 cases), spanning multiple languages (Python, C, and JavaScript), U-SPLOIT achieves attack success rates up to 98.1% on multiple state-of-the-art models (e.g., GPT-5.2-chat and Gemini-3-Flash-Preview).

cs.CR↗

arXiv2026

FAAST: Forward-Only Associative Learning via Closed-Form Fast Weights for Test-Time Supervised Adaptation

Adapting pretrained models typically involves a trade-off between the high training costs of backpropagation and the heavy inference overhead of memory-based or in-context learning. We propose FAAST, a forward-only associative adaptation method that analytically compiles labeled examples into fast weights in a single pass. By eliminating memory or context dependence, FAAST achieves constant-time inference and decouples task adaptation from pretrained representation. Across image classification and language modeling benchmarks, FAAST matches or exceeds backprop-based adaptation while reducing adaptation time by over 90% and is competitive to memory/context-based adaptation while saving memory usage by up to 95%. These results demonstrate FAAST as a highly efficient, scalable solution for supervised task adaptation, particularly for resource-constrained models. We release the code and models at https://github.com/baoguangsheng/faast.

cs.LG↗

arXiv2026

UAV-VL-R1: Generalizing Vision-Language Models via Supervised Fine-Tuning and Multi-Stage GRPO for UAV Visual Reasoning

Recent advances in vision-language models (VLMs) have demonstrated strong generalization in natural image tasks. However, their performance often degrades on unmanned aerial vehicle (UAV)-based aerial imagery, which features high resolution, complex spatial semantics, and strict real-time constraints. These challenges limit the applicability of general-purpose VLMs to structured aerial reasoning tasks. To address these challenges, we propose UAV-VL-R1, a lightweight VLM explicitly designed for aerial visual reasoning. It is trained using a hybrid method that combines supervised fine-tuning (SFT) and multi-stage reinforcement learning (RL). We leverage the group relative policy optimization (GRPO) algorithm to promote structured and interpretable reasoning through rule-guided rewards and intra-group policy alignment. To support model training and evaluation, we introduce a high-resolution visual question answering dataset named HRVQA-VL, which consists of 50,019 annotated samples covering eight UAV-relevant reasoning tasks, including object counting, transportation recognition, and spatial scene inference. Experimental results show that UAV-VL-R1 achieves a 48.17% higher zero-shot accuracy than the Qwen2-VL-2B-Instruct baseline and even outperforms its 72B-scale variant, which is 36x larger, on multiple tasks. Ablation studies reveal that while SFT improves semantic alignment, it may reduce reasoning diversity in mathematical tasks. GRPO-based RL compensates for this limitation by enhancing logical flexibility and the robustness of inference. Additionally, UAV-VL-R1 requires only 3.9GB of memory under FP16 inference and can be quantized to 2.5GB with INT8, supporting real-time deployment on resource-constrained UAV platforms.

cs.CV↗

arXiv2026

Triple-Phase Sequential Fusion Network for Hepatobiliary Phase Liver MRI Synthesis

Gadoxetate disodium-enhanced MRI is essential for the detection and characterization of hepatocellular carcinoma. However, acquisition of the hepatobiliary phase (HBP) requires a prolonged post-contrast delay, which reduces workflow efficiency and increases the risk of motion artifacts. In this study, we propose a Triple-Phase Sequential Fusion Network (TriPF-Net) to synthesize HBP images by leveraging the sequential information from pre-HBP sequences: while T1-weighted imaging serves as the indispensable baseline, the model adaptively integrates arterial-phase (AP) and venous-phase (VP) features when available. By modeling the tissue-specific contrast uptake and excretion dynamics across these three phases, TriPF-Net ensures robust HBP synthesis even under the stochastic absence of one or both dynamic contrast-enhanced sequences. The framework comprises an Enhanced Region-Guided Encoder and a Dynamic Feature Unification Module, optimized with a Region-Guided Sequential Fusion Loss to maintain physiological consistency. In addition, clinical variables, including age, sex, total bilirubin, and albumin, are incorporated to enhance physiological consistency. Compared with conventional methods, TriPF-Net achieved superior performance on datasets from two centers. On the internal dataset, the model achieved an MAE of 10.65, a PSNR of 23.27, and an SSIM of 0.76. On the external validation dataset, the corresponding values were 12.41, 23.11, and 0.78, respectively. This flexible solution enhances clinical workflow and lesion depiction, potentially eliminating the need for delayed HBP acquisition in HCC imaging.

eess.IV↗

arXiv2026

HOI-aware Adaptive Network for Weakly-supervised Action Segmentation

In this paper, we propose an HOI-aware adaptive network named AdaAct for weakly-supervised action segmentation. Most existing methods learn a fixed network to predict the action of each frame with the neighboring frames. However, this would result in ambiguity when estimating similar actions, such as pouring juice and pouring coffee. To address this, we aim to exploit temporally global but spatially local human-object interactions (HOI) as video-level prior knowledge for action segmentation. The long-term HOI sequence provides crucial contextual information to distinguish ambiguous actions, where our network dynamically adapts to the given HOI sequence at test time. More specifically, we first design a video HOI encoder that extracts, selects, and integrates the most representative HOI throughout the video. Then, we propose a two-branch HyperNetwork to learn an adaptive temporal encoder, which automatically adjusts the parameters based on the HOI information of various videos on the fly. Extensive experiments on two widely-used datasets including Breakfast and 50Salads demonstrate the effectiveness of our method under different evaluation metrics.

cs.CV↗

arXiv2026

AgentDID: Trustless Identity Authentication for AI Agents

AI agents are autonomous entities that can be instantiated on demand, migrate across platforms, and interact with other agents or services without continuous human supervision. In such environments, identity is critical for establishing reliable interaction semantics among agents that may lack prior trust relationships. However, existing identity and access management mechanisms are designed for human users or static machines, assuming centralized enrollment, persistent identifiers, and stable execution contexts. These assumptions do not hold for AI agents, whose identities are self-managed, short-lived, and tightly coupled with their execution state and capabilities. We study the problem of identity authentication and state verification for AI agents and identify three challenges: (1) supporting self-managed identities for autonomously created agents, (2) enabling authentication under large-scale, concurrent interactions, and (3) verifying agents' dynamic execution state, such as whether their context and capabilities remain valid at interaction time. To address these challenges, we present AgentDID, a decentralized framework for identity authentication and state verification. AgentDID leverages decentralized identifiers (DIDs) and verifiable credentials (VCs), enabling agents to manage their own identities and authenticate across systems without centralized control. To address the limitations of static credential-based approaches, AgentDID introduces a challenge-response mechanism that allows verifiers to validate an agent's execution conditions at interaction time. We implement AgentDID in compliance with W3C standards and evaluate it through throughput experiments with multiple concurrent agents. Results show that the system achieves scalable identity authentication and state verification, demonstrating its potential to support large populations of AI agents.

cs.CR↗

arXiv2026

Precision extraction of the deuteron electric polarizability via the Baldin sum rule with full low-energy coverage

The photodisintegration cross sections of the deuteron have been systematically measured over the photon energy range of 2.33-19.65 MeV at the Shanghai Laser Electron Gamma Source (SLEGS). By applying the well-established Baldin sum rule to the newly obtained data, the sum of the electric and magnetic dipole polarizabilities of the deuteron is extracted for the first time based solely on a dense and continuous experimental dataset, yielding αE +\{beta}M = 0.719\pm0.009stat\pm0.014algo\pm0.023syst fm3 . With theoretical values of the magnetic polarizability \{beta}M calculated from the pionless effective field theory, a new value of the electric polarizability is obtained as αE = 0.637 \pm 0.009stat \pm 0.014algo \pm 0.023syst \pm 0.004theo fm3 , which is in excellent agreement with current theoretical predictions. This result resolves the previous discrepancy between experimental measurements from elastic scattering and theory, providing a high-precision benchmark for nuclear interaction models.

nucl-ex↗

arXiv2026

Revisit viscous shock tube at low Reynolds number

The viscous shock tube is a canonical test case for assessing Navier-Stokes (NS) solvers in the continuum-flow regime, widely used to validate numerical accuracy and probe flow physics. It features a rich set of interacting structures-shock and rarefaction waves, contact discontinuities, boundary layers, and their coupling-spanning multiple spatial and temporal scales. However, NS-based modeling, which presumes near-equilibrium behavior, may fail to capture important non-equilibrium effects even in nominally continuum conditions. This study investigates the viscous shock tube at low Reynolds numbers and demonstrates the presence of non-equilibrium phenomena within the conventional continuum regime. To obtain physically consistent solutions across scales, we employ the unified gas-kinetic scheme (UGKS) and compare its results with NS solutions computed using the gas-kinetic scheme (GKS). Discrepancies between UGKS and GKS solutions reveal pronounced non-equilibrium effects in regions where shock waves interact with boundary layers. For continuum flows at high Mach and low Reynolds numbers, such multiscale non-equilibrium transport becomes important, underscoring the need for multiscale methods in analysis and prediction.

physics.flu-dyn↗

arXiv2026

Complexity of quantum states in the stabilizer formalism

We initiate an investigation into a notion of state complexity for discrete-variable quantum systems. Specifically, we propose an information-theoretic quantifier for the complexity of quantum states within the stabilizer formalism of quantum computation. This is achieved by leveraging the symmetric Jordan product (associated with classicality) and the skew-symmetric Lie product (linked to quantumness) between the square root of the quantum state and the Heisenberg-Weyl displacement operators. We establish the fundamental properties of this quantifier and demonstrate that state complexity is closely related to the nonstabilizerness of quantum states via the $L^4$-norm of their characteristic functions.

quant-ph↗

arXiv2026

SAGE: Signal-Amplified Guided Embeddings for LLM-based Vulnerability Detection

Software vulnerabilities are a primary threat to modern infrastructure. While static analysis and Graph Neural Networks have long served as the foundation for vulnerability detection, the emergence of Large Language Models (LLMs) has introduced a transformative paradigm driven by superior semantic reasoning and cross-environment generalization. However, in the context of LLM-based vulnerability detection, we identify a fundamental bottleneck in these models termed \textbf{Signal Submersion}: a state where features related to vulnerability are activated internally but numerically overwhelmed by dominant functional semantics. To address this, we propose \textbf{SAGE} (\textbf{S}ignal-\textbf{A}mplified \textbf{G}uided \textbf{E}mbeddings), a framework that shifts from passive signal submersion to active signal recovery. SAGE integrates task-conditional Sparse Autoencoders (SAEs) to isolate and amplify these faint vulnerability signals. Extensive evaluations on BigVul, PrimeVul, and PreciseBugs demonstrate that SAGE achieves state-of-the-art performance. Notably, SAGE mitigates Signal Submersion by increasing the internal Signal-to-Noise Ratio (SNR) by 12.7$\times$ via sparse manifold projection. This mechanistic intervention enables a 7B model to achieve up to 318\% Matthews Correlation Coefficient (MCC) gains on unseen distributions and a 319\% gain on classic datasets. By maintaining robust performance across 13 programming languages and outperforming 34B baselines, SAGE establishes a more efficient and scalable path to software security than simple parameter scaling.

cs.CR↗

arXiv2026

Photon radiation induced by rescattering in strong-interacting medium with a magnetic field

The photon radiation induced by rescattering in a magnetized medium is investigated in relativistic heavy-ion collisions. Within the high-energy limit, the photon emission rate and the associated electromagnetic energy loss are derived using the Gyulassy-Levai-Vitev formalism at first order in opacity, for a quark jet propagating a quark-gluon plasma under a background magnetic field. Quantitative analysis shows a slight suppression of the overall photon radiation over a broad range of jet energies in this process. This reduction in photon yield consequently leads to a moderate decrease in the electromagnetic energy loss of the jet. Our results contribute to a better understanding of the electromagnetic properties of strongly interacting matter in high-energy nucleus-nucleus collisions and motivate experimental comparison of photon yields from quark-gluon plasma with similar properties but distinct magnetic field strengths.

nucl-th↗

arXiv2026

Advancing MAPF Toward the Real World: A Scalable Multi-Agent Realistic Testbed (SMART)

We present Scalable Multi-Agent Realistic Testbed (SMART), a realistic and efficient software tool for evaluating Multi-Agent Path Finding (MAPF) algorithms. MAPF focuses on planning collision-free paths for a group of robots. While state-of-the-art MAPF planners can plan paths for hundreds of robots in seconds, they often rely on simplified robot models, making their real-world performance unclear. Researchers typically lack access to hundreds of physical robots in laboratory settings to evaluate the algorithms. Meanwhile, industrial professionals who lack expertise in MAPF require an easy-to-use simulator to efficiently test and understand the performance of MAPF planners in their specific settings. SMART fills this gap with several advantages: (1) SMART uses physics-engine-based simulators to create realistic simulation environments, accounting for complex real-world factors such as robot kinodynamics and execution uncertainties, (2) SMART uses an execution monitor framework based on the Action Dependency Graph, facilitating seamless integration with various MAPF planners and robot models, and (3) SMART scales to thousands of robots. The code is publicly available at https://github.com/smart-mapf/smart with an online service available at https://smart-mapf.github.io/demo/.

cs.RO↗

arXiv2026

LLMEval-Fair: A Large-Scale Longitudinal Study on Robust and Fair Evaluation of Large Language Models

Existing evaluation of Large Language Models (LLMs) on static benchmarks is vulnerable to data contamination and leaderboard overfitting, critical issues that obscure true model capabilities. To address this, we introduce LLMEval-Fair, a framework for dynamic evaluation of LLMs. LLMEval-Fair is built on a proprietary bank of 220k graduate-level questions, from which it dynamically samples unseen test sets for each evaluation run. Its automated pipeline ensures integrity via contamination-resistant data curation, a novel anti-cheating architecture, and a calibrated LLM-as-a-judge process achieving 90% agreement with human experts, complemented by a relative ranking system for fair comparison. A 30-month longitudinal study of nearly 60 leading models reveals a performance ceiling on knowledge memorization and exposes data contamination vulnerabilities undetectable by static benchmarks. The framework demonstrates exceptional robustness in ranking stability and consistency, providing strong empirical validation for the dynamic evaluation paradigm. LLMEval-Fair offers a robust and credible methodology for assessing the true capabilities of LLMs beyond leaderboard scores, promoting the development of more trustworthy evaluation standards. Our code and data are publicly available at https://github.com/llmeval/LLMEval-Fair.

cs.CL↗

arXiv2026

WisPaper: Your AI Scholar Search Engine

We present \textsc{WisPaper}, an end-to-end agent system that transforms how researchers discover, organize, and track academic literature. The system addresses two fundamental challenges. (1)~\textit{Semantic search limitations}: existing academic search engines match keywords but cannot verify whether papers truly address complex research questions; and (2)~\textit{Workflow fragmentation}: researchers must manually stitch together separate tools for discovery, organization, and monitoring. \textsc{WisPaper} tackles these through three integrated modules. \textbf{Scholar Search} combines rapid keyword retrieval with \textit{Deep Search}, in which an agentic model, \textsc{WisModel}, validates candidate papers against user queries through structured reasoning. Discovered papers flow seamlessly into \textbf{Library} with one click, where systematic organization progressively builds a user profile that sharpens the recommendations of \textbf{AI Feeds}, which continuously surfaces relevant new publications and in turn guides subsequent exploration, closing the loop from discovery to long-term awareness. On TaxoBench, \textsc{WisPaper} achieves 22.26\% recall, surpassing the O3 baseline (20.92\%). Furthermore, \textsc{WisModel} attains 93.70\% validation accuracy, effectively mitigating retrieval hallucinations.

cs.IR↗

arXiv2026

Unified Gas-Kinetic Scheme for Unsteady Multiscale Flows with Moving Boundaries

Simulating multiscale flows with moving boundaries, such as hypersonic multi-body separation and flows in micro-electro-mechanical systems (MEMS), requires robust numerical methods that couple mesh deformation with complex flow physics. This paper presents a hybrid overlapping moving-mesh technique developed within the unified gas-kinetic scheme (UGKS). To mitigate the Courant-Friedrichs-Lewy (CFL) constraint, we extend the implicit unsteady UGKS solver to support moving meshes, incorporating memory-efficient data handling and parallel computing optimizations to maximize computational efficiency. Validated against hypersonic multi-body separation and thermal rarefied MEMS flows, the proposed scheme accurately resolves complex, dynamic multiscale phenomena. The results confirm that this robust and efficient method provides a highly reliable tool for modeling dynamic flow interactions in complex geometric configurations.

physics.flu-dyn↗

arXiv2026

3DrawAgent: Teaching LLM to Draw in 3D with Early Contrastive Experience

Sketching in 3D space enables expressive reasoning about shape, structure, and spatial relationships, yet generating 3D sketches through natural language remains a major challenge. In this work, we introduce 3DrawAgent, a training-free, language-driven framework for 3D sketch generation that leverages large language models (LLMs) to sequentially draw 3D Bezier curves under geometric feedback. Unlike prior 2D sketch agents, our method introduces a relative experience optimization strategy that adapts the recently proposed Group Reward Policy Optimization (GRPO) paradigm. Instead of relying on explicit ground-truth supervision, we construct pairwise comparisons among generated sketches, with each pair consisting of a relatively better and a worse result based on CLIP-based perceptual rewards and LLM-based fine-grained qualitative assessment. These experiences are then used to iteratively refine the prior knowledge of 3D drawing, enabling black-box reinforcement of the model's 3D awareness. This design allows our model to self-improve its spatial understanding and drawing quality without parameter updates. Experiments show that 3DrawAgent can generate complex and coherent 3D Bezier sketches from diverse textual prompts, exhibit emergent geometric reasoning, and generalize to novel shapes, establishing a new paradigm for advancing the field of training-free 3D sketch intelligence.

cs.CV↗

arXiv2026

PaddleOCR-VL-1.5: Towards a Multi-Task 0.9B VLM for Robust In-the-Wild Document Parsing

We introduce PaddleOCR-VL-1.5, an upgraded model achieving a new state-of-the-art (SOTA) accuracy of 94.5% on OmniDocBench v1.5. To rigorously evaluate robustness against real-world physical distortions, including scanning, skew, warping, screen-photography, and illumination, we propose the Real5-OmniDocBench benchmark. Experimental results demonstrate that this enhanced model attains SOTA performance on the newly curated benchmark. Furthermore, we extend the model's capabilities by incorporating seal recognition and text spotting tasks, while remaining a 0.9B ultra-compact VLM with high efficiency. Code: https://github.com/PaddlePaddle/PaddleOCR

cs.CV↗