arXiv subjects

Hao Xu

Publications and source records attributed to Hao Xu.

At least 37 records · Page 2Linked to original sources

arXiv2026

CODE: Cross-Modal Calibration and Dynamic Suppression for Open World Object Detection

Open World Object Detection (OWOD) built on multimodal foundation models often suffers from semantic ambiguity caused by unidirectional text-to-vision matching, while rigid outlier penalties may over-suppress unknown objects near known-class decision boundaries. We propose CODE (Cross-Modal Calibration and Dynamic Suppression), a unified inference-time framework with three complementary components. Cross-Modal Joint Confidence Calibration injects global visual prototypes to calibrate text-driven known-class predictions. Uncertainty-Guided Universal Objectness Enhancement measures classification hesitation from local visual responses to strengthen potential unknown objects. Dynamic Outlier Suppression via Confidence Margin replaces rigid suppression with a margin-aware adjustment that preserves ambiguous out-of-distribution instances. Experiments on the Real-World Detection benchmark demonstrate that, with the OWL-ViT L/14 backbone, CODE achieves 21.7 U-mAP and 40.8 K-mAP in Task 1, surpassing the previous state of the art by 2.6 and 2.3 points, respectively.

cs.CV↗

arXiv2026

Implication of the observed $ψ(3770)\to p\bar{p}π^0$ for studying the $p\bar{p}\to ψ(3770)π^0$ process

We study the charmonium $p \bar{p} \to ψ(3770) π^0$ reaction using the effective lagrangian approach where the contributions from well established $N^*$ states are considered, and all parameters are fixed in the process of $e^+e^- \to p \bar{p}π^0$ at center of mass energy $\sqrt{s} = 3.773$ GeV. The experimental data on the line shape of the mass distribution of the $e^+e^- \to p\bar{p}π^0$ can be well reproduced. Based on the studying of $e^+e^- \to p \bar{p}π^0$, the total and differential cross sections of the $p \bar{p} \to ψ(3770) π^0$ reaction are predicted. At the same time we evaluated also the cross sections of the $p \bar{p} \to ψ(3686) π^0$ reaction. It is shown that the contribution of the nucleon pole to this reaction is largest from the reaction threshold within a wide range. However, the interference between nucleon pole and the other nucleon resonance can still change the angle distributions significantly. Those theoretical results may be test by the future experiments at $\overline{\mbox{P}}$ANDA.

hep-ph↗

arXiv2026

Finite-blocklength Fluid Antenna Systems

This paper investigates fluid antenna systems (FASs) subject to finite-blocklength (FBL) constraints, motivated by the strict reliability-latency and ultra-massive connectivity requirements of future wireless networks. While FAS performance has been widely studied in the asymptotic regime, its behavior under FBL remains largely unexplored. Our objective is to develop a unified set of analytical tools for evaluating FASs under FBL that remains applicable across different spatial-correlation models. First, to establish accurate benchmarks for non-orthogonal finite-length user signature design, we characterize both the average and the worst-case correlation coefficients via extreme value theory (EVT) and derive closed-form predictions of the achievable correlation levels. Second, taking block error rate (BLER) as the fundamental FBL metric, we study joint detection and decoding in FAS-assisted links and derive a closed-form BLER expression that is universally applicable across channel models. Additionally, we revisit outage probability (OP) in the FBL regime and obtain tractable OP characterizations for both FASs and conventional multiple fixed-position antenna (FPA) systems. In order to reduce the computational burden for multi-fold integrals in correlated fading models, we further propose a Taylor-expansion-assisted mean value theorem for integrals (MVTI), thus enabling efficient performance evaluation with marginal accuracy loss. Numerical results validate the analysis and reveal that even single-antenna FASs can have superior spatial diversity relative to conventional multi-FPA systems. Moreover, under both FBL and interference-limited environments, FASs provide improved energy, spectral, and hardware efficiencies, hence highlighting FAS as a promising enabler for next-generation wireless networks.

cs.IT↗

arXiv2026

GraphMed-LT: Patient-Specific Graph Memory with Latent Clinical Thought Refinement for Multi-Turn Medical Conversations

Multi-turn medical question answering (QA) aims to model realistic clinical diagnosis, where a doctor gathers patient information across multiple turns of conversation. Existing multi-turn medical conversation systems have shown promising progress, but they often rely on accumulated conversation histories as memory, leaving clinical evidence fragmented across turns. We propose GraphMed-LT, a patient-specific graph memory approach with latent clinical thought refinement for multi-turn medical conversations. GraphMed-LT extracts patient-specific clinical triplets from patient responses, retrieves relevant knowledge triplets, and organises them into an incrementally updated graph memory. The graph memory is projected into graph-conditioned evidence tokens and refined inside a trainable doctor agent through hidden-state feedback, enabling the agent to update its internal clinical context before asking follow-up questions or producing the final answer. Experiments on three multi-turn medical QA benchmarks show that GraphMed-LT consistently outperforms existing multi-turn medical conversation baselines across multiple LLM backbones, achieving up to a 6.3 percentage-point absolute improvement over the strongest baseline. Further analyses show that GraphMed-LT asks more answerable follow-up questions and provides consistent gains across medical specialties.

cs.CL↗

arXiv2026

SSE-Bio: A Structured Self-Evolving Agent with Agentic Retrieval Policy for Multi-Hop Biomedical Reasoning

Biomedical multi-hop question answering (QA) requires models to connect evidence across intermediate entities such as diseases, drugs, proteins, and phenotypes. Existing agents typically rely on static retrieval workflows or coarse-grained prompt rewriting, which can lead to instruction drift when reasoning procedures need to be updated. We propose SSE-Bio, a structured self-evolving agent with an agentic retrieval policy for multi-hop biomedical reasoning. Instead of globally rewriting agent instructions, SSE-Bio maintains a structured state, selectively retrieves knowledge triplets and prior templates through a trainable proxy policy, and improves its reasoning memory through fine-grained template editing. To optimise retrieval decisions, we introduce a proxy-training strategy based on group relative policy optimization, where the proxy is improved through decision-contrastive groups over alternative retrieval choices. Experiments on three biomedical multi-hop QA benchmarks show that SSE-Bio consistently outperforms existing baselines, achieving an improvement of 6.56 absolute points over the strongest self-evolving baseline on BioHopR.

cs.CL↗

arXiv2026

The Equality Cases of the Weak Simplex Conjecture

Among $n+1$ equiprobable equal-energy signals in $\R^n$ under additive white Gaussian noise with maximum-likelihood decoding, which arrangement maximizes the probability of correct decoding? The question is Shannon's, recorded by Rice in 1950. Mulgund proved in 2026 that the regular-simplex value bounds the correct-decoding probability of every signal set at every signal-to-noise ratio, leaving open whether the simplex is the only maximizer. This paper determines the equality cases in a form stronger than uniqueness. A signal set other than a regular simplex falls strictly below the bound at every positive signal-to-noise ratio. Hence a code meeting the bound at one positive operating point is already a regular simplex, up to vertex relabeling and an orthogonal map. In probabilistic form, among the correlation matrices that signal sets induce, any matrix other than the identity gives a lower-orthant probability strictly above its independent counterpart at every finite threshold, leaving no room for a nontrivial equality. No code of ambient dimension below $n$ attains the bound. Under an energy budget $E$ with unrestricted blocklength the optimal codebook is uniquely the regular simplex of circumradius $\sqrt{E}$. Every optimal codeword therefore exhausts its allowance. Equality in the Simplex Mean Width Conjecture likewise occurs only at the regular simplex. The proof strengthens the first self-convolution step of Mulgund's argument with Royen's correlation theorem. The single-parameter rigidity is machine-checked in Lean 4.

cs.IT↗

arXiv2026

ATOM: Geometry-Aware Microgesture towards Object-Agnostic Tangible Interaction

This paper presents ATOM, an integrated framework towards agnostic and tangible object interactions with microgestures. Our goal is to support microgesture interactions across different everyday objects, with the capability to automatically leverage the geometric affordance of each object. We formulate a fingertip-aware detection pipeline to leverage generative 2D and 3D models for geometry enhancement and refinement. We then introduce a usability-based method to prioritize the detected elements based on their ergonomic suitability for interactions. Building on this foundation, we further develop an AR system to transform everyday handheld objects into tangible user interfaces with 0D, 1D, and 2D microgesture interactions. Across transitions among everyday cooking objects of varying shapes and sizes, ATOM outperformed ablation baselines in task completion, usability (SUS), and workload (NASA-TLX). A further study with 10 objects demonstrates ATOM's generalizability across objects and grasps, highlighting its potential towards fluid, object-agnostic tangible interaction in real-world AR scenarios.

cs.HC↗

arXiv2026

Secure Cooperative THz ISAC via Mamba Empowered Graph Neural Network Precoding

The terahertz (THz) band offers abundant spectrum resources for high-throughput communication and ultra high-precision localization. This paper investigates secure communication in cooperative THz orthogonal frequency-division multiplexing (OFDM) bistatic integrated sensing and communications (ISAC) systems, where multiple base stations (BSs) equipped with extremely large-scale antenna arrays (ELAAs) collaboratively serve downlink users while concurrently locating multiple targets. Malicious targets are assumed to act as potential eavesdroppers attempting to intercept confidential information intended for legitimate users. To mitigate these threats, we formulate a joint optimization problem for analog beamforming, digital precoding, true-time delayers (TTDs), and sensing signal covariance matrix design. The objective is to maximize the minimum secrecy rate subject to Cramer-Rao bound (CRB) constraints that ensure localization accuracy. This problem is highly challenging due to the non-convex CRB constraint, strongly coupled variables, high computational complexity from ELAA, and near-field channel modeling. To address these challenges, we propose a novel data-driven framework that integrates graph neural networks (GNNs) with the Mamba architecture. Our proposed framework first encodes the interactions among users, targets, and BSs into a heterogeneous graph and then employs message passing to optimize vertex features. The Mamba blocks further enhance this process through their selection mechanism and state space modeling capabilities, enabling dynamic and context-aware optimization of beamforming, TTD configurations, and sensing parameters. Numerical simulations validate that the proposed method outperforms both conventional and learning-based baselines, while offering high computational efficiency and strong generalization across different network conditions.

cs.IT↗

arXiv2026

Intelligent Wiretap Code Design: Exploiting Wireless Endogenous Security via Information Theory and Deep Learning Integration

Recent advancements in wireless endogenous security have explored leveraging the inherent randomness of wireless channels to enhance communication security, providing an effective alternative to traditional encryption methods. This paper proposes a wiretap coding scheme within the semantic communication framework, which leverages discrete semantic representations compatible with conventional digital modulation to jointly enhance communication security and reliability. We investigate two eavesdropping scenarios: (i) the eavesdropper employs a maximum a posteriori (MAP) decoder, and (ii) the eavesdropper has access to a decoder identical to that of the legitimate receiver. In the first scenario, we exploit mutual information as a metric to guide the design of an optimized coding strategy, minimizing information leakage while enhancing communication reliability. In the second scenario, considering the limitations of the eavesdropper's decoding capability, we employ generalized mutual information (GMI) to characterize recoverability under the prescribed decoding rule and guide reliability-aware code optimization.

cs.IT↗

arXiv2026

CSI Reconstruction in Fluid Antenna Systems Without Spatial Covariance Priors

Fluid antenna systems (FASs) exploit many candidate ports for spatial diversity, but hardware constraints allow channel observations at only a few active ports. Whether full-port CSI can be recovered without pre-acquired channel statistics remains open. Under the Clarke isotropic scattering model, we show that the channel lies in a low-dimensional spatial modal subspace determined by the scattering environment rather than the total port count. Consequently, recovery becomes feasible when the number of observed ports reaches the modal dimension (i.e., $M\geq r$), even when $M\ll N$. We further establish a sharp feasibility threshold: reliable recovery is impossible below this dimension regardless of SNR, whereas accuracy improves with additional observations above it. By decomposing the recovery error into modal truncation, estimation, and learning components, we derive explicit tradeoffs among RF chains, pilot overhead, transmit power, and training data. These results enable scalable prior-free full-port CSI recovery with few active ports.

cs.IT↗

arXiv2026

WirelessOpsAgent: A Benchmark and Agent Design for Action Assurance in Wireless Networks

Large language model (LLM) agents are emerging as planners for autonomous wireless network operations. Yet a task answer that is correct at proposal time can still be unsafe at execution time if supporting telemetry is stale or inconsistent. Existing benchmarks mainly evaluate task solving from fixed observations and leave support checking at execution time untested. We introduce WirelessOptBench, a benchmark for action assurance in wireless operations. It turns wireless tasks into execution state decision episodes with controlled telemetry faults and action constraints. We further develop WirelessOpsAgent, which grounds candidate actions in current evidence and repairs recoverable support failures before execution. Across three backbone evaluations with 600 episodes each, WirelessOpsAgent achieves up to 0.983 Exact Action Accuracy. On Claude Sonnet 4.6, the Unsafe APPLY Rate decreases from 82.2% to 10.3% relative to the safest baseline. We make WirelessOptBench available at https://anonymous.4open.science/r/wirelessopsbench-artifact-D969/.

cs.NI↗

arXiv2026

The 2-character theory of finite 2-groups

We generalize the notion of character for 2-representations of finite 2-groups. The properties of 2-characters bear strong similarities to those classical characters of finite groups, including conjugation invariance, additivity, multiplicativity and orthogonality. With a careful analysis using homotopy fixed points and quotients for categories with 2-group actions, we prove that the category of class functors on a 2-group $\mathcal G$ is equivalent to the Drinfeld center of the 2-group algebra $\mathrm{Vec}_{\mathcal G}$, which categorifies the Fourier transform on finite abelian groups. After transferring the canonical nondegenerate braided monoidal structure from $\mathfrak Z_1(\mathrm{Vec}_{\mathcal G})$, we discover that irreducible 2-characters of $\mathcal G$ coincide with full centers of the corresponding 2-representations, which are in a one-to-one correspondence with Lagrangian algebras in the category of class functors on $\mathcal G$. In particular, the fusion rule of $2\mathrm{Rep}(\mathcal G)$ can be calculated from the pointwise product of Lagrangian algebras as class functors. From a topological quantum field theory (TQFT) point of view, the commutative Frobenius algebra structure on a 2-character is induced from a 2D topological sigma-model with target space $\lvert \mathrm{B} \mathcal G \rvert$.

math.RT↗

arXiv2026

Classification of symmetric fusion categories over $\mathbb{R}$

We show that every symmetric fusion category over $\mathbb{R}$ is equivalent to the category of finite-dimensional semi-linear representations of a $\mathbb{Z}_2$-graded finite super group. The proof uses Galois descent for tensor categories over $\mathbb{C}/\mathbb{R}$, reducing the classification to semi-linear $\mathbb{Z}_2$-actions on symmetric fusion categories over $\mathbb{C}$. As a further structural result, we establish a Tannaka-Krein type correspondence between symmetric fusion categories over $\mathbb{R}$ and finite groupoids with a $\mathbb{Z}_2 \times \mathrm{B} \mathbb{Z}_2$-action. This gives a complete real analogue of Deligne's classification result.

math.QA↗

arXiv2026

Enhancing Large Language Model Reasoning with Reward Models: An Analytical Survey

Reward models (RMs) play a critical role in enhancing the reasoning performance of LLMs. For example, they can provide training signals to finetune LLMs during reinforcement learning (RL) and help select the best answer from multiple candidates during inference. In this paper, we provide a systematic introduction to RMs, along with a comprehensive survey of their applications in LLM reasoning. We first review fundamental concepts of RMs, including their architectures, training methodologies, and evaluation techniques. Then, we explore their key applications: (1) guiding generation and selecting optimal outputs during LLM inference, (2) facilitating data synthesis and iterative self-improvement for LLMs, and (3) providing training signals in RL-based finetuning. Finally, we discuss critical open questions regarding the selection, generalization, evaluation, and enhancement of RMs, based on existing research and our own empirical findings. Our analysis aims to provide actionable insights for the effective deployment and advancement of RMs for LLM reasoning.

cs.CL↗

arXiv2026

Encoded Jamming Secure Communication for RIS-Assisted Systems

This paper investigates a cooperative jamming (CJ)-aided secure wireless communication system. Conventional CJ schemes transmit Gaussian noise (GN) to improve security, which inherently degrades the legitimate receiver's performance. While the encoded jamming (EJ) scheme mitigates this interference, its advantage over the GN scheme is highly channel-dependent. To address this limitation, we introduce a reconfigurable intelligent surface (RIS)-assisted secure design based on the EJ scheme for secrecy-rate maximization. Starting from the multiple-input multiple-output (MIMO) secrecy-rate expressions for the EJ and GN schemes, we identify the jamming-channel conditions under which the EJ scheme may be limited. For the general MIMO setup, we develop a weighted minimum mean-square error (WMMSE)-based framework for joint precoder and RIS phase optimization. We further provide a large-RIS asymptotic benchmark showing that a jamming-aligned EJ construction achieves a positive gap over a signal-aligned GN benchmark in the considered multiple-input single-output (MISO) setting. Simulation results support the analysis and show that, under the evaluated settings, the RIS-assisted EJ scheme can alleviate the identified spatial bottlenecks and improve the secrecy rate relative to the considered baselines.

cs.IT↗

arXiv2026

Projection-Based Outlier Detection in Interval-Valued Functional Data

Outlier detection is a fundamental task for ensuring reliable statistical modeling and inference. Interval-valued functional data (IVFD), in which each observation is represented by an interval-valued curve that preserves the variability and uncertainty within the observation, have attracted increasing attention in statistics and related applications. Developing effective outlier detection procedures for IVFD is therefore an important methodological problem. To address this issue, we develop a robust projection-based outlier detection framework. We first represent each interval-valued functional observation through its center and log-radius functions and apply interval-valued functional principal component analysis (IFPCA) to obtain a joint low-dimensional representation. We then introduce the interval-valued least trimmed functional scores (ILTFS) method, which identifies a robust reference subset by minimizing a trimmed aggregate of standardized IFPCA score distances. Finally, we proposed the ILTFS-FDR outlier detection procedure by converting the resulting projection distances into empirical $p$-values and adjusting using the Benjamini--Hochberg procedure at a prespecified target false discovery rate level. Theoretically, we derive the finite-sample breakdown point of the ILTFS mean estimator and establish the descent property of the concentration-step algorithm. Simulation studies and an empirical application to high-frequency ETF data demonstrate the effectiveness and robustness of the proposed ILTFS-FDR procedure in detecting abnormal interval-valued functional observations.

stat.ME↗

arXiv2026

LingShu: A Large-Scale Symptom-Centric Contextualized Knowledge Graph Bridging Traditional Chinese Medicine and Modern Biomedicine

Biomedical knowledge graphs (KGs) are pivotal for knowledge organization, yet traditional binary relations often struggle to represent the conditional nature of biomedical knowledge. Symptoms provide a shared phenotypic layer for linking Traditional Chinese Medicine (TCM), which relies on symptom patterns for syndrome differentiation and treatment selection, with modern biomedicine, which connects clinical manifestations to diseases and molecular mechanisms. We present LingShu, a large-scale symptom-centric contextualized knowledge graph designed to bridge TCM and modern biomedicine. The exported version of LingShu analyzed in this study comprises 17.33 million atom-level entity records and 39.47 million relation records, including 17.19 million semantic triples and 22.29 million contextualized quadruples. LingShu integrates multi-source data, including clinical electronic medical records, authoritative TCM texts, biomedical ontologies, and curated knowledge bases, through a pipeline combining natural language processing, terminology normalization, and human-in-the-loop verification. A key innovation of LingShu is its hybrid data model: it maintains 64 typed triple relation patterns to ensure broad connectivity, while incorporating 35 contextual quadruple relation patterns to capture conditional medical associations. This dual-structure approach explicitly encodes conditional knowledge, providing a granular representation of the contexts associated with medical relations. These contextualized relations cover syndrome-dependent herb efficacy, disease-contextualized drug effects, population-specific clinical associations, and mechanism-related therapeutic responses. Furthermore, we developed a web platform (http://www.tcmkg.com/) that integrates graph visualization, graph-based reasoning, and an evidence-grounded knowledge question-answering agent.

cs.CL↗

arXiv2026

SONG: A Photorealistic 3D Gaussian Simulation Platform for Benchmarking Social Navigation

Social navigation has progressed from simplified 2D environments toward a more general vision-based setting, in which a robot needs to achieve socially compliant behavior purely from onboard visual observations. Yet supporting simulation platforms have not kept pace: existing options either lack visual observations, lack moving human avatars, or fall short of real-world fidelity in appearance and pedestrian behavior, offering limited support for advancing vision-based social navigation. We introduce SONG, a SOcial Navigation platform powered by 3D Gaussian splatting (3DGS). It leverages 3DGS for both scene and avatar representations, drives pedestrians using semantically grounded trajectories generated by a large language model, and synthesizes their full-body motion with a trajectory-conditioned generator to produce continuous, natural movement. On top of the platform, we curate SONG-Bench, a set of evaluation episodes stratified by difficulty, and propose a multi-dimensional metric suite covering effectiveness, safety, and social compliance. A systematic evaluation of representative navigation baselines reveals three findings: (a) vision-based social navigation is far from solved; (b) a critical safety deficit precedes social etiquette; (c) real-world data matters more than model scale. Crucially, we demonstrate that fine-tuning on our curated data effectively improves the success rate in real-world environments. We hope our platform provides a faithful and rigorous testbed for the next generation of vision-based social navigation research.

cs.RO↗