arXiv subjects

Jinrui Zhang

Publications and source records attributed to Jinrui Zhang.

At least 19 recordsLinked to original sources

arXiv2026

Pulsed heterodyne detection enables fiber-compatible, high-specificity Brillouin biomechanics in intact tissue and the living brain

Brillouin microscopy provides label-free, three-dimensional mechanical characterization of biological specimens, but current dispersive detection imposes two limits: the fiber background folds onto the sample spectrum, precluding single-fiber operation, and a ~250 MHz dispersion-induced instrumental broadening blurs mechanically distinct components within a focal volume. Here, we introduce pulsed heterodyne Brillouin detection (PHBD), which retrieves the spectrum electronically from temporal beat notes, overcoming both limitations. The fiber background beats outside the detection band and is rejected; elimination of dispersive broadening yields 25-MHz spectrometer resolution. Pulsed excitation reaches Brillouin-signal-shot-noise-limited detection, attaining 9.0-MHz shift precision in 3 ms at 30 mW in water with 53-fold improvement in energy efficiency over continuous-wave excitation. Through a bare 125-um fiber, PHBD resolves regional contrast along a 4-mm insertion track in the living mouse brain; in free space, it resolves distinct Brillouin components from the cell wall and adjacent cytoplasm in strongly scattering Arabidopsis root tips with epi-mode.

physics.optics↗

arXiv2026

GraphFAS: A Distributed System for Automated Graph Feature Generation and Selection in Industrial Transaction Networks

Industrial fraud detection often relies on costly expert-crafted features that overlook graph-structured relational signals, while GNNs often do not meet the interpretability and deployment requirements of financial risk control. We propose GraphFAS (Graph Feature Automated Selection), a distributed feature selection procedure based on Boruta that bridges this gap through: (1) a non-parametric graph feature generation module that constructs explicit, interpretable structural features via multi-hop subgraph extraction and multi-scale aggregation without learned parameters; and (2) an automated distributed feature selection algorithm extending Boruta with median-based aggregation across partitions to robustly identify informative features at scale with minimal domain expertise. Compared with end-to-end GNN pipelines, GraphFAS decouples feature aggregation from model training, enabling direct integration with tabular models and direct compatibility with TreeSHAPbased explanations. Deployed in Alipay, GraphFAS delivers orderof-magnitude improvements in engineering efficiency while showing strong performance against expert-driven and graph-learning baselines on large-scale graphs.

cs.LG↗

arXiv2026

A covariance-based reduced-order framework for solving acoustic scattering problems

This paper presents a physics-aware reduced-order method (ROM) for the efficient computation of wave-scattering problems. Standard model order reduction techniques, typically treating scattering as generic parameterized systems, frequently overlook the underlying physical structure, limiting their effectiveness in practice. To address this limitation, we propose an algorithmic framework that utilizes the intrinsic low-rank structure of the induced contrast source density. By modeling the incident wave as a random variable governed by a specified prior probability measure, we formulate the contrast source as a spatial random field whose covariance function captures essential spatial correlation and physical interactions. The reduced-order basis is then constructed via the Karhunen-Loève (KL) expansion, effectively extracting the dominant features from the scattering process to resolve multiple scattering scenarios. A central algorithmic contribution is the efficient reconstruction of the covariance matrix for arbitrary scatterer geometries and specified incident wave priors. To circumvent the prohibitive computational cost of assembling high-fidelity covariance matrices, we introduce a non-intrusive, physics-informed graph neural network (GNN) surrogate to learn the complex mapping from scatterer geometry to the source correlation kernel, enabling a highly efficient offline-online computational paradigm suitable for large-scale scattering configurations. Extensive numerical experiments demonstrate that the proposed framework achieves robust computational acceleration over full-order models without sacrificing accuracy.

math.NA↗

arXiv2026

A fast solver for many-particle elastic scattering in layered media

This paper proposes a fast solver for time-harmonic elastic scattering by multiple particles embedded in layered media, with either Dirichlet or Neumann boundary conditions imposed on the particle surfaces. Such problems arise in many important applications, including composite material optimization, nondestructive testing, and subsurface imaging. They are computationally challenging because of strong multiple scattering interactions among the particles and the layered interface. The proposed method represents the layered medium contribution through Sommerfeld integrals and couples this representation with a well-posed boundary integral formulation for the particle scattering problem. High-order integral equation discretization and scattering matrix are used to handle particles of general shape, while multiple scattering theory provides an efficient description of particle interactions. To reduce the cost for large particle systems, the resulting multiple scattering computation is further accelerated by the fast multipole method. The main formulation is developed in both two and three dimensions. Numerical experiments for rigid and traction-free particles validate the accuracy of the formulation, and demonstrate its flexibility in both direct scattering simulations and inverse scattering applications.

math.NA↗

arXiv2026

Spectral Convergence of the Multipole Expansion Method for Acoustic Scattering in Three Dimensions

Multiple scattering is a fundamental wave interaction phenomenon in acoustics and electromagnetics. The multipole expansion method (MEM) is the basis of many fast algorithms, such as the fast multipole method (FMM), for such problems. However, due to the infinitely many wave reflections involved, its convergence in three dimensions remains unexplored. In this paper, we prove spectral convergence of the MEM for time-harmonic acoustic scattering by finitely many well-separated spheres in three dimensions. Using a diagonally preconditioned single-layer formulation, we analyze the degree-$N$ truncated system in a natural spherical harmonic energy space. We split the interaction truncation into target-side and source-side high-degree parts and choose a different representation for each: a projected Green-kernel representation for the former and degree-wise estimates of a translated spherical wave family for the latter. The resulting argument, based on Parseval's identity and the spherical harmonic addition theorem, provides a general framework for the convergence analysis of MEM and reveals the geometric and physical origins of the convergence factors. We also obtain a sharper estimate through the first-transfer analysis. Numerical experiments confirm the predicted spectral decay and the geometric convergence factor. This paves the way for the convergence analysis of a large class of fast algorithms for multiple scattering.

math.NA↗

arXiv2026

$\mathcal{P}^3$: Toward Versatile Embodied Agents

Embodied agents have demonstrated promising capabilities in interacting with physical environments. Yet, versatile embodied agents face three core bottlenecks: dynamic environmental perception, open tool access, and complex multi-task planning. Prior methods depend entirely on tool feedback to track scene changes and task progress, leading to poor real-time adaptability, error accumulation, and limited tool compatibility; multi-task scheduling is also understudied due to the difficulty of handling task dependencies and conflicting priorities. To address these limitations, we propose $\mathcal P^3$, a unified framework integrating real-time perception and dynamic scheduling, which perceives task-relevant information actively from the environment, plugs and utilizes tools without feedback requirements, and plans multi-task execution by prioritizing urgent tasks and dynamically adjusting task order based on dependencies. We additionally build the Active Task Perception (ATP) benchmark to quantitatively measure VLMs' capacity for active scene understanding and task proposal. Evaluations on the ATP benchmark verify that multiple VLMs can detect and propose active tasks, and comprehensive real-world robot experiments prove our method bridges the gap between benchmarks and practical deployment, yielding transferable general-purpose embodied agents. Code and data are available at https://github.com/fz-zsl/P3.

cs.RO↗

arXiv2026

TIIF-Bench: How Does Your T2I Model Follow Your Instructions?

The rapid advancements of Text-to-Image (T2I) models have ushered in a new phase of AI-generated content, marked by their growing ability to interpret and follow user instructions. However, existing T2I model evaluation benchmarks fall short in limited prompt diversity and complexity, as well as coarse evaluation metrics, making it difficult to evaluate the fine-grained alignment performance between textual instructions and generated images. In this paper, we present TIIF-Bench Text-to-Image Instruction Following Benchmark), aiming to systematically assess T2I models' ability in interpreting and following intricate textual instructions. TIIF-Bench comprises 5,000 prompts organized along multiple dimensions and categorized into three levels of difficulty and complexity. To rigorously evaluate robustness to prompt length, each prompt is provided in both short and long versions with identical core semantics. We further propose a novel Global Normalized Edit Distance (GNED) metric for text rendering and provide aspect-ratio-diverse reference images for each prompt to assess style control. In addition, we collect 100 high-quality designer-level prompts covering diverse scenarios for comprehensive evaluation. To enable scalable and fine-grained evaluation, we explore the best paradigm for leveraging the world knowledge encoded in large Vision-Language Models (VLMs) as automated binary evaluators. Through extensive ablations, we develop a fully reproducible evaluator that provides interpretable reasoning and reliable verification, enabling our benchmark to discern subtle variations in T2I model outputs. Through comprehensive benchmarking of mainstream T2I models on TIIF-Bench, we analyze the strengths and weaknesses of current T2I systems and reveal the limitations of existing evaluation benchmarks. Project Page: https://a113n-w3i.github.io/TIIF_Bench/.

cs.CV↗

arXiv2026

ARGUS: Defending LLM Agents Against Context-Aware Prompt Injection

Large Language Model (LLM) agents are increasingly deployed as task-oriented software systems that use runtime context to decide and act on behalf of users. This delegation model makes prompt injection especially dangerous: an attacker can hide a context-aware instruction inside evidence the agent must use to decide what to do. Existing benchmarks and defenses largely miss this setting. Benchmarks often use context-insensitive tasks where the user prompt already specifies the intended action, together with generic attack payloads independent of context. Existing defenses also do not capture the causal support from runtime evidence to concrete actions, which makes them incomplete and ineffective for context-dependent tasks. We present AgentLure, a benchmark for context-dependent tasks under context-aware prompt injection. AgentLure spans four agentic domains and eight attack vectors across six attack surfaces. To defend this setting, we propose ARGUS, a causal-provenance auditor for LLM agents. Instead of relying only on tool authorization or suspicious-context detection, ARGUS verifies whether each proposed action has a complete benign causal justification. It builds an influence-provenance graph, labels runtime spans, grounds action arguments in supporting evidence, and releases an action only when benign evidence entails it and task invariants hold. On AgentLure, ARGUS reduces attack success rate from 28.8% to 3.8% while preserving 87.5% clean utility, significantly outperforming existing defenses in the security-utility tradeoff.

cs.CR↗

arXiv2026

Pretraining A Large Language Model using Distributed GPUs: A Memory-Efficient Decentralized Paradigm

Pretraining large language models (LLMs) typically requires centralized clusters with thousands of high-memory GPUs (e.g., H100/A100). Recent decentralized training methods reduce communication overhead by employing federated optimization; however, they still need to train the entire model on each node, remaining constrained by GPU memory limitations. In this work, we propose SParse Expert Synchronization (SPES), a memory-efficient decentralized framework for pretraining mixture-of-experts (MoE) LLMs. SPES trains only a subset of experts per node, substantially lowering the memory footprint. Each node updates its local experts and periodically synchronizes with other nodes, eliminating full-parameter transmission while ensuring efficient knowledge sharing. To mitigate limited per-expert data utilization under sparse expert updates, we introduce an expert-merging warm-up strategy, where experts exchange knowledge early in training, to rapidly establish foundational capabilities. With SPES, we train a 2B-parameter MoE LLM using 16 standalone 48GB GPUs over internet connections, which achieves competitive performance with centrally trained LLMs under similar computational budgets. We further demonstrate scalability by training a 7B model from scratch and a 9B model upcycled from a dense checkpoint, both of which match prior centralized baselines. Our code is available at https://github.com/zjr2000/SPES.

cs.CL↗

arXiv2026

VideoVerse: Does Your T2V Generator Have World Model Capability to Synthesize Videos?

The recent rapid advancement of Text-to-Video (T2V) generation technologies are engaging the trained models with more world model ability, making the existing benchmarks increasingly insufficient to evaluate state-of-the-art T2V models. First, current evaluation dimensions, such as per-frame aesthetic quality and temporal consistency, are no longer able to differentiate state-of-the-art T2V models. Second, event-level temporal causality-an essential property that differentiates videos from other modalities-remains largely unexplored. Third, existing benchmarks lack a systematic assessment of world knowledge, which are essential capabilities for building world models. To address these issues, we introduce VideoVerse, a comprehensive benchmark focusing on evaluating whether the current T2V model could understand complex temporal causality and world knowledge to synthesize videos. We collect representative videos across diverse domains and extract their event-level descriptions with inherent temporal causality, which are then rewritten into text-to-video prompts by independent annotators. For each prompt, we design ten evaluation dimensions covering dynamic and static properties, resulting in 300 prompts, 815 events, and 793 evaluation questions. Consequently, a human preference-aligned QA-based evaluation pipeline is developed by using modern vision-language models to systematically benchmark leading open- and closed-source T2V systems, revealing the current gap between T2V models and desired world modeling abilities.

cs.CV↗

arXiv2026

Context Learning for Multi-Agent Discussion

Multi-Agent Discussion (MAD) has garnered increasing attention very recently, where multiple LLM instances collaboratively solve problems via structured discussion. However, we find that current MAD methods easily suffer from discussion inconsistency, LLMs fail to reach a coherent solution, due to the misalignment between their individual contexts.In this paper, we introduce a multi-LLM context learning method (M2CL) that learns a context generator for each agent, capable of dynamically generating context instructions per discussion round via automatic information organization and refinement. Specifically, inspired by our theoretical insights on the context instruction, M2CL train the generators to control context coherence and output discrepancies via a carefully crafted self-adaptive mechanism.It enables LLMs to avoid premature convergence on majority noise and progressively reach the correct consensus. We evaluate M2CL on challenging tasks, including academic reasoning, embodied tasks, and mobile control. The results show that the performance of M2CL significantly surpasses existing methods by 20%--50%, while enjoying favorable transferability and computational efficiency.

cs.AI↗

arXiv2026

Mitigating Error Accumulation in Continuous Navigation via Memory-Augmented Kalman Filtering

Continuous navigation in complex environments is critical for Unmanned Aerial Vehicle (UAV). However, the existing Vision-Language Navigation (VLN) models follow the dead-reckoning, which iteratively updates its position for the next waypoint prediction, and subsequently construct the complete trajectory. Then, such stepwise manner will inevitably lead to accumulated errors of position over time, resulting in misalignment between internal belief and objective coordinates, which is known as "state drift" and ultimately compromises the full trajectory prediction. Drawing inspiration from classical control theory, we propose to correct for errors by formulating such sequential prediction as a recursive Bayesian state estimation problem. In this paper, we design NeuroKalman, a novel framework that decouples navigation into two complementary processes: a Prior Prediction, based on motion dynamics and a Likelihood Correction, from historical observation. We first mathematically associate Kernel Density Estimation of the measurement likelihood with the attention-based retrieval mechanism, which then allows the system to rectify the latent representation using retrieved historical anchors without gradient updates. Comprehensive experiments on TravelUAV benchmark demonstrate that, with only 10% of the training data fine-tuning, our method clearly outperforms strong baselines and regulates drift accumulation.

cs.RO↗

arXiv2026

MICo-150K: A Comprehensive Dataset Advancing Multi-Image Composition

In controllable image generation, synthesizing coherent and consistent images from multiple reference inputs, i.e., Multi-Image Composition (MICo), remains a challenging problem, partly hindered by the lack of high-quality training data. To bridge this gap, we conduct a systematic study of MICo, categorizing it into 7 representative tasks and curate a large-scale collection of high-quality source images and construct diverse MICo prompts. Leveraging powerful proprietary models, we synthesize a rich amount of balanced composite images, followed by human-in-the-loop filtering and refinement, resulting in MICo-150K, a comprehensive dataset for MICo with identity consistency. We further build a Decomposition-and-Recomposition (De&Re) subset, where 11K real-world complex images are decomposed into components and recomposed, enabling both real and synthetic compositions. To enable comprehensive evaluation, we construct MICo-Bench with 100 cases per task and 300 challenging De&Re cases, and further introduce a new metric, Weighted-Ref-VIEScore, specifically tailored for MICo evaluation. Finally, we fine-tune multiple models on MICo-150K and evaluate them on MICo-Bench. The results show that MICo-150K effectively equips models without MICo capability and further enhances those with existing skills. Notably, our baseline model, Qwen-MICo, fine-tuned from Qwen-Image-Edit, matches Qwen-Image-2509 in 3-image composition while supporting arbitrary multi-image inputs beyond the latter's limitation. Our dataset, benchmark, and baseline collectively offer valuable resources for further research on Multi-Image Composition.

cs.CV↗

arXiv2026

UHR-DETR: Efficient End-to-End Small Object Detection for Ultra-High-Resolution Remote Sensing Imagery

Ultra-High-Resolution (UHR) imagery has become essential for modern remote sensing, offering unprecedented spatial coverage. However, detecting small objects in such vast scenes presents a critical dilemma: retaining the original resolution for small objects causes prohibitive memory bottlenecks. Conversely, conventional compromises like image downsampling or patch cropping either erase small objects or destroy context. To break this dilemma, we propose UHR-DETR, an efficient end-to-end transformer-based detector designed for UHR imagery. First, we introduce a Coverage-Maximizing Sparse Encoder that dynamically allocates finite computational resources to informative high-resolution regions, ensuring maximum object coverage with minimal spatial redundancy. Second, we design a Global-Local Decoupled Decoder. By integrating macroscopic scene awareness with microscopic object details, this module resolves semantic ambiguities and prevents scene fragmentation. Extensive experiments on the UHR imagery datasets (e.g., STAR and SODA-A) demonstrate the superiority of UHR-DETR under strict hardware constraints (e.g., a single 24GB RTX 3090). It achieves a 2.8\% mAP improvement while delivering a 10$\times$ inference speedup compared to standard sliding-window baselines on the STAR dataset. Our codes and models will be available at https://github.com/Li-JingFang/UHR-DETR.

cs.CV↗

arXiv2026

Impact of refractive index heterogeneity on stimulated Brillouin scattering microscopy: a quantitative analysis

Stimulated Brillouin scattering (SBS) microscopy enables label-free biomechanical imaging, with Brillouin gain serving as a critical contrast parameter for quantitative analysis. However, the influence of sample-induced refractive index (RI) heterogeneity on gain measurements remains poorly understood. Here, we quantitatively investigate, how RI mismatch affects SBS microscopy using finite element simulations and experiments on a phantom sample comprising polydimethylsiloxane beads embedded in agarose gel. We demonstrate that RI heterogeneity induces focal field distortion that reduce pump-probe beam overlap, resulting in attenuated Brillouin gain and degraded shift precision at material interfaces. Crucially, we establish that fiber-coupling efficiency, commonly used for system alignment, cannot serve as a linear proxy for Brillouin gain due to its heightened sensitivity to focal field distortion.

physics.optics↗

arXiv2025

Modeling and Optimal Control of Thermal Environment in Pig Houses

The management of thermal environments in pig farming is crucial for optimizing animal health, productivity, and operational energy efficiency. This study introduces a novel thermal ventilation model (TVM) based on enthalpy balance, which integrates both temperature and humidity control to address the specific thermal regulation requirements of pig housing in regions characterized by high temperatures and humidity, such as Guangdong, China. These challenging environmental conditions can lead to heat stress in pigs, adversely affecting their health and productivity. The TVM provides a precise representation of thermal comfort by accounting for the combined effects of temperature and humidity. Building on the TVM, we formulate an optimization problem using Model Predictive Control (MPC), which dynamically adjusts ventilation rates in real-time by modifying weight factors to minimize energy consumption while keeping the temperature and humidity within the comfort zone of the pigs. The accuracy of the TVM is validated against real-world environmental data from pig housing facilities in Guangdong. The root mean square error of temperature in winter, spring and summer were 1.23, 0.81, and 0.60, demonstrating its reliability and robustness across diverse climatic conditions. Furthermore, simulation results show that the proposed MPC strategy significantly improves energy efficiency and environmental comfort, achieving a 100% comfort temperature zone in spring and 83% in summer, compared to 91% and 43% with traditional rule-based control, respectively. However, the model's energy consumption in summer (91.2 kWh) was higher than that of rule-based control (80.8 kWh), reflecting the trade-off between maintaining optimal comfort and energy efficiency under extreme conditions.

math.OC↗

arXiv2025

Trading with the Devil: Risk and Return in Foundation Model Strategies

Foundation models - already transformative in domains such as natural language processing - are now starting to emerge for time-series tasks in finance. While these pretrained architectures promise versatile predictive signals, little is known about how they shape the risk profiles of the trading strategies built atop them, leaving practitioners reluctant to commit serious capital. In this paper, we propose an extension to the Capital Asset Pricing Model (CAPM) that disentangles the systematic risk introduced by a shared foundation model - potentially capable of generating alpha if the underlying model is genuinely predictive - from the idiosyncratic risk attributable to custom fine-tuning, which typically accrues no systematic premium. To enable a practical estimation of these separate risks, we align this decomposition with the concepts of uncertainty disentanglement, casting systematic risk as epistemic uncertainty (rooted in the pretrained model) and idiosyncratic risk as aleatory uncertainty (introduced during custom adaptations). Under the Aleatory Collapse Assumption, we illustrate how Monte Carlo dropout - among other methods in the uncertainty-quantization toolkit - can directly measure the epistemic risk, thereby mapping trading strategies to a more transparent risk-return plane. Our experiments show that isolating these distinct risk factors yields deeper insights into the performance limits of foundation-model-based strategies, their model degradation over time, and potential avenues for targeted refinements. Taken together, our results highlight both the promise and the pitfalls of deploying large pretrained models in competitive financial markets.

cs.CE↗

arXiv2025

DynaKV: Enabling Accurate and Efficient Long-Sequence LLM Decoding on Smartphones

As the demand for human-like reasoning, multi-turn dialogues, and long-form responses grows, large language models (LLMs) are increasingly expected to support efficient and effective long-sequence decoding. However, due to limited DRAM capacity, long-seuqence LLM decoding on smartphones is constrained by the key-value cache (KVCache), whose memory footprint increases linearly with sequence length. Retrieval-based methods mitigate DRAM pressure by offloading KVCache to flash and retrieving query-relevant entries through cluster-based indexing. Unfortunately, as decoding progresses, KVCache distribution shifts render static or local cluster updates progressively misaligned, excluding essential entries or fetching redundant ones. These issues are further exacerbated by smartphone-specific limitations in bandwidth, IOPS, and memory capacity. We propose DynaKV, the first adaptive KVCache management approach that jointly addresses accuracy and efficiency for long-sequence decoding on smartphones. DynaKV integrates three key techniques: (1) Migration-Free Cluster Adaptation, which adaptively splits clusters during retrieval without incurring additional transfers; (2) Continuity-Centric Flash Management, which co-locates correlated entries and clusters and employs a dual-head layout for efficient updates; and (3) Memory-Efficient Cache Design, which virtualizes cache space across DRAM and flash and extends replacement policies to align with cluster-level access patterns. Evaluations demonstrate that DynaKV improves retrieval accuracy and reduces end-to-end latency compared to state-of-the-art solutions, achieving average gains of $1.38\times$ in accuracy and $1.47\times$ speedups. Furthermore, the insights of DynaKV naturally extend to other long-context workloads and multi-tier memory hierarchies, underscoring its broader applicability.

cs.DC↗