arXiv subjects

Yu Wang

Publications and source records attributed to Yu Wang.

At least 559 records · Page 31Linked to original sources

arXiv2025

A High Compression Ratio Channel Multiplexing Method for Micro-pattern Gaseous Detectors

The demand for a large number of readout channels has been a limiting factor for the application of Micro-pattern Gaseous Detectors (MPGDs) in achieving higher spatial resolution and larger detection areas. This challenge is further compounded by issues related to system integration, power consumption, and cost efficiency. To address these challenges, this study proposes two novel multiplexing methods based on Eulerian circuits. Mathematical calculations indicate that with $n$ electronics channels, up to $n \times (n-1)/2 - (n - 2)/2 + 1$ detector channels can be read out, where $n$ is even. Three types of multiplexing circuits were designed, implemented, and tested in combination with Micromegas detectors. Experimental results demonstrate that, for a multiplexing circuit with a factor of 8, the spatial resolution remains comparable to the direct readout method, while achieving a detection efficiency exceeding 94\%. For a circuit with a multiplexing factor of 16, although the spatial resolution shows a slight degradation, the detection efficiency remains above 93.6\%. These results demonstrate that the proposed multiplexing methods can significantly reduce the number of readout channels while maintaining an acceptable level of spatial resolution and detection efficiency. These findings highlight the potential of the proposed multiplexing techniques for applications in fields requiring high-resolution and cost-effective detector systems, such as cosmic-ray muon imaging.

physics.ins-det↗

arXiv2025

Multi-Robot System for Cooperative Exploration in Unknown Environments: A Survey

With the real need of field exploration in large-scale and extreme outdoor environments, cooperative exploration tasks have garnered increasing attention. This paper presents a comprehensive review of multi-robot cooperative exploration systems. First, we review the evolution of robotic exploration and introduce a modular research framework tailored for multi-robot cooperative exploration. Based on this framework, we systematically categorize and summarize key system components. As a foundational module for multi-robot exploration, the localization and mapping module is primarily introduced by focusing on global and relative pose estimation, as well as multi-robot map merging techniques. The cooperative motion module is further divided into learning-based approaches and multi-stage planning, with the latter encompassing target generation, task allocation, and motion planning strategies. Given the communication constraints of real-world environments, we also analyze the communication module, emphasizing how robots exchange information within local communication ranges and under limited transmission capabilities. In addition, we introduce the actual application of multi-robot cooperative exploration systems in DARPA SubT Challenge. Finally, we discuss the challenges and future research directions for multi-robot cooperative exploration in light of real-world trends. This review aims to serve as a valuable reference for researchers and practitioners in the field.

cs.RO↗

arXiv2025

Direct reconstruction of the quantum density matrix elements with classical shadow tomography

We introduce a direct estimation framework for reconstructing multiple density matrix elements of an unknown quantum state using classical shadow tomography. Traditional direct measurement protocols (DMPs), while effective for individual elements, suffer from poor scalability due to post-selection losses and the need for element-specific measurement configurations. In contrast, our method, DMP-ST, leverages random Clifford or biased mutually unbiased basis measurements to enable global estimation: a single dataset suffices to estimate arbitrary off-diagonal entries with high accuracy. We prove that estimating $K$ off-diagonal matrix elements up to additive error $ε$ requires only $\mathcal{O}(\log K/ε^2)$ samples, achieving exponential improvement over conventional DMPs. The number of required measurement configurations can also be exponentially reduced for large K. When extended to full state tomography, DMP-ST attains trace distance error $\le ε$ with sample complexity $\mathcal{O}(d^3 \log d/ε^2)$, which is closed to the optimal scaling for single-copy measurements. Moreover, biased MUB measurements reduce sample complexity by a constant factor than random Clifford measurements. This work provides both theoretical guarantees and explicit protocols for efficient, entrywise quantum state reconstruction. It significantly advances the practicality of direct tomography, especially for high-dimensional systems and near-term quantum platforms.

quant-ph↗

arXiv2025

EfficientLLM: Efficiency in Large Language Models

Large Language Models (LLMs) have driven significant progress, yet their growing parameter counts and context windows incur prohibitive compute, energy, and monetary costs. We introduce EfficientLLM, a novel benchmark and the first comprehensive empirical study evaluating efficiency techniques for LLMs at scale. Conducted on a production-class cluster (48xGH200, 8xH200 GPUs), our study systematically explores three key axes: (1) architecture pretraining (efficient attention variants: MQA, GQA, MLA, NSA; sparse Mixture-of-Experts (MoE)), (2) fine-tuning (parameter-efficient methods: LoRA, RSLoRA, DoRA), and (3) inference (quantization methods: int4, float16). We define six fine-grained metrics (Memory Utilization, Compute Utilization, Latency, Throughput, Energy Consumption, Compression Rate) to capture hardware saturation, latency-throughput balance, and carbon cost. Evaluating over 100 model-technique pairs (0.5B-72B parameters), we derive three core insights: (i) Efficiency involves quantifiable trade-offs: no single method is universally optimal; e.g., MoE reduces FLOPs and improves accuracy but increases VRAM by 40%, while int4 quantization cuts memory/energy by up to 3.9x at a 3-5% accuracy drop. (ii) Optima are task- and scale-dependent: MQA offers optimal memory-latency trade-offs for constrained devices, MLA achieves lowest perplexity for quality-critical tasks, and RSLoRA surpasses LoRA efficiency only beyond 14B parameters. (iii) Techniques generalize across modalities: we extend evaluations to Large Vision Models (Stable Diffusion 3.5, Wan 2.1) and Vision-Language Models (Qwen2.5-VL), confirming effective transferability. By open-sourcing datasets, evaluation pipelines, and leaderboards, EfficientLLM provides essential guidance for researchers and engineers navigating the efficiency-performance landscape of next-generation foundation models.

cs.CL↗

arXiv2025

FlightBench: Benchmarking Learning-based Methods for Ego-vision-based Quadrotors Navigation

Ego-vision-based navigation in cluttered environments is crucial for mobile systems, particularly agile quadrotors. While learning-based methods have shown promise recently, head-to-head comparisons with cutting-edge optimization-based approaches are scarce, leaving open the question of where and to what extent they truly excel. In this paper, we introduce FlightBench, the first comprehensive benchmark that implements various learning-based methods for ego-vision-based navigation and evaluates them against mainstream optimization-based baselines using a broad set of performance metrics. More importantly, we develop a suite of criteria to assess scenario difficulty and design test cases that span different levels of difficulty based on these criteria. Our results show that while learning-based methods excel in high-speed flight and faster inference, they struggle with challenging scenarios like sharp corners or view occlusion. Analytical experiments validate the correlation between our difficulty criteria and flight performance. Moreover, we verify the trend in flight performance within real-world environments through full-pipeline and hardware-in-the-loop experiments. We hope this benchmark and these criteria will drive future advancements in learning-based navigation for ego-vision quadrotors. Code and documentation are available at https://github.com/thu-uav/FlightBench.

cs.RO↗

arXiv2025

RARE: Retrieval-Augmented Reasoning Modeling

Domain-specific intelligence demands specialized knowledge and sophisticated reasoning for problem-solving, posing significant challenges for large language models (LLMs) that struggle with knowledge hallucination and inadequate reasoning capabilities under constrained parameter budgets. Inspired by Bloom's Taxonomy in educational theory, we propose Retrieval-Augmented Reasoning Modeling (RARE), a novel paradigm that decouples knowledge storage from reasoning optimization. RARE externalizes domain knowledge to retrievable sources and internalizes domain-specific reasoning patterns during training. Specifically, by injecting retrieved knowledge into training prompts with masked losses, RARE transforms learning objectives from rote memorization to contextualized reasoning. It enables models to bypass parameter-intensive memorization and prioritize the development of higher-order cognitive processes. Extensive experiments demonstrate that lightweight RARE-trained models (e.g., Llama-3.1-8B) could achieve state-of-the-art performance, surpassing retrieval-augmented GPT-4 and DeepSeek-R1 up to approximately 20\% accuracy. RARE establishes a paradigm shift where maintainable external knowledge bases synergize with compact, reasoning-optimized models, collectively driving more scalable domain-specific intelligence.

cs.CL↗

arXiv2025

MoRAL: Motion-aware Multi-Frame 4D Radar and LiDAR Fusion for Robust 3D Object Detection

Reliable autonomous driving systems require accurate detection of traffic participants. To this end, multi-modal fusion has emerged as an effective strategy. In particular, 4D radar and LiDAR fusion methods based on multi-frame radar point clouds have demonstrated the effectiveness in bridging the point density gap. However, they often neglect radar point clouds' inter-frame misalignment caused by object movement during accumulation and do not fully exploit the object dynamic information from 4D radar. In this paper, we propose MoRAL, a motion-aware multi-frame 4D radar and LiDAR fusion framework for robust 3D object detection. First, a Motion-aware Radar Encoder (MRE) is designed to compensate for inter-frame radar misalignment from moving objects. Later, a Motion Attention Gated Fusion (MAGF) module integrate radar motion features to guide LiDAR features to focus on dynamic foreground objects. Extensive evaluations on the View-of-Delft (VoD) dataset demonstrate that MoRAL outperforms existing methods, achieving the highest mAP of 73.30% in the entire area and 88.68% in the driving corridor. Notably, our method also achieves the best AP of 69.67% for pedestrians in the entire area and 96.25% for cyclists in the driving corridor.

cs.CV↗

arXiv2025

Origin of local magnetic exchange interaction in infiite-layer nickelates

Significant magnetic exchange interactions have been observed in infinite-layer nickelates RNiO2 (R = La, Pr, Nd), which exhibit unconventional superconductivity upon hole doping. Despite their structural and Fermi surface similarities to cuprates, infinite-layer nickelates possess a larger charge transfer gap, which influences their magnetic exchange interactions via oxygen. In this work, we performed 17O nuclear magnetic resonance (NMR) measurements on LaNiO2 and Sr-doped LaNiO2, revealing glassy spin dynamics originating from Ni-O planes. This indicates that infinite-layer nickelates are in proximity to magnetic ordering and that magnetic correlations play a crucial role in their physics. More importantly, our analysis of the Knight shift and hyperfine coupling of 17O nuclei revealed that the Ni-Ni superexchange interaction, mediated by the σ bond between the Ni-dx2-y2 and O-p orbitals, is one order of magnitude weaker than that in cuprates. This alone cannot account for the total magnetic exchange interaction observed in nickelates. First-principles many-body calculations indicate that an interstitial s orbital near the Fermi level, coupled with the Ni-d3z2-r2 orbital, significantly enhances the superexchange interaction. This contrasts with cuprates, where magnetic interactions are predominantly governed by Cu-dx2-y2 superexchange via oxygen. Our findings provide new insights into the distinct magnetic interactions in infinite-layer nickelates and their potential role in unconventional superconductivity.

cond-mat.supr-con↗

arXiv2025

Lightweight Deep Learning Framework for Accurate Particle Flow Energy Reconstruction

Under extreme operating conditions, characterized by high particle multiplicity and heavily overlapping shower energy deposits, classical particle flow algorithms encounter pronounced limitations in resolution, efficiency, and accuracy. To address this challenge, this paper proposes and systematically evaluates a deep learning reconstruction framework: For multichannel sparse features, we design a hybrid loss function combining weighted mean squared error with structural similarity index, effectively balancing pixel-level accuracy and structural fidelity. By integrating 3D convolutions, Squeeze-and-Excitation channel attention, and Offset self-attention modules into baseline convolutional neural networks, we enhance the model's capability to capture cross-modal spatiotemporal correlations and energy-displacement nonlinearities. Validated on custom-constructed simulation data and Pythia jet datasets, the framework's 90K-parameter lightweight variant approaches the performance of 5M-parameter baselines, while the 25M-parameter 3D model achieves state-of-the-art results in both interpolation and extrapolation tasks. Comprehensive experiments quantitatively evaluate component contributions and provide performance-parameter trade-off guidelines. All core code and data processing scripts are open-sourced on a GitHub repository to facilitate community reproducibility and extension.

physics.ins-det↗

arXiv2025

The Sound of Populism: Distinct Linguistic Features Across Populist Variants

This study explores the sound of populism by integrating the classic Linguistic Inquiry and Word Count (LIWC) features, which capture the emotional and stylistic tones of language, with a fine-tuned RoBERTa model, a state-of-the-art context-aware language model trained to detect nuanced expressions of populism. This approach allows us to uncover the auditory dimensions of political rhetoric in U.S. presidential inaugural and State of the Union addresses. We examine how four key populist dimensions (i.e., left-wing, right-wing, anti-elitism, and people-centrism) manifest in the linguistic markers of speech, drawing attention to both commonalities and distinct tonal shifts across these variants. Our findings reveal that populist rhetoric consistently features a direct, assertive ``sound" that forges a connection with ``the people'' and constructs a charismatic leadership persona. However, this sound is not simply informal but strategically calibrated. Notably, right-wing populism and people-centrism exhibit a more emotionally charged discourse, resonating with themes of identity, grievance, and crisis, in contrast to the relatively restrained emotional tones of left-wing and anti-elitist expressions.

cs.CL↗

arXiv2025

Generative-Contrastive Heterogeneous Graph Neural Network

Heterogeneous Graphs (HGs) effectively model complex relationships in the real world through multi-type nodes and edges. In recent years, inspired by self-supervised learning (SSL), contrastive learning (CL)-based Heterogeneous Graphs Neural Networks (HGNNs) have shown great potential in utilizing data augmentation and contrastive discriminators for downstream tasks. However, data augmentation remains limited due to the graph data's integrity. Furthermore, the contrastive discriminators suffer from sampling bias and lack local heterogeneous information. To tackle the above limitations, we propose a novel Generative-Contrastive Heterogeneous Graph Neural Network (GC-HGNN). Specifically, we propose a heterogeneous graph generative learning method that enhances CL-based paradigm. This paradigm includes: 1) A contrastive view augmentation strategy using a masked autoencoder. 2) Position-aware and semantics-aware positive sample sampling strategy for generating hard negative samples. 3) A hierarchical contrastive learning strategy aimed at capturing local and global information. Furthermore, the hierarchical contrastive learning and sampling strategies aim to constitute an enhanced contrastive discriminator under the generative-contrastive perspective. Finally, we compare our model with seventeen baselines on eight real-world datasets. Our model outperforms the latest baselines on node classification and link prediction tasks.

cs.LG↗

arXiv2025

SimAug: Enhancing Recommendation with Pretrained Language Models for Dense and Balanced Data Augmentation

Deep Neural Networks (DNNs) are extensively used in collaborative filtering due to their impressive effectiveness. These systems depend on interaction data to learn user and item embeddings that are crucial for recommendations. However, the data often suffers from sparsity and imbalance issues: limited observations of user-item interactions can result in sub-optimal performance, and a predominance of interactions with popular items may introduce recommendation bias. To address these challenges, we employ Pretrained Language Models (PLMs) to enhance the interaction data with textual information, leading to a denser and more balanced dataset. Specifically, we propose a simple yet effective data augmentation method (SimAug) based on the textual similarity from PLMs, which can be seamlessly integrated to any systems as a lightweight, plug-and-play component in the pre-processing stage. Our experiments across nine datasets consistently demonstrate improvements in both utility and fairness when training with the augmented data generated by SimAug. The code is available at https://github.com/YuyingZhao/SimAug.

cs.IR↗

arXiv2025

Amplifying Your Social Media Presence: Personalized Influential Content Generation with LLMs

The remarkable advancements in Large Language Models (LLMs) have revolutionized the content generation process in social media, offering significant convenience in writing tasks. However, existing applications, such as sentence completion and fluency enhancement, do not fully address the complex challenges in real-world social media contexts. A prevalent goal among social media users is to increase the visibility and influence of their posts. This paper, therefore, delves into the compelling question: Can LLMs generate personalized influential content to amplify a user's presence on social media? We begin by examining prevalent techniques in content generation to assess their impact on post influence. Acknowledging the critical impact of underlying network structures in social media, which are instrumental in initiating content cascades and highly related to the influence/popularity of a post, we then inject network information into prompt for content generation to boost the post's influence. We design multiple content-centric and structure-aware prompts. The empirical experiments across LLMs validate their ability in improving the influence and draw insights on which strategies are more effective. Our code is available at https://github.com/YuyingZhao/LLM-influence-amplifier.

cs.SI↗

arXiv2025

Existence and non-existence of the CLT for a family of SDEs driven by stable process

Stochastic differential equations (SDEs) without global Lipschitz drift often demonstrate unusual phenomena. In this paper, we consider the following SDE on $\mathbb R^d$: \begin{align*} \mathrm{d} \mathbf{X}_t=\mathbf{b}(\mathbf{X}_t) \mathrm{d} t+ \mathrm{d}\mathbf{Z}_t, \quad \mathbf{X}_0=\mathbf{x} \in \mathbb{R}^d, \end{align*} where $\mathbf{Z}_t$ is the rotationally symmetric $α$-stable process with $α\in(1,2)$ and $\mathbf{b}:\mathbb{R}^d \rightarrow \mathbb{R}^d$ is a differentiable function satisfying the following condition: there exist some $θ\ge 0$, and $K_1 , K_2 , L>0$, so that $$\langle \mathbf{b}(\mathbf{x})-\mathbf{b}(\mathbf{y}), \mathbf{x}-\mathbf{y}\rangle \leqslant K_1 |\mathbf{x}-\mathbf{y}|^2, \ \ \forall \ \ |\mathbf{x}-\mathbf{y}| \leqslant L, $$ $$\langle \mathbf{b}(\mathbf{x})-\mathbf{b}(\mathbf{y}), \mathbf{x}-\mathbf{y}\rangle \leqslant -K_2 |\mathbf{x}-\mathbf{y}|^{2+θ}, \ \ \forall \ \ |\mathbf{x}-\mathbf{y}| > L.$$ Under this assumption, the SDE admits a unique invariant measure $μ$. We investigate the normal central limit theorem (CLT) of the empirical measures $$ \mathcal{E}_t^\mathbf{x}(\cdot)=\frac{1}{t} \int_0^t δ_{\mathbf{X}_s }(\cdot) \mathrm{d} s, \ \ \ \ \mathbf{X}_0=\mathbf{x} \in \mathbb{R}^d, \ \ t>0, $$ where $δ_{\mathbf{x}}(\cdot)$ is the Dirac delta measure. Our results reveal that, for the bounded measurable function $h$, $$\sqrt t \left(\mathcal{E}_t^\mathbf{x}(h)-μ(h)\right)=\frac{1}{\sqrt t} \int_0^t \left(h\left(\mathbf{X}_s^\mathbf{x}\right)-μ(h)\right) \mathrm{d} s$$ admits a normal CLT for $θ\geqslant 0$. For the Lipschitz continuous function $h$, the normal CLT does not necessarily hold when $θ=0$, but it is satisfied for $θ>1-\fracα{2}$.

math.PR↗

arXiv2025

semi-PD: Towards Efficient LLM Serving via Phase-Wise Disaggregated Computation and Unified Storage

Existing large language model (LLM) serving systems fall into two categories: 1) a unified system where prefill phase and decode phase are co-located on the same GPU, sharing the unified computational resource and storage, and 2) a disaggregated system where the two phases are disaggregated to different GPUs. The design of the disaggregated system addresses the latency interference and sophisticated scheduling issues in the unified system but leads to storage challenges including 1) replicated weights for both phases that prevent flexible deployment, 2) KV cache transfer overhead between the two phases, 3) storage imbalance that causes substantial wasted space of the GPU capacity, and 4) suboptimal resource adjustment arising from the difficulties in migrating KV cache. Such storage inefficiency delivers poor serving performance under high request rates. In this paper, we identify that the advantage of the disaggregated system lies in the disaggregated computation, i.e., partitioning the computational resource to enable the asynchronous computation of two phases. Thus, we propose a novel LLM serving system, semi-PD, characterized by disaggregated computation and unified storage. In semi-PD, we introduce a computation resource controller to achieve disaggregated computation at the streaming multi-processor (SM) level, and a unified memory manager to manage the asynchronous memory access from both phases. semi-PD has a low-overhead resource adjustment mechanism between the two phases, and a service-level objective (SLO) aware dynamic partitioning algorithm to optimize the SLO attainment. Compared to state-of-the-art systems, semi-PD maintains lower latency at higher request rates, reducing the average end-to-end latency per request by 1.27-2.58x on DeepSeek series models, and serves 1.55-1.72x more requests adhering to latency constraints on Llama series models.

cs.CL↗

arXiv2025

An Inverse Source Problem for Semilinear Stochastic Hyperbolic Equations

This paper investigates an inverse source problem for general semilinear stochastic hyperbolic equations. Motivated by the challenges arising from both randomness and nonlinearity, we develop a globally convergent iterative regularization method that combines Carleman estimate with fixed-point iteration. Our approach enables the reconstruction of the unknown source function from partial lateral Cauchy data, without requiring a good initial guess. We establish a new Carleman estimate for stochastic hyperbolic equations and prove the convergence of the proposed method in weighted spaces. Furthermore, we design an efficient numerical algorithm that avoids solving backward stochastic partial differential equations and is robust to randomness in both the model and the data. Numerical experiments are provided to demonstrate the effectiveness of the method.

math.AP↗

arXiv2025

Towards Distribution Matching between Collaborative and Language Spaces for Generative Recommendation

Generative recommendation aims to learn the underlying generative process over the entire item set to produce recommendations for users. Although it leverages non-linear probabilistic models to surpass the limited modeling capacity of linear factor models, it is often constrained by a trade-off between representation ability and tractability. With the rise of a new generation of generative methods based on pre-trained language models (LMs), incorporating LMs into general recommendation with implicit feedback has gained considerable attention. However, adapting them to generative recommendation remains challenging. The core reason lies in the mismatch between the input-output formats and semantics of generative models and LMs, making it challenging to achieve optimal alignment in the feature space. This work addresses this issue by proposing a model-agnostic generative recommendation framework called DMRec, which introduces a probabilistic meta-network to bridge the outputs of LMs with user interactions, thereby enabling an equivalent probabilistic modeling process. Subsequently, we design three cross-space distribution matching processes aimed at maximizing shared information while preserving the unique semantics of each space and filtering out irrelevant information. We apply DMRec to three different types of generative recommendation methods and conduct extensive experiments on three public datasets. The experimental results demonstrate that DMRec can effectively enhance the recommendation performance of these generative models, and it shows significant advantages over mainstream LM-enhanced recommendation methods.

cs.IR↗

arXiv2025

VocalNet: Speech LLM with Multi-Token Prediction for Faster and High-Quality Generation

Speech large language models (LLMs) have emerged as a prominent research focus in speech processing. We introduce VocalNet-1B and VocalNet-8B, a series of high-performance, low-latency speech LLMs enabled by a scalable and model-agnostic training framework designed for real-time voice interaction. Central to our contribution is the first application of multi-token prediction (MTP) to speech LLMs. This approach represents a paradigm shift from standard next-token prediction (NTP), offering simultaneous improvements in generation speed and quality. Informed by analysis of MTP's effect on speech generation and experimental comparisons, we designed a straightforward and highly effective MTP implementation. Experiments demonstrate that VocalNet performs on par with mainstream Omni LLMs even with limited training data, and significantly surpasses existing open-source speech LLMs. To foster reproducibility and community advancement, all model weights, inference code, training data, and framework implementations have been made publicly available at https://github.com/SJTU-OmniAgent/VocalNet

cs.CL↗