Searcharxiv⌕ Search

arXiv subjects

Hao Yang

Publications and source records attributed to Hao Yang.

At least 37 records · Page 2Linked to original sources

Chiral superconductors and competing states across a Lifshitz transition in rhombohedral pentalayer graphene

Rhombohedral multilayer graphene hosts a distinctive low-energy electronic structure in which strong Coulomb interactions and nontrivial quantum geometry intertwine to generate exotic quantum states. Recent experiments reported signatures of chiral superconductivity in electron-doped rhombohedral multilayer graphene within the spin- and valley-polarized regime. Here we map the normal-state fermiology surrounding chiral superconductivity in rhombohedral pentalayer graphene. Quantum oscillation measurements reveal an electrically controlled Lifshitz transition between a simply-connected circular quarter-metal Fermi surface and an annular quarter-metal Fermi surface. The Lifshitz boundary itself shifts with perpendicular magnetic field, consistent with the strongly momentum-dependent orbital magnetic moment of the low-energy band. Approaching the transition from either side, the electron effective mass becomes strongly enhanced, implying the formation of a nearly dispersionless band bottom and a strongly reduced kinetic-energy scale. This singular electronic structure produces a regime of exceptionally strong instability in which chiral superconductivity competes with Wigner crystalline phases and reentrant quantum Hall states. In particular, two superconducting regions with signatures of orbital time-reversal-symmetry breaking lie on opposite sides of the Lifshitz boundary and have comparable transition temperatures, yet the annular-side state is suppressed by a substantially smaller perpendicular magnetic field. Our calculation finds comparable chiral pairing tendencies on the two parent Fermi surfaces while producing a much lower orbital-Zeeman pair-breaking scale and an additional finite-momentum pairing tendency for the annular state. These results identify Fermi-surface topology as a key control parameter for chiral superconductivity in rhombohedral graphene.

cond-mat.mes-hall↗

How Chain-of-Thought Works? Tracing Information Flow from Decoding, Projection, and Activation

Chain-of-Thought (CoT) prompting significantly enhances model reasoning, yet its internal mechanisms remain poorly understood. We analyze CoT's operational principles by reversely tracing information flow across decoding, projection, and activation phases. Our quantitative analysis suggests that CoT may serve as a decoding space pruner, leveraging answer templates to guide output generation, with higher template adherence strongly correlating with improved performance. Furthermore, we surprisingly find that CoT modulates neuron engagement in a task-dependent manner: reducing neuron activation in open-domain tasks, yet increasing it in closed-domain scenarios. These findings offer a novel mechanistic interpretability framework and critical insights for enabling targeted CoT interventions to design more efficient and robust prompts. We released our code and data at https://anonymous.4open.science/r/cot-D247.

cs.AI↗

PosterText: Towards Unified Visual Text Generation and Editing for E-commerce Poster

Automated e-commerce poster design requires both high-quality poster generation and flexible editing of existing designs. However, most existing methods either target end-to-end poster generation or follow multi-stage design pipelines, with limited capability for flexible and precise editing of existing posters. To enable unified generation and editing of e-commerce posters, we introduce Text Patch Generation and Editing, a unified task formulation that treats text patches as atomic units and covers four operations: poster generation, patch addition, patch deletion, and patch modification, with optional reference-guided style control. Based on this, we propose PosterText, a unified model trained with a four-stage curriculum, including text rendering pretraining, instruction-following training, reinforcement learning for preference alignment, and spatial guidance self-distillation for execution refinement. We further construct a large-scale dataset with patch-level annotations and a comprehensive benchmark for evaluation. Extensive experiments demonstrate that PosterText achieves competitive performance against existing generation and editing approaches, validating the effectiveness of the proposed framework.

cs.CV↗

Transferable Tool-Tissue Contact Detection from Stereo Depth in Robot-Assisted Surgery

Reliable tool--tissue contact detection can support interaction-aware control and downstream force estimation in robot-assisted surgery. Most existing methods learn a contact classifier from RGB appearance, which is hard to generalize. In this work, we use the depth image generated from a stereo pair to give more information about tool--tissue contact. For each depth frame, we localize a spatially supported minimum-distance patch around the tool boundary and reduce it to a single scalar, $-\log_{10}|d|$; this signal rises and falls in step with ground-truth contact. We formalize this observation with a fully supervised two-state hidden Markov model. We fit this model as a six-fold leave-one-session-out (LOSO) ensemble on six palpation sessions against a single silicone cup-like phantom, with the decision threshold selected from the pooled out-of-fold predictions. It is evaluated on four held-out sessions of three categories: 1. same task on same phantom; 2. same task on different phantom; 3. different task on different phantom. This model reaches held-out macro F1 $0.927$ and AUPRC $0.980$. We further compare against a reproduction of an RGB-based contact classifier from prior work. This RGB-based model achieves high performance on the first category (F1 $0.965$), but substantially lower performance on the other two, resulting in macro F1 $0.320$ across all four sessions. These results indicate that the tool--tissue distance is a strong, transferable cue for contact detection in robot-assisted surgery.

cs.RO↗

TransAnyText: Translating Arbitrary Text in E-commerce Images via Structured Visual Generation

Cross-border e-commerce image translation is essential for global retail, where product images, banners, and detail pages need to be produced in different languages. Existing methods struggle to achieve accurate translation, faithful visual identity preservation, and easy-to-edit outputs, simultaneously. To address these challenges, we introduce TransAnyText, a structured visual code framework that reformulates image text translation as generating renderable HTML patches from source images and target languages. Our framework decouples semantic generation from pixel rendering: a vision-language model (VLM) handles visual understanding, cross-lingual translation, and structured visual generation, while a diffusion model performs background inpainting and pixel-level refinement, followed by deterministic rendering to synthesize the final image. Based on this formulation, we develop a three-stage post-training framework, where supervised fine-tuning (SFT) establishes the image-to-code mapping, privilege-gap weighted self-distillation (PWSD) improves the learning of style and layout tokens, and reinforcement learning with verifiable rewards (RLVR) further optimizes task-level performance. We further introduce TransAnyDataset and TransAnyBench, a multilingual dataset and benchmark for e-commerce image translation. Extensive experiments demonstrate competitive performance against cascaded pipelines, open-source end-to-end models, and closed-source image editing systems, providing an effective, controllable, and editable solution for cross-border e-commerce image translation.

cs.CV↗

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↗

YNU-HPCC at SemEval-2025 Task 11: Bridging the Gap in Text-Based Emotion Using Multiple Prediction Headers

This paper describes the participation of the YNU-HPCC team in subtask A of task 11, Bridging the Gap in Text-Based Emotion at SemEval-2025. Our best-performing system employs the RoBERTa (Robustly Optimized BERT Approach) model, an improved version of BERT that utilizes the Transformer encoder architecture. We enhanced the output head to allow the model to process one emotion simultaneously. We obtained the official ranking score (0.44), including results from all languages. The entire dataset was translated into English using Google Translate to facilitate subsequent processing. Through probabilistic and attention analyses, we found that (I) a single prediction head performs better than six heads predicting six emotions simultaneously, and (II) training on a uniformly translated English dataset yields better results than using the original dataset. The code is available at: https://github.com/BGWH123/Semeval-2025-task11.

cs.CL↗

PerceptionBench: Evaluating Atomic Visual Perception in Multimodal Large Language Models

We introduce PerceptionBench, a benchmark specifically designed to evaluate the atomic visual perception capabilities of Multimodal Large Language Models (MLLMs). Existing benchmarks often fail to isolate perception: holistic evaluations conflate perceptual errors with failures in reasoning or domain knowledge, while application-driven benchmarks only cover narrow, fragmented domains shaped by heuristic designs. To address these limitations, PerceptionBench adopts a bottom-up approach: by diagnosing the earliest failure points in the responses of frontier MLLMs across 42 existing benchmarks, we construct an error taxonomy whose perception branch defines ten atomic perceptual capabilities. Guided by this taxonomy, we construct 3,000 verified questions with short, unambiguous answers, each isolating a single capability, with difficulty stemming from perception rather than reasoning or knowledge. Benchmark results across sixteen frontier MLLMs reveal that atomic perception remains largely unsolved---no model reaches 60\% accuracy, perception-related hallucination is the weakest capability on average, and similar overall scores conceal sharply divergent capability profiles. PerceptionBench thus provides a capability-level standard for measuring and diagnosing the visual perception boundaries of MLLMs.

cs.CV↗

DICA: Dual-Indicator Guided Contrastive Alignment in Multimodal Large Language Models

Human visual reasoning typically follows a coarse-to-fine attention process, starting from global scene understanding and gradually focusing on question-relevant regions. However, multimodal large language models may deviate from this pattern due to attention drift and the underutilization of visual evidence, which can lead to hallucinations. To mitigate these issues, this study proposes a Dual-Indicator Guided Contrastive Alignment (DICA), which tracks two information-theoretic indicators during inference: Visual Attention Entropy (VAE), which reflects the concentration of visual attention, and Output Image Correlation (OIC), which measures the dependence of generated outputs on the visual input. An abnormal increase in VAE or a decrease in OIC corresponds to different failure modes, which trigger targeted contrastive alignment to restore visual grounding. Experimental results across multiple benchmarks demonstrate that DICA consistently outperforms existing approaches and substantially reduces hallucinations, highlighting the effectiveness of indicator-driven intervention in improving multimodal inference reliability. The code is publicly available at https://github.com/BGWH123/DICA/.

cs.AI↗

Offline-Online Curriculum RL for Multimodal Reasoning

Multimodal large language models exhibit capabilities on reasoning tasks, yet often produce flawed intermediate steps while yielding correct final answers. This behavior undermines interpretability and reliability, suggesting reliance on spurious shortcuts rather than faithful reasoning. Although efforts have explored step-level supervision, distinguishing decisive steps from redundant ones remains challenging. We propose $O^2$-CritiCuRL, a novel curriculum reinforcement learning framework that introduces critical-step awareness through an iterative offline-online paradigm. In the offline stage, $O^2$-CritiCuRL conducts multi-rollout analysis over step-annotated trajectories to estimate step-level importance, allowing the framework to distill critical reasoning steps and filter out redundant ones. In the online stage, we employ a progressive step-level reinforcement learning strategy, where truncated chains guide the model to infer missing steps and refine its reasoning, thereby sharpening its focus on critical steps and overcoming the limitations of static supervision. Extensive experiments on multimodal reasoning benchmarks show that our method achieves state-of-the-art performance while delivering superior training and inference efficiency. Code is available at https://github.com/kk0013/CritiCuRL.

cs.AI↗

EVL-MCoT: Enhanced Vision-Language Multi-CoT for Harmful Meme Detection

MEMEs are widely used on the internet and often carry strong elements of sarcasm or irony. Understanding their hidden meanings typically requires a joint interpretation of text and vision. Existing methods focus on the dual-stream vision-language model to extract the visual and text simultaneously, which lacks background information and prior knowledge about the comprehensive explanation of MEME. One feasible option is to adopt chain-of-thought (CoT). However, the simple CoT approach lacks multi-perspective thinking, which may compromise the reliability of the resulting answers. Moreover, it often relies on shallow feature fusion, lacking the fusion of local details and fine-grained visual-prompt text alignment. This limitation prevents a deeper understanding of the intricate connections between the visual and the text. Herein, an enhanced vision-language multi-CoT (EVL-MCoT) approach is proposed to address these limitations. By promoting multi-CoT, EVL-MCoT enhances consistency and reduces bias in the decision-making process. Additionally, we design a prototype-guided and context-guided decoding framework, which incorporates visual prototypes to guide the fusion process and enables the model to align textual and visual information more precisely. We achieve promising results on the HatefulMemes and MultiOff datasets. The source code has been publicly released and is available at https://github.com/BGWH123/EVL-MCoT.

cs.CV↗

Visual Saliency Steering Distillation for Multimodal Chain-of-Thought Reasoning

Multimodal chain-of-thought (CoT) reasoning integrates visual and textual cues through step-by-step inference. In small models with limited token budgets, modality-interaction fusion often suppresses tiny cross-modal differences. In particular, multimodal CoT often struggles when different images pair with identical text or different texts pair with an identical image, making such inputs nearly indistinguishable after fusion. This study proposes Visual Saliency Steering Distillation (VSSD). VSSD leverages the attention maps of multimodal large language models to generate perturbed images that capture task-sensitive feature directions, and then applies singular value decomposition to extract dominant steering vectors to guide inter-layer distillation. Experiments on ScienceQA and M$^3$CoT demonstrate that VSSD improves rationale generation and answer inference. The code is available at https://github.com/BGWH123/VSSD.

cs.CV↗

InCarEmo: A Multimodal Dataset for In-Cabin Emotion Recognition and Driver State Monitoring

Understanding driver emotion and state is critical for the next generation of intelligent in-cabin systems that ensure safety and enhance human-vehicle interaction. However, existing public datasets for in-cabin affective computing are largely limited to visual modalities and rarely include conversational information, making it difficult to capture the linguistic and interactive cues underlying driver emotion. To address these gaps, we introduce InCarEmo, a multimodal dataset for in-cabin emotion recognition and driver state monitoring. InCarEmo integrates RGB and infrared video, in-cabin audio, and dialogue text collected from scripted in-cabin scenarios designed to simulate realistic driver behaviors, covering diverse lighting conditions and driving contexts. The dataset supports three primary tasks: 1) multimodal emotion recognition, 2) fatigue detection, and 3) distraction monitoring. In addition to the original Chinese data, we construct an auxiliary English benchmark to support preliminary cross-lingual evaluation. We provide a unified benchmark with extensive baseline results across unimodal and multimodal methods, including analyses under modality-missing and noise conditions. Experimental results demonstrate the benefits of multimodal fusion and reveal remaining challenges under real-world noise and low-light conditions. By releasing InCarEmo, we aim to establish a comprehensive foundation for robust, interpretable, and human-centric in-cabin affective understanding, promoting safer and more empathetic driver-vehicle interaction.

cs.AI↗

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↗

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↗

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↗

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↗

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↗