arXiv subjects

Yang Yu

Publications and source records attributed to Yang Yu.

At least 109 records · Page 6Linked to original sources

arXiv2026

Using Subgraph GNNs for Node Classification:an Overlooked Potential Approach

Previous studies have demonstrated the strong performance of Graph Neural Networks (GNNs) in node classification. However, most existing GNNs adopt a node-centric perspective and rely on global message passing, leading to high computational and memory costs that hinder scalability. To mitigate these challenges, subgraph-based methods have been introduced, leveraging local subgraphs as approximations of full computational trees. While this approach improves efficiency, it often suffers from performance degradation due to the loss of global contextual information, limiting its effectiveness compared to global GNNs. To address this trade-off between scalability and classification accuracy, we reformulate the node classification task as a subgraph classification problem and propose SubGND (Subgraph GNN for NoDe). This framework introduces a differentiated zero-padding strategy and an Ego-Alter subgraph representation method to resolve label conflicts while incorporating an Adaptive Feature Scaling Mechanism to dynamically adjust feature contributions based on dataset-specific dependencies. Experimental results on six benchmark datasets demonstrate that SubGND achieves performance comparable to or surpassing global message-passing GNNs, particularly in heterophilic settings, highlighting its effectiveness and scalability as a promising solution for node classification.

cs.LG↗

arXiv2026

Towards Public Administration Research Based on Interpretable Machine Learning

Causal relationships play a pivotal role in research within the field of public administration. Ensuring reliable causal inference requires validating the predictability of these relationships, which is a crucial precondition. However, prediction has not garnered adequate attention within the realm of quantitative research in public administration and the broader social sciences. The advent of interpretable machine learning presents a significant opportunity to integrate prediction into quantitative research conducted in public administration. This article delves into the fundamental principles of interpretable machine learning while also examining its current applications in social science research. Building upon this foundation, the article further expounds upon the implementation process of interpretable machine learning, encompassing key aspects such as dataset construction, model training, model evaluation, and model interpretation. Lastly, the article explores the disciplinary value of interpretable machine learning within the field of public administration, highlighting its potential to enhance the generalization of inference, facilitate the selection of optimal explanations for phenomena, stimulate the construction of theoretical hypotheses, and provide a platform for the translation of knowledge. As a complement to traditional causal inference methods, interpretable machine learning ushers in a new era of credibility in quantitative research within the realm of public administration.

cs.CY↗

arXiv2026

ELMM: Efficient Lightweight Multimodal Large Language Models for Multimodal Knowledge Graph Completion

Multimodal Knowledge Graphs (MKGs) extend traditional knowledge graphs by incorporating visual and textual modalities, enabling richer and more expressive entity representations. However, existing MKGs often suffer from incompleteness, which hinder their effectiveness in downstream tasks. Therefore, multimodal knowledge graph completion (MKGC) task is receiving increasing attention. While large language models (LLMs) have shown promise for knowledge graph completion (KGC), their application to the multimodal setting remains underexplored. Moreover, applying Multimodal Large Language Models (MLLMs) to the task of MKGC introduces significant challenges: (1) the large number of image tokens per entity leads to semantic noise and modality conflicts, and (2) the high computational cost of processing large token inputs. To address these issues, we propose Efficient Lightweight Multimodal Large Language Models (ELMM) for MKGC. ELMM proposes a Multi-view Visual Token Compressor (MVTC) based on multi-head attention mechanism, which adaptively compresses image tokens from both textual and visual views, thereby effectively reducing redundancy while retaining necessary information and avoiding modality conflicts. Additionally, we design an attention pruning strategy to remove redundant attention layers from MLLMs, thereby significantly reducing the inference cost. We further introduce a linear projection to compensate for the performance degradation caused by pruning. Extensive experiments on four benchmark datasets demonstrate that ELMM achieves state-of-the-art performance.

cs.AI↗

arXiv2026

Helicity Dependent Distribution Functions of the Proton and $Λ$ and $Σ^0$ Baryons

Using continuum Schwinger function methods, a coherent set of predictions for proton, $Λ$ and $Σ^0$ distribution functions (DFs) has been made available -- both helicity dependent and unpolarised. The results and comparisons between them reveal impacts of diquark correlations and SU$(3)$-flavour symmetry breaking, some of which are highlighted in this contribution. For instance: in-proton ratios of helicity-dependent/unpolarised valence-quark DFs are presented; it is highlighted that, were it not for the presence of axialvector diquarks in the $Σ^0$, the valence strange quark would carry none of the $Σ^0$ spin; and the sign and size of polarised gluon DFs is discussed -- at a scale typical of modern measurements, gluon partons carry roughly 40% of each octet baryon's spin.

hep-ph↗

arXiv2026

Demonstration of Discrete-Time Quantum Walks and Observation of Topological Edge States in a Superconducting Qutrit Chain

Quantum walk serves as a versatile tool for universal quantum computing and algorithmic research. However, the implementation of discrete-time quantum walks (DTQWs) with superconducting circuits is still constrained by some limitations such as operation precision, circuit depth and connectivity. With improved hardware efficiency by using superconducting qutrits (three-level systems), we experimentally demonstrate a scalable DTQW in a superconducting circuit, observing the ballistic spreading of quantum walk in a qutrit chain. The usage of qutrits in our implementation allows hardware efficiently encoding of the walker position and the coin degree of freedom. By exploiting the flexibility and intrinsic symmetries of qutrit-based DTQWs, we successfully prepare two topological phases in the chain. For the first time, particle-hole-symmetry-protected edge states, bounded at the interface between these two topological phases, are observed in the superconducting platform. Measured parameter dependencies further validate the properties of edge states. The scalability and gate-control compatibility of the demonstrated DTQWs enable a versatile tool for superconducting quantum computing and quantum simulation.

quant-ph↗

arXiv2025

New Constraints on Cosmic-ray boosted Sub-GeV Dark Matter via Light Mediators

Traditional direct detection experiments lack the sensitivity to probe the sub-GeV dark matter (DM), primarily due to the low energy of the expected nuclear recoils. In this work, we investigate cosmic-ray (CR) upscattering as a mechanism to accelerate DM particles to detectable velocities in underground experiments. By analyzing four models of DM-nucleon interactions -- namely scalar, vector, pseudoscalar, and axial-vector mediators -- we derive constraints on the coupling parameters using data from the LZ, XENON, and Borexino experiments, covering mediator mass from $10^{-6}$ to $1$ GeV. As the mediator mass varies, the shift in dominance between momentum transfer and mediator mass leads to a turnover in the constraints around $10^{-2}$--$10^{-3}~\mathrm{GeV}$. Our results extend the reach of direct detection into the sub-GeV window and clarify the critical role of momentum dependence in light-mediator scenarios.

astro-ph.HE↗

arXiv2025

Multi-orbital dynamical mean-field theory with a complex-time solver

We present the combination of a complex-time tensor-network impurity solver with an analytic continuation scheme based on exponential fitting as an efficient framework for single and multi-orbital dynamical mean-field calculations. By performing time-evolution along a complex-time contour, the approach balances computational cost with the difficulty of spectral recovery, offering greater flexibility than methods confined to the real or imaginary axis. By complementing the complex-time evolution with an exponential fitting scheme, we faithfully extract real-time information at negligible cost. The resulting method obtains high-resolution spectra at a significantly lower computational cost than real-time evolution, offering a promising tool for ab initio studies of strongly correlated materials.

cond-mat.str-el↗

arXiv2025

Information-Scrambling-Enhanced Quantum Sensing Beyond the Standard Quantum Limit

Quantum sensing promises measurement precision beyond classical limits, but its practical realization is often hindered by decoherence and the challenges of generating and stabilizing entanglement in large-scale systems. Here, we experimentally demonstrate a scalable, scrambling-enhanced quantum sensing protocol, referred to as butterfly metrology, implemented on a cross-shaped superconducting quantum processor. By harnessing quantum information scrambling, the protocol converts local interactions into delocalized metrologically useful correlations, enabling robust signal amplification through interference of the scrambled and polarized quantum states. We validate the time-reversal ability via Loschmidt echo measurements and quantify the information scrambling through out-of-time-ordered correlators, establishing the essential quantum resources of our protocol. Our measurements reveal that the sensing sensitivity surpasses the standard quantum limit (SQL) with increasing qubit number, reaching 3.78 in a 9-qubit configuration, compared to the SQL of 3.0. The scheme further exhibits inherent robustness to coherent control errors and probed signal noise. This work demonstrates a readily scalable path toward practical quantum sensing advantages with prevalent experimental platforms.

quant-ph↗

arXiv2025

Measuring the Collisional Evolution of Debris Clusters in an Asteroid System

Context. Rotational instability of rubble-pile asteroids can trigger mass shedding, forming transient debris clouds that may provide the initial conditions for secondary formation in binary systems. Aims. We investigate the dynamical and collisional evolution of a debris cloud numerically generated around a Didymos-like progenitor, as a representative case for the early formation of Dimorphos. The analysis focuses on the growth and structural properties of clusters composed of centimetre- to decimetre-scale particles. Methods. We perform full-scale simulations of debris evolution around a near-critically rotating asteroid using a cross-spatial-scale approach combined with the discrete element method (DEM). To overcome computational timescale limitations, an equivalent cluster-scale simulation framework is introduced to capture the essential collisional growth processes efficiently. These simulations quantify the efficiency of cluster growth and the structural evoution within the debris cloud. Results. Our simulations reveal that particles shed from a rotationally unstable asteroid exhibit a consistent migration pattern toward low-geopotential regions, which governs the mass distribution and dynamical structure of the debris cloud. The collisional velocity are well described by a Weibull distribution (lambda = 0.0642, k = 1.8349), where low-velocity impacts favor accretion. These collisions enable clusters to grow from centimeter-decimeter scales to meter-sized bodies, developing compact, moderately porous structures (Delta I \approx 0.8, phi \approx 0.52). Collisions between meter-sized clusters do not exhibit a bouncing barrier: low-velocity impacts yield Dinkinesh-like shapes, while moderate velocities promote plastic merging and continued growth.

astro-ph.EP↗

arXiv2025

Parametric phase modulation in superconducting circuits

Parametric modulation, valued for its versatility, is widely employed in superconducting circuits for quantum simulations and high-fidelity two-qubit gates. Conventionally, the qubit coupling strength is determined by the amplitude of the parametric flux pulse, which affects the qubit parameters dramatically. In this paper, we propose and implement a phase-modulation scheme to tune the interaction strength via adjustment of the relative phase between the parametric flux pulses applied to two coupled qubits. We characterize this modulation for sideband couplings, at both sweet and off-sweet spots, achieving a broad range of coupling strengths, as confirmed by both population dynamics and spectroscopy methods. This approach enables phase-controlled modulation of coupling strength, providing a promising candidate for parametrically driven quantum simulations and gate operations.

quant-ph↗

arXiv2025

Layer-wise Noise Guided Selective Wavelet Reconstruction for Robust Medical Image Segmentation

Clinical deployment requires segmentation models to stay stable under distribution shifts and perturbations. The mainstream solution is adversarial training (AT) to improve robustness; however, AT often brings a clean--robustness trade-off and high training/tuning cost, which limits scalability and maintainability in medical imaging. We propose \emph{Layer-wise Noise-Guided Selective Wavelet Reconstruction (LNG-SWR)}. During training, we inject small, zero-mean noise at multiple layers to learn a frequency-bias prior that steers representations away from noise-sensitive directions. We then apply prior-guided selective wavelet reconstruction on the input/feature branch to achieve frequency adaptation: suppress noise-sensitive bands, enhance directional structures and shape cues, and stabilize boundary responses while maintaining spectral consistency. The framework is backbone-agnostic and adds low additional inference overhead. It can serve as a plug-in enhancement to AT and also improves robustness without AT. On CT and ultrasound datasets, under a unified protocol with PGD-$L_{\infty}/L_{2}$ and SSAH, LNG-SWR delivers consistent gains on clean Dice/IoU and significantly reduces the performance drop under strong attacks; combining LNG-SWR with AT yields additive gains. When combined with adversarial training, robustness improves further without sacrificing clean accuracy, indicating an engineering-friendly and scalable path to robust segmentation. These results indicate that LNG-SWR provides a simple, effective, and engineering-friendly path to robust medical image segmentation in both adversarial and standard training regimes.

cs.CV↗

arXiv2025

Pass@k Metric for RLVR: A Diagnostic Tool of Exploration, But Not an Objective

The ability of Large Language Models (LLMs) to perform complex, multi-step reasoning is a central focus of modern AI research. To evaluate and enhance this capability, the pass@k metric, which measures the probability of obtaining at least one correct solution in k independent samples, has received significant attention. Its intuitive appeal has led to its adoption not only as an evaluation standard but also as a direct optimization objective in reinforcement learning. In this paper, we analyze the pass@k objective, derive its gradient, and demonstrate that it is fundamentally a per-example positive reweighting of the simpler pass@1 objective. Our analysis reveals that the pass@k objective provides a vanishing learning signal in regimes where exploration is most critical. We further analyze the dynamics of "exploration collapse", showing that as the policy concentrates probability mass, the gap between pass@k and pass@1 diminishes. We conclude that while pass@k is a useful diagnostic tool, it may be an unsuitable direct objective for optimization. Instead, mechanisms explicitly encouraging efficient exploration could offer a more effective path forward for reinforcement learning in reasoning tasks.

cs.LG↗

arXiv2025

An LLM-based Quantitative Framework for Evaluating High-Stealthy Backdoor Risks in OSS Supply Chains

In modern software development workflows, the open-source software supply chain contributes significantly to efficient and convenient engineering practices. With increasing system complexity, using open-source software as third-party dependencies has become a common practice. However, the lack of maintenance for underlying dependencies and insufficient community auditing create challenges in ensuring source code security and the legitimacy of repository maintainers, especially under high-stealthy backdoor attacks exemplified by the XZ-Util incident. To address these problems, we propose a fine-grained project evaluation framework for backdoor risk assessment in open-source software. The framework models stealthy backdoor attacks from the viewpoint of the attacker and defines targeted metrics for each attack stage. In addition, to overcome the limitations of static analysis in assessing the reliability of repository maintenance activities such as irregular committer privilege escalation and limited participation in reviews, the framework uses large language models (LLMs) to conduct semantic evaluation of code repositories without relying on manually crafted patterns. The framework is evaluated on sixty six high-priority packages in the Debian ecosystem. The experimental results indicate that the current open-source software supply chain is exposed to various security risks.

cs.SE↗

arXiv2025

In-Situ Growth of Halide Perovskite Single Crystals and Thin Films on Optical Fiber End Facets

Halide perovskites exhibit significant advantages for active optical components such as light emitting diodes, solar cells and photodetectors due to their excellent optoelectronic properties. Their nonlinear optical effects and other characteristics also make them suitable for integration into waveguide components, such as optical fibers, for applications like optical modulation. Although some efforts have been made to integrate perovskite nanomaterials with optical fibers, technological challenges have hindered reliable in-situ preparation methods. Herein, we propose an area-selective wetting strategy for optical fibers, which utilizes hydrophobic sidewalls and hydrophilic end facets to reliably hold small precursor droplets. By introducing a space confinement strategy to suppress the kinetics of solvent evaporation, Methylammonium lead bromide (MAPbBr3) perovskite single crystals were successfully grown in-situ on the fiber end facet. The versatility of this in-situ growth method for single crystals on fiber end facets of various sizes has also been verified. In a separate approach, the controllable in-situ preparation of CsPbBr3 polycrystalline thin films was achieved through vacuum-assisted rapid crystallization. Our strategy provides a controllable platform for the integration of perovskite materials and optical fibers, enabling further development in optical applications.

physics.optics↗

arXiv2025

TZ-LLM: Protecting On-Device Large Language Models with Arm TrustZone

Large Language Models (LLMs) deployed on mobile devices offer benefits like user privacy and reduced network latency, but introduce a significant security risk: the leakage of proprietary models to end users. To mitigate this risk, we propose a system design for protecting on-device LLMs using Arm Trusted Execution Environment (TEE), TrustZone. Our system addresses two primary challenges: (1) The dilemma between memory efficiency and fast inference (caching model parameters within TEE memory). (2) The lack of efficient and secure Neural Processing Unit (NPU) time-sharing between Rich Execution Environment (REE) and TEE. Our approach incorporates two key innovations. First, we employ pipelined restoration, leveraging the deterministic memory access patterns of LLM inference to prefetch parameters on demand, hiding memory allocation, I/O and decryption latency under computation time. Second, we introduce a co-driver design, creating a minimal data plane NPU driver in the TEE that collaborates with the full-fledged REE driver. This reduces the TEE TCB size and eliminates control plane reinitialization overhead during NPU world switches. We implemented our system on the emerging OpenHarmony OS and the llama.cpp inference framework, and evaluated it with various LLMs on an Arm Rockchip device. Compared to a strawman TEE baseline lacking our optimizations, our system reduces TTFT by up to 90.9% and increases decoding speed by up to 23.2%.

cs.CR↗

arXiv2025

Tunable Hybrid-Mode Coupler Enabling Strong Interactions between Transmons at Centimeter-Scale Distance

The transmon, a fabrication-friendly superconducting qubit, remains a leading candidate for scalable quantum computing. Recent advances in tunable couplers have accelerated progress toward high-performance quantum processors. However, extending coherent interactions beyond millimeter scales to enhance quantum connectivity presents a critical challenge. Here, we introduce a hybrid-mode coupler exploiting resonator-transmon hybridization to simultaneously engineer the two lowest-frequency mode, enabling high-contrast coupling between centimeter-scale transmons. For a 1-cm coupler, our framework predicts flux-tunable $XX$ and $ZZ$ coupling strengths reaching 23 MHz and 100 MHz, with modulation contrasts exceeding $10^2$ and $10^4$, respectively, demonstrating quantitative agreement with an effective two-channel model. This work provides an efficient pathway to mitigate the inherent connectivity constraints imposed by short-range interactions, enabling transmon-based architectures compatible with hardware-efficient quantum tasks.

quant-ph↗

arXiv2025

Multi-agent In-context Coordination via Decentralized Memory Retrieval

Large transformer models, trained on diverse datasets, have demonstrated impressive few-shot performance on previously unseen tasks without requiring parameter updates. This capability has also been explored in Reinforcement Learning (RL), where agents interact with the environment to retrieve context and maximize cumulative rewards, showcasing strong adaptability in complex settings. However, in cooperative Multi-Agent Reinforcement Learning (MARL), where agents must coordinate toward a shared goal, decentralized policy deployment can lead to mismatches in task alignment and reward assignment, limiting the efficiency of policy adaptation. To address this challenge, we introduce Multi-agent In-context Coordination via Decentralized Memory Retrieval (MAICC), a novel approach designed to enhance coordination by fast adaptation. Our method involves training a centralized embedding model to capture fine-grained trajectory representations, followed by decentralized models that approximate the centralized one to obtain team-level task information. Based on the learned embeddings, relevant trajectories are retrieved as context, which, combined with the agents' current sub-trajectories, inform decision-making. During decentralized execution, we introduce a novel memory mechanism that effectively balances test-time online data with offline memory. Based on the constructed memory, we propose a hybrid utility score that incorporates both individual- and team-level returns, ensuring credit assignment across agents. Extensive experiments on cooperative MARL benchmarks, including Level-Based Foraging (LBF) and SMAC (v1/v2), show that MAICC enables faster adaptation to unseen tasks compared to existing methods. Code is available at https://github.com/LAMDA-RL/MAICC.

cs.MA↗

arXiv2025

Fast and Robust Remote Two-Qubit Gates on Distributed Qubits

Distributed quantum computing offers a potential solution to the complexity of superconducting chip hardware layouts and error correction algorithms. High-quality gates between distributed chips enable the simplification of existing error correction algorithms. This article proposes and demonstrates a remote quantum geometric gate scheme via parametric modulation. Our scheme inherits the intrinsic robustness of geometric phases. Meanwhile, by employing gradient-based optimization algorithms(Adaptive Moment Estimation) from deep learning, we design control waveforms that significantly suppress population leakage. We experimentally realize the rapid remote SWAP and $\sqrt{\text{SWAP}}$ gates with high fidelity, completing operation in about 30 ns. The gate error of SWAP ($\sqrt{\text{SWAP}}$) is 1.16\% (0.91\%) after excluding the effect of energy relaxation. The simulation demonstrate that this scheme can be implemented in the distributed chips connected by cables extending several meters. Our results highlight the effectiveness of the proposed protocol in enabling modular quantum processors, offering a promising path toward the realization of fault-tolerant quantum computation.

quant-ph↗