Searcharxiv⌕ Search

arXiv subjects

Zhuo Xu

Publications and source records attributed to Zhuo Xu.

At least 19 recordsLinked to original sources

Similar Is Not Useful: Selecting In-Context Demonstrations by Closed-Loop Utility

Retrieval-augmented vision-language-action (VLA) policies fill their context with the demonstrations whose frames look most like the current observation under frozen DINOv2 embeddings. We ask whether visual similarity selects the demonstrations that make the policy succeed. For a frozen retrieval-augmented VLA (RICL on $π_0$-FAST, LIBERO), we make the demonstration pool swappable at run time and score each demonstration's utility by regressing the closed-loop success of 60 fixed-size pools on their membership. On initial states disjoint from those used for scoring, pools of the five highest-utility demonstrations succeed on 66.4% of 760 paired episodes across 19 tasks, pools of the five most similar on 55.7%, and random pools on 55.5%. Utility beats similarity by 10.8 points ($p=3.2\times10^{-6}$; positive on 15 of 18 untied tasks), including on 12 tasks the policy was never primed on, and similarity-selected pools do no better than random ($+0.1$ points). Within a task, a pool's visual similarity to the test scenes tracks its success at Spearman 0.10; across tasks, similarity separates tasks whose scenes differ and falls to chance when two tasks share a scene. The gain comes from on-task closed-loop evidence: best-of-ten direct search over pools recovers two-thirds of it with 100 rollouts. Against the shipped 20-demonstration pool, utility-curated pools of five lead by 7.0 points over 560 paired episodes from two evaluation runs ($p=0.006$), and utility-ordered retrieval inside the full pool leads by 4.5 points ($p=0.055$).

cs.LG↗

Where Do Human-to-Robot Transfer Gains Come From?

Human data can support robot policy pretraining, but gains attributed to a data recipe may also reflect subset size, training variability, or downstream adaptation. In an HPT implementation on a 20-task MetaWorld suite with three training blocks, a constrained random 5,000-recording subset matches most of the task-informed subset's gain over the 40,000-recording pool at 20,000 updates (3.69 of 4.29 percentage points), leaving equal-size selection differences of 0.60 points at 5,000 recordings and 0.45 points at 1,250 recordings, with wide paired intervals. Across 12 comparisons, task orderings repeat across seeds for several contrasts, but a fixed predictor built from the other two seeds trails the mean or difficulty reference in at least one held-out fold for every comparison. Neither mechanism probe shows its predicted positive interaction: task-slot mismatch yields an interaction of $-0.0347$ points after adaptation, and in a six-task observation experiment the observation-by-pretraining interaction changes sign between seeds ($-18.29$ and $+1.04$ points) while full-state pretraining gains are positive in both ($+6.37$ and $+2.31$ points). This retrospective study shows how equal-size and capacity controls, seed-level reporting, and targeted interventions change the interpretation of apparent transfer gains.

cs.RO↗

Site-Specific Cell Shaping: An Agentic Framework

An agentic framework is proposed for cell shaping in future sixth-generation (6G) wireless network planning. Cell shaping controls the coverage and interferences of base stations (BSs) through antenna parameters configuration, providing an important means of improving coverage. In contrast to conventional approaches that reply on costly performance evaluations, the proposed framework achieves intelligent and efficient antenna configuration through a perception-reasoning-reflection loop. Specifically, a Configuration Agent combines scene information, evaluation history, and reflection feedback to generate antenna configuration proposals. Then, a ray tracing(RT)-based evaluator assesses these proposals and returns a structured performance summary. Next, a Reflection Agent interprets these results to diagnose site-specific performance deficiencies, recommend feasible configuration adjustments, and accumulate conditional experience. Through this iterative process, the framework accumulates site-specific experience and progressively refines antenna configurations without human-in-the-loop intervention. Simulations in real-world urban scenarios demonstrate that the proposed framework achieves lower outage probabilities than the considered benchmark methods, highlighting the effectiveness of agentic reasoning and reflection in translating site-specific performance feedback and accumulated experience into adaptive antenna configuration decisions.

eess.SY↗

Super-resolution quantum imaging via multiphoton correlation

The resolution of conventional imaging is fundamentally constrained by the diffraction limit. Here we demonstrate that this limit can be overcome using classical thermal light, through the correlation of multiphoton subsystems. By resolving the photon numbers detected in the two arms of a Hanbury Brown-Twiss interferometer, the correlation function exhibits a narrowed peak or dip whose width is tunable via the average photon number. Temporal and spatial super-resolution enhancements up to 11.8-fold and 5.1-fold, respectively, are experimentally achieved. As a proof-of-principle experiment, a double-pinhole that is completely unresolved by standard ghost imaging becomes clearly distinguishable via the correlation of two-photon versus zero-photon. The principle of this super-resolution imaging can be interpreted as a combination of classical super-resolution imaging and quantum super-resolution imaging. This work provides a versatile platform for super-resolution imaging and lithography, and opens a new avenue for exploring the boundary between classical and nonclassical phenomena.

quant-ph↗

TacClaw-Infinity: A Large-Scale Vision-Tactile-Language-Action Dataset for Dexterous Manipulation

Large-scale robot learning increasingly relies on diverse human demonstrations, yet tactile manipulation data remain difficult to scale, and existing multimodal datasets often lack consistent quality control and structured supervision. We present TacClaw-Infinity, a large-scale structured Vision-Tactile-Language-Action (VTLA) dataset for contact-rich manipulation, collected with TacClaw, a tactile-enabled UMI-style handheld interface that records synchronized visual observations, fingertip tactile signals, and end-effector trajectories without requiring a target robot during data collection. TacClaw-Infinity is built through a distributed worldwide collection across homes, laboratories, industrial workplaces, retail stores, and outdoor environments including tasks contributed by academic and industrial collaborators. Together, these efforts yield over 10,000 hours, 1 million episodes, and 1 billion frames spanning more than 1,000 task types. We develop a scalable pipeline for trajectory reconstruction, multimodal quality control, embodiment-aware filtering, and structured annotation, covering contact-centric segmentation, subtask description, and spatial grounding. We validate TacClaw-Infinity at both the data and model levels: At the data level, we assess the collection interface, the action-space compatibility of the curated demonstrations, and the structured annotations, while for the model level, we demonstrate cross-embodiment transfer across three heterogeneous robots without robot-specific demonstrations.

cs.RO↗

Finite-event modulation transfer through forward-scattering media

How spatial structure is transferred through a forward-scattering medium depends jointly on pattern scale and propagation distance. Starting from photon exit displacements, we derive modulation transfer while retaining the number, depths, and projected angles of individual deflections, with event occurrences described by a homogeneous Poisson process along the propagation path. The second angular moment yields a leading low-frequency loss proportional to $k^2z^3$, where $k$ is angular spatial frequency and $z$ is thickness. At finite frequency, the model predicts two coupled departures: loss bends below its low-frequency quadratic extrapolation at fixed thickness, and transfer curves separate by thickness at fixed $k^2z^3$. The leading corrections to both effects arise from the same fourth angular moment. For symmetric, nondegenerate projected-angle distributions, the full response further establishes increasing loss with thickness in the same medium at fixed joint variable. Binary-pattern measurements through TiO$_2$ suspensions span five nominal loadings, seven thicknesses, and 20 spatial frequencies, supporting the approximate low-frequency scaling and showing both departures. A Gaussian effective-angle response calibrated only on lower-frequency data predicts the held-out higher-frequency band without refitting, with a logarithmic root-mean-square error of 0.0181 compared with 0.1021 for quadratic extrapolation. The results show that finite-event statistics provide a common physical origin for spectral bending and thickness-dependent departure from low-frequency scaling, linking coarse-pattern transport to finer spatial structure.

physics.optics↗

RoboChrono: A Real Robot Benchmark for Streaming Task Understanding

Understanding ongoing robot manipulation requires models to interpret visual observations in relation to interaction history and task progress. We introduce RoboChrono, a benchmark for streaming task understanding comprising 39 scenarios and 34,713 evaluation instances, constructed from real robot executions and complementary bare-hand human recordings. The benchmark evaluates seven tasks grouped into recognition, alignment, and temporal grounding, covering action understanding and anticipation, visual correspondence, temporal ordering, and action localization. Zero-shot evaluation of 18 vision-language models reveals substantial differences across tasks. GPT-6-Astra achieves 98.3% accuracy on Frame Matching but 68.3% on Frame Ordering, while RynnBrain1.1-122B-A10B exhibits a larger gap, reaching 95.4% and 32.9%, respectively. Input ablations on matched questions with five open-weight models further reveal distinct dependencies on visual evidence: removing visual observations reduces Current Action Recognition accuracy by 22.1 percentage points, whereas Next Action Prediction decreases by only 0.7 points. These findings show that strong visual matching does not consistently coincide with strong temporal ordering, and suggest that next-action prediction can be supported by task and action priors even when visual evidence is unavailable. RoboChrono provides a diagnostic setting for examining these differences, highlighting the need for capability-specific evaluation beyond aggregate scores when assessing task understanding in robot manipulation.

cs.RO↗

CARNet: Channel-Adaptive Receiver Network for Robust NextG Communications

Neural receivers have been recognized as a promising paradigm for the next-generation (NextG) communications. However, due to the reliance on a static network optimized for specific channel conditions, their generalization capability across diverse scenarios remains a significant challenge. To address this issue, this paper proposes a novel channel-adaptive neural receiver network (CARNet) based on the mixture-of-experts (MoE) framework. The proposed architecture employs multiple expert networks together with an efficient routing mechanism to enable signal detection in various scenarios. The experts are constructed via stacked ResNet blocks and specialize in robust signal detection within specific channel conditions, while the routing mechanism incorporates a lightweight representation learning module, which projects the coarse channel estimate into a low-dimensional latent embedding. The learned embedding characterizes task-relevant channel conditions and provides efficient guidance for accurate expert selection. Link-level simulation experiments demonstrate that the proposed CARNet achieves superior performance across diverse channel conditions.

cs.IT↗

Near-Field Communications with Grating Lobes for Quasi-Distributed Arrays: From ULA to MRA

Extremely large-scale antenna array (ELAA) has emerged as a common feature of many key candidate technologies for 6G, where the near-field characteristics become dominant. The quasi-distributed array can further extend the near-field range and utilize the near-field benefits to improve the system performance. However, its typical implementation with modular arrays suffers from severe grating lobes that cause non-negligible inter-user interferences. To solve this problem, we propose the modular minimum-redundancy array (M-MRA) to suppress near-field grating lobes by redesigning the subarray configuration. Specifically, we first characterize the beam pattern of the conventional modular uniform linear array (M-ULA). Contrary to the common belief that grating lobes only exist in the angle domain, we reveal that near-field grating lobes may also occur in the distance domain. We further analyze how to suppress near-field grating lobes for the M-ULA. The results demonstrate that increasing the number of antennas per module can suppress grating lobes. In particular, the number of antennas required grows linearly with the inter-module spacing, thus the grating lobe interferences are severe under a limited number of antennas. This limitation inspires us to propose the M-MRA by redesigning the subarray structure. For M-MRA, the nonuniform antenna spacing within each subarray provides a narrower spatial envelope, allowing it to suppress near-field grating lobes in the angle and distance domains simultaneously. Simulation results verify that the proposed M-MRA can significantly improve the spectrum efficiency of multi-user near-field communications under the same number of antennas.

eess.SP↗

Accuracy-Configurable Floating-Point Multiplier Design for SRAM-Based Compute-in-Memory

Digital Compute-in-Memory (DCiM) reduces data movement and has become a promising solution for energy-efficient edge AI. However, most existing DCiM frameworks still primarily target integer or fixed-point arithmetic, and provide limited support for compiler-integrated and accuracy-configurable floating-point computation. Directly integrating conventional IEEE 754 floating-point units into dense SRAM-based DCiM arrays, however, incurs high area and power overhead. To address this challenge, this work presents an accuracy-configurable floating-point multiplier integrated into the OpenACM framework for SRAM-based DCiM. An exact IEEE~754-compliant multiplier is first implemented as a baseline, and a mantissa-segmentation-based approximate multiplier is then proposed to reduce hardware cost while preserving numerical fidelity. Post-layout results show up to 69% logic area reduction and 72% power savings over exact floating-point designs without delay overhead. Evaluations on image processing tasks and ResNet-18 inference further demonstrate negligible accuracy degradation. These results indicate that compiler-integrated approximate floating-point multiplication is a practical approach for enabling efficient and configurable floating-point support in SRAM-based DCiM systems. The Floating-Point Multiplier is available on https://github.com/ShenShan123/OpenACM

cs.AR↗

Observation antibunching with classical light in a linear interferometer

Understanding the boundary between classical and nonclassical phenomena is important for both fundamental researches in quantum optics and applications in quantum information. One of the most interesting research directions in this field is exploring nonclassical effects with classical light. In this paper, we will show that it is possible to observe antibunching with thermal light in a Hanbury Brown-Twiss interferometer by treating single-photon detectors as photon-number-resolving detectors to perform photon-number projection measurements. Both temporal and spatial antibunching is observed via the correlation of two detectors detecting one and zero photon, respectively. By comparing the measured results of thermal and laser light, it is found that the observed antibunching arises from the combined effect of photon statistics of thermal light and photon-number projection measurement.The classical and nonclassical nature of the observed antibunching is analyzed. The results are helpful to understand the connection between classical and nonclassical correlation and may find applications in multiphoton interference and quantum imaging.

quant-ph↗

Ghost imaging with zero photons

Ghost imaging was first demonstrated with entangled photon pairs and well-known for its peculiar properties. The signal beam that illuminates the object possesses no spatial resolution, whereas the reference beam, which never interacts with the object, is spatially resolved. Either beam alone cannot retrieve the image, which can only be obtained when the signal and reference beams are correlated. Here we will report a ghost imaging experiment with even more peculiar properties, in which the image can be reconstructed when no photon interacts with the object or even no photon in neither signal nor reference beam. All the photons interacted with the object are discarded. Only the time bins with zero photon are employed to retrieve the image, a process referred to as "ghost imaging with zero photons" hereafter. The reason why ghost image can be retrieved with zero photons is jointly determined by photon-number projection measurement and photon statistics of thermal light. The results are helpful to resolve the debate on the physics of ghost imaging and understand the relation between quantum and classical correlations.

quant-ph↗

Real-to-Sim Robot Policy Evaluation with Gaussian Splatting Simulation of Soft-Body Interactions

Robotic manipulation policies are advancing rapidly, but their direct evaluation in the real world remains costly, time-consuming, and difficult to reproduce, particularly for tasks involving deformable objects. Simulation provides a scalable and systematic alternative, yet existing simulators often fail to capture the coupled visual and physical complexity of soft-body interactions. We present a real-to-sim policy evaluation framework that constructs soft-body digital twins from real-world videos and renders robots, objects, and environments with photorealistic fidelity using 3D Gaussian Splatting. We validate our approach on representative deformable manipulation tasks, including plush toy packing, rope routing, and T-block pushing, demonstrating that simulated rollouts correlate strongly with real-world execution performance and reveal key behavioral patterns of learned policies. Our results suggest that combining physics-informed reconstruction with high-quality rendering enables reproducible, scalable, and accurate evaluation of robotic manipulation policies. Website: https://real2sim-eval.github.io/

cs.RO↗

Unified Error Correction Code Transformer with Low Complexity

Channel coding is vital for reliable sixth-generation (6G) data transmission, employing diverse error correction codes for various application scenarios. Traditional decoders require dedicated hardware for each code, leading to high hardware costs. Recently, artificial intelligence (AI)-driven approaches, such as the error correction code Transformer (ECCT) and its enhanced version, the foundation error correction code Transformer (FECCT), have been proposed to reduce the hardware cost by leveraging the Transformer to decode multiple codes. However, their excessively high computational complexity of $\mathcal{O}(N^2)$ due to the self-attention mechanism in the Transformer limits scalability, where $N$ represents the sequence length. To reduce computational complexity, we propose a unified Transformer-based decoder that handles multiple linear block codes within a single framework. Specifically, a standardized unit is employed to align code length and code rate across different code types, while a redesigned low-rank unified attention module, with computational complexity of $\mathcal{O}(N)$, is shared across various heads in the Transformer. Additionally, a sparse mask, derived from the parity-check matrix's sparsity, is introduced to enhance the decoder's ability to capture inherent constraints between information and parity-check bits, improving decoding accuracy and further reducing computational complexity by $86\%$. Extensive experimental results demonstrate that the proposed unified Transformer-based decoder outperforms existing methods and provides a high-performance, low-complexity solution for next-generation wireless communication systems.

cs.IT↗

OpenHAIV: A Framework Towards Practical Open-World Learning

Substantial progress has been made in various techniques for open-world recognition. Out-of-distribution (OOD) detection methods can effectively distinguish between known and unknown classes in the data, while incremental learning enables continuous model knowledge updates. However, in open-world scenarios, these approaches still face limitations. Relying solely on OOD detection does not facilitate knowledge updates in the model, and incremental fine-tuning typically requires supervised conditions, which significantly deviate from open-world settings. To address these challenges, this paper proposes OpenHAIV, a novel framework that integrates OOD detection, new class discovery, and incremental continual fine-tuning into a unified pipeline. This framework allows models to autonomously acquire and update knowledge in open-world environments. The proposed framework is available at https://haiv-lab.github.io/openhaiv .

cs.CV↗

OpenEarthSensing: Large-Scale Fine-Grained Benchmark for Open-World Remote Sensing

The advancement of remote sensing, including satellite systems, facilitates the continuous acquisition of remote sensing imagery globally, introducing novel challenges for achieving open-world tasks. Deployed models need to continuously adjust to a constant influx of new data, which frequently exhibits diverse shifts from the data encountered during the training phase. To effectively handle the new data, models are required to detect semantic shifts, adapt to covariate shifts, and continuously update their parameters without forgetting learned knowledge, as has been considered in works on a variety of open-world tasks. However, existing studies are typically conducted within a single dataset to simulate realistic conditions, with a lack of large-scale benchmarks capable of evaluating multiple open-world tasks. In this paper, we introduce \textbf{OpenEarthSensing (OES)}, a large-scale fine-grained benchmark for open-world remote sensing. OES includes 189 scene and object categories, covering the vast majority of potential semantic shifts that may occur in the real world. Additionally, to provide a more comprehensive testbed for evaluating the generalization performance, OES encompasses five data domains with significant covariate shifts, including two RGB satellite domains, one RGB aerial domain, one multispectral RGB domain, and one infrared domain. We evaluate the baselines and existing methods for diverse tasks on OES, demonstrating that it serves as a meaningful and challenging benchmark for open-world remote sensing. The proposed dataset OES is available at https://haiv-lab.github.io/OES.

cs.CV↗

Empowering Near-Field Communications in Low-Altitude Economy with LLM: Fundamentals, Potentials, Solutions, and Future Directions

The low-altitude economy (LAE) is gaining significant attention from academia and industry. Fortunately, LAE naturally aligns with near-field communications in extremely large-scale MIMO (XL-MIMO) systems. By leveraging near-field beamfocusing, LAE can precisely direct beam energy to unmanned aerial vehicles, while the additional distance dimension boosts overall spectrum efficiency. However, near-field communications in LAE still face several challenges, such as the increase in signal processing complexity and the necessity of distinguishing between far and near-field users. Inspired by the large language models (LLM) with powerful ability to handle complex problems, we apply LLM to solve challenges of near-field communications in LAE. The objective of this article is to provide a comprehensive analysis and discussion on LLM-empowered near-field communications in LAE. Specifically, we first introduce fundamentals of LLM and near-field communications, including the key advantages of LLM and key characteristics of near-field communications. Then, we reveal the opportunities and challenges of near-field communications in LAE. To address these challenges, we present a LLM-based scheme for near-field communications in LAE, and provide a case study which jointly distinguishes far and near-field users and designs multi-user precoding matrix. Finally, we outline and highlight several future research directions and open issues.

eess.SP↗

Input-to-state type Stability for Simplified Fluid-Particle Interaction System

In this paper, we study the well-posedness and the input-to-state type stability of a one-dimensional fluid-particle interaction system. A distinctive feature, not yet considered in the ISS literature, is that our system involves a free boundary. More precisely, the fluid is described by the viscous Burgers equation, and the motion of the particle obeys Newton second law. The point mass is subject to both a feedback control and an open-loop control. We first establish the well-posedness of the system for any open-loop input in the L2(0, infinity) space. Assuming the input also belongs to the L1(0,infinity) space, we prove that the particle's position remains uniformly bounded and that the system is input-to-state type stable. The proof is based on the construction of a Lyapunov functional derived from a special test function.

math.AP↗