arXiv subjects

Jie Xu

Publications and source records attributed to Jie Xu.

At least 55 records · Page 3Linked to original sources

arXiv2026

LLMBDC: Language Model for Biological Domains Oriented Clustering of Gene Ontology

Gene Ontology (GO) enrichment analysis is a foundational tool for translating large-scale genomic data into biological insights, but typically yields hundreds of redundant terms that obscure overarching themes. Existing summarization tools rely on fixed similarity metrics (REVIGO, GOSemSim, clusterProfiler::simplify()), gene-overlap measures (Metascape), or static hierarchy mappings (GO-slim), and therefore cannot incorporate biological context. Manual curation provides context-aware grouping but is subjective and labor-intensive. A scalable, context-aware framework is needed to cluster GO terms into interpretable higher-order biological domains. Here we present LLMBDC (Large Language Model for Biological Domains Oriented Clustering of Gene Ontology), a training-free framework that leverages zero-shot semantic reasoning of LLMs with confidence scoring to cluster GO terms into BioDomains using only ontology information at inference time. Benchmarked across Alzheimer's disease (AD) and Fragile X syndrome (FXS) against six baseline methods including SapBERT, LLMBDC achieved substantially higher precision, recall, and clustering performance. Against ground-truth annotations, LLMBDC improved ARI from 9.7% to 73.3% (AD) and from 15.7% to 66.6% (FXS) over REVIGO, with corresponding NMI gains from 59.9% to 73.4% (AD) and 66.0% to 79.5% (FXS). A Cauchy combination test further confirmed that aggregated BioDomains retained statistically significant functional signals. LLMBDC provides a scalable, reproducible, and interpretable route to context-aware, system-level interpretation of GO enrichment results while preserving biological specificity.

q-bio.GN↗

arXiv2026

Exploiting Movable Antennas for Multi-Target Wireless Sensing System in Multipath Environments

In this paper, we study the multi-target detection problem in a movable-antenna (MA)-enabled wireless sensing system with linear arrays, in which both the direct line-of-sight (LoS) paths and the first-order non-LoS (NLoS) paths are explicitly considered. Unlike conventional fixed-position antenna arrays, MAs provide additional design degrees of freedom by enabling adaptive antenna positioning to reconfigure the propagation geometry, offering great potential to enhance the sensing performance in complex multi-target multipath scenarios. Under this setup, we first develop a cross sparsity Markov mixture prior to derive the posterior probabilities of target locations, in which the structural correlation between the LoS and NLoS paths is effectively exploited to enhance the location estimation accuracy. Based on the derived posterior probabilities, we further analyze the angular-domain sensing performance for multi-target detection by proposing a new two-dimensional (2D) ambiguity function as the performance metric. Next, we optimize the MA positions to suppress the sidelobe levels and narrow the mainlobe width of the proposed ambiguity function. Although the resulting problem is highly non-convex, we develop a low-complexity Dykstra-based projected gradient descent algorithm to solve it efficiently. Finally, simulation results verify the accuracy of the proposed ambiguity function analysis, demonstrate the substantial performance gains enabled by the proposed prior model and MAs, and show that the proposed algorithm achieves performance comparable to existing methods with significantly lower computational complexity.

cs.IT↗

arXiv2026

Intelligent Reflecting Surfaces for Integrated Sensing and Communications: From System Coexistence to Networked Mutualism

The rapid development of sixth-generation (6G) wireless networks requires seamless integration of communication and sensing to support ubiquitous intelligence and real-time, high-reliability applications. Integrated sensing and communication (ISAC) has emerged as a key solution for achieving this convergence, offering joint utilization of spectral, hardware, and computing resources. However, realizing high-performance ISAC remains challenging due to environmental line-of-sight (LoS) blockage, limited spatial resolution, and the inherent coverage asymmetry and resource coupling between sensing and communication. Intelligent reflecting surfaces (IRSs), featuring low-cost, energy-efficient, and programmable electromagnetic reconfiguration, provide a promising solution to overcome these limitations. This article presents a comprehensive overview of IRS-aided wireless sensing and ISAC technologies, including IRS architectures, target detection and estimation techniques, beamforming designs, and performance metrics. It further explores IRS-enabled new opportunities for more efficient performance balancing, coexistence, and networking in ISAC systems, focuses on current design bottlenecks, and outlines future research directions. This article aims to offer a unified design framework that guides the development of practical and scalable IRS-aided ISAC systems for the next-generation wireless network.

eess.SP↗

arXiv2026

Construction and Dynamic Update of Channel Gain Maps via 3D Gaussian Splatting

Channel knowledge maps (CKMs) have emerged as a promising technique for providing scene-specific and location-dependent propagation knowledge to enable environment-aware wireless network design. This paper investigates the construction and dynamic updating of a particular type of CKM, namely grid-based channel gain maps (CGMs), for large-scale networks using three-dimensional Gaussian splatting (3DGS). First, we formulate a grid-based channel gain model, where each map entry is defined as the locally averaged channel gain over a receiver grid, thereby suppressing phase-sensitive small-scale fluctuations. The resulting channel gain is decomposed into distance-dependent attenuation, path transmittance, and effective scattering contributions. Based on this decomposition, we develop a physics-informed Gaussian-splatting-based channel gain (GS-CG) model, which represents the propagation environment as a set of Gaussian primitives. The proposed model maps Gaussian geometry, opacity, and directional features to propagation-related factors and renders grid-level channel gains through a differentiable process. To accommodate real-time environmental changes, we further propose an incremental learning mechanism that updates a static reference GS-CG representation into a dynamic CGM. Specifically, the reference Gaussian primitives are frozen, while a compact set of tunable Gaussians is introduced to capture newly induced local channel-gain variations from sparse measurements.Numerical results demonstrate that the proposed GS-CG methods accurately reconstruct grid-based CGMs, efficiently adapt to dynamic environmental changes, and achieve a favorable accuracy-complexity tradeoff for fast CGM refinement.

cs.IT↗

arXiv2026

The spectral picture of self-similar collapse in the Constantin-Lax-Majda equation

We give a spectral description of the self-similar collapse profile of the Constantin-Lax-Majda (CLM) equation, the $a=0$ anchor of the generalized family $w_t + a\,u\,w_x = u_x\,w$, $u_x = Hw$. Linearizing about the exact profile $Ω(y) = -y/(y^2+1/4)$ and realizing $L_0$ as a closed operator on the origin-$H^2$ space, we prove three things at $a=0$. Its essential spectrum meets the closed half-plane $\{\mathrm{Re}\,λ\ge -1/2\}$ in the single vertical line $\{\mathrm{Re}\,λ= -1/2\}$: the line is placed by a log-widening Weyl sequence, and an explicit Hardy-Mellin resolvent bound constructively empties the rest of the half-plane apart from $0$ and $1$. Its full point spectrum over $\mathbb{C}$, on the odd realization, is exactly $\{0,1\}$, the scaling and time-shift symmetry modes, with no embedded eigenvalues; removing these by the standard modulation leaves a spectral gap of $1/2$ on $X$. The linear semigroup and its exact decay rate $e^{-τ/2}$ are computed in closed form, but on a weighted space of the conjugated variable reached from $X$ by a bounded transfer map; we keep the two separate, since $L_0$ is non-normal and a spectral gap does not by itself give a decay rate in the $X$ norm. A realization dichotomy identifies the in-strip smear of generic discretizations as the faithful spectrum of the maximal $L^2$ realization, which origin-$H^2$ removes. For $a>0$ we prove a conditional two-line inclusion for each admissible smooth focusing profile, recompute the branch $c_l(a)$ of Lushnikov, Silantyev, and Siegel as a cross-check, and record the formal scaling-relevance exponent $s^*(a) = 1/c_l(a)$, below which fractional dissipation is asymptotically subdominant in self-similar variables for fixed sufficiently regular data. The contribution is the realization-dependent spectral picture of the collapse profile itself.

physics.flu-dyn↗

arXiv2026

WARA: A Closed-Loop Multi-Agent Framework for Wireless Optimization Autoresearch

Large language model (LLM) agents have shown growing capabilities in tool use, code execution, artifact inspection, and iterative revision, creating new opportunities for automating scientific research. To the best of our knowledge, this paper presents the first end-to-end autoresearch framework for the wireless domain, with a particular focus on wireless resource allocation optimization, an essential area for characterizing the fundamental performance limits of wireless systems and enhancing their practical performance under dynamic channel and network conditions. Specifically, we propose the Wireless AutoResearch Agent (WARA), a closed-loop multi-agent system that transforms an initial research topic into a complete research package. WARA organizes the research workflow into three phases: 1) research gap identification and problem proposal, 2) optimization modeling, algorithm design, and experimentation, and 3) research deliverable construction. Each phase follows an artifact-mediated process, in which structured upstream artifacts are consumed to generate downstream outputs. Controller-managed gates validate these artifacts and maintain consistency among problem formulations, algorithms, experiments, and research claims. When validation fails, WARA repairs only the affected artifact instead of restarting the entire workflow. We further design an LLM-based ScoringAgent to evaluate manuscript-level research validity. Comparative results show that WARA substantially outperforms one-shot LLM generation and approaches the quality profile of recently accepted peer-reviewed papers. These results demonstrate the potential of closed-loop artifact control for end-to-end LLM-assisted wireless optimization research. The source code is available at https://github.com/guoyuan-dotcom/WARA_CUHKSZ

eess.SP↗

arXiv2026

CHMAS: A Coupled Hierarchical Framework for Multi-Agent Reinforcement Learning

Multi-agent reinforcement learning (MARL) systems face fundamental challenges in balancing global coordination with local execution across different temporal scales. This paper introduces the Coupled Hierarchical Multi-Agent System (CHMAS), a novel framework that decomposes multi-agent decision-making into centralized strategic planning and distributed tactical execution with bidirectional information flow. The strategic layer integrates all agents' states with an exclusive global environmental state to generate guidance actions every $T$ timesteps, while tactical agents execute distributed policies augmented by strategic guidance and local neighborhood observations. Unlike existing hierarchical approaches with unidirectional control, CHMAS establishes a feedback mechanism where accumulated tactical rewards influence strategic objectives through a coupling coefficient $λ$, ensuring strategic plans remain grounded in tactical feasibility. To address the non-stationarity inherent in hierarchical learning, we propose an asynchronous update protocol where strategic parameters update every $N_f$ tactical episodes, allowing tactical policies to converge to quasi-stationary points between strategic changes. We present both a general bi-level formulation capturing full system dynamics and a tractable additive approximation enabling rigorous analysis. Theoretical analysis proves that this asynchronous scheme achieves $\mathcal{O}(\log K/\sqrt{K})$ convergence for the strategic layer after $K$ strategic updates under standard assumptions. Experimental validation in a multi-agent foraging domain demonstrates successful learning of spatially partitioned exploration strategies, with both layers converging stably despite hierarchical coupling.

cs.MA↗

arXiv2026

MedRealMM: A Real-World Multimodal Benchmark for Chinese Online Medical Consultation

Large language models (LLMs) are increasingly deployed in online medical consultation, yet existing benchmarks remain poorly aligned with real clinical practice. Many rely on synthetic conversations or patient simulators, omit patient-uploaded medical images, or evaluate open-ended clinical responses using multiple-choice or lexical-overlap metrics that poorly reflect clinical quality. We introduce \textbf{MedRealMM}, a large-scale benchmark for multimodal online medical consultation built from de-identified patient-doctor interactions collected from a nationwide Chinese internet hospital. MedRealMM uses a Multimodal Clinical Challenge Point (MCCP) extraction framework to identify clinically demanding moments in authentic consultation trajectories and converts each into a standardized next-response generation task while preserving the preceding text-image context. Each instance is paired with a case-specific rubric refined by physicians that rewards clinically desirable behaviors and penalizes unsafe, unsupported, or contradictory responses. The current release contains 5,620 real-world multimodal cases spanning 64 clinical departments. We evaluate 19 general-purpose and medical-specialized LLMs, including text-only and multimodal systems. Our results show that image information is critical for reliable clinical performance and that current frontier models remain below the online physician response. Although some frontier models satisfy as many or more positive clinical criteria than physicians, they trigger more negative criteria, indicating that safety-sensitive error avoidance remains a central bottleneck. MedRealMM offers a realistic and reproducible benchmark for evaluating multimodal medical reasoning in real-world online consultation. The dataset will be publicly available on Hugging Face at https://huggingface.co/datasets/jdh-algo/MedRealMM.

cs.AI↗

arXiv2026

Consistent Variance Estimation for Q-Function Estimators in Finite-Horizon MDP Tree Search

We study the variance of Q-function estimators in finite-horizon, finite-state Markov decision process (MDP) tree search. We show that the variance decomposes into three components attributed to the immediate reward collected, probabilistic state transitions, and uncertainty in future state value function estimates. Using this decomposition, we show that the sample variance estimator based on the assumption of i.i.d. paths is biased, underestimating the true variance, and the bias does not vanish in the limit. We then propose a recursive variance estimator that is consistent. To enable efficient storage and computation, we derive an equivalent implementation of the recursive estimator using only node-local statistics that can be iteratively updated. This consistent variance estimator is integrated into two Monte Carlo Tree Search (MCTS) sampling procedures for finite-horizon MDPs. In numerical examples from inventory control and kidney paired donation matching, the new estimator improves the performance of the MCTS algorithm relative to a baseline that uses the i.i.d.-based sample variance estimator.

eess.SY↗

arXiv2026

Breaking the Model Forgetting Cycle in Long-Incremental 3D Object Detection

Incremental 3D object detection requires a detector to learn novel object classes while remembering previously learned ones over sequentially arriving data. Previous methods, primarily based on pseudo-labeling, perform reasonably in short-incremental stages but still suffer from severe model forgetting when dealing with long-incremental sequences. We investigate this failure and reveal a detrimental self-reinforcing cycle: data distribution shift of novel classes causes model forgetting on old classes, which further produces accumulated error in pseudo-labeling that exacerbates model degradation. To address this issue, we draw inspiration from the human learning process and propose the \emph{Learning-Dynamics-driven Memory and Review} (LDMR) framework. LDMR monitors per-class detection quality at periodic training checkpoints and uses these learning-dynamics signals to drive two innovative mechanisms, namely (i) human-like intra-stage review that divides each incremental stage into multiple sub-stages' training and concentrates on remembering the most-forgotten objects, and (ii) scene-aware cross-stage memory evolution that evolves a memory bank to transfer knowledge between two consecutive stages by jointly considering scene learnability and diversity. Extensive experiments across multiple long-incremental protocols on indoor benchmarks SUN RGB-D and ScanNetV2 show that LDMR substantially mitigates the model forgetting and outperforms all baselines by a clear margin. Code is available at https://github.com/qianpeisheng/LDMR.

cs.CV↗

arXiv2026

From Novice to Expert: Cost-Aware Bandits for Evolving Worker Performance in Crowdsensing

Mobile crowdsensing (MC) recruits mobile users to perform sensing tasks using their smartphones, enabling large-scale applications such as traffic monitoring and environmental sensing. A fundamental challenge is online worker recruitment under uncertainty, where the platform must learn workers' sensing performance while operating with a limited budget. Existing learning-based MC recruitment methods typically assume that each worker's sensing quality is stationary with a fixed mean over time. In practice, however, worker performance often improves with experience and eventually stabilizes, while the incurred sensing cost can be unknown in advance due to time-varying device and context states. In this paper, we study a budget-constrained online recruitment problem in which the platform selects one worker in each round, observes the sensing quality and incurred cost, where the expected sensing quality of each worker increases with experience and eventually converges to a plateau, and repeats until the budget is exhausted. We formulate this problem as a structured bandit model where each worker's expected reward evolves according to an unknown increasing-then-converging function of its participation count, and each worker has an unknown expected cost. We develop a cost-aware online learning framework that jointly learns evolving reward trajectories and heterogeneous costs, detects performance saturation, and allocates the limited budget to maximize long-term sensing utility. We provide theoretical performance guarantees and validate the proposed approach through extensive experiments, demonstrating consistent improvements over baselines that ignore experience-driven dynamics or assume known costs.

cs.LG↗

arXiv2026

Rotating ULA-Enabled Computed Tomography for Efficient 3D Spatial Power Spectrum Synthesis: Architecture and Principled Orientation Design

This paper proposes an efficient three-dimensional (3D) spatial power spectrum synthesis method by rotating a uniform linear array (ULA) about its center in 3D space. Inspired by classical computed tomography (CT), the ULA performs analog receive combining at each rotation angle to produce a partial coherent sum. By collecting such sums over multiple rotations, the full 3D spectrum can be synthesized online via a single radio-frequency (RF) chain, without explicitly acquiring per-antenna signals. Depending on whether the overall coherent sum is accessible, the synthesis is obtained through either a minimum operation over partial spectrum images or joint synthesis after accumulating all coherent sums. Compared with fixed uniform planar array (UPA)-based combining and dense single movable-antenna (MA) sampling for 3D cubic virtual arrays, the proposed scheme achieves full-space 3D coverage with substantially reduced sampling and movement overhead while maintaining uniformly high angular resolution. Its sampling geometry and sequential orientation design also support pipelined analog beamforming, reducing practical hardware cost. To design rotation orientations in a principled manner without prior environmental information, we aim to maximize the expected worst-case projected separation between multi-path component (MPC) pairs. A secondary criterion then minimizes the worst-case projective correlation among orientation axes to reduce orientation redundancy. Accordingly, we optimize orientation sets for different numbers of orientations under isotropic-matrix and unit-norm constraints, using a multistart smooth minimax algorithm. Numerical results show that the optimized orientations uniformly span 3D space and reconstruct full-space 3D spectra close to the dense 3D cubic reference using only a fraction of spatial samples.

eess.SP↗

arXiv2026

A Codimension Two Approach to the $\mathbb{S}^1$-Stability Conjecture

J. Rosenberg's $\mathbb{S}^1$-stability conjecture states that a closed oriented manifold $X$ admits a positive scalar curvature metric iff $X\times \mathbb{S}^1$ admits a positive scalar curvature metric $h$. As pointed out by J. Rosenberg and others, there are known counterexamples in dimension four. We prove this conjecture whenever $h$ satisfies a geometric bound which measures the discrepancy between $\partial_θ\in T\mathbb{S}^1$ and the normal vector field to $X\times \{P\}$, for a fixed $P\in \mathbb{S}^1.$

math.DG↗

arXiv2026

The Rosenberg $ \mathbb{S}^{1} $-Stability Conjecture for $ χ(X) = 0 $

Let $ X $ be a closed, oriented manifold with $ \dim X \geqslant 5 $. In this article, we show that 2006 Rosenberg's $ \mathbb{S}^{1} $-stability holds when $ X $ has zero Euler characteristic. The 2006 Rosenberg-Stolz Conjecture for $ X \times \mathbb{R} $ also follows under the same assumption, provided that the Riemannian metric $ g $ on $ X \times \mathbb{R} $ is complete, is of bounded curvature, and whose smallest eigenvalue is uniformly bounded below by some positive constant. We then show a $ \mathbb{T}^{n} $-stability theorem with the same hypothesis of $ X $.

math.DG↗

arXiv2026

MedBench v5: A Dynamic, Process-Oriented, and Hallucination-Aware Benchmark for Clinical Multimodal Models

Existing medical AI benchmarks lack process visibility, atomic skill evaluation, and integrated hallucination detection. We introduce MedBench v5, a redesigned benchmark for clinical multimodal models (language, vision-language, and agent systems) that moves from static QA to dynamic, process-oriented evaluation. MedBench v5 features: (1) a dual-dimensional framework combining Clinical Cognitive Responsiveness (13 sub-dimensions) and Medical Atomic Skills (4 agent environments), covering 63 tasks; (2) three switchable information-flow stressors (omission, contradiction, evidence delay) for factorized degradation analysis; (3) a dynamic process audit protocol with five reasoning nodes that produces model-specific failure fingerprints; (4) hallucination propagation monitoring across initiation, propagation, anchoring, and contradiction interaction-capturing silent hallucination. Experiments on frontier models show that strong overall task performance does not guarantee process stability: stressors mainly disrupt contradiction detection, diagnosis updating, hallucination propagation, and contradiction-based self-correction, while final evidence grounding can remain superficially stable. MedBench v5 provides a unified infrastructure for capability profiling, controllable stress testing, process auditing, and hallucination trajectory analysis in clinical AI evaluation.

cs.CL↗

arXiv2026

SILO: Simulation-in-the-Loop Sim-to-Real Transfer for Multi-Stage Cable Routing

Linear-deformable manipulation remains challenging due to the complex deformations of objects such as cables and ropes. Prior data-driven approaches, particularly imitation learning, have shown some promise in narrowly defined settings but typically require thousands of demonstrations for specific tasks and cable types, limiting scalability and generalization. We introduce a sim-to-real reinforcement learning (RL) framework for multi-stage cable routing that leverages GPU-parallelized simulation to approximate linear deformable behaviors. Training across thousands of parallel simulations enables the learned policies to generalize across diverse cable geometries and deformation patterns. To bridge the sim-to-real gap, we propose a novel deployment strategy that combines a Simulation In the LOop (SILO) execution framework, localized RL policies, and robust cable state estimation. On real-world cable routing tasks, our approach achieves higher success rates and 2x reduction in cycle times compared to prior state-of-the-art learning methods. To our knowledge, this is the first successful sim-to-real transfer of RL policies for multi-stage cable routing. Videos and additional visualizations are available at https://silo-cable-routing.github.io/

cs.RO↗

arXiv2026

An Interpretable Deep Learning Framework for Discovery and Clinical Validation of Deep Radiomic Signatures in Tumor Classification

Imaging signatures are quantitative features extracted from medical images that provide clinically meaningful information for tumor diagnosis, characterization, prognosis, and treatment planning. Although deep learning has shown great potential for imaging signature discovery, its limited interpretability remains a major barrier to clinical adoption. Existing approaches often achieve high predictive performance but provide little biological insight into the identified signatures. We propose a unified framework for interpretable imaging signature discovery by integrating deep learning based segmentation, explainable classification, and radiomic analysis. A robust segmentation model is first used to accurately delineate tumors, followed by a Grad-CAM guided pipeline that identifies diagnostically important regions as candidate imaging signatures. A mutual information based adaptive thresholding strategy enables patient-specific signature extraction. The resulting signatures are validated using a downstream deep learning classification model, while radiomic features extracted from the signature regions are evaluated with traditional machine learning models and interpreted using SHAP to identify the most discriminative biomarkers. The proposed framework is evaluated on the public BUSI breast ultrasound, KiTS renal CT, and BraTS brain tumor datasets, as well as a private UF Health renal CT cohort. Compared with conventional whole-tumor radiomics, the proposed signature-based approach achieves improved discriminative performance while providing greater biological interpretability. By converting deep learning attention into reproducible quantitative imaging biomarkers, this framework offers an interpretable and reproducible solution for non-invasive tumor characterization and imaging biomarker discovery.

eess.IV↗

arXiv2026

Sensing-Limited Control of Noiseless Linear Systems Under Nonlinear Observations

This paper investigates the fundamental information-theoretic limits for the control and sensing of noiseless linear dynamical systems subject to a broad class of nonlinear observations. We analyze the interactions between the control and sensing components by characterizing the minimum information flow required for stability. Specifically, we derive necessary conditions for mean-square observability and stabilizability, demonstrating that the average directed information rate from the state to the observations must exceed the intrinsic expansion rate of the unstable dynamics. Furthermore, to address the challenges posed by non-Gaussian distributions inherent to nonlinear observation channels, we establish sufficient conditions by imposing regularity assumptions, specifically log-concavity, on the system's probabilistic components. We show that under these conditions, the divergence of differential entropy implies the convergence of the estimation error, thereby closing the gap between information-theoretic bounds and estimation performance. By establishing these results, we unveil the fundamental performance limits imposed by the sensing layer, extending classical data-rate constraints to the more challenging regime of nonlinear observation models.

eess.SY↗