arXiv subjects

Rui Wang

Publications and source records attributed to Rui Wang.

At least 73 records · Page 4Linked to original sources

arXiv2026

Unusually high phonon thermal conductivity in the Weyl semimetal TaP: A comparative study with TaAs

In many metals, thermal transport is often dominated by electrons, although the lattice contribution can remain appreciable depending on the material. Here, through rigorous first-principles calculations, we uncover a phonon-dominated thermal transport regime in the Weyl semimetals TaAs and TaP. Remarkably, despite its metallic character, TaP exhibits an exceptionally high phonon thermal conductivity ($κ_{\rm ph}$) of 162 Wm$^{-1}$K$^{-1}$ at room temperature, surpassing its electronic counterpart by nearly an order of magnitude. This anomalously high $κ_{\rm ph}$ arises from the combined effects of Weyl electronic structure, acoustic phonon bunching, and a large low-high frequency phonon gap, which together suppress phonon-electron and three-phonon scattering. The linearly dispersing bands near the Fermi level yield a low electronic density of states, limiting both electrical conductivity and electronic thermal transport in these compounds. By further surveying a broad range of topological semimetals, we show that the prominence of phonon thermal transport is a universal characteristic of this material class. Our work provides deeper insight into thermal transport mechanisms in topological semimetals and broadens the scope for discovering metals with high thermal conductivity.

cond-mat.mtrl-sci↗

arXiv2026

Shedding Light on (Anti-)nuclei Production with Pion-Nucleus Femtoscopy

High-energy nuclear collisions provide a unique environment for synthesizing both nuclei and antinuclei (such as $\bar{d}$ and $^4\overline{\text{He}}$) at temperatures ($k_BT\sim100$ MeV) much higher than their binding energies per nucleon of a few MeV. The underlying production mechanism, whether through statistical hadronization, nucleon coalescence, or dynamical regeneration and disintegration, remains unsettled. Here we address this question using pion-nucleus femtoscopy. By solving relativistic kinetic equations for pion-catalyzed reactions ($πNN \leftrightarrow πd$) for deuteron production and including final-state $p-$wave scatterings derived from an established effective interaction, we successfully reproduce the resonance peaks of both $π^+-p$ and $π^+-d$ femtoscopic correlations observed in $pp$ collisions at $\sqrt{s} = 13~\mathrm{TeV}$. The interplay between $Δ$ resonance and $p$-wave scatterings shifts both correlation peaks downward by about $70\text{ MeV}$ relative to vacuum $Δ$ decay. Conversely, both the nucleon coalescence model and the statistical hadronization model significantly underestimate the data and produce additional dips that are absent from the data. These results provide compelling evidence that pion-catalyzed reactions play a dominant role in the production of light (anti-)nuclei in high-energy nuclear collisions and cosmic rays.

nucl-th↗

arXiv2026

The First ChineseBabyLM Challenge: training data-efficient and cognitively plausible language models for Chinese

This paper presents the first ChineseBabyLM Challenge, organized as part of NLPCC 2026. The challenge asked participants to train language models from scratch using no more than 102M Chinese words. The models were evaluated on three tracks: natural language understanding, cognitive alignment, and Hanzi knowledge. There were no restrictions on tokenizers, model architectures, or the number of training epochs. Eighteen teams submitted 28 distinct models, generating 74 result files. The overall-winning team used a DeBERTa-v2 architecture and introduced an auxiliary pinyin-prediction objective during pretraining. Several submissions also explored curriculum-learning strategies and architectural innovations. Overall, the challenge provides a benchmark for advancing data-efficient and cognitively plausible approaches to Chinese language modeling.

cs.CL↗

arXiv2026

DiffImaginE: Imagine to Verify Entity Types with Diffusion

Multimodal named entity recognition (MNER) determines whether each candidate span and entity-type hypothesis is supported by joint textual and visual evidence. Existing imagine-and-compare verifiers map each (span, type) pair to one predicted visual feature, compressing diverse visual realisations into a single prototype and providing a compatibility score without explicit probabilistic semantics. We introduce DiffImaginE, which formulates MNER type verification as conditional latent diffusion inference. Given span-localised visual evidence, a type-conditioned denoiser predicts noise injected into its standardised latent. The resulting denoising error provides an ELBO-consistent surrogate for type-conditional negative log-likelihood, allowing competing type hypotheses to be ranked by how well they explain the observation. DiffImaginE retains a standard multimodal encoder stack and replaces the deterministic verifier with a classifier-free-guided diffusion scorer trained using Min-SNR weighting. We directly supervise per-type diffusion scores as classification logits, learn aggregation across noise levels, and use antithetic sampling to reduce Monte Carlo comparison variance. Our analysis shows that classifier-free guidance sharpens the induced type posterior and characterises when antithetic pairing reduces variance at equal denoiser cost. Experiments on Twitter-2015 and Twitter-2017 show consistent gains over a matched deterministic ImaginE control under the same encoder, auxiliary objectives, and evaluation protocol, supported by ablations and paired significance tests.

cs.AI↗

arXiv2026

DB-SpMSpV: Dual-View Blocked Sparse Matrix-Sparse Vector Multiplication for Dynamic GPU Workloads

Sparse Matrix-Sparse Vector Multiplication (SpMSpV) is a core primitive in graph traversal, sparse linear algebra, and sparse model inference. Its input vector is often dynamically sparse, so the best GPU execution path depends on both global sparsity and the local vector-block distribution. Existing GPU SpMSpV methods often bind storage layouts, push/pull traversal, and kernels together, making fine-grained adaptation difficult without extra storage or scheduling overhead. This paper presents DB-SpMSpV, a dual-view blocked SpMSpV framework for dynamic GPU workloads. DB-SpMSpV partitions the matrix into fixed-size 2D blocks, maintains block-level CSR/CSC views at the high level, and reuses a single low-level block payload to support both row-driven pull and column-driven push. At runtime, it selects the global traversal path based on input block sparsity, chooses block microkernels from the local matrix/vector block structure, and uses load balancing, asynchronous prefetching, and hierarchical writeback to reduce irregular memory accesses, writeback conflicts, and load imbalance. We further integrate the framework into DB-BFS and DB-Decoding. We evaluate DB-SpMSpV on NVIDIA A100 and RTX 4090 using SuiteSparse matrices, symmetric graphs, and three open-source LLMs. Across input sparsities, DB-SpMSpV achieves average speedups of 5.48$\times$--64.34$\times$ over cuSPARSE and 2.36$\times$--14.01$\times$ over TileSpMSpV on A100, with similar gains on RTX 4090. DB-BFS further improves end-to-end graph traversal by 2.66$\times$ over TileBFS on A100 and 3.60$\times$ on RTX 4090 on average, while DB-Decoding accelerates single-token linear layers by up to 4.50$\times$.

cs.DC↗

arXiv2026

ES3D: Embedding Semantics into 3D Space for Component-Aware Editing

Existing 3D editing methods have made notable progress in controllability, yet they remain limited in several important ways. Most approaches rely on text-driven editing, which struggles to express fine-grained visual changes intended by the user. Moreover, many methods require manually supplied 3D masks or introduce unintended changes to regions that should remain untouched. These limitations largely arise from the absence of fine-grained semantic understanding, making it difficult for existing models to retrieve or modify specific 3D components. We introduce ES3D, a framework that embeds semantics directly into 3D space, enabling component-aware retrieval and editing of a 3D asset conditioned on multiple local reference images and optional text queries. We first construct a 3D semantic embedding by projecting multi-view semantic features into the voxelized space of the asset. We then perform 3D component retrieval by computing feature similarity between the 3D semantic embedding and the semantic embeddings of image or text queries. For editing, we employ a pretrained 3D generative model with an inpainting mechanism to modify the retrieved components guided by user-provided images while preserving the rest of the asset. Overall, ES3D is a 3D editing framework that retrieves editable regions based on semantic cues and uses multiple images as conditions. Extensive experiments demonstrate that ES3D produces geometrically consistent and semantically coherent edits, enabling robust image-based and text-assisted control for 3D editing.

cs.CV↗

arXiv2026

Intern-S2-Mobius: Foundation Model with Decoupled Knowledge and Reasoning

We introduce Mobius-v0, an architecture that comprises a globally shared Memory (FFN) that stores knowledge vectors and multiple Reasoners (Self-Attn) that iteratively achieve compositional reasoning. Using hidden states as cache and carrier, reasoners repeatedly query memory for required knowledge-vectors, while the knowledge is transmitted back to reasoning operators. Through this knowledge-reasoning-separation architecture, Mobius achieves better knowledge compression and reasoning efficiency. Built upon Mobius-v0 architecture: 1) Our 7B model trained-from-scratch achieves similar downstream score as a 7B Transformer baseline with 62.6% of baseline's training data. 2) Our Intern-S2-Mobius, continually-pretrained from Qwen3.5-35B, achieves similar downstream score while delivering nearly 4x end-to-end inference speedup.

cs.AI↗

arXiv2026

Intern-S2-Preview: Scientific Agentic Foundation Model

Scientific discovery increasingly requires AI systems that can reason over scientific evidence of heterogeneous modalities, interact with scientific tools and environments, and sustain progress across long task horizons. We present Intern-S2-Preview, a series of scientific agentic foundation models designed to support multimodal scientific understanding, reasoning, generation, and long-horizon tasks. The training pipeline begins with scientific multimodal pre-training over rendered scientific documents, interleaved image-text data, and diverse scientific corpora. Starting from the pretrained checkpoint, we apply a unified post-training pipeline consisting of supervised fine-tuning, scalable multi-task reinforcement learning (RL), black- and white-box agentic RL, and on-policy distillation. This pipeline is supported by practical techniques that improve rollout and training stability and efficiency, including partial rollout with off-policy correction, adaptive length regularization, online speculative decoding, robust multi-task optimization, and trace-aware experience assembly for agentic tasks. At the architecture level, Intern-S2-Preview-397B extends time series modelling from efficient long-sequence understanding to numerical forecasting, while Memory Decoder is studied as a separate memory-augmented path for rapid scientific specialization without modifying the frozen 397B backbone. Evaluations across scientific, multimodal, agentic, and general-purpose benchmarks show that Intern-S2-Preview-397B achieves competitive or leading results in multiple settings. The time series modules improve scientific signal understanding and forecasting on SciTS, while the separate Intern-MemDec-4B extension improves the Biology-Instructions average score from 56.92 to 60.32 without modifying the frozen 397B backbone.

cs.LG↗

arXiv2026

WBMM: Windowed Batch Matrix Multiplication for Efficient Large Receptive Field Convolution

Large kernel depthwise convolutions achieve strong performance but suffer from significant degradation as kernel size grows due to irregular memory access from gather-based computation; while Large Kernel Acceleration (LKA) helps on small feature maps, it becomes counterproductive on large feature maps, even slower than non-accelerated implementations. We propose Windowed Batch Matrix Multiplication (WBMM), which partitions input into contiguous windows and indexes a compact relative position bias table to construct weight matrices, enabling regular memory access via batched matrix multiplication. This yields a unique property: WBMM's throughput improves with larger windows, opposite to depthwise convolutions that degrade with larger kernels. Operator-level benchmarks show WBMM with 14x14 windows outperforms 5x5 depthwise convolution baselines in speed while providing a 7.8x larger per-layer receptive field. Combined with inter-block cross-window communication and hierarchical window reparameterization, WBMM achieves comparable or higher accuracy on ImageNet-1K, COCO, and ADE20K with 1.31-1.88x training speedup, and demonstrates consistent advantages across GPU, CPU, and edge devices without requiring specialized acceleration kernels. Our code is available at https://github.com/wansong-s/WBMM.

cs.CV↗

arXiv2026

Mitigating Context Interference for Reliable and Efficient Search Agents

Recent research empowers Large Language Models (LLMs) as multi-turn search agents to iteratively retrieve and generate outputs until complex tasks are solved. However, the contexts of multi-turn search agents are lengthy and complex. For example, the retrieved set of documents in each turn would inevitably introduce irrelevant information that distracts LLMs, referring to \textit{context interference}, potentially hindering the reliability and efficiency of search agents. Therefore, we conduct a systematic study on context interference in multi-turn search agents, focusing on investigating i) which parts of the context of search agents will contribute to the context interference, ii) how to refine the contexts of search agents to mitigate the interference, and iii) can incorporating context refinement into search agent training yield further improvements. We reveal that interference primarily arises from the latest retrieved documents. Based on the explored findings, we then introduce a distill-based context refiner to dynamically mitigate context interference for multi-turn search agents. Finally, we validate that incorporating context refinement into RL training pipelines of search agents can significantly enhance both reliability and efficiency. This study highlights the importance of mitigating context interference of search agents, inspiring a novel paradigm of ``refine context and then generate'' for AI agents.

cs.CL↗

arXiv2026

Co-Evolution in Agentic Systems: Toward Self-Directed Evolution Beyond Human Design

Agentic systems are increasingly expected to improve after deployment, yet single-entity self-evolution is often bounded by a static learning context, such as fixed tasks and feedback. This survey focuses on co-evolution in agentic systems, a multi-component form of self-evolution in which multiple agents and their environment impose adaptive pressure on one another. To organize existing papers, we propose a progressive three-stage taxonomy that traces how the system gradually sheds human-engineered constraints. Agent--Agent Co-Evolution studies how agents adapt through dynamic peers, including adversarial, collaborative, and organizational adaptation. Agent--Environment Co-Evolution extends this loop to adaptive tasks, feedback, and interaction spaces that change with the agents. Meta Co-Evolution further explores the possibility of making the evolution mechanism itself evolvable. We also discuss open challenges in evaluating such systems, scaling them across multiple components, and keeping increasingly autonomous evolutionary processes safe and controllable. This survey provides a unified foundation for building robust and open-ended agentic systems that can improve beyond fixed human-designed paths.

cs.CL↗

arXiv2026

Hybrid Policy Distillation for LLMs

Knowledge distillation (KD) is a powerful paradigm for compressing large language models (LLMs), whose effectiveness depends on intertwined choices of divergence direction, optimization strategy, and data regime. We break down the design of existing KD methods and present a unified view that establishes connections between them, reformulating KD as a reweighted log-likelihood objective at the token level. We further propose Hybrid Policy Distillation (HPD), which integrates the complementary advantages of forward and reverse KL to balance mode coverage and mode-seeking, and combines off-policy data with lightweight, approximate on-policy sampling. We validate HPD on long-generation math reasoning as well as short-generation dialogue and code tasks, demonstrating improved optimization stability, computational efficiency, and final performance across diverse model families and scales. The code related to this work is available at https://github.com/zwhong714/Hybrid-Policy-Distillation.

cs.CL↗

arXiv2026

VTO: Visual Tool Orchestration for Video Anomaly Detection

Video anomaly detection (VAD) is a critical yet challenging task due to the complex and diverse nature of real-world scenarios. Traditional deep learning approaches are fundamentally limited by poor generalization across diverse scenarios. While multimodal agents offer a promising tool-learning paradigm for VAD, current systems relying on supervised fine-tuning struggle with complex orchestration, and standard reinforcement learning often causes premature termination due to coarse-grained outcome rewards. To address these challenges, we propose VTO, a process-supervised reinforcement learning framework. Moving beyond static tool usage, VTO enables the agent to dynamically explore and interact with the environment. Specifically, we introduce a foundation model-driven cognitive evaluator to provide context-aware semantic feedback, which is seamlessly integrated into a Process-Supervised Cognitive Alignment that delivers fine-grained, step-wise supervision. By explicitly penalizing logical truncation and rewarding complete causal chains, the agent optimizes its multi-step reasoning policy for interrelated tool orchestration. To support our proposed framework, we meticulously crafted VAD-Tool, a hierarchical visual tool set comprising 12 specialized vision tools spanning from entity tracking to high-stakes hazard detection, and established the corresponding benchmark for rigorous multi-step reasoning evaluation. Extensive experiments on VAD-Tool demonstrate that VTO significantly outperforms baselines, achieving up to a 10.2\% absolute accuracy improvement in tool scheduling. Code and data are available at https://github.com/MICLAB-BUPT/VTO.

cs.CV↗

arXiv2026

Efficient Discrete Position Design for Movable Antenna Systems: Low Complexity and Robustness

Building on advances in reconfigurable antenna techniques, movable antennas (MAs) can dynamically reshape antenna arrays and introduce additional spatial degrees of freedom (DoFs), thereby further improving communication performance. Despite these benefits, existing MA design algorithms often entail prohibitively high computational complexity from discrete positioning selection, which prevents practical implementations of MAs. In this paper, we investigate efficient solutions for the mutual information (MI) maximization problem of a multi-user multiple-input multiple-output (MU-MIMO) uplink communication system aided by discrete MAs. To this end, we first formulate the discrete MA positioning problem with the assumption of perfect channel state information (CSI). Then, we prove that the design problem falls into the category of monotone submodular maximization subject to a 2-system constraint. Accordingly, we propose a low-complexity distance-constrained submodular position search algorithm, which is theoretically shown to achieve at least 1/3 of the optimum. Furthermore, we extend our approach to scenarios with imperfect CSI, and show that the proposed submodular optimization-based design remains robust against channel estimation errors. Numerical results demonstrate that the proposed scheme can achieve at least 90% of the optimal solution's MI gain under both perfect and imperfect CSI assumptions. Remarkably, the algorithm achieves orders-of-magnitude complexity reduction (e.g., 34.4x faster than the branch-and-bound approach) while maintaining significant MI gains.

cs.IT↗

arXiv2026

Dual-Attention and Adversarial Transfer Networks for Sim-to-Real Cross-Orientation Wireless Sensing

Millimeter-wave human activity recognition suffers significant performance degradation when the user's orientation changes relative to the sensing system, yet collecting labeled multi-orientation data is labor-intensive and costly. To eliminate the need for exhaustive multi-orientation measured data, we develop a physics-guided simulator that synthesizes orientation-diverse wireless training data from single-orientation motion. Specifically, to suppress orientation-induced feature variations, we propose a dual-attention network that extracts activity-discriminative and orientation-robust representations from dual-link Doppler spectrograms. To bridge the simulation-to-reality gap, we introduce an adversarial unsupervised transfer learning mechanism that aligns feature distributions using only a small number of unlabeled target-domain samples. The S2M-Sense platform shows high fidelity in reproducing real-world signatures, validated against 60.48 GHz mmWave measured data with an average structural similarity index measure (SSIM) of 0.84 between simulated and measured Doppler spectrograms across all 4 activities and 4 orientations. Experimental results show that S2M-Sense achieves 88.33% recognition accuracy using only the dual-link multi-orientation simulated dataset, which improves to 95% after simulation-to-reality transfer learning with as few as 16 unlabeled measured samples. Both cases with and without transfer learning outperform state-of-the-art cross-domain sensing methods.

cs.CV↗

arXiv2026

Enhancing Social Intelligence in LLMs with Hierarchical Reasoning and Utterance-Level Goal Rewarding

Large language models (LLMs) excel in structured tasks but struggle with dynamic social interactions, where success requires long-term goal coordination and rapid adaptation. Current methods often apply uniform goal-based rewards to every utterance, overlooking the specificity of objectives at each dialogue turn and failing to account for the rationale of potential strategies. Inspired by the Theory of Planned Behavior, we propose the Think-Strategy-Response (TSR) framework, which decomposes social dialogue into two hierarchical stages: high-level strategic planning and low-level linguistic execution. To optimize TSR, we introduce Linearized Hierarchical Reinforcement Learning with Variance-Gated Rewards (LHRL-VGR), a novel algorithm that dynamically routes rewards - balancing goal completion and strategy adherence - based on the variance of goal achievement scores. Experiments on the SOTOPIA benchmark show that our approach fine-tunes a Qwen2.5-7B agent to surpass the GPT-4o baseline by 7.32% in goal completion success, demonstrating state-of-the-art performance in multi-agent social negotiation tasks.

cs.CL↗

arXiv2026

Stabilizing Multi-Attack Adversarial Training via Bandit Optimization

Deep Neural Networks (DNNs) remain vulnerable to diverse adversarial perturbations, motivating multi-attack adversarial training (AT) for improved robustness. However, existing methods either incur prohibitive overhead by computing all attacks at each iteration, or rely on stochastic sampling over adversarial examples, which may cause excessive parameter drift. To address these issues, we propose Calibrated Adversarial Sampling (CAS), an efficient and stable framework that reformulates multi-attack AT as a multi-armed bandit optimization problem. By sampling a single attack per iteration that dynamically balances exploration and exploitation, CAS significantly reduces training cost while mitigating optimization conflicts across attacks and controlling excessive parameter drifts. Extensive experiments demonstrate that CAS achieves superior overall robustness at low computational cost, offering a scalable and principled approach to robust generalization against multi-attack settings. Our code is available at https://github.com/1240148048/CAS.

cs.LG↗

arXiv2026

Effects of light-cluster degrees of freedom on collective flows in heavy-ion collisions at FOPI energies

Within a lattice Boltzmann-Uehling-Uhlenbeck transport model coupled to a kinetic approach for light-cluster formation, we investigate the impact of explicit light-cluster degrees of freedom on collective flows in Au+Au collisions at FOPI energies with beam energies $E_{\rm beam}$= $120$--$1500 A$ MeV by using a density-, momentum-, and isospin-dependent N$5$LO Skyrme pseudopotential. We first benchmark the kinetic approach by comparing the calculated light-cluster yields with FOPI data in central Au+Au collisions. We then analyze the collective flows of protons and light nuclei (deuterons, tritons, $^{3}\mathrm{He}$, and $^{4}\mathrm{He}$) in mid-central collisions. For protons, calculations with and without dynamical light-cluster degrees of freedom are compared to quantify the influence of dynamical cluster formation on proton directed ($v_1$), elliptic ($v_2$), triangular ($v_3$), and quadrangular ($v_4$) flows. We find that the dynamical light-cluster effect appreciably modifies proton $v_1$--$v_4$ flows at $E_{\rm beam}=120$--$150 A$ MeV, remains visible at $E_{\rm beam}=250$--$400 A$ MeV, and gradually weakens at $E_{\rm beam}\gtrsim 600 A$ MeV. For light nuclei, the kinetic approach captures the overall beam-energy dependence of the FOPI flow data, with better agreement for $E_{\rm beam}\geq 400 A$ MeV. We further examine the nucleon-number scaling of $v_2/A$ in both model calculations and experimental data, finding that the kinetic light-cluster formation approach qualitatively reproduces the observed scaling behavior. These results highlight the importance of a dynamical treatment of light-cluster formation for interpreting collective flows in heavy-ion collisions below about $600 A$ MeV, although the clustering effects on proton flows are minor at higher collision energies.

nucl-th↗