SearcharxivSearch

arXiv subjects

Zhi Liu

Publications and source records attributed to Zhi Liu.

At least 19 recordsLinked to original sources

MotionQ: Operator-Conditioned Motion Quotients for Cross-Observation WiFi Gesture Recognition

WiFi gesture recognition is accurate in fixed deployments but often degrades when user orientation, available links, or transceiver placement changes. Unlike ordinary domain shifts, these changes alter the wireless observation operator, so the same motion is expected to produce different measurements. Existing methods nevertheless pursue domain-invariant features and largely overlook changing layouts and observation configurations. Yet changing the observation operator also changes which task-relevant motion cues are physically observable, rather than merely altering the appearance of a fixed set of cues. Under a local linearization of the WiFi forward process, we derive a common task-observability condition under which a strict common linear representation is recoverable from every geometry-induced operator while preserving the gesture task. When the condition fails, enforcing stronger alignment across additional heterogeneous source operators may discard task-relevant cues still observable under individual operators. We therefore present MotionQ, which generates an operator-conditioned two-support motion measure for each candidate geometry. A motion quotient removes only the arbitrary ordering of its unlabeled supports and is represented by permutation-invariant central moments. Rather than matching quotients across operators, single-link-retention interventions encourage each view to retain information sufficient for gesture recognition. Extensive evaluations show that MotionQ is robust to extrapolative observation operators.

cs.HC

On the Regularization Landscape for the Linear Recommendation Models

Recently, a wide range of recommendation algorithms inspired by deep learning techniques have emerged as the performance leaders on several standard recommendation benchmarks. While these algorithms were built on different DL techniques (e.g., dropouts, autoencoder), they have similar performance and even similar cost functions. This paper studies whether the models' comparable performance are sheer coincidence, or they can be unified under a single framework. We find that all linear performance leaders effectively add only a nuclear-norm based regularizer, or a Frobenius-norm based regularizer. The former ones possess a (surprising) rigid structure that limits the models' predictive power but their solutions are low rank and have closed form. The latter ones are more expressive and more efficient for recommendation but their solutions are either full-rank or require executing hard-to-tune numeric procedures such as ADMM. Along this line of finding, we further propose two low-rank, closed-form solutions, derived from carefully generalizing Frobenius-norm based regularizers. The new solutions get the best of both nuclear-norm and Frobenius-norm world.

cs.AI

Aplaud: Adaptive Personalized Low-Rank Decomposition for User-Specific LLM

In this paper, we study the problem of personalized survey response prediction using fine-tuned large language models (LLMs). This task poses unique challenges: limited per-user training data, scalability of model storage, and the need to exploit shared structure across survey questions. To address these issues, we propose Aplaud (Adaptive Personalized Low-rank and User-specific Nested Decomposition), a lightweight and scalable framework for LLM personalization. Aplaud extends the LoRA paradigm by separating adaptation into a frozen, shared low-rank basis and a compact user-specific correction, augmented with a rank-one residual for finer personalization. To further reduce per-user parameter cost and mitigate overfitting, the correction matrix can be factorized into an even lower-rank form. Empirical results demonstrate that Aplaud achieves efficient, scalable personalization across users while outperforming state-of-the-art LoRA-based personalized LLM approaches in both generalization and inference efficiency.

cs.AI

US-VLA: An Ultrasound Vision-Language-Action Model for Embodied Abdomina

Artificial intelligence-assisted ultrasound scanning enhances diagnostic reliability and efficiency by providing real-time guidance for standardized image acquisition and reducing operator dependence. However, existing reinforcement learning and learning-assisted ultrasound scanning methods typically rely on carefully designed reward functions or extensive interaction data, which limits their generalization ability and stability across different devices, patient populations, and complex clinical scenarios. To address these challenges, we propose an ultrasound vision-language-action model (US-VLA) for automated ultrasound scanning that explicitly encodes clinical semantic goals and generates sequential probe manipulation actions under real-time ultrasound feedback. In particular, we first design an ultrasound-aware expert fusion module to jointly integrate ultrasound observations with auxiliary contextual information, enabling semantic ultrasound feedback to effectively guide the scanning process. Then, we construct US-VLA-Data, a real-world dataset covering liver and kidney examinations, which includes five clinically defined standard planes and comprises 320 expert scanning trajectories with approximately 80,000 synchronized timesteps. Extensive experiments demonstrate that US-VLA achieves competitive performance in ultrasound probe manipulation tasks, indicating its effectiveness and promising generalization within the evaluated abdominal ultrasound setting. The source code is available at https://github.com/VMVLab/US-VLA.

cs.RO

Booster-based beam recycling for swap-out injection at the High Energy Photon Source

Fourth-generation synchrotron light sources employ ultralow-emittance storage rings with stringent injection requirements. On-axis swap-out injection alleviates the dependence on storage-ring dynamic aperture, but high-charge operation requires an efficient injector architecture capable of producing high-charge replacement bunches. This paper presents the accelerator physics design and performance analysis of a booster-based beam-recycling swap-out injection scheme implemented at the High Energy Photon Source (HEPS). In this approach, the full-energy booster serves as both an injector and a high-energy accumulator. An extracted storage-ring bunch is returned to the booster, merged with a low-charge bunch previously injected from the linac and accelerated to full energy. Following high-energy damping, the merged bunch is reinjected into the original storage-ring bucket. The scheme avoids the need for a dedicated accumulator ring while enabling high-charge bunch replacement. The recycling scheme was commissioned through staged machine studies. Full recycling-chain simulations, commissioning studies, and measured performance analysis are presented. The measured results characterize the recycling operation and quantify the transmission efficiency and performance limitations of the complete recycling loop. These results demonstrate the feasibility of the booster-based beam-recycling architecture and establish its operational basis for high-charge swap-out injection in future fourth-generation synchrotron light sources.

physics.acc-ph

ForceU-VLA: A Force-Aware Vision-Language-Action Model for Embodied Ultrasound Scanning

Embodied intelligent ultrasound scanning enables the automation and standardization of the ultrasound examination process by integrating perception, decision-making, and execution capabilities. However, existing methods suffer from loosely coupled modeling between force and ultrasound modalities and lack awareness of scanning stages, which limits their ability to capture dynamic probe-tissue interactions. To address these issues, we propose ForceU-VLA, a force-aware Vision-Language-Action model for autonomous embodied ultrasound scanning, which leverages force signals and ultrasound image feedback throughout the scanning process to enable accurate and high-quality ultrasound acquisition. Firstly, we propose a Force-Ultrasound Synergistic Fusion Module (FUSFM) that synergistically fuses ultrasound visual and force-feedback information to provide stable, reliable guidance for probe motion. Secondly, a Stage-Adaptive Modulation Mechanism (SAMM) is proposed to accommodate the task requirements across different scanning stages by adaptively modulating multimodal features to enhance their representation quality. Additionally, we introduce ForceU-VLA-Data, a real-world, force-aware embodied ultrasound dataset that integrates visual, force, and action signals, including data from two organs across five representative clinical scanning views, and comprising 450 expert-collected trajectories with approximately 100,000 synchronized multimodal frames. Extensive experimental results demonstrate that ForceU-VLA significantly improves contact stability and probe pressure regulation in embodied ultrasound scanning, thereby effectively enhancing task execution quality and overall system reliability. The source code is available at https://github.com/VMVLab/ForceU-VLA.

cs.RO

ReForge: Keeping ABR Algorithms Never Finished with Verified Large Language Model Edits

Designing an ABR algorithm for one network scenario takes an engineer months, and large language models now do this work in hours, matching or beating hand-built designs. But either way, the design fits only the world visible at its birth, and fails on the world that arrives after. We ask whether an ABR algorithm can keep pace with the world, redesigned in minutes as each scenario arrives, with every change proven harmless to every scenario already served. In this work, we propose ReForge, a continual heuristic learning framework that adapts to continuously changing scenarios. ReForge runs that routine with a large language model (LLM) in the loop. Each round the LLM reads where the current design falls short and proposes one small edit, and a replay over every network served so far decides. Specifically, what it edits is a single page of fuzzy rules that routes every decision to one of a frozen pool of pre-trained policies. The LLM writes the first page from measurements alone, then keeps improving it on its own. Each round it reads where the current rules fall short and proposes one small edit, and a replay over every network served so far decides whether the edit lands. We evaluate ReForge on nine real-world network families arriving one at a time as 3G, 4G, then 5G. A few edits per arrival lift mean QoE from 1.23 to 1.74, past the best single policy at 1.66 and to 94\% of an oracle, and even repair families the loop never saw, one rising from 0.30 to 0.80. All code, data, and experiment records will be open-sourced upon cleanup.

cs.AI

Benchmarking LLM Judges for Mobile Agent Evaluation

Mobile agent benchmarks increasingly rely on LLM-based judges to evaluate task completion, yet the reliability of these judges on mobile agent trajectories remains largely unexamined. We introduce MobileJudgeBench, a benchmark for systematically evaluating LLM-as-judge methods on mobile agent trajectories. Our benchmark comprises 931 human-annotated trajectories spanning 6 mobile agent benchmarks, 4 agent models, and 68 apps. We evaluate 6 judge methods (five adapted from SPA-Bench, A3 with two modes, AndroidArena, and AgentRewardBench, plus a simple baseline we design) across multiple LLM backends. Our experiments reveal three key findings. First, a simple baseline judge with sampled screenshots is competitive with, and often exceeds, purpose-built methods, indicating that more elaborate judge pipelines do not consistently improve judge quality; among competitive methods, the LLM backbone is the primary driver. Second, benchmark quality metrics reliably predict real-world judge utility: they correlate with both agent ranking fidelity for evaluation and downstream performance when judges serve as reward signals for on-policy reinforcement learning. Third, failure analysis across two LLM backends uncovers qualitatively opposite failure profiles, one conservative and the other permissive, linked to the backbone's precision-recall characteristics.

cs.AI

Random Bernoulli measures in a random environment

We study random Bernoulli measures $\mu_{\mathbf{p}}$ in a random environment $\mathbf{p}=(p_1,p_2,\ldots)$, where $p_n$ are independent and identically distributed on $(0,1)$. For almost every environment $\mathbf{p}$, we establish several almost sure properties of $\mu_{\mathbf{p}}$: its local dimension, $L^q$ dimensions, Rajchman property, mutual singularity with any fixed measure, and a dichotomy for normal numbers of its typical points.

math.CA

AirKey: Multimodal Acoustic-Assisted WiFi Sensing for Zero-Training Robust PIN Inference

Contactless keystroke inference via WiFi sensing highlights severe privacy threats, yet its real-world feasibility is hindered by two fundamental physical and deployment bottlenecks: the strict requirement for network privileges to acquire stable sensing streams, and the inherent "waveform fusion" ambiguity of pure WiFi signals during rapid, muscle-memory typing. To overcome these limitations, we propose AirKey, a novel cross-modal sensing framework that achieves highly stealthy, zero-training PIN eavesdropping. First, to bypass network deployment barriers, AirKey exploits fundamental IEEE 802.11 mechanisms to predictably elicit Acknowledgment (ACK) responses from unmodified target devices. By passively harvesting Channel State Information (CSI) from these ACKs using a low-cost microcontroller, AirKey secures a continuous spatial sensing stream entirely without network association. Crucially, to resolve the WiFi waveform fusion bottleneck, AirKey introduces a cross-modal complementarity mechanism. By utilizing lightweight acoustic signals as precise temporal anchors, the system robustly guides the segmentation of overlapping CSI trajectories. This joint spatiotemporal fusion strictly intersects CSI-derived spatial similarities with acoustic-guided inter-keystroke timing. Extensive real-world evaluations demonstrate that AirKey achieves over 4x higher accuracy than state-of-the-art unimodal zero-training schemes, successfully recovering device-unlock PINs within 6 attempts. Ultimately, this work exposes a critical vulnerability in contemporary smart interfaces, underscoring the severe privacy implications of ubiquitous multimodal sensing.

cs.CR

Galvanic Vestibular Stimulation in Latent Space

Galvanic vestibular stimulation (GVS) is widely used to modulate self-orientation, balance, and motion perception; the discriminability of frequency-encoded cues further suggests its potential as a standalone modality for embodied feedback. However, synthesizing GVS waveforms congruent with target events or bodily states remains challenging. GVS waveforms combine current direction, intensity, duration, and onset and offset transitions, yet how these parameters jointly shape users' perceptual and associative responses remains underexplored. To address this gap, we contribute a dataset linking GVS waveforms to free-form experience descriptions, as well as a retrieval-guided generative model for synthesizing candidate waveforms from target descriptions. The dataset comprises 100 GVS waveforms and 1,526 valid free-form sensation descriptions collected from 16 participants. Semantic analysis revealed diverse motion- and force-related sensations, localized bodily sensations, and situational associations. Compared with a participant-preserving permutation baseline, descriptions elicited by the same waveform covered fewer semantic categories (8.18 vs. 9.45) and exhibited a higher dominant-category proportion (26.97% vs. 21.25%; both P < 0.001). Building on this dataset, we implemented the generative model as a retrieval-guided one-dimensional convolutional variational autoencoder. An independent behavioral study recruited 10 participants who had not contributed to the dataset collection. Performance in discriminating congruent from incongruent waveform-visual cue pairings was significantly above chance, with an accuracy of 63.33%, d-prime = 0.70, and p < 0.001. Together, these findings demonstrate the feasibility of text-conditioned GVS synthesis and support the development of GVS as a programmable modality for semantically congruent embodied feedback across interactive scenarios.

cs.HC

NSMA: Neuro-Symbolic Manifold Alignment for Generalizable Adaptive Bitrate Streaming under Texture Shift

For decades, ABR has kept two kinds of intelligence apart. Neural policies learn rich behaviors yet forget them the moment the environment changes; rules never learn, and never forget. Every prior attempt to combine them has kept this separation, letting rules supervise, constrain, or override the network from outside. We dissolve the boundary itself. But no union can be trusted before it can be tested, and ABR has never known how to measure what its policies learn or forget. The field's yardstick is bandwidth statistics, and we show it misleads. Identical statistics can hide entirely different outcomes, while wildly different statistics can hide similar ones. We replace the yardstick before building the bridge, with Texture-Aware Generalization Evaluation, a protocol that judges a policy by its whole training journey across traces whose temporal nature is laid bare. What truly breaks a policy is invisible. No statistic reveals it, no feature extracts it, yet rules walk through it untouched, for they reason from physics and owe the data nothing. So we build the bridge. Neuro-Symbolic Manifold Alignment (NSMA) embeds rule decisions as anchors inside the latent space of the neural policy, so that it keeps learning where learning pays, and can no longer forget what rules have always known. Generalization cannot be argued, only survived. We raise NSMA on 3G traces alone and release it, without fine-tuning, into eight unseen datasets spanning 4G, 5G, and WiFi, and onto a real-world player. It outperforms every state-of-the-art baseline. And when we open its latent space to ask why, probing and visualization return the same answer the design promised. https://tinyzqh.github.io/NSMA/

cs.NI

Self-Driven Atomic Dispersion in Graphitic Layers

Carbon-supported single-atom catalysts maximize metal utilization, but how metal nanoparticles transform into isolated atoms within carbon remains unclear. We show that metal nanoparticles can undergo a self-driven dispersion process under hydrocarbon oxidation conditions, transforming into single atoms that are confined in carbon matrix. Using Pt-catalysed hydrocarbon oxidation as a model, we combine operando electron microscopy, near-ambient-pressure X-ray photoelectron spectroscopy and mass spectrometry to track coupled structural and chemical evolution. Graphitic carbon grows at step edges of Pt nanoparticle, continuously reconstructing Pt surface and generating undercoordinated sites for atom release. In-situ generated CO accumulates at the metal-carbon interface, weakening bonding and facilitating self-amplified atom release and migration. Defective carbon overlayers then trap, stabilize and transport liberated atoms, while oxidative etching preserves interfacial access of reaction-gas. Similar behaviour across other metals suggests a general atomization pathway for single-atom catalyst synthesis, yielding products with electrocatalytic hydrogen production activity beyond standard commercial benchmarks.

cond-mat.mtrl-sci

How is Water released in Hydrogen-Based Metal Oxide Reduction? Unraveling the Kinetic Bottleneck in Sustainable Metal Production

Hydrogen-based direct reduction of metal oxides is a ubiquitous solid-gas redox process central to geophysics, sustainable metallurgy, redox energy cycles and catalysis. During this process, hydrogen removes lattice oxygen to form water, yet product water has long been regarded as a passive exhaust, and its nanoscale formation, trapping and removal remain poorly understood. Here, we directly observe redox-product water release from iron oxide during hydrogen-based direct reduction. Because water removal emerges from coupled structural, chemical and crystallographic evolution across multiple length-scales under realistic non-equilibrium reaction-conditions, we establish a correlative multiscale in-situ approach that links pore evolution, molecular water signatures, phase transformation and chemical-state evolution during hematite reduction. We uncover a mechanism in which oxygen removal induces closed nanopores spatially delocalized from reaction surfaces, causing transient trapping of water vapor. Water is released only when these pores coalesce into a percolating network connected to the surface, coinciding with and accelerating the onset of the hematite-to-magnetite transformation. These findings show that dynamically evolving pore topology governs mass transport and redox kinetics in solid-gas reactions, closing a critical mechanistic gap in product-water removal and providing nanoscale guidance for hydrogen-based metal extraction, reactor design, and sustainable redox energy technologies under practical conditions.

physics.chem-ph

CrossVLA: Cross-Paradigm Post-Training and Inference Optimization for Vision-Language-Action Models

Vision-Language-Action (VLA) models have rapidly converged on a small set of architectural patterns: discrete-token autoregression (e.g. OpenVLA) and continuous-action flow-matching (e.g. pi-0.5). Yet preference alignment via Direct Preference Optimisation (DPO) -- the de-facto post-training step in language models -- has been studied almost exclusively on autoregressive VLAs. We present CrossVLA, an empirical study of cross-paradigm VLA post-training. Three contributions: (i) a surrogate flow-matching log-probability estimator that lets DPO operate on continuous-action backbones without probability-flow ODE integration; (ii) a head-to-head comparison of LoRA and DoRA as the parameter-efficient layer for VLA DPO, finding DoRA improves over OpenVLA SFT by a mean +10.4 pp across LIBERO 4-suite (600 trials, 3 seeds) -- per-suite +20.0 Object, +11.0 Long-horizon, +8.0 Goal, +2.7 Spatial -- with zero seed variance on Object (38/50 on each of 3 seeds); (iii) an inference-time anatomy showing the denoise loop dominates 78.6% of sample_actions latency and prefix-K/V caching a la VLA-Cache caps at a 21% acceleration ceiling -- both chunk-level and token-level cache strategies degrade success rate to 0-80% in our benchmarks. We further pretrain a multi-view + temporal projection head on 6000 LIBERO frames, achieving 99.5% k-NN recall@1 for same-task retrieval (36x over random), available as a downstream initialisation. All code, ckpts, training logs, and reproduction scripts are open at https://github.com/lz-googlefycy/vla-lab.

cs.CV

WhiteTesseract: Reframing the Interpretation of Cultural Heritage through XR and Conversational AI

Cultural heritage exhibitions often struggle to sustain attention and support reflective engagement. Physical exhibitions rely on fixed interpretive aids that lack adaptability to individual backgrounds or curiosity, and their effectiveness depends heavily on a visitor's Personal Context, prior knowledge, and cultural literacy. Meanwhile, digital exhibitions prioritize convenience and accessibility but risk weakening the Physical and Social Contexts that define embodied cultural experience. WhiteTesseract addresses this gap by enabling in-situ interpretation through high-resolution XR and conversational AI. The system integrates spatial intelligence via artwork recognition to allow visitors to selectively reduce environmental distractions (via diminished reality) and engage in context-aware dialogue (via large language models). The goal is to preserve the richness of the physical and social environment while providing a flexible space for personal reflection, enhancing Personal Context without compromising physical authenticity. We deployed the system in a Claude Monet exhibition and conducted a controlled user study with 26 participants. Quantitative results showed that WhiteTesseract modulation significantly increased average viewing duration from 35.3 to 98.3 seconds (p < 0.001). Analysis of 529 visitor-AI interactions revealed that 60% extended beyond factual queries to include analytical, emotional, and comparative inquiries. These findings demonstrate how XR and AI can enrich the physical exhibition experience by supporting deeper, more personalized engagement without displacing the embodied value of cultural heritage. We discuss technical and social constraints for real-world deployment and limitations of our controlled setting.

cs.HC

M$^4$-SAM: Multi-Modal Mixture-of-Experts with Memory-Augmented SAM for RGB-D Video Salient Object Detection

The Segment Anything Model 2 (SAM2) has emerged as a foundation model for universal segmentation. Owing to its generalizable visual representations, SAM2 has been successfully applied to various downstream tasks. However, extending SAM2 to the RGB-D video salient object detection (RGB-D VSOD) task encounters three challenges including limited spatial modeling of linear LoRA, insufficient employment of SAM's multi-scale features, and dependence of initialization on explicit prompts. To address the issues, we present Multi-Modal Mixture-of-Experts with Memory-Augmented SAM (M$^4$-SAM), which equips SAM2 with modality-related PEFT, hierarchical feature fusion, and prompt-free memory initialization. Firstly, we inject Modality-Aware MoE-LORA, which employs convolutional experts to encode local spatial priors and introduces a modality dispatcher for efficient multi-modal fine-tuning, into SAM2's encoder. Secondly, we deploy Gated Multi-Level Feature Fusion, which hierarchically aggregates multi-scale encoder features with an adaptive gating mechanism, to balance spatial details and semantic context. Finally, to conduct zero-shot VSOD without manual prompts, we utilize a Pseudo-Guided Initialization, where a coarse mask is regarded as a pseudo prior and used to bootstrap the memory bank. Extensive experiments demonstrate that M$^4$-SAM achieves the state-of-the-art performance across all evaluation metrics on three public RGB-D VSOD datasets.

cs.CV

Checkerboard: Closed-Form and Data-Independent Trigger Design for Clean-Label Backdoor Attacks

Backdoor attacks threaten the deep-learning supply chain by poisoning a small fraction of the training data so that a model behaves normally on clean inputs but maps triggered inputs to an attacker-chosen class. Clean-label backdoor attacks are especially difficult to audit because poisoned examples preserve their semantic labels. Yet existing clean-label attacks often require surrogate model training, auxiliary data access, or iterative optimization. In this paper, we present \emph{Checkerboard}, a clean-label backdoor attack with closed-form, data-independent trigger design. We formulate trigger design through an input-space Fisher-separability objective and, under a ridge four-neighbor local-smoothness prior for natural images, obtain the pixel-wise checkerboard as a closed-form maximizer of the resulting design proxy without data access, model training, or optimization. Across four benchmark datasets, Checkerboard outperforms the evaluated norm-bounded clean-label attacks and achieves state-of-the-art performance under low global poisoning rates. For example, on CIFAR-10, under a trigger perturbation of $10/255$, poisoning 20 training samples achieves $95.72\%$ Attack Success Rate (ASR). On IN-100, a global poisoning rate of only $0.4\%$ yields over $83\%$ ASR without degrading clean accuracy. The proposed attack also remains effective against state-of-the-art backdoor defenses and shows resistance to adaptive defenses under simple modification.

cs.CR