Searcharxiv⌕ Search

arXiv subjects

Jinrui Zhang

Publications and source records attributed to Jinrui Zhang.

At least 19 recordsLinked to original sources

Strict Monotonicity of the First Positive Steklov Eigenvalue on Eccentric Spherical Shells in Every Dimension

For $d\ge2$, consider the region between two nested spheres of fixed radii, with the inner sphere translated a distance $\varepsilon$ from the outer center. We prove that the first positive eigenvalue of the Steklov problem, with the spectral boundary condition imposed on both spheres, decreases strictly with $\varepsilon$ throughout the noncontact interval. This settles the planar monotonicity conjecture formulated by Nigam and establishes its higher-dimensional counterparts. In dimension two we use a double-center holomorphic expansion and a pair of positive compact coefficient operators. For every $d\ge3$, solid Gegenbauer harmonics yield analogous axisymmetric and transverse operators, with a positive rank-one monopole correction. Weighted angular-mode comparison for $d\ge3$ and a direct matrix comparison for $d=2$ identify the first positive eigenvalue as the unique level-one crossing of an associated spectral radius. The first eigenspace has dimension $d$ in the concentric case and dimension one for every nonconcentric configuration. Convergence and reconstruction estimates justify the coefficient reductions at the two boundaries.

math.SP↗

BitMTP: When Multi-Token Prediction Meets Low-Bit Large Language Models

For efficient deployment of large language models (LLMs), methods of ultra-low-bit backbones reduce weight storage, memory traffic, and linear-layer execution cost, while multi-token prediction (MTP) methods reduce sequential decoding steps by predicting multiple future tokens in parallel. Although complementary, the direct combination of these methods cannot accelerate decoding at comparable quality: masked drafting lacks intermediate token input supplied in next-token training, while wider computation and causal key-value (KV) updates can offset the savings from fewer steps. To address these challenges, we propose BitMTP, an algorithm-system co-design framework for efficient MTP on ultra-low-bit LLM backbones. A joint next-token prediction and MTP objective equips a single model with both autoregressive (AR) generation and block-causal drafting. Confidence-only decoding, speculative-only decoding, and hybrid decoding provide different quality-throughput operating points without using separate draft and verifier models. Accepted-prefix alignment keeps the committed prefix, materialized causal KV boundary, and CUDA Graph replay state consistent for continued generation. BitMTP uses this contract to select width-specialized low-bit execution and reuse captured graphs over shared KV storage. On NVIDIA H20, BitMTP with hybrid decoding achieves five-task mean speedups of 2.2x on BitNet b1.58-2B and 2.1-2.4x on 1.7B-4B Bonsai models at comparable task quality. On RTX 3090 and Jetson Orin, it further achieves up to 2.0x in five-task mean throughput and 3.3x on MBPP+, respectively. These results demonstrate that BitMTP accelerates ultra-low-bit LLM generation across backbones, model sizes, and GPU types. The source code is released at https://github.com/PolyU-VCLab/BitMTP

cs.CL↗

A Statistical Imaging Framework for Inverse Obstacle Scattering and Its Resolution Analysis

We develop a general statistical framework for inverse obstacle imaging and resolution analysis from far-field second moments under random illumination. The regularized $Q$-statistic is introduced and utilized to measure the minimal statistically weighted cost of synthesizing the test far field associated with a sampling point. Its reciprocal provides an imaging indicator. Under uniform full-aperture plane-wave illumination, we relate this indicator to several classical sampling indicators and derive their statistical counterparts for general random illumination. For the resolution analysis, separating the effects of radiation and noise from the statistics of induced boundary sources, we measure a correlation-free resolution limit by the one-sided half-height width of the boundary transition. In the regime of fixed wavenumber $k$ with the noise-calibrated regularization level $ρ_τ\to 0$, we establish a sharp asymptotic law for this width for simply connected domains with analytic boundaries. The width scales as \(h_Γ(x)\log\log(1/ρ_τ)/\log(1/ρ_τ)\), with $h_Γ(x)$ a geometric prefactor along the boundary determining both the boundary image contrast and the local transition width. For general boundary-source statistics, we examine how the source mean, variance, and correlation affect imaging quality. Finally, in representative scattering configurations, we provide qualitative interpretations of some typical imaging phenomena through the statistical structure of their induced boundary sources. Numerical examples illustrate these mechanisms and indicate that practical resolution is governed jointly by source statistics, radiation, the noise level, rather than by wavelength alone.

math.NA↗

HaloBlock: Faster and Better Decoding for Diffusion Large Language Models

Diffusion large language models (dLLMs) have attracted increasing research attention due to their bidirectional attention and arbitrary order decoding. However, there are two issues in dLLMs inference: the decoding difficulty is dominated by the tokens on the right side of the block, and the block-wise decoding inherently suffers from boundary contextual discontinuity. To tackle these limitations, we propose HaloBlock, a difficulty-aware adaptive halo mechanism for dLLM inference. We first leverage bidirectional cumulative entropy to characterize block decoding difficulty. Then, based on the bidirectional decoding difficulty, we adaptively allocate bidirectional halo regions on both sides of each block to mitigate boundary contextual discontinuity. The difficulty-aware design of HaloBlock smooths cross-block context propagation and lowers decoding difficulty for hard tokens, yielding better generation quality and faster convergence. Evaluated on LLaDA-8B-Instruct, Dream-7B-Instruct and LLaDA-1.5 across mathematical reasoning and code generation benchmarks, HaloBlock demonstrates consistent accuracy improvements and higher inference efficiency. Source codes are publicly available at https://github.com/PolyU-VCLab/HaloBlock.

cs.LG↗

From Surfaces to Volumes: Registered Geometry for Protein Representation Learning

Existing protein geometry models typically represent molecular surfaces using local geometric features such as sampled points, normals, and curvature. While effective for capturing exposed molecular shape, these representations do not explicitly model the volumetric organization beneath the surface or provide a consistent coordinate system for residue-wise volumetric structure. We introduce Protein-TetSphere, a registered residue-wise volumetric representation for proteins. Each protein chain is tetrahedralized to obtain local volumetric regions associated with individual residues, which are then registered to a shared fixed-topology tetrahedral reference and represented in a common Laplacian basis. This registration establishes consistent volumetric coordinates across residues, enabling local three-dimensional deformation to be integrated with surface and chemical information in a multimodal protein representation. We evaluate Protein-TetSphere on ligand-binding pocket classification, protein--protein interface prediction, and de novo protein binder design. Across the three tasks, Protein-TetSphere improves ligand-binding pocket balanced accuracy from $0.795$ to $0.826$, Pinder-Pair/Site AUROC from $0.914/0.852$ to $0.932/0.866$, and binder-design success from $14.95\%$ to $19.90\%$ on the BoltzGen Challenge Set and from $27.62\%$ to $32.19\%$ at the ProtDBench backbone level. These results show that registered volumetric geometry provides complementary spatial information beyond molecular surfaces across protein recognition, interaction, and design.

cs.AI↗

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↗

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↗

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↗

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↗

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↗

$\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↗

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↗

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↗

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↗

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↗

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↗

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↗

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↗