Search arXiv⌕ Search

arXiv subjects

Xu Zheng

Publications and source records attributed to Xu Zheng.

At least 19 recordsLinked to original sources

First-Order LoRA Training with Phone NPUs

On-device fine-tuning lets a large language model (LLM) learn from its user's private data without uploading it. Low-rank adaptation (LoRA) reduces the trainable parameters, but each first-order training step still multiplies by the frozen base-model weights during the forward pass, activation recomputation, and input-gradient computation. A phone's neural processing unit (NPU) already holds these weights for inference; using it for training also requires computing input gradients, which its inference interface does not support. We present a system that runs all three frozen-weight products on the NPU while keeping the training graph, adapters, and optimizer on the CPU. Its input-gradient kernels reuse the resident weight tiles and the forward dequantizer, avoiding a transposed weight copy and ensuring forward and backward use the same effective weights. To preserve usable gradients, the system selects precision by gradient sensitivity and applies a per-row range guard for half-precision (FP16) outputs. Its runtime fuses the remaining CPU operators and overlaps NPU execution with adapter computation, while resumable execution and thermal pacing let training proceed as a background job. We evaluate it on two Qualcomm Snapdragon platforms using four LLMs from the Qwen and Llama families. Our workloads cover nightly personalization with labels supplied on the phone and the public LaMP-2 benchmark; comparisons include an optimized CPU trainer, a phone-GPU trainer, forward-only training, and GPU-trained references.

cs.LG↗

Tandem: Serving Hybrid Linear-Attention GUI Agents on Mobile NPUs

Smartphone GUI agents complete tasks in mobile apps by repeatedly reading the screen and asking a model for the next action. Mobile neural processing units (NPUs) enable local execution, keeping screen contents on the phone, but model latency accumulates with every action. Hybrid linear attention models reduce memory requirements, yet reusing their recurrent state requires checkpoints at the appropriate input positions. Agent requests retain instructions but rewrite recent history, so checkpoint policies designed for chat continuation can miss reusable prefixes. Retaining rollback states for speculative decoding can also move prompt processing off the NPU's matrix unit, adding overhead that outweighs decoding savings on short action outputs. A loaded model can further hold the NPU awake between tasks. We present Tandem, a runtime for hybrid GUI agents on mobile NPUs. Tandem saves recurrent state where consecutive prompts diverge, allowing later requests to reuse previously processed context. It keeps most prefill on the matrix unit and produces rollback states through a short per-token tail. Its verification kernel reads each weight block once for all proposed tokens. Between request bursts, Tandem releases NPU power votes without unloading the model. We implement Tandem in llama.cpp and evaluate it on recorded agent interactions across two Snapdragon generations. On a Snapdragon 8 Elite, Tandem reduces per-step latency by 30% for text-based screen descriptions and 16% for screenshots relative to llama.cpp's fastest NPU configuration, reduces energy per text step by 33%, and lowers standby power with the model loaded from 0.76 to 0.22 W.

cs.AI↗

Adv-Camou: An Emissivity-based Physical Dynamic Adversarial Patch for Infrared Attack

With the widespread application of infrared object detection technologies in military domains, intelligent infrared adversarial camouflage capabilities have become critical. Existing physical attack methods predominantly employ static thermal suppression strategies, suffering from limited environmental adaptability, insufficient attack robustness, and inadequate visual concealment. This study proposes Adv-Camou, an emissivity-based physical dynamic adversarial patch that achieves paradigm-shifting advancements from static to dynamic attacks through algorithm-material co-innovation. First, a multi-level loss function based on feature confusion mechanisms is designed to deceive detectors by attenuating target saliency and enforcing background feature alignment. Second, adaptive physical transformations and differentiable binarization optimization are integrated to address physical robustness and realizability constraints. A 6*4 array of reversible electrochromic emissivity device is developed and tested across a range of background scenarios, enabling scene-adaptive dynamic camouflage through independent unit control. Experiments demonstrate that this method achieves 95.59% attack success rate (ASR), reducing average precision (AP) by 60.51%. Physical validations show that static adversarial patches attain 76.55% average ASR under multi-view, multi-range, and multi-spectral conditions, while dynamic patches enhance ASR up to 91.55% in complex environments (wilderness/urban) through adaptive switching. The seamless digital-to-physical transfer via tunable emissivity devices transcends the limitations of traditional static camouflage by establishing a dynamic infrared regulation capability. This advancement enhances the battlefield survivability of military assets and demonstrates transformative potential for adaptive camouflage in practical combat scenarios.

eess.IV↗

EgoOmniWorld: Unifying Egocentric Understanding via Ego-Action-World Interactions

Egocentric video understanding spans diverse capabilities, modalities, and evaluation formats, yet these are often studied in isolation despite their tight coupling in real-world interaction. We propose the Ego-Action-World interaction loop as a unifying principle: the wearer perceives the world, forms goals, acts, changes the world, and uses feedback to guide subsequent behavior. Based on this view, we introduce EgoOmniWorld, a benchmark organized around four complementary interaction structures: Node captures ego, action, and world states; Edge captures directed relations among them; Chain captures linked dependencies; and Loop captures feedback-closed interactions. We develop an interaction-first, evidence-grounded data pipeline that extracts structured interactions from egocentric videos, grounds them in visual and auditory evidence, and generates questions according to their interaction structure. Required modalities and single- or multi-turn formats follow naturally from the supporting evidence and dependencies. EgoOmniWorld contains 24,166 QA groups, including 20,284 training and 3,882 test samples. Experiments on representative open- and closed-source multimodal large language models reveal substantial and uneven limitations across interaction structures. Models trained on EgoOmniWorld improve in-domain interaction understanding and generalize to existing egocentric benchmarks. EgoOmniWorld provides a unified foundation for evaluating and advancing egocentric video understanding. Data, code, and models will be released.

cs.CV↗

Do Time-Series QA Systems Read the Time Series? Evidence Use and Reasoning Reliability

In recent years, time-series question answering (QA) systems have made significant progress. However, generating a correct answer does not show whether retaining the supplied numerical series improves task performance, nor whether the prediction is sensitive to changes in that input. While some systems provide rationales, answer accuracy also does not show whether their numerical claims are grounded in the supplied series or whether the stated inference is valid. In this work, we focus on evaluating four time-series QA systems: TimeOmni-1, ChatTS, TimeOmni-VL, and Time-MQA. First, for three systems with released evaluation data, we reproduce their reported results and compare the performance of the systems with their backbones. Then, we introduce a benchmark named COMMON-TSQA, which collects public evaluation datasets from existing time-series benchmarks and unifies their sample representation, task definitions, and answer schemas, while evaluating each system through its own interface under common evaluation criteria. The evaluation uses the original condition and six interventions while keeping the question and target fixed. Our analysis shows that aggregate performance alone can obscure how systems use numerical evidence. Similar task-level scores can arise despite substantial changes in individual predictions. Some interventions induce simple fallback behavior rather than preserved task ability. We also evaluate rationales for factual grounding, inference validity, and consistency with the final answer. We find that rationales often contain time-series claims unsupported by the input. Moreover, the rationale audit shows that agreement between a rationale and its final answer can coexist with incorrect numerical descriptions or invalid intermediate inferences.

cs.AI↗

OnceSelect: Reusable Data Selection for Efficient Multimodal Instruction Tuning

Multimodal instruction tuning is widely used to adapt multimodal large language models (MLLMs), yet the large-scale image-text datasets it relies on are often highly redundant. Existing data selection methods are commonly tied to specific datasets, target models, or training states, requiring retraining or recomputation when transferred to new settings. We ask whether a selection signal can instead be learned once and reused across datasets and models. We propose OnceSelect, a reusable data selector trained once and directly applied to unseen datasets. OnceSelect encodes image-instruction pairs in a frozen joint multimodal space, clusters them into pseudo-labels capturing coarse semantic structure, and trains a lightweight selector using a fixed validation macro-accuracy criterion. Low-confidence samples under the learned partition are treated as informative candidates. As the selector is independent of the downstream MLLM, it can be transferred across datasets without retraining or model-dependent scoring, while selected subsets can be reused across model architectures. Using only 15% of LLaVA-625K, OnceSelect retains 99.2% of full-data aggregate performance across nine evaluation metrics. Without retraining, it achieves 103.4% and 102.5% relative performance on unseen Vision-Flan-186K and LRV-Sub-180K. The same 93.7K LLaVA subset further achieves 99.9-106.7% relative performance across Qwen3-VL and InternVL3 models without model-specific scoring or reselection. These results demonstrate efficient and reusable multimodal data selection across datasets and model architectures. Code is available at https://github.com/DMK041218/OnceSelect

cs.CV↗

Beyond Localization: A Comprehensive Benchmark of Perspective-Conditioned Spatial Reasoning in MLLMs from Omnidirectional Images

Multimodal Large Language Models (MLLMs) show strong visual perception, yet remain limited in reasoning about space under changing viewpoints. We study this challenge as Perspective-Conditioned Spatial Reasoning (PCSR) in 360 degree omnidirectional images, where broad scene coverage reduces ambiguity from partial observations without eliminating the need for viewpoint-dependent inference. To assess this capability, we introduce PCSR-Bench, a diagnostic benchmark of 84,373 QA pairs from 2,600 omnidirectional images across 26 indoor environments, organized into eight tasks under three cognitive groups--- Perception, Spatial, and advanced PCSR. We evaluate 14 representative MLLMs and observe a substantial perception--reasoning gap: accuracy reaches 57.59% on Limited Field-of-View Reasoning (T7) but drops to 13.49%, 7.13%, and 0.64% on Relative Direction (T2), Egocentric Rotation (T4), and open-ended Compositional Directional Chains (T3), respectively. To probe the plasticity of this gap, we conduct an RL-based diagnostic study on a 7B-scale model. Reward shaping improves a matched 7B baseline from 31.10% to 60.06% under a controlled setting, suggesting that PCSR exhibits partial plasticity rather than being fully immutable. Still, these gains are task-selective, sensitive to reward design, and partially dependent on the evaluation protocol. These results position PCSR as a key bottleneck in current MLLMs and highlight meaningful yet bounded room for recovery under targeted optimization. Details and access are available at https://github.com/Caleb-ychen/PCSR-Benchmark.

cs.CV↗

Refresh or Realize? Compute Allocation in Drifting Models

Drifting Models train a one-step generator by recomputing a finite-sample drift field at every iteration and taking an optimizer step toward the drifted target. The field says how generated samples should move, but the step is taken in parameters shared by all samples, so the motion the network actually makes need not match the motion it was given. This leaves a basic training question open: should extra compute go into fitting the current target more closely, or into recomputing the field? We study it on ImageNet 256x256. Holding the target fixed for k optimizer steps and measuring the realized displacement, we find that deeper fitting does bring the network closer to the frozen target, and that the number of steps needed before it makes any net progress drops from about sixteen early in training to one later on. When the extra steps come for free, k=2 also lowers FID. Once they are paid for, the result flips: at approximately matched measured wall-clock, spending the budget on fresh fields gives lower FID than deeper fitting, on both training seeds. The target itself shows why a fresh field is worth so much. Redrawing the finite support rotates its direction far more than a parameter update does (cosine ~0.3-0.6 against ~0.95), and a correction that is optimal in field space is not reliably better in FID than a parameter-free one. For Drifting, fitting each target well and spending compute well are different goals.

cs.LG↗

Boundary singular scattering enables coherent perfect absorption and lasing without resonators

Scattering singularities are features conventionally associated with resonant scattering bodies, which correspond to the zeros and poles of a scattering matrix, and manifest as coherent perfect absorption and lasing respectively. Here, we show that they can emerge solely from an interface, eliminating the need for any resonant body. We introduce boundary singular scattering, whereby an interface between two non-Hermitian media supports coherent perfect absorption, lasing, or both. Despite these singular responses, the two adjoining media are in parity-time (PT)-unbroken phases, with entirely real bulk spectra. This phenomenon originates from a singular boundary mode-matching condition unique to non-Hermitian systems, not from any underlying resonant modes. We demonstrate it experimentally in a programmable synthetic photonic lattice, and show coherent switching between perfect absorption and lasing by controlling only the relative phase of the incident beams. The same mechanism further generalizes from mirror-symmetric interfaces to asymmetric interfaces with dissimilar bulk dispersions. Our work establishes boundaries as a previously unexplored origin of scattering singularities, opening a resonator-free route to coherent perfect absorption, lasing, and other singular wave phenomena.

physics.optics↗

Unlocking Multimodal Document Intelligence: From Current Triumphs to Future Frontiers of Visual Document Retrieval

With the rapid proliferation of multimodal information, Visual Document Retrieval (VDR) has emerged as a critical frontier in bridging the gap between unstructured visually rich data and precise information acquisition. Unlike traditional natural image retrieval, visual documents exhibit unique characteristics defined by dense textual content, intricate layouts, and fine-grained semantic dependencies. This paper surveys the VDR landscape as a retrieval problem in its own right, rather than as the front end of a generation pipeline, and does so specifically through the lens of the Multimodal Large Language Model (MLLM) era. We begin by examining the benchmark landscape, including the recent turn toward reasoning-intensive evaluation, and then dive into the methodological evolution along two orthogonal axes: what a retriever is, spanning multimodal embedding models and reranker models, and how it is deployed, from single-stage retrieval through Retrieval-Augmented Generation (RAG) to Agentic systems. Cutting across both, we analyse the representation--efficiency trade-off that late interaction imposes. We ground these categories in leaderboard evidence on where the empirical frontier actually lies, and close by identifying persistent challenges and outlining promising future directions for multimodal document intelligence.

cs.CL↗

Controlling pair dynamics of rotating magnetic microparticles through radial and transverse interactions

Rotating magnetic microparticles are building blocks for field-driven assembly and microrobotic control. As the elementary interaction rule for larger assemblies, pair motion in these systems is governed not only by magnetic forcing, but also by hydrodynamic coupling and other long-range interactions. Here we develop a reduced framework for two synchronized rotating magnetic particles by resolving the interactions into radial components that change the interparticle distance and transverse components that rotate the line of centers. The competition between magnetic dipolar interaction, additional radial repulsion, and rotation-induced transverse coupling selects three pair-motion modes: rigid-body rotation, contact-separation rotation, and irreversible separation. We derive transition criteria for the rigid-body state, reversed orbital motion, and the separation boundary, and obtain an asymptotic solution for the separation dynamics. Lattice Boltzmann simulations of particles rotating near a wall provide a hydrodynamic realization of the model, in which inertial secondary flow generates radial repulsion and rotational flow produces transverse coupling. The resulting phase diagram in the physical $(\mathrm{Re},C_m)$ plane is consistent with the reduced-model predictions. These results provide design rules for programming elementary pair interactions in rotating magnetic-particle systems and may help guide the control of microrobotic assemblies.

cond-mat.soft↗

Towards A Unified Information Bottleneck Framework for Time Series Explanations

Explaining deep learning models operating on time series data is crucial in various applications that require transparent and interpretable insights into model behavior. {Existing explanation methods generally fall into two categories: attribution-based explanations, which identify the temporal regions most responsible for a prediction, and counterfactual explanations, which reveal how an input should be modified to alter the model's decision.} {Despite valuable insights, these two fields are largely studied independently. This disconnect leaves attribution methods lacking causal validation, while counterfactual methods suffer from severe instability, producing adversarial-like noise instead of meaningful explanations.} In this work, we revisit time-series explainability from an information-theoretic perspective and show that existing explainers are vulnerable to trivial solutions and distributional shifts. To address these limitations, we propose a unified objective function for explainable time series learning that bridges attribution and counterfactual reasoning within a single framework. Building upon the Information Bottleneck principle, our formulation explicitly prevents trivial explanations and out-of-distribution counterfactuals. {Based on this objective function, we introduce {\modelname}, a novel explanation framework that learns a parametric transformation network to construct explanation-embedded instances, where preserved information yields attribution explanations and controlled information removal produces stable counterfactual explanations.} We evaluate {\modelname} on synthetic and real-world benchmarks against state-of-the-art baselines. Extensive quantitative and qualitative results show that {\modelname} consistently outperforms competing methods, yielding faithful attributions and stable counterfactual explanations.

cs.LG↗

Reinforcing Egocentric Spatial Perception in Multimodal Large Language Models via Ego Scene Augmentation

Egocentric Visual Question Answering (VQA) has attracted widespread attention as an important task for enabling Multimodal Large Language Models (MLLMs) to interact with the real world. However, existing MLLMs struggle to perform effective spatial reasoning in complex egocentric scenes due to their limited spatial perception capabilities. To this end, we introduce Ego Scene Augmentation (ESA), an egocentric spatial perception framework, which actively enhances the spatial perception capabilities from the egocentric perspective, powered by the proposed Ego-element Graph. Our core insight is leveraging the Ego-element Graph as an intermediary representation to augment the egocentric spatial perception of MLLMs via visual foundational models. Specifically, we 1) construct the Ego-element Graph, which encapsulates and integrates egocentric spatial features enabled by visual foundational models; 2) enhance the spatial perception capabilities of MLLMs via the Ego-element Graph for ego-perspective scenes. Our proposed ESA framework presents significant performance improvement on the EgoTextVQA benchmark. We achieve an 8.14% gain on the indoor setting and an 8.72% gain on the outdoor setting. Furthermore, our ESA shows the most impressive performance improvement in the shopping subset of the indoor setting. The project code is publicly available.

cs.CV↗

The First EgoCross Challenge at EgoVis 2026: Cross-Domain Egocentric Video Question Answering

EgoCross is a cross-domain egocentric video question answering benchmark designed to evaluate whether multimodal large language models can generalize beyond common daily-life scenarios. The first EgoCross Challenge was hosted at the Third EgoVis Workshop at CVPR 2026 and evaluated models on first-person videos from four target domains: surgery, industrial assembly, extreme sports, and animal perspectives. Each test example consists of an egocentric video clip, a question, and four candidate answers, from which the model must select the correct option. This technical report introduces the challenge task, benchmark resources, and two official Codabench tracks. The Source-Limited Track restricts participants to the official baseline model and a small support set, whereas the Open-Source Track permits broader choices of models and training data under rules that prohibit the manual construction of target-domain training data. In total, the challenge received more than 1,500 submissions from over 130 participants, with 19 teams participating in the Open-Source Track and 38 teams in the Source-Limited Track. We further present the official leaderboard results and summarize the winning solutions from both tracks. We hope that this report will serve as a useful technical reference for advancing cross-domain egocentric video understanding. All resources, including the challenge data, baseline implementation, and code released by the winning teams, are made publicly available.

cs.CV↗

EgoIntent: A Pre-Outcome Micro-Step Benchmark for Understanding What, Why, and Next

Egocentric video provides a natural modality for studying human behavior, but conventional visual understanding captures mainly observable scenes, objects, and actions rather than the latent goals that organize them. Existing intent benchmarks typically focus on coarse event-level goals and overlook how intent evolves across procedural steps. We introduce EgoIntent, a step-level intent-understanding benchmark comprising 3,014 pre-outcome micro-steps from 32 egocentric videos across 15 indoor and outdoor daily-life scenarios. Each step is manually annotated along three complementary dimensions: Local Intent (What), the immediate goal; Procedural Intent (Why), the role of the step in the broader procedure; and Next-Plan (Next), the action most likely to follow. Multiple rounds of human review refine temporal boundaries and annotation quality. We evaluate 15 multimodal large language models using reference-based scores and complementary reference-free diagnostics. Controlled studies on four representative models show that only one model gains significantly from correct temporal order, while a single boundary frame outperforms the full ordered clip for three models. Step-only input performs best for all four models, and adding 15 seconds of history significantly degrades three. Revealing the current outcome improves Local Intent by 7.81 points, while revealing the following step improves Next-Plan by 13.17 points. These findings indicate that current models can achieve strong intent-prediction scores through static boundary cues without robustly exploiting temporal order or procedural history.

cs.CV↗

ObjectStream: Latent Objects as Memory Anchors for Streaming Video Understanding

Streaming video understanding requires models to continuously retain useful visual evidence before future questions are known. Existing approaches primarily manage the growing visual context according to token importance, temporal redundancy, or segment-level relevance, but rarely organize evidence around objects that persist and evolve over time. Thus, in this paper, we introduce ObjectStream, a training-free framework that treats latent objects as memory anchors for streaming video understanding. ObjectStream induces spatially coherent latent objects directly from frozen Video-LLM representations, links them across frames into persistent anchors, and maintains their histories under a bounded memory budget, without requiring external object detectors or segmentation models. Built on these anchors, ObjectStream preserves three complementary forms of evidence: persistent object histories, transient object changes, and recent visual context. This design enables existing Video Large Language Models (Video-LLMs) to reason over object identities, interactions, and state changes while leaving the underlying model unchanged. Extensive experiments on online streaming and offline long-video benchmarks demonstrate both effectiveness and efficiency. In online streaming evaluation, ObjectStream improves Qwen2.5-VL-7B by 10.0 points on OVO-Bench Real-Time Visual Perception, while reducing peak GPU mem-ory and TTFT by approximately 50%. On offline long-video benchmarks, it surpasses the full-token baseline while discarding 82.5% of visual tokens. These results highlight latent objects as a practical and effective organizing principle for compact streaming video memory.

cs.CV↗

Parameter-Efficient CLIP Adaptation for 3D Understanding via Unified Tokenization

Vision-language models, such as CLIP, encode rich semantic knowledge through large-scale image-text pretraining. Reusing these models for 3D understanding is highly desirable, because 3D-text pairs and dense point-level annotations are far scarcer and more difficult to obtain than their 2D counterparts. However, CLIP is trained on regular 2D image patches, whereas point clouds are unordered, sparse, and irregular. The primary challenge lies in constructing 3D token sequences whose geometry, position, and local relations can be interpreted by a frozen, pretrained vision transformer. Moreover, coordinate-scale variations across heterogeneous 3D domains make unified training particularly challenging. To bridge these gaps, we propose a parameter-efficient framework that learns a scale-normalized 3D tokenizer, enabling the CLIP visual encoder to be reused for point-cloud understanding. Our tokenizer, named UTok3D, estimates an input-adaptive geometric scale to calibrate sparse voxelization, coordinate normalization, token-center computation, and 3D positional encoding, and serializes the resulting tokens by Hilbert ordering. This shared geometric convention makes joint training feasible across point clouds with substantially different metric scales, including object-level shapes, indoor scenes, and outdoor LiDAR scans. The tokenizer is trained without 3D annotations through self-supervised cross-modal distillation from foundation-model features extracted from multi-view images, combining local superpoint alignment with the proposed Sinkhorn Ranked Contrastive distillation. Experiments on ShapeNetPart, ScanNetV2, S3DIS, SemanticKITTI, and nuScenes show that, when equipped with a scale-consistent and CLIP-interpretable token interface, a frozen CLIP visual backbone can be effectively reused for annotation-free 3D segmentation.

cs.CV↗

Towards Structurally Explainable Machine-Generated Text Detection: A Graph-Perspective Framework

Despite the success of machine-generated text detectors, the black-box nature remains a critical limitation. Traditional explainability methods rely on token-level saliency, insufficient to reveal the high-order structural dependencies that distinguish LLM outputs. In this paper, we propose \textsc{LM$^2$otifs}, a principled framework that shifts detection from linear sequences to graph-structured manifolds. We first provide a theoretical grounding based on probabilistic graphical models, demonstrating that detection performance is more distinguishable in the graph-topological space. Driven by this theory, \textsc{LM$^2$otifs} transforms text into lexical co-occurrence graphs to preserve latent structural fingerprints. The framework employs Graph Neural Networks for robust detection and utilizes graph-specific explainers to extract interpretable motifs. Crucially, our experiments reveal that these structural motifs achieve higher faithfulness compared to traditional methods. This empirical evidence confirms the existence of high-order structural explanations that linear methods fail to capture. Experimental results show that \textsc{LM$^2$otifs} achieves state-of-the-art performance while providing multi-level \textit{distinct linguistic fingerprints} that are more faithful to the model's decision.

cs.CL↗