arXiv subjects

Yu Han

Publications and source records attributed to Yu Han.

At least 19 recordsLinked to original sources

arXiv2026

Rethinking Radiomap Blind Prediction with Limited Environment and Configuration Representations

Radiomap blind prediction infers radiomaps from observable representations of the propagation environment and base station (BS) configuration without field measurements. These representations are inherently incomplete and cannot uniquely determine the target radiomap. Under squared loss, we identify the conditional-mean radiomap as the population-optimal deterministic target and decompose domain risk into target-approximation error and irreducible uncertainty. The train-test risk gap motivates propagation priors as cross-domain guidance, although their partial or simplified forms may bias the attainable predictor. We therefore propose RadioDecomp, which treats a prior-guided predictor as a correctable base and uses deterministic residual refinement to learn its remaining predictable discrepancy. We instantiate RadioDecomp as RadioLSR (LoS-Shadow-Residual). Experiments under cross-configuration and cross-environment settings show that RadioLSR is especially effective for cross-configuration generalization and provides overall gains over a controlled monolithic counterpart under cross-environment generalization.

eess.SP↗

arXiv2026

Interpreting Object-Dependent Concept Brittleness in Text-to-Image Diffusion Models

Although text-to-image diffusion models generally exhibit strong prompt-following ability, we identify a persistent and previously underexplored failure pattern in which a small subset of prompts differing only in the object consistently fails to realize the same target concept under identical generation settings. We term this phenomenon object-dependent concept brittleness. Such cases suggest systematic internal blind spots rather than random sampling noise. In this paper, we present an interpretability-oriented framework to audit and minimally correct these failures. Our key idea is to analyze denoising trajectories in a step-wise sparse autoencoder (SAE) space, where abstract style and attribute concepts become more separable than in the raw denoising representation. This sparse space enables us to compare successful and failed generations, identify concept dimensions whose evidence is missing, weakened, or temporally delayed, and construct class-level concept prototypes from reliable class-consistent samples. Based on this audit process, we introduce a lightweight inference-time correction strategy that interpolates denoising features toward the corresponding prototype in SAE space. Rather than serving as a task-specific retraining method, this intervention acts as a validation of the diagnosed concept deficiency. We evaluate the proposed framework on style and attribute failure cases across multiple diffusion backbones, with significant improvements in concept consistency, text fidelity, and repair success. Further analyses show that deeper denoising representations provide clearer concept structure, while early-stage intervention offers the strongest correction leverage. Code is available at https://github.com/Metecade/Object-Dependent-Concept-Brittleness.

cs.CV↗

arXiv2026

Remote epitaxy beyond polarity

Remote epitaxy through a monolayer two-dimensional material-covered substrate establishes a crystallographic registry across the van der Waals (vdW) surface that enables the epitaxial growth, lift-off and transfer of single-crystalline films. A central belief in remote epitaxy is that the substrate facilitating the phenomenon must be a material with strong ionicity, as the interatomic electrostatic potential fluctuation in covalent and metallic materials is substantially attenuated by two-dimensional materials. Here, we show remote epitaxy is possible when the substrate is a metallic or covalently bonded material and experimentally demonstrate non-polar remote homo- and heteroepitaxy across a wide range of material systems, including both metals and semiconductors. The achieved non-polar remote interactions are designed and engineered by harnessing substrate conductivity and vicinal surface step-edge density. These findings indicate that remote epitaxy is universal and applicable to ionic, metallic, and covalent materials, expanding its capabilities and stimulating a plethora of new fundamental scientific questions about the mechanism of remote epitaxy.

cond-mat.mtrl-sci↗

arXiv2026

Photon Spheres and Shadows of Covariant Loop Quantum Black Holes in the general $\mu$-scheme

We investigate black hole shadows and photon sphere properties for two families of covariant quantum-corrected black-hole metrics (hereafter called BH-I and BH-II) formulated within a general $\mu$-scheme, parameterised by a power-law exponent $s$ and an amplitude $\xi$. The extension to general (including non-integer) $s$ is a phenomenological interpolation between the $\mu_0$-scheme ($s=0$) and $\bar\mu$-scheme ($s=1$) and reveals a rich phenomenology masked when $s$ is usually fixed to 1 in previous literature. For BH-I, the photon sphere exists for all parameter values and exhibits an exact cancellation at $s=1$ where the coordinate location $r_{\rm ph}=3M$ is restored for any $\xi$. For BH-II, both the horizon and the photon sphere exhibit critical curves in the $(\xi,s)$ parameter plane; the photon sphere disappears when $\xi$ exceeds a closed-form critical value $\xi_c^{\rm PS}(s)$. We prove analytically that the photon sphere is always unstable ($\lambda_{\rm ph}>0$) throughout the physical parameter space of both metrics, and derive closed-form expressions for the Lyapunov exponent. Systematic parameter scans reveal that for fixed $\xi$ the shadow radius decreases monotonically with $s$ for BH-II and non-monotonically for BH-I. We derive small-parameter analytic expansions for the photon-sphere radius, shadow radius, and Lyapunov exponent, and demonstrate that a single shadow measurement suffers an observational degeneracy in the two-dimensional $(\xi,s)$ space; the degeneracy can be broken by a simultaneous measurement of the Lyapunov exponent. Using Event Horizon Telescope (EHT) measurements, we derive constraints on the $(\xi,s)$ parameter space and find that BH-II is constrained roughly $2$--$4$ times more tightly than BH-I.

gr-qc↗

arXiv2026

WM-R1: Training GUI Agents to Reason and leverage World Models with Reinforcement Learning

GUI agents trained with reinforcement learning (RL) have showcased strong environment learning capabilities on mobile platforms. However, RL typically demands extensive real-environment interactions, leading to high resource costs and instability, especially in GUI scenarios. To address these, we propose WM-R1, the first reinforcement learning framework that trains mobile GUI agents with world models instead of real environments. Specifically, world models serve as the source of state transitions during all rollouts, replacing the real Android environment within the training loop. WM-R1 also embeds world models directly into the thinking process, enabling agents to reason about the consequences of candidate actions before committing to the final action. Crucially, WM-R1 eliminates the need for real-environment interaction, supports massively parallelized and step-level granularized trajectory generation grounded in world models, and introduces a multi-dimensional rule-based reward that jointly optimizes task success, trajectory efficiency, and world model utilization. For efficient training, we curate a high-quality dataset of 2000 challenging tasks. Experiments on Android mobile benchmarks demonstrate that WM-R1-trained agents significantly outperform GRPO-only baselines and inference-time simulation methods. Code is available at https://github.com/genalyu/WM-R1 .

cs.AI↗

arXiv2026

RACE: Scalable Statistical Estimation of Functional Consistency in LLM Neurons

Discovering stable neuron behavior across entire domains remains a challenge in mechanistic interpretability. Existing methods often rely on instance-level point estimates or computationally expensive procedures, which either obscure population-level variability or limit scalable domain-wide analysis. We present RACE (Residual Alignment for Consistency Estimation), a forward-pass statistical framework that evaluates the domain-wide functional consistency of Transformer neurons. Compared with gradient-based point estimates, RACE produces neuron rankings that yield more domain-specific effects under perturbation. Token-distribution shifts support the connection between the selected neurons and the target domain, while scoring requires roughly one-hundredth of the computational overhead of the gradient-based methods. Code is available at https://github.com/Nexround/RACE.

cs.AI↗

arXiv2026

StateTrace: An Object-Centric Framework for Hidden-State Spatiotemporal Reasoning in Long Videos

Existing VLMs have achieved strong performance in video understanding, yet they struggle with long-video spatiotemporal reasoning when target objects become invisible, often mistaking "invisible" for "unknown". We define this challenge as hidden-state spatiotemporal reasoning: inferring object states during prolonged invisible intervals from context interactions. To address this, we propose StateTrace, a novel object-centric framework that endows VideoLLMs with an explicit mechanism for hidden state reasoning in long videos. StateTrace builds a reusable spatiotemporal state memory that organizes object trajectories, inter-object relations, and state-transition events into a structured reasoning substrate. At inference time, it retrieves question-relevant state-evolution trajectories and converts them into compact reasoning cues, enabling the model to explicitly reason about why an object disappears, how its state evolves while invisible, and whether that state should persist at query time. We further build HSR-Bench, a diagnostic benchmark for hidden-state reasoning, containing 1,427 video-QA samples from 1,384 unique videos. Extensive experiments across multiple VideoLLMs show that StateTrace consistently improves performance on both public benchmarks and HSR-Bench (e.g., improving VideoLLaMA3 from 39.6 to 64.2 on HSR-Bench).

cs.CV↗

arXiv2026

Superconducting ternary compounds Li-X-B (X=Mo, W) within the mild pressure range: First-principles predictions

Among the superconducting hydrides under high pressure, a number of studies concentrate on the ternary compounds to explore unique superconductors, which are capable of reducing the stable pressure and maintain superconductivity. In this work, to verify our proposed strategy of ternary composition lines (TCLs) to explore ternary compounds, we combined the first-principles calculations and crystal structure predictions to study the ternary compounds Li-X-B (X=Mo, W) under high pressure. After calculations along five and four TCLs in Li-W-B and Li-Mo-B, respectively, five Li-W-B compounds and four Li-Mo-B compounds were predicted. The compositions of LiWB4, Li4MoB2 and LiMo2B2 could be thermodynamically stable under high pressure, and Li2WB6 is around 0.02 eV/atom above the convex hull at 0 GPa, which has potential for synthesizing. Both of the predicted Li2WB6 P6/mmm and Li2WB4 R-3m are superconducting and their Tc are around 11 K, which are similar to the Tc of WB2 P6/mmm around 100 GPa. An anomalous increase of Tc was found in Li4MoB2 C2/m upon compression. We carried out full ternary search (FTS) to evaluate the validity of the TCLs strategy in Li-W-B system at 0 GPa. Our results are helpful for understanding the phase diagram of Li-X-B (X=Mo, W) under high pressure and the introducing of Li atoms provide candidate structures to reduce the measured stable pressure from ~100 GPa in WB2 P6/mmm to 0 GPa. Meanwhile, we preliminary validate the strategy of TCLs in structure predictions and we expect to improve this strategy in the future, shedding light on the studies of ternary compounds.

cond-mat.supr-con↗

arXiv2026

Global and local error bounds: characterizations via directional derivatives and tangent cones

We develop new characterizations of both global and local error bounds for general functions, using directional derivatives and tangent cones without imposing convexity or linear structure. We first establish several equivalent conditions for the global error bound of a nonnegative lower semicontinuous function. These equivalences hold for general, possibly nonconvex and nonsmooth functions. We further link the error bound with perturbation stability, Hausdorff stability of sublevel sets, and an inverse-sublevel-set estimate. Turning to directional derivatives, we introduce the minimal unit-sphere directional derivative $\varphi(x)$ on the tangent cone and clarify its exact relation with the global slope. For Lipschitz continuous functions we prove that $\sup_{x\notin S_0} \varphi(x) < 0$ is sufficient for an error bound, and for convex functions on convex sets this condition is also necessary, In finite dimensions we obtain sharp local results: if $\varphi(\bar{x}) > 0$ at a solution $\bar{x}$, then a local error bound holds and the optimal constant is exactly $1/\varphi(\bar{x})$; if $\varphi(\bar{x}) = 0$ and a suitable direction exists outside the tangent cone of the solution set, the local error bound fails. A general estimate relating the directional derivative to the distance from the tangent cone of the solution set is also derived.

math.OC↗

arXiv2026

Radar-Aided Near-Field Beam Prediction via Beam Map Learning for XL-MIMO V2I Communications

Near-field beam training in extremely large-scale multiple-input multiple-output (XL-MIMO) vehicle-to-infrastructure (V2I) systems incurs high overhead due to large range-angle codebooks and rapid channel variation. This paper proposes a passive radar-aided framework for near-field beam prediction based on radar-to-beam map learning. By exploiting the spatial correlation between radar observations and communication signals, the proposed method maps radar Bartlett spectra to communication beam maps using a lightweight encoder-decoder convolutional neural network. Gaussian soft supervision is further introduced to preserve beam-space continuity. Simulations on a synchronized Sionna ray tracing radar-communication dataset show that the proposed method consistently improves Top-k accuracy, distance-based accuracy, beam loss, and spectral efficiency.

eess.SP↗

arXiv2026

Low-Complexity Channel Estimation Framework for Non-Square UPA-Assisted XL-MIMO Systems

Low-complexity channel state information acquisition is crucial for extremely large-scale multiple-input multiple-output (XL-MIMO) systems. However, practical deployments of non-square uniform planar arrays (UPAs) in hybrid-field environments face prohibitive computational complexity and degraded estimation accuracy due to limited elevation angle-of-arrival (AoA) resolution and deteriorated channel sparsity. To tackle these challenges, we propose a low-complexity channel estimation framework. First, an antenna-domain extrapolation scheme synthesizes a virtually enlarged vertical aperture via the spatial correlation among adjacent elements, breaking the elevation resolution limit. The framework then disentangles the parameter coupling by transforming the two-dimensional joint search into two sequential one-dimensional searches. Specifically, elevation AoAs are extracted via an extrapolation-enhanced discrete Fourier transform-Newtonized orthogonal matching pursuit (NOMP) algorithm along the virtually enlarged vertical uniform linear array (ULA), while azimuth AoAs, ranges, and gains are acquired utilizing a discrete fractional Fourier transform-NOMP algorithm along a horizontal ULA. A subspace fitting-driven path matching algorithm pairs these decoupled parameters. To overcome the accuracy bottleneck of the antenna-domain scheme, a correlation-domain extrapolation scheme is further developed by exploiting the structural properties of the spatial correlation matrix to decouple the near-field quadratic and azimuth phase components, yielding a noise-suppressed virtual array. Numerical results validate the effectiveness of the proposed framework.

eess.SP↗

arXiv2026

Directional Derivatives and Error Bounds of Merit Functions in Vector Optimization

This paper presents a comprehensive analysis of directional derivatives and error bounds for the merit function $\theta(x)=\sup_{a\in A}\bigl(-\Delta_C(F(x)-F(a))\bigr)$ associated with the vector optimization problem $\operatorname{Min}_C\{F(x):x\in A\}$, where $\Delta_C$ is the oriented distance function. We first prove that $\theta$ is concave and Lipschitz continuous on the whole space and derive its dual representation via the weak$^*$ compact convex set $K=\overline{\operatorname{co}}^{w^*}(S(C^+))$. At a weakly efficient solution $\bar x$, we obtain the explicit formula $\theta'(\bar x;d)=\min_{y^*\in W(\bar x)}\langle y^*,F(d)\rangle$ with $W(\bar{x})=\{y^*\in K:F^*y^*\in -N_A(\bar{x})\}$, characterize the zero-directional-derivative cone, and prove that, under a local error bound condition, the tangent cone to the solution set is $T_{E_w}(\bar x)=T_A(\bar x)\cap T_{\widehat A}(\bar x)=\{d\in T_A(\bar x):\theta'(\bar x;d)=0\}$. We establish the equivalence of thirteen distinct global error bound conditions, including characterizations via linear regularity, the global slope, an asymptotic condition, and perturbation stability. A central result shows that the global error bound property for $\theta$ on the feasible set $A$ is characterized by a uniform negativity condition on the unit-sphere minimal directional derivative, namely $\sup_{x \in A \setminus E_w} \varphi(x) < 0$. We also determine the optimal local error bound constant precisely as $1/\varphi(\bar x)$ when $\varphi(\bar x)>0$, and provide a counterexample demonstrating that an additional directional condition is essential when $\varphi(\bar x)=0$. These results provide a complete bridge between the directional derivative of the merit function and the geometry of the solution set, offering fundamental tools for the convergence analysis of algorithms in vector optimization.

math.OC↗

arXiv2026

Dynamic Speed Limit Control of Connected Automated Vehicles in Freeway Networks Considering Traffic Composition Uncertainty

Dynamic speed limit control has emerged as a promising strategy to improve freeway sustainability in mixed traffic environments with connected automated vehicles (CAVs). However, most existing approaches assume that the CAV penetration rate is deterministic and can be accurately known throughout the control horizon. In reality, the penetration rate has inherent observation errors, leading to uncertainty in mixed traffic composition, which in turn degrades control performance. To overcome this limitation, this study proposes a novel model predictive control (MPC) framework for dynamic CAV speed limit control in freeway networks that explicitly incorporates traffic composition uncertainty into both flow prediction and control optimization. An uncertainty-aware macroscopic mixed traffic model is first developed, where the uncertain penetration rate propagates through the mixed fundamental diagram to the flow dynamics by affecting the mixed free-flow speed, capacity, and capacity drop condition. Then, a traffic composition-aware MPC is formulated to optimize CAV speed limits against multiple admissible penetration rate realizations, thereby improving control robustness under heterogeneous traffic conditions. Simulation experiments are conducted on both a single-bottleneck freeway corridor and a multi-bottleneck freeway network with merge-diverge interactions. The results demonstrate that the proposed controller generates more spatially coordinated speed limits, which effectively reduce travel time spent and provide environmental benefits.

eess.SY↗

arXiv2026

Continuous-Variable Source-Independent Quantum Random Number Generation with General POVMs

Continuous-variable source-independent quantum random number generators offer the highest generation rates among semi-device-independent protocols. In reality, the protocol design is limited due to permissible measurement configurations. In this work, we propose a rigorous security proof framework that accommodates general, infinite-dimensional positive-operator-valued measures. Building upon the numerical security proof framework, we evaluate the randomness lower bound by maximizing the eavesdropper's guessing probability. Specifically, we transform the inherently infinite-dimensional semidefinite program in Fock space into a tractable finite-dimensional one, rigorously proving that latter provides a strict upper bound to the guessing probability of the original infinite-dimensional problem. Our framework showcases its capability by certifying secure randomness using unbalanced homodyne detection with only a single quadrature measurement, thereby bypassing the traditional requirement of measuring two conjugate quadratures such as $X$ and $P$. We experimentally validate our protocol on an optical platform using vacuum and weak coherent states, achieving a maximum secure randomness extraction of 1.11 bits per sample and an ultra-high generation rate of 1.776 Gbps. This work provides a flexible design for practical, high-speed quantum random number generators.

quant-ph↗

arXiv2026

High-order tensor neural network for iteration-free structure relaxation

Structure relaxation is important for the discovery of new materials, yet conventional ab initio optimization remains a major bottleneck in high-throughput screening workflows. Machine learning potentials have accelerated relaxation by orders of magnitude, but they still rely on iterative optimization and high-quality DFT force labels. Here, we present HotRelax, a high-order tensor message-passing neural network for one-shot, end-to-end prediction of relaxed structures. Trained directly on paired unrelaxed and relaxed structures, HotRelax requires no DFT force labels and predicts relaxed structures in a single forward pass, without iterative inference or post-processing. Across five diverse datasets spanning 3D bulk crystals, 2D layered materials and catalysts, HotRelax shows strong performance relative to state-of-the-art end-to-end relaxation models, achieving lower prediction errors on several benchmarks while maintaining a compact model size and efficient inference. Extensive DFT calculations further show that the predicted structures are close in energy to their DFT-relaxed counterparts. When integrated into catalytic workflows, HotRelax also improves the accuracy and generalization of relaxed-state energy prediction models. Together, these results support HotRelax as an efficient and widely applicable framework for end-to-end structure relaxation, with strong potential to accelerate high-throughput materials discovery.

physics.comp-ph↗

arXiv2026

Scaling Learning-based AEB with Massive Unlabeled Data

This paper studies how to scale learning-based automatic emergency braking (AEB) with massive unlabeled fleet data under production constraints. Our approach is based on meta-feedback semi-supervised learning (MF-SSL), where a teacher generates pseudo labels for unlabeled driving data and is updated using a small labeled anchor set as safety-critical feedback. In production, anchor ambiguity and labeled-unlabeled mismatch can amplify systematic pseudo-label errors, leading to spurious triggers. We propose a stabilized MF-SSL framework with (i) Noise-Aware Decoupling, which removes ambiguity-prone anchors from the teacher's supervised update path, and (ii) kinematics-gated pseudo-labeling with a teacher conflict penalty to suppress mismatch-induced risk hallucinations on unlabeled data while maintaining broad coverage. Extensive experiments show consistent gains as unlabeled data scale from 1M to 1B windows, improving safety while keeping comfort stable. The 1B-trained student model is deployed to hundreds of thousands of vehicles and validated over \$10^9$ km of driving, achieving a positive-to-false activation ratio exceeding 100:1 and a 35% improvement in accident-free driving mileage over a production rule-only baseline.

cs.LG↗

arXiv2026

XL-ChannelDiff: An Efficient Diffusion-Based Multi-Domain Near-Field Channel Extrapolation Framework for XL-MIMO Systems

Accurate channel state information (CSI) acquisition is essential for unleashing the performance gains of extremely large-scale multiple-input multiple-output (XL-MIMO) systems. However, in near-field regions, CSI acquisition is much more challenging than in the far field due to the high-dimensional channel representation and spherical wavefront propagation. To address this, in this paper, we propose an efficient multi-domain near-field channel extrapolation framework for XL-MIMO systems. Leveraging the conditional denoising diffusion implicit model (CDDIM), our approach enables accurate channel extrapolation across the antenna, frequency, and spatial domains. Specifically, we design a physics-aware CDDIM backbone that incorporates position-embedded patch tokenization and a mask-guided multi-head attention mechanism, enabling the model to exploit position-dependent channel correlations induced by near-field spherical-wave propagation. To ensure high-fidelity extrapolation, we incorporate a Wasserstein GAN (WGAN) discriminator that provides adversarial supervision to the CDDIM during both the training and reverse sampling phases. Additionally, a RePaint-style refinement scheme is introduced to optimize the sampling trajectory, further boosting extrapolation accuracy. Extensive experiments demonstrate the superiority of the proposed framework, achieving superior extrapolation accuracy and robust generalization across diverse domains, varied configurations, and severe masking conditions.

eess.SP↗

arXiv2026

Vision-Based Efficient Joint Trajectory and Channel Tracking in Near-Field XL-MIMO Systems

Accurate joint tracking of mobile users, surrounding scatterers, and dynamic channels is a critical task for sixth-generation (6G) wireless systems, essential for both ensuring high-quality communications and empowering advanced selsing applications such as autonomous driving and immersive extended reality. While extremely large-scale multiple-input multiple-output (XL-MIMO) inherently offers strong support for this task through its high spatial resolution and spectral efficiency, its massive scale of antenna arrays, coupled with near-field propagation characteristics, makes joint trajectory and channel tracking time-consuming and hardware-intensive. To address these challenges, we rethink the problem from a vision-based signal perspective. Specifically, we design a subarray-based partially connected hybrid beamforming (PC-HBF) architecture with a tailored time-multiplexed (TM) mechanism. This effectively compensates for the aperture loss caused by limited radio frequency (RF) chains, generating high-fidelity Cartesian-domain signal images that inherently capture near-field spatial features. Based on this visual representation, we propose an improved CenterNet to perform accurate one-shot path localization, circumventing the path-iterative search required by conventional compressed-sensing-based methods. Building upon this to further improve the accuracy and exploit temporal correlation, a local small-scale orthogonal matching pursuit (OMP) refiner and a lightweight cascaded OMP tracker are developed. Finally, a Hungarian-based trajectory association module is incorporated to maintain track continuity and provide trajectory-level information for environment monitoring. Simulation results show that the proposed framework consistently outperforms representative baselines in position and channel tracking accuracy, especially under low-SNR and limited-hardware conditions.

eess.SP↗