arXiv subjects

Liang Wang

Publications and source records attributed to Liang Wang.

At least 199 records · Page 11Linked to original sources

arXiv2025

Observation of a Knotted Electron Diffusion Region in Earth's Magnetotail Reconnection

Magnetic reconnection is a fundamental plasma process that alters the magnetic field topology and releases magnetic energy. Most numerical simulations and spacecraft observations assume a two-dimensional diffusion region, with the electron diffusion region (EDR) embedded in the same plane as the ion diffusion region (IDR) and a uniform guide field throughout. Using observations from Magnetospheric Multiscale (MMS) mission, we report a non-coplanar, knotted EDR in Earth's magnetotail current sheet. The reconnection plane of the knotted EDR deviates by approximately 38° from that of the IDR, with the guide field exhibiting both a 38° directional shift and a twofold increase in amplitude. Moreover, the Hall magnetic field is bipolar in the EDR but quadrupolar in the IDR, indicating different Hall current structures at electron and ion scales. These observations highlight the importance of three-dimensional effects and illustrate the complexity of multiscale coupling between the EDR and IDR during reconnection studies.1

physics.space-ph↗

arXiv2025

EC-Flow: Enabling Versatile Robotic Manipulation from Action-Unlabeled Videos via Embodiment-Centric Flow

Current language-guided robotic manipulation systems often require low-level action-labeled datasets for imitation learning. While object-centric flow prediction methods mitigate this issue, they remain limited to scenarios involving rigid objects with clear displacement and minimal occlusion. In this work, we present Embodiment-Centric Flow (EC-Flow), a framework that directly learns manipulation from action-unlabeled videos by predicting embodiment-centric flow. Our key insight is that incorporating the embodiment's inherent kinematics significantly enhances generalization to versatile manipulation scenarios, including deformable object handling, occlusions, and non-object-displacement tasks. To connect the EC-Flow with language instructions and object interactions, we further introduce a goal-alignment module by jointly optimizing movement consistency and goal-image prediction. Moreover, translating EC-Flow to executable robot actions only requires a standard robot URDF (Unified Robot Description Format) file to specify kinematic constraints across joints, which makes it easy to use in practice. We validate EC-Flow on both simulation (Meta-World) and real-world tasks, demonstrating its state-of-the-art performance in occluded object handling (62% improvement), deformable object manipulation (45% improvement), and non-object-displacement tasks (80% improvement) than prior state-of-the-art object-centric flow methods. For more information, see our project website at https://ec-flow1.github.io .

cs.RO↗

arXiv2025

Simulation studies of a high-repetition-rate electron-driven surface muon beamline at SHINE

A high-repetition-rate pulsed muon source operating at approximately 50\,kHz holds the potential to improve the sensitivity of various particle physics and material science experiments involving muons. In this article, we propose utilizing the high-repetition-rate pulsed electron beam at the SHINE facility to generate a surface muon beam. Our simulation studies indicate that an 8\,GeV, 100\,pC charge pulsed electron beam impinging on a copper target can produce up to $2 \times 10^{3}$ muons per pulse. Beamline optimization results demonstrate that approximately 60 surface muons per electron bunch can be efficiently transported to the end of the beamline. This translates to a surface muon rate of $3 \times 10^{6}\,μ^{+}$/s when the pulsed electron beam is operated at 50\,kHz, which is comparable to existing muon facilities. This high-repetition-rate pulsed muon beam, with its ideal time structure, represents a unique and pioneering effort once constructed. It serves as a model for building cost-effective muon sources at existing electron machines with GeV electron energies. In addition to the typical challenges encountered in conventional muon beamlines, such as the installation and construction of the target station and beamline, the removal of substantial quantities of positrons is also a major challenge. A potential solution to this issue is also discussed.

physics.acc-ph↗

arXiv2025

MoCa: Modality-aware Continual Pre-training Makes Better Bidirectional Multimodal Embeddings

Multimodal embedding models, built upon causal Vision Language Models (VLMs), have shown promise in various tasks. However, current approaches face three key limitations: the use of causal attention in VLM backbones is suboptimal for embedding tasks; scalability issues due to reliance on high-quality labeled paired data for contrastive learning; and limited diversity in training objectives and data. To address these issues, we propose MoCa, a two-stage framework for transforming pre-trained VLMs into effective bidirectional multimodal embedding models. The first stage, Modality-aware Continual Pre-training, introduces a joint reconstruction objective that simultaneously denoises interleaved text and image inputs, enhancing bidirectional context-aware reasoning. The second stage, Heterogeneous Contrastive Fine-tuning, leverages diverse, semantically rich multimodal data beyond simple image-caption pairs to enhance generalization and alignment. Our method addresses the stated limitations by introducing bidirectional attention through continual pre-training, scaling effectively with massive unlabeled datasets via joint reconstruction objectives, and utilizing diverse multimodal data for enhanced representation robustness. Experiments demonstrate that MoCa consistently improves performance across MMEB and ViDoRe-v2 benchmarks, achieving new state-of-the-art results, and exhibits strong scalability with both model size and training data on MMEB.

cs.CV↗

arXiv2025

Reinforcing Spatial Reasoning in Vision-Language Models with Interwoven Thinking and Visual Drawing

As textual reasoning with large language models (LLMs) has advanced significantly, there has been growing interest in enhancing the multimodal reasoning capabilities of large vision-language models (LVLMs). However, existing methods primarily approach multimodal reasoning in a straightforward, text-centric manner, where both reasoning and answer derivation are conducted purely through text, with the only difference being the presence of multimodal input. As a result, these methods often encounter fundamental limitations in spatial reasoning tasks that demand precise geometric understanding and continuous spatial tracking-capabilities that humans achieve through mental visualization and manipulation. To address the limitations, we propose drawing to reason in space, a novel paradigm that enables LVLMs to reason through elementary drawing operations in the visual space. By equipping models with basic drawing operations, including annotating bounding boxes and drawing auxiliary lines, we empower them to express and analyze spatial relationships through direct visual manipulation, meanwhile avoiding the performance ceiling imposed by specialized perception tools in previous tool-integrated reasoning approaches. To cultivate this capability, we develop a three-stage training framework: cold-start training with synthetic data to establish basic drawing abilities, reflective rejection sampling to enhance self-reflection behaviors, and reinforcement learning to directly optimize for target rewards. Extensive experiments demonstrate that our model, named VILASR, consistently outperforms existing methods across diverse spatial reasoning benchmarks, involving maze navigation, static spatial reasoning, video-based reasoning, and multi-view-based reasoning tasks, with an average improvement of 18.4%.

cs.CV↗

arXiv2025

New Symbiotic Stars from LAMOST DR10 Spectra and Multi-band Photometry

Symbiotic star (SySt) is long-period interacting binary system, typically consisting of a white dwarf and a red giant surrounded by a nebula. These systems are natural astrophysical laboratories for investigating binary star evolution. In this paper, we identified nine SySts from the LAMOST DR10 low-resolution spectra survey, seven of which were previously known, while two are newly identified. Initially, we selected LAMOST spectra exhibiting typical SySt emission lines (e.g., $\rm H_α, ~H_β, ~H_γ, ~and ~He II$). Subsequently, we utilized the distribution of known SySts on the HR diagram to select SySt candidates, and visually inspected their spectra. Ultimately, we classified all nine as S-type SySts using the $J - H$ vs. $H - K$ diagram. Additionally, based on multi-band photometric data from GALEX, Gaia, 2MASS, ALLWISE, and several X-ray catalogs, we found 12 accreting-only SySt (acc-SySt) candidates, characterized by concurrent ultraviolet and infrared excess and accretion process. Furthermore, we estimated the white dwarf temperatures by fitting their observed SEDs using a combination of Kurucz stellar atmosphere model and Koester white dwarf model. We compared the accretion rates of acc-SySt candidates and confirmed SySts, and found they have similar accretion rate distribution, providing evidence that these acc-SySt candidates constitute bona fide SySts.

astro-ph.SR↗

arXiv2025

Autonomous Collaborative Scheduling of Time-dependent UAVs, Workers and Vehicles for Crowdsensing in Disaster Response

Natural disasters have caused significant losses to human society, and the timely and efficient acquisition of post-disaster environmental information is crucial for the effective implementation of rescue operations. Due to the complexity of post-disaster environments, existing sensing technologies face challenges such as weak environmental adaptability, insufficient specialized sensing capabilities, and limited practicality of sensing solutions. This paper explores the heterogeneous multi-agent online autonomous collaborative scheduling algorithm HoAs-PALN, aimed at achieving efficient collection of post-disaster environmental information. HoAs-PALN is realized through adaptive dimensionality reduction in the matching process and local Nash equilibrium game, facilitating autonomous collaboration among time-dependent UAVs, workers and vehicles to enhance sensing scheduling. (1) In terms of adaptive dimensionality reduction during the matching process, HoAs-PALN significantly reduces scheduling decision time by transforming a five-dimensional matching process into two categories of three-dimensional matching processes; (2) Regarding the local Nash equilibrium game, HoAs-PALN combines the softmax function to optimize behavior selection probabilities and introduces a local Nash equilibrium determination mechanism to ensure scheduling decision performance. Finally, we conducted detailed experiments based on extensive real-world and simulated data. Compared with the baselines (GREEDY, K-WTA, MADL and MARL), HoAs-PALN improves task completion rates by 64.12%, 46.48%, 16.55%, and 14.03% on average, respectively, while each online scheduling decision takes less than 10 seconds, demonstrating its effectiveness in dynamic post-disaster environments.

cs.MA↗

arXiv2025

Scaling and Beyond: Advancing Spatial Reasoning in MLLMs Requires New Recipes

Multimodal Large Language Models (MLLMs) have demonstrated impressive performance in general vision-language tasks. However, recent studies have exposed critical limitations in their spatial reasoning capabilities. This deficiency in spatial reasoning significantly constrains MLLMs' ability to interact effectively with the physical world, thereby limiting their broader applications. We argue that spatial reasoning capabilities will not naturally emerge from merely scaling existing architectures and training methodologies. Instead, this challenge demands dedicated attention to fundamental modifications in the current MLLM development approach. In this position paper, we first establish a comprehensive framework for spatial reasoning within the context of MLLMs. We then elaborate on its pivotal role in real-world applications. Through systematic analysis, we examine how individual components of the current methodology, from training data to reasoning mechanisms, influence spatial reasoning capabilities. This examination reveals critical limitations while simultaneously identifying promising avenues for advancement. Our work aims to direct the AI research community's attention toward these crucial yet underexplored aspects. By highlighting these challenges and opportunities, we seek to catalyze progress toward achieving human-like spatial reasoning capabilities in MLLMs.

cs.LG↗

arXiv2025

Divide-Then-Align: Honest Alignment based on the Knowledge Boundary of RAG

Large language models (LLMs) augmented with retrieval systems have significantly advanced natural language processing tasks by integrating external knowledge sources, enabling more accurate and contextually rich responses. To improve the robustness of such systems against noisy retrievals, Retrieval-Augmented Fine-Tuning (RAFT) has emerged as a widely adopted method. However, RAFT conditions models to generate answers even in the absence of reliable knowledge. This behavior undermines their reliability in high-stakes domains, where acknowledging uncertainty is critical. To address this issue, we propose Divide-Then-Align (DTA), a post-training approach designed to endow RAG systems with the ability to respond with "I don't know" when the query is out of the knowledge boundary of both the retrieved passages and the model's internal knowledge. DTA divides data samples into four knowledge quadrants and constructs tailored preference data for each quadrant, resulting in a curated dataset for Direct Preference Optimization (DPO). Experimental results on three benchmark datasets demonstrate that DTA effectively balances accuracy with appropriate abstention, enhancing the reliability and trustworthiness of retrieval-augmented systems.

cs.CL↗

arXiv2025

Reinforcing General Reasoning without Verifiers

The recent paradigm shift towards training large language models (LLMs) using DeepSeek-R1-Zero-style reinforcement learning (RL) on verifiable rewards has led to impressive advancements in code and mathematical reasoning. However, this methodology is limited to tasks where rule-based answer verification is possible and does not naturally extend to real-world domains such as chemistry, healthcare, engineering, law, biology, business, and economics. Current practical workarounds use an additional LLM as a model-based verifier; however, this introduces issues such as reliance on a strong verifier LLM, susceptibility to reward hacking, and the practical burden of maintaining the verifier model in memory during training. To address this and extend DeepSeek-R1-Zero-style training to general reasoning domains, we propose a verifier-free method (VeriFree) that bypasses answer verification and instead uses RL to directly maximize the probability of generating the reference answer. We compare VeriFree with verifier-based methods and demonstrate that, in addition to its significant practical benefits and reduced compute requirements, VeriFree matches and even surpasses verifier-based methods on extensive evaluations across MMLU-Pro, GPQA, SuperGPQA, and math-related benchmarks. Moreover, we provide insights into this method from multiple perspectives: as an elegant integration of training both the policy and implicit verifier in a unified model, and as a variational optimization approach. Code is available at https://github.com/sail-sg/VeriFree.

cs.LG↗

arXiv2025

The Impact of Fiber Cross Contamination on Radial Velocity Precision

High-resolution spectrographs with precise radial velocity (PRV) capabilities require careful considerations in instrumental design and data processing in order to reach the 10 cm/s-level precision, which is needed for detecting Earth-like planets. In this work, we investigate the impact of fiber cross contamination on the RV precision via simulations, as modern PRV spectrographs often have multiple fiber traces on their spectral images. We simulated extracted 1-D spectra under the preliminary design of CHORUS, short for the Canary Hybrid Optical high-Resolution Ultra-stable Spectrograph, a dual-arm PRV spectrograph under construction for the Gran Telescopio de Canarias. We considered two types of fiber cross contaminations: contamination from calibration traces to neighboring science traces (or cal-sci contamination) and between science traces (or sci-sci contamination). We present results in four different scenarios: photon noise only, cal-sci contamination only, sci-sci contamination only, and all effects combined. For the preliminary design of CHORUS, we estimated that the cal-sci contamination fraction is smaller than 0.0001% in flux across the whole CCD for either arm, resulting in a negligible impact on the RV precision. Assuming worst-case scenarios, we estimated the sci-sci contamination to be up to 0.1% in some traces, corresponding to an additional RV error of up to 10 cm/s. We demonstrate the importance of considering fiber-trace spacing and cross contamination in PRV spectrographs, and we recommend careful design, operation, and spectral extraction algorithms to minimize and mitigate cross contamination to achieve the best possible instrumental RV precision.

astro-ph.IM↗

arXiv2025

REACT: Representation Extraction And Controllable Tuning to Overcome Overfitting in LLM Knowledge Editing

Large language model editing methods frequently suffer from overfitting, wherein factual updates can propagate beyond their intended scope, overemphasizing the edited target even when it's contextually inappropriate. To address this challenge, we introduce REACT (Representation Extraction And Controllable Tuning), a unified two-phase framework designed for precise and controllable knowledge editing. In the initial phase, we utilize tailored stimuli to extract latent factual representations and apply Principal Component Analysis with a simple learnbale linear transformation to compute a directional "belief shift" vector for each instance. In the second phase, we apply controllable perturbations to hidden states using the obtained vector with a magnitude scalar, gated by a pre-trained classifier that permits edits only when contextually necessary. Relevant experiments on EVOKE benchmarks demonstrate that REACT significantly reduces overfitting across nearly all evaluation metrics, and experiments on COUNTERFACT and MQuAKE shows that our method preserves balanced basic editing performance (reliability, locality, and generality) under diverse editing scenarios.

cs.AI↗

arXiv2025

Materials Generation in the Era of Artificial Intelligence: A Comprehensive Survey

Materials are the foundation of modern society, underpinning advancements in energy, electronics, healthcare, transportation, and infrastructure. The ability to discover and design new materials with tailored properties is critical to solving some of the most pressing global challenges. In recent years, the growing availability of high-quality materials data combined with rapid advances in Artificial Intelligence (AI) has opened new opportunities for accelerating materials discovery. Data-driven generative models provide a powerful tool for materials design by directly create novel materials that satisfy predefined property requirements. Despite the proliferation of related work, there remains a notable lack of up-to-date and systematic surveys in this area. To fill this gap, this paper provides a comprehensive overview of recent progress in AI-driven materials generation. We first organize various types of materials and illustrate multiple representations of crystalline materials. We then provide a detailed summary and taxonomy of current AI-driven materials generation approaches. Furthermore, we discuss the common evaluation metrics and summarize open-source codes and benchmark datasets. Finally, we conclude with potential future directions and challenges in this fast-growing field. The related sources can be found at https://github.com/ZhixunLEE/Awesome-AI-for-Materials-Generation.

cond-mat.mtrl-sci↗

arXiv2025

CaMDN: Enhancing Cache Efficiency for Multi-tenant DNNs on Integrated NPUs

With the rapid development of DNN applications, multi-tenant execution, where multiple DNNs are co-located on a single SoC, is becoming a prevailing trend. Although many methods are proposed in prior works to improve multi-tenant performance, the impact of shared cache is not well studied. This paper proposes CaMDN, an architecture-scheduling co-design to enhance cache efficiency for multi-tenant DNNs on integrated NPUs. Specifically, a lightweight architecture is proposed to support model-exclusive, NPU-controlled regions inside shared cache to eliminate unexpected cache contention. Moreover, a cache scheduling method is proposed to improve shared cache utilization. In particular, it includes a cache-aware mapping method for adaptability to the varying available cache capacity and a dynamic allocation algorithm to adjust the usage among co-located DNNs at runtime. Compared to prior works, CaMDN reduces the memory access by 33.4% on average and achieves a model speedup of up to 2.56$\times$ (1.88$\times$ on average).

cs.AR↗

arXiv2025

R1-Reward: Training Multimodal Reward Model Through Stable Reinforcement Learning

Multimodal Reward Models (MRMs) play a crucial role in enhancing the performance of Multimodal Large Language Models (MLLMs). While recent advancements have primarily focused on improving the model structure and training data of MRMs, there has been limited exploration into the effectiveness of long-term reasoning capabilities for reward modeling and how to activate these capabilities in MRMs. In this paper, we explore how Reinforcement Learning (RL) can be used to improve reward modeling. Specifically, we reformulate the reward modeling problem as a rule-based RL task. However, we observe that directly applying existing RL algorithms, such as Reinforce++, to reward modeling often leads to training instability or even collapse due to the inherent limitations of these algorithms. To address this issue, we propose the StableReinforce algorithm, which refines the training loss, advantage estimation strategy, and reward design of existing RL methods. These refinements result in more stable training dynamics and superior performance. To facilitate MRM training, we collect 200K preference data from diverse datasets. Our reward model, R1-Reward, trained using the StableReinforce algorithm on this dataset, significantly improves performance on multimodal reward modeling benchmarks. Compared to previous SOTA models, R1-Reward achieves a $8.4\%$ improvement on the VL Reward-Bench and a $14.3\%$ improvement on the Multimodal Reward Bench. Moreover, with more inference compute, R1-Reward's performance is further enhanced, highlighting the potential of RL algorithms in optimizing MRMs.

cs.CV↗

arXiv2025

Graffe: Graph Representation Learning via Diffusion Probabilistic Models

Diffusion probabilistic models (DPMs), widely recognized for their potential to generate high-quality samples, tend to go unnoticed in representation learning. While recent progress has highlighted their potential for capturing visual semantics, adapting DPMs to graph representation learning remains in its infancy. In this paper, we introduce Graffe, a self-supervised diffusion model proposed for graph representation learning. It features a graph encoder that distills a source graph into a compact representation, which, in turn, serves as the condition to guide the denoising process of the diffusion decoder. To evaluate the effectiveness of our model, we first explore the theoretical foundations of applying diffusion models to representation learning, proving that the denoising objective implicitly maximizes the conditional mutual information between data and its representation. Specifically, we prove that the negative logarithm of the denoising score matching loss is a tractable lower bound for the conditional mutual information. Empirically, we conduct a series of case studies to validate our theoretical insights. In addition, Graffe delivers competitive results under the linear probing setting on node and graph classification tasks, achieving state-of-the-art performance on 9 of the 11 real-world datasets. These findings indicate that powerful generative models, especially diffusion models, serve as an effective tool for graph representation learning.

cs.LG↗

arXiv2025

Increasing the density limit with ECRH-assisted Ohmic start-up on EAST

High plasma density operation is crucial for a tokamak to achieve energy breakeven and a burning plasma. However, there is often an empirical upper limit of electron density in tokamak operation, namely the Greenwald density limit $n_G$, above which tokamaks generally disrupt. Achieving high-density operations above the density limit has been a long-standing challenge in magnetic confinement fusion research. Here, we report experimental results on EAST tokamak achieving the line-averaged electron density in the range of 1.3 $n_G$ to 1.65 $n_G$,while the usual range in EAST is (0.8-1.0)$n_G$. This is performed with ECRH-assisted Ohmic start-up and a sufficiently high initial neutral density. This is motivated by and consistent with predictions of a recent plasma-wall self-organization (PWSO) theory, that increasing ECRH power or pre-filled gas pressure leads to lower plasma temperatures around divertor target and higher density limits. In addition, the experiments are shown to operate in the density-free regime predicted by the PWSO model. These results suggest a promising scheme for substantially increasing the density limit in tokamaks, a critical advancement toward achieving the burning plasma.

physics.plasm-ph↗

arXiv2025

The effect of neon seeding on plasma edge transport in EAST

The effect of neon seeding on different transport mechanisms in EAST is investigated by analyzing SOLPSITER simulations. By evaluating the agreement between experimental observations and the performed simulations, four simulations are selected for a detailed analysis. In this analysis, it is shown that the presence of neon reduces the influence of drifts on the simulated profiles. In the simulation results, double peaked profiles/profiles with two valleys are observed at the divertor targets which can be explained by the parallel drift velocities These drifts move particles from the outboard towards the inboard side and, in that way, also increase the ionization sources at the inboard side. It is shown that Ne+ leaks towards the core making it difficult to perform experiments which contain as much neon as in the SOLPS-ITER simulations. In fact, the level of neon in the experiments is limited by the HL backtransition which takes place if higher order states of neon ionize in the core and cause in that way too much core radiation. Furthermore, the analysis of the radiated power profiles suggests that the presence of other radiators besides neon is important to bring the experiments into detachment. The ionization of deuterium is the most important neutral reaction present in the simulations. The amount of ionized deuterium is decreased when large amounts of neon are present and the anomalous transport is modified. Therefore, it is concluded that for the analyzed simulations, neon increases the radiated power fraction, decreases the deuterium ionization, increases the neutral friction, but does not manage to cause significant influence of deuterium recombination. As a consequence, volumetric recombination only plays a minor role in the studied simulations.

physics.plasm-ph↗