arXiv subjects

Hao Yang

Publications and source records attributed to Hao Yang.

At least 55 records · Page 3Linked to original sources

arXiv2026

Kubo-Martin-Schwinger conditions for non-Hermitian systems

We investigate the extension of the Kubo--Martin--Schwinger (KMS) thermal equilibrium condition to bounded non-Hermitian Hamiltonians with real spectra and biorthogonal eigensystems, providing a unified framework through three complementary constructions: a complete KMS theorem under quasi-Hermiticity, a biorthogonal KMS-type identity whose positivity characterises quasi-Hermiticity, and a quantum-detailed-balance condition for the associated open-system dynamics. Our main result is a thermodynamic characterisation of quasi-Hermiticity: for any diagonalisable $H\in M_d(\mathbb C)$ with real spectrum, the biorthogonal Gibbs functional $ω_{\rm bi}(A)=Z_{\rm bi}^{-1}\sum_n e^{-βE_n}\langleϕ_n|A|ψ_n\rangle$ satisfies $ω_{\rm bi}(A^\dagger A)\ge0$ for all $A$ if and only if $H$ is quasi-Hermitian. The proof reconstructs the metric $η$ directly from the eigenprojectors of $ω_{\rm bi}$ via the Riesz representation theorem, yielding a metric-free criterion for quasi-Hermiticity. Under the quasi-Hermitian hypothesis, we prove that the $η$-Gibbs state $ω_η(A)=Z_η^{-1}{\rm Tr}[ηe^{-βH}A]$ satisfies the full analytic KMS condition using the Hadamard three-line theorem and Bari's theorem on Riesz bases. The transported state generally differs from the Gibbs state of the isospectral Hermitian partner whenever $[η,h]\neq0$, so the KMS property cannot be obtained by similarity transformation alone. Finally, within the Haag--Hugenholtz--Winnink programme, we establish the Tomita--Takesaki modular structure of the $η$-Gibbs state in finite dimensions, while the construction of a compatible $C^*$-norm and the proof of $σ$-weak continuity remain open.

quant-ph↗

arXiv2026

Dark Matter in Draco and Boötes I: Hints of a Core in an Ultra-Faint Dwarf from Simulation-Based Inference

The density profiles of dwarf spheroidal galaxies are among the most sensitive probes of dark matter physics, yet extracting them from noisy stellar kinematics remains a fundamental obstacle. We present GraphNPE, a simulation-based inference method for dynamical mass modeling that incorporates measurement uncertainties and spectroscopic selection functions in the forward model. Using mock data, we show that methods relying solely on line-of-sight velocity dispersion are biased toward cuspy density profiles, even in the absence of the mass-anisotropy degeneracy. By accessing higher-order velocity moments, particularly line-of-sight kurtosis, GraphNPE breaks key degeneracies and recovers density profiles with substantially less bias. We apply GraphNPE to Draco and Boötes I using MMT/Hectochelle and DESI for Draco, and the S5 survey for Boötes I. For each, we report density profiles and dark matter $J$- and $D$-factors. For Draco, GraphNPE yields consistent results across datasets, marginally preferring a cuspy inner profile ($ρ_{150} \sim 1.6-1.9 \times 10^8\,\mathrm{M}_\odot\,\mathrm{kpc}^{-3}$) in agreement with literature. On DESI, however, second-order Jeans modeling fits the dispersion but fails to reproduce the kurtosis, demonstrating higher-order moments are essential. For Boötes I, limited statistical power prevents definitive determination of the inner slope. GraphNPE recovers $ρ_{150} = 0.36^{+0.15}_{-0.11} \times 10^8\,\mathrm{M}_\odot\,\mathrm{kpc}^{-3}$, significantly lower than literature and consistent with a cored inner profile. This places Boötes I among the lowest density dwarfs at comparable stellar masses.

astro-ph.GA↗

arXiv2026

LoHoSearch: Benchmarking Long-Horizon Search Agents Beyond the Human Difficulty Ceiling

Search agent benchmarks exemplified by BrowseComp have rapidly saturated over the past year, with the strongest models surpassing 90% accuracy. Since these benchmarks are predominantly human-authored, annotators lack a global perspective on entity statistics and cannot systematically maximize search space size and structural complexity. This creates a difficulty ceiling that is hard to break. To address this, we introduce LoHoSearch (Long-Horizon Search Agents), a challenging benchmark comprising 544 human-verified questions across 11 domains. LoHoSearch is constructed via an automated pipeline built upon a knowledge graph covering over 7 million Wikipedia entities, which selects relations with large search spaces and assembles them into structurally complex questions with KG-verified unique answers. Our evaluation demonstrates that even the strongest model achieves only 34.74% accuracy, and existing context management strategies (best +6.8%) yield far smaller gains than on prior benchmarks. LoHoSearch provides a more demanding standard for evaluating long-horizon reasoning and context management in search agents.

cs.CL↗

arXiv2026

Radiative decay of fully-heavy tetraquark into quarkonium

We present a comprehensive study of the radiative decays of fully heavy tetraquarks ($T_{4c}$, $T_{4b}$) and mixed heavy-flavor tetraquarks ($T_{bc\bar{b}\bar{c}}$) into charmonium/bottomonium states, within the nonrelativistic QCD factorization framework. Numerical result indicates that the decay widths of fully charm tetraquark $T_{4c}$ into $γJ/ψ(η_c)$ are around 1 MeV. Crucially, the $γJ/ψ$ signal channel receives less experimental background near the $J/ψJ/ψ$ threshold, providing a compelling way to search for the possible tetraquark states X(6200). For $T_{4b}$, the decay width is highly suppressed by the bottom quark mass, just lying in tens eV level. We further find that the decay widths of $T_{bc\bar{b} \bar{c}} \to γΥ$ exceed those to $γJ/ψ$ by 3-4 orders of magnitude, indicating preferential $c\bar{c}$-pair annihilation over $b\bar{b}$. These radiative decay modes can be measured in the future experiments, and are helpful to understand the inner structure of the full heavy tetraquark.

hep-ph↗

arXiv2026

Looped World Models

Current world models face a fundamental tension: faithful long-horizon simulation demands deep computation, but deeper models are expensive to deploy and prone to compounding errors. We resolve this by introducing Looped World Models (LoopWM), which are the first looped architectures for world modelling. Our method iteratively refines latent environment states through a parameter-shared transformer block. This yield up to 100x parameter efficiency over conventional approaches with adaptive computation that automatically scales depth to match the complexity of each prediction step. Orthogonal to scaling model size and training data, LoopWM establishes iterative latent depth as a new scaling axis for world simulation, which might significantly push the community forward.

cs.LG↗

arXiv2026

Noncoherent ISAC over Block-Fading Channels: Asymptotic Performance Analysis

This paper investigates the fundamental limits and optimal signal distribution design for Integrated Sensing and Communication (ISAC) systems operating under strictly noncoherent conditions. Unlike conventional coherent frameworks that rely on perfect channel state information, we consider a block-fading MIMO channel where the channel realizations are unknown to both the transmitter and the receiver. We adopt a realization-wise perspective to characterize the noncoherent performance tradeoff across different signal-to-noise ratio (SNR) regimes. In the high-SNR regime, we derive a lower bound for the noncoherent mutual information and define a metric, termed sensing-induced rate loss, to quantify the communication penalty incurred by sensing-oriented beamforming. We then employ a projected gradient algorithm to optimize the spatial power allocation, balancing the conflict between the unitary space-time modulation-based structure for communication and the task-oriented spatial power allocation for sensing. Conversely, in the low-SNR regime, we perform a first-order asymptotic analysis of the ergodic minimum mean squared error (EMMSE). Our theoretical derivation reveals a fundamental synergy: the sensing-optimal strategy collapses to a rank-one transmission along the dominant eigenvector of the target response, which incurs no first-order communication loss in the low-SNR regime. This result demonstrates that the conflicting tradeoff observed at high SNR vanishes asymptotically at low SNR, enabling perfect alignment between sensing and communication objectives.

cs.IT↗

arXiv2026

Reasoning for Mobile User Experience with Multimodal LLMs: Task, Benchmark, and Approach

User experience (UX) centered on usability, perceived consistency, and functional clarity is fundamental to real-world user interfaces (UI). The application of multimodal large language models (MLLMs) in the field of user interfaces is evolving rapidly, such as visual element grounding, graphical user interface (GUI) agents, and design-to-code generation. However, research efforts on evaluating UX based on UI screenshots are still immature. To address this, we propose UXBench, a novel multimodal benchmark consisting of 2,000 VQA data samples designed to assess MLLMs' ability to perform UI-based reasoning. UXBench includes 8 tasks based on real-world UI screenshots that require fine-grained diagnosis of UX issues across layout relationships, visual hierarchy, and content consistency. Our extensive evaluation of mainstream MLLMs shows that they remain fundamentally limited in their capacity for UI-based reasoning. The results underscore the need for further advancements in this area. To bridge this gap, we propose UI-UX, an MLLM based on Qwen3-VL-4B-Thinking foundation model and enhanced via reinforcement learning with two key innovations: a reward routing mechanism that dynamically balances perceptual understanding and logical reasoning during inference, and an asymmetric transition reward that suppresses redundant or insufficient reasoning steps. Experiments demonstrate that UI-UX achieves state-of-the-art (SOTA) performance on UXBench, attaining an accuracy of 0.7963 -- surpassing Claude-4.5-Sonnet's 0.6550 -- while exhibiting strong generalization across diverse UI tasks and maintaining low inference latency.

cs.AI↗

arXiv2026

Rosetta Memory: Adaptive Memory for Cross-LLM Agents

Memory is the key component for transforming a stateless LLM into a persistent, evolving agent through experience accumulation, long-horizon planning, and continual self-improvement. Existing memory systems typically take the LLM as the center and design memory operations tailored to a specific backbone. In practice, however, users frequently switch between LLMs, for example using Claude for coding and GPT for writing across tasks, or routing different steps to different backbones within a single task for cost-effective trade-offs. As a result, memory written by one model often needs to be consumed by another. Making upstream memory effectively adapt to and activate downstream LLMs remains a critical yet underexplored problem. To bridge this gap, we shift the perspective from LLM-centric memory design to \emph{memory-centric LLM adaptation}. Specifically, we approach the above upstream-downstream memory adaptation problem from both the write and read sides, and design two profile-conditioned operators that are jointly trained to optimize how memory is stored and presented for better task completion. To ensure the learned operators generalize across a broad set of LLMs, we propose a minimum-gain sampling curriculum that prioritizes the least-served LLMs during training. To better measure the operators' actual contribution rather than the LLM's own capability, we design a performance-gap reward that compares against a naive memory baseline. Experiments on HotpotQA, 2WikiMultihopQA, and MuSiQue demonstrate that our model consistently outperforms baselines and remains robust under unseen-model replacement.

cs.LG↗

arXiv2026

Veda: Scalable Video Diffusion via Distilled Sparse Attention

Scaling Diffusion Transformers to generate high-resolution, long videos is constrained by the quadratic cost of self-attention, and existing sparse attention methods degrade under high sparsity. We show empirically that generation quality is determined not by the sparsity ratio itself, but by how well the sparse mask aligns with the tile-wise geometry of full attention. Based on this insight, we propose Veda, a distilled sparse attention framework that formulates tile selection as an explicit reconstruction problem from full attention. Veda integrates statistics-aware tile scoring with head-aware tiling to reduce estimation error and structural mismatch, enabling aggressive sparsity. A hardware-efficient tile-skipping kernel converts theoretical sparsity into practical wall-clock speedups. Experiments on large video diffusion models, including Waver and Wan2.1, demonstrate substantial acceleration with no noticeable degradation in generation quality. To generate 720P 10-second videos on Waver-T2V-12B, Veda achieves a 5.1$\times$ end-to-end speedup and a 10.5$\times$ self-attention speedup, reducing attention overhead from 92% to 50%. Notably, the gains increase with sequence length, indicating that Veda scales favorably with spatiotemporal resolution across models.

cs.CV↗

arXiv2026

Finite Curvature Construction of Regular Black Holes and Quasinormal Mode Analysis

We develop a class of regular black holes by prescribing finite curvature invariants and reconstructing the corresponding spacetime geometry. Two distinct approaches are employed: one based on the Ricci scalar and the other on the Weyl scalar. In each case, we explore a variety of analytic profiles for the curvature functions, including Gaussian, hyperbolic secant, and rational forms, ensuring regularity, asymptotic flatness, and compatibility with dominant energy conditions. The resulting mass functions yield spacetime geometries free from curvature singularities and exhibit horizons depending on model parameters. To assess the stability of these solutions, we perform a detailed analysis of quasinormal modes (QNMs) under axial gravitational perturbations. We show that the shape of the effective potential, particularly its width and the presence of potential valleys, plays a critical role in determining the QNMs. Models with a large peak-to-valley ratio in the potential barrier exhibit stable, exponentially decaying waveforms, while a small ratio may induce late-time instabilities. Our results highlight the significance of potential design in constructing physically viable and dynamically stable regular black holes, offering potential observational implications in modified gravity and quantum gravity scenarios.

gr-qc↗

arXiv2026

Multiple Superconducting Phases in Rhombohedral Heptalayer Graphene

Crystalline rhombohedral multilayer graphene (RMG) has emerged as an ideal platform for studying unconventional superconductivity. Here, we report the observation of superconductivity in moiréless rhombohedral heptalayer graphene (RHG) at zero magnetic field. The superconducting phases emerge at low displacement electric fields (|D| < 0.2 V/nm) and are symmetrically distributed about D = 0, with one robust state exhibiting zero resistance and two weaker superconducting features. Comparisons with rhombohedral pentalayer graphene (RPG) reveal distinct perpendicular magnetic-field responses, and quantum oscillation measurements indicate that superconductivity in RHG arises from a half-metallic normal state. These results highlight the strong dependence of superconductivity on layer number and electronic structure in RMG systems and provide new insights into its microscopic origin.

cond-mat.mes-hall↗

arXiv2026

Intuitive Surgical SurgToolLoc and SurgVU Challenges Results: 2022-2025

Robotic assisted (RA) surgery promises to transform surgical intervention. Intuitive Surgical is committed to fostering these changes and the machine learning models and algorithms that will enable them. With these goals in mind we have invited the surgical data science community to participate in a yearly competition hosted through the Medical Imaging Computing and Computer Assisted Interventions (MICCAI) conference. With varying changes from year to year, we have challenged the community to solve difficult machine learning problems in the context of advanced RA applications. Here we document the results of these challenges, focusing on surgical tool localization (SurgToolLoc) and surgical visual understanding (SurgVU). The publicly released dataset that accompanies these challenges is detailed in a separate paper arXiv:2501.09209 [1].

cs.CV↗

arXiv2026

Text-RSIR: A Text-Guided Framework for Efficient Remote Sensing Image Transmission and Reconstruction

High-resolution remote sensing imagery is critical for environmental monitoring, urban mapping, and land cover analysis, but its transmission is often hindered by limited bandwidth and high communication costs. Conventional pipelines transmit full-resolution pixel data, resulting in redundant and inefficient delivery. This paper proposes a text-guided remote sensing image transmission system that replaces complete high-resolution data with low-resolution images accompanied by compact textual descriptions. An onboard text generator produces spatial and semantic summaries, reducing the transmitted data volume to approximately 2\% of the original size. For ground-based reconstruction, a text-conditioned image restoration model is introduced, which leverages cross-modal learning to recover fine spatial details and maintain semantic coherence. Experimental results on the Alsat-2B, UC Merced Land Use, and Aerial Image datasets demonstrate that the proposed framework achieves reconstruction PSNRs of 16.36 dB, 26.87 dB, and 27.41 dB, respectively, enabling efficient and information-preserving image transfer for remote sensing applications. The implementation will be made publicly available at \href{https://github.com/haoyangofficial/textrssr}{GitHub}.

eess.IV↗

arXiv2026

Low Light Image Enhancement Challenge at NTIRE 2026

This paper presents a comprehensive review of the NTIRE 2026 Low Light Image Enhancement Challenge, highlighting the proposed solutions and final results. The objective of this challenge is to identify effective networks capable of producing clearer and visually compelling images in diverse and challenging conditions by learning representative visual cues with the purpose of restoring information loss due to low-contrast and noisy images. A total of 195 participants registered for the first track and 153 for the second track of the competition, and 22 teams ultimately submitted valid entries. This paper thoroughly evaluates the state-of-the-art advances in (joint denoising and) low-light image enhancement, showcasing the significant progress in the field, while leveraging samples of our novel dataset.

cs.CV↗

arXiv2026

NTIRE 2026 The Second Challenge on Day and Night Raindrop Removal for Dual-Focused Images: Methods and Results

This paper presents an overview of the NTIRE 2026 Second Challenge on Day and Night Raindrop Removal for Dual-Focused Images. Building upon the success of the first edition, this challenge attracted a wide range of impressive solutions, all developed and evaluated on our real-world Raindrop Clarity dataset~\cite{jin2024raindrop}. For this edition, we adjust the dataset with 14,139 images for training, 407 images for validation, and 593 images for testing. The primary goal of this challenge is to establish a strong and practical benchmark for the removal of raindrops under various illumination and focus conditions. In total, 168 teams have registered for the competition, and 17 teams submitted valid final solutions and fact sheets for the testing phase. The submitted methods achieved strong performance on the Raindrop Clarity dataset, demonstrating the growing progress in this challenging task.

cs.CV↗

arXiv2026

ViSRA: A Video-based Spatial Reasoning Agent for Multi-modal Large Language Models

Recent advances in Multi-modal Large Language Models (MLLMs) target 3D spatial intelligence, yet the progress has been largely driven by post-training on curated benchmarks, leaving the inference-time approach relatively underexplored. In this paper, we take a training-free perspective and introduce ViSRA, a human-aligned Video-based Spatial Reasoning Agent, as a framework to probe the spatial reasoning mechanism of MLLMs. ViSRA elicits spatial reasoning in a modular and extensible manner by leveraging explicit spatial information from expert models, enabling a plug-and-play flexible paradigm. ViSRA offers two key advantages: (1) human-aligned and transferable 3D understanding rather than task-specific overfitting; and (2) no post-training computational cost along with heavy manual curation of spatial reasoning datasets. Experimental results demonstrate consistent improvement across a set of MLLMs on both existing benchmarks and unseen 3D spatial reasoning tasks, with ViSRA outperforming baselines by up to a 15.6% and 28.9% absolute margin respectively.

cs.CV↗

arXiv2026

A Hybrid Graph Neural Network for Enhanced EEG-Based Depression Detection

Graph neural networks (GNNs) are becoming increasingly popular for EEG-based depression detection. However, previous GNN-based methods fail to sufficiently consider the characteristics of depression, thus limiting their performance. Firstly, studies in neuroscience indicate that depression patients exhibit both common and individualized brain abnormal patterns. Previous GNN-based approaches typically focus either on fixed graph connections to capture common abnormal brain patterns or on adaptive connections to capture individualized patterns, which is inadequate for depression detection. Secondly, brain network exhibits a hierarchical structure, which includes the arrangement from channel-level graph to region-level graph. This hierarchical structure varies among individuals and contains significant information relevant to detecting depression. Nonetheless, previous GNN-based methods overlook these individualized hierarchical information. To address these issues, we propose a Hybrid GNN (HGNN) that merges a Common Graph Neural Network (CGNN) branch utilizing fixed connection and an Individualized Graph Neural Network (IGNN) branch employing adaptive connections. The two branches capture common and individualized depression patterns respectively, complementing each other. Furthermore, we enhance the IGNN branch with a Graph Pooling and Unpooling Module (GPUM) to extract individualized hierarchical information. Extensive experiments on two public datasets show that our model achieves state-of-the-art performance.

eess.SP↗

arXiv2026

Judge, Then Drive: A Critic-Centric Vision Language Action Framework for Autonomous Driving

Recent advances in vision language action (VLA) models have shown remarkable potential for autonomous driving by directly mapping multimodal inputs to control signals. However, previous VLA-based methods have not explicitly exploited the critic capability of VLAs to refine driving decisions, even though such capability has been well demonstrated in other LLM-based domains, thereby limiting their performance in complex closed-loop scenarios. In this work, we present a theoretically inspired two-stage framework, CriticVLA, which extends the role of VLAs from acting to judging. CriticVLA first generates a rough trajectory and then refines it through multimodal evaluation and single-step optimization guided by a VLA-based critic, yielding higher-quality driving behaviors. To support this process, we construct a large-scale synthetic dataset of 12.9 million annotated trajectories covering diverse driving scenarios, which enhances the critic's reasoning and refinement abilities. Extensive closed-loop experiments on the Bench2Drive benchmark show that CriticVLA significantly surpasses state-of-the-art baselines, achieving a 73.33% total success rate and delivering about 30% improvement in challenging scenarios.

cs.CV↗