arXiv subjects

Cheng Liu

Publications and source records attributed to Cheng Liu.

At least 73 records · Page 4Linked to original sources

arXiv2025

Probing the Fermi surface with Quantum Oscillation Measurements in the Dirac semimetal TaNiTe$_5$

We report a detailed investigation of the Fermi surface in the layered Dirac semimetal TaNiTe$_5$. We probed the magnetization, magnetic torque and magnetoresistance in high-quality single crystals. Pronounced Shubnikov - de Haas (SdH) and de Haas - van Alphen (dHvA) oscillations are observed in magnetic fields above 3T and at temperatures of up to 22K. Multiple fundamental frequencies and light effective quasiparticle masses are obtained by fast Fourier transformation (FFT) and Lifshitz-Kosevich (LK) formula fits. The high resolution of the low-temperature FFT spectra allows us to investigate individual peaks in detail for the magnetic fields applied along all three crystallographic axes and the planes in between. Our investigation can confirm the density functional theory (DFT) calculated band structure and its corresponding Fermi surface.

cond-mat.mes-hall↗

arXiv2025

The Giant Radio Array for Neutrino Detection (GRAND) Collaboration -- Contributions to the 39th International Cosmic Ray Conference (ICRC 2025)

The Giant Radio Array for Neutrino Detection (GRAND) is an envisioned observatory of ultra-high-energy particles of cosmic origin, with energies in excess of 100 PeV. GRAND uses large surface arrays of antennas to look for the radio emission from extensive air showers that are triggered by the interaction of ultra-high-energy cosmic rays, gamma rays, and neutrinos in the atmosphere or underground. In particular, for ultra-high-energy neutrinos, the future final phase of GRAND aims to be sensitive enough to detect them in spite of their plausibly tiny flux. Three prototype GRAND radio arrays have been in operation since 2023: GRANDProto300, in China, GRAND@Auger, in Argentina, and GRAND@Nançay, in France. Their goals are to field-test the GRAND detection units, understand the radio background to which they are exposed, and develop tools for diagnostic, data gathering, and data analysis. This list of contributions to the 39th International Cosmic Ray Conference (ICRC 2025) presents an overview of GRAND, in its present and future incarnations, and a first look at data collected by GRANDProto300 and GRAND@Auger, including the first cosmic-ray candidates detected by them.

astro-ph.IM↗

arXiv2025

Hardware-software co-exploration with racetrack memory based in-memory computing for CNN inference in embedded systems

Deep neural networks generate and process large volumes of data, posing challenges for low-resource embedded systems. In-memory computing has been demonstrated as an efficient computing infrastructure and shows promise for embedded AI applications. Among newly-researched memory technologies, racetrack memory is a non-volatile technology that allows high data density fabrication, making it a good fit for in-memory computing. However, integrating in-memory arithmetic circuits with memory cells affects both the memory density and power efficiency. It remains challenging to build efficient in-memory arithmetic circuits on racetrack memory within area and energy constraints. To this end, we present an efficient in-memory convolutional neural network (CNN) accelerator optimized for use with racetrack memory. We design a series of fundamental arithmetic circuits as in-memory computing cells suited for multiply-and-accumulate operations. Moreover, we explore the design space of racetrack memory based systems and CNN model architectures, employing co-design to improve the efficiency and performance of performing CNN inference in racetrack memory while maintaining model accuracy. Our designed circuits and model-system co-optimization strategies achieve a small memory bank area with significant improvements in energy and performance for racetrack memory based embedded systems.

cs.ET↗

arXiv2025

CodeTool: Enhancing Programmatic Tool Invocation of LLMs via Process Supervision

Tool invocation significantly enhances the capabilities of Large Language Models (LLMs), yet challenges persist, particularly in complex task scenarios. Current methods, such as instruction-enhanced reasoning and supervised fine-tuning, often result in unnecessarily long reasoning paths and face difficulties in verifying the correctness of intermediate steps. In this paper, we propose CodeTool, a novel framework for stepwise code generation that improves LLM tool invocation by leveraging the concise and easily verifiable nature of code. CodeTool incorporates two distinct process rewards: the On-the-spot Reward, which provides immediate feedback on the accuracy of each tool invocation, and the Latent Reward, which assesses the contribution of each step toward overall task completion. By maximizing the cumulative reward of the On-the-spot and Latend Rewards at each step, LLMs are guided to follow efficient and accurate reasoning paths. Extensive experiments on StableToolBench and RestBench-TMDB demonstrate the superiority of CodeTool over existing approaches.

cs.AI↗

arXiv2025

A post-common-envelope binary with double-peaked Balmer emission lines from TMTS

The dynamical method provides an efficient way to discover post-common-envelope binaries (PCEB) with faint white dwarfs (WDs), thanks to the development of time-domain survey projects. We perform a comprehensive analysis of the PCEB system TMTS J15530469+4457458 (J1553), discovered by the Tsinghua University-Ma Huateng Telescopes for Survey, to explore its physical origin and evolutionary fate. This system is characterized by double-peaked Balmer emission lines, and a cross-correlation function is applied to derive its radial velocity (RV) from a series of phase-resolved Keck spectra. Analyses with the cross-correlation function suggest that this system is a single-lined spectroscopic binary and only one star is optically visible. Further analysis through Doppler tomography indicates that J1553 is a detached binary without an accretion disk. Under such a configuration, the simultaneous light-curve and RV fitting reveal that this system contains an unseen WD with mass $M_{\rm A}=0.56\pm 0.09\, M_{\odot}$, and an M4 dwarf with mass $M_{\rm B}=0.37\pm 0.02\,M_{\odot}$ and radius $R_{\rm B}=0.403^{+0.014}_{-0.015}\,R_{\odot}$. The extra prominent Balmer emission lines seen in the spectra can trace the motion of the WD, which are likely formed near the WD surface as a result of wind accretion. According to the MESA simulation, J1553 could have evolved from a binary consisting of a 2.0-4.0 ${M}_{\odot}$ zero-age-main-sequence star and an M dwarf with an initial orbital period $P_i\approx 201-476$ d, and the system has undergone a common-envelope (CE) phase. After about $3.3\times10^6$ yr, J1553 should evolve into a cataclysmic variable, with a transient state as a supersoft X-ray source at the beginning. J1553 is an excellent system for studying wind accretion, CE ejection physics, and binary evolution theory.

astro-ph.SR↗

arXiv2025

Large Processor Chip Model

Computer System Architecture serves as a crucial bridge between software applications and the underlying hardware, encompassing components like compilers, CPUs, coprocessors, and RTL designs. Its development, from early mainframes to modern domain-specific architectures, has been driven by rising computational demands and advancements in semiconductor technology. However, traditional paradigms in computer system architecture design are confronting significant challenges, including a reliance on manual expertise, fragmented optimization across software and hardware layers, and high costs associated with exploring expansive design spaces. While automated methods leveraging optimization algorithms and machine learning have improved efficiency, they remain constrained by a single-stage focus, limited data availability, and a lack of comprehensive human domain knowledge. The emergence of large language models offers transformative opportunities for the design of computer system architecture. By leveraging the capabilities of LLMs in areas such as code generation, data analysis, and performance modeling, the traditional manual design process can be transitioned to a machine-based automated design approach. To harness this potential, we present the Large Processor Chip Model (LPCM), an LLM-driven framework aimed at achieving end-to-end automated computer architecture design. The LPCM is structured into three levels: Human-Centric; Agent-Orchestrated; and Model-Governed. This paper utilizes 3D Gaussian Splatting as a representative workload and employs the concept of software-hardware collaborative design to examine the implementation of the LPCM at Level 1, demonstrating the effectiveness of the proposed approach. Furthermore, this paper provides an in-depth discussion on the pathway to implementing Level 2 and Level 3 of the LPCM, along with an analysis of the existing challenges.

cs.AR↗

arXiv2025

OmniConsistency: Learning Style-Agnostic Consistency from Paired Stylization Data

Diffusion models have advanced image stylization significantly, yet two core challenges persist: (1) maintaining consistent stylization in complex scenes, particularly identity, composition, and fine details, and (2) preventing style degradation in image-to-image pipelines with style LoRAs. GPT-4o's exceptional stylization consistency highlights the performance gap between open-source methods and proprietary models. To bridge this gap, we propose \textbf{OmniConsistency}, a universal consistency plugin leveraging large-scale Diffusion Transformers (DiTs). OmniConsistency contributes: (1) an in-context consistency learning framework trained on aligned image pairs for robust generalization; (2) a two-stage progressive learning strategy decoupling style learning from consistency preservation to mitigate style degradation; and (3) a fully plug-and-play design compatible with arbitrary style LoRAs under the Flux framework. Extensive experiments show that OmniConsistency significantly enhances visual coherence and aesthetic quality, achieving performance comparable to commercial state-of-the-art model GPT-4o.

cs.CV↗

arXiv2025

ApproxABFT: Approximate Algorithm-Based Fault Tolerance for Neural Network Processing

With the increasing deployment of deep neural networks (DNNs) in terrestrial and aerospace safety-critical applications, system reliability has emerged as a co-equal design metric alongside computational efficiency. Algorithm-based fault tolerance (ABFT) mechanisms, characterized by architecture-agnostic and cost-effectiveness, have become a promising solution for reliability enhancement. However, conventional ABFT approaches rely on rigorous verification mechanisms where even minor computational deviations trigger error recovery processes, which not only disregards the intrinsic fault tolerance characteristics of DNN models but also incurs redundant fault tolerance processing overhead. To address these limitations, we propose an Approximate ABFT framework (ApproxABFT) that innovatively introduces adaptive error tolerance thresholds to enable selective fault recovery, activating error correction modules exclusively when computational deviations exceed predefined thresholds. This approach effectively mitigating overreaction to non-critical computational errors. Furthermore, a dynamic block granularity optimization algorithm is implemented to achieve inter-layer error sensitivity balancing. Experimental evaluations demonstrate that the proposed ApproxABFT achieves a 43.39% average reduction in redundant computing overhead compared to previous accurate ABFT, while simultaneously enhancing the tolerable soft error rate by an order of magnitude.

cs.CR↗

arXiv2025

MusicEval: A Generative Music Dataset with Expert Ratings for Automatic Text-to-Music Evaluation

The technology for generating music from textual descriptions has seen rapid advancements. However, evaluating text-to-music (TTM) systems remains a significant challenge, primarily due to the difficulty of balancing performance and cost with existing objective and subjective evaluation methods. In this paper, we propose an automatic assessment task for TTM models to align with human perception. To address the TTM evaluation challenges posed by the professional requirements of music evaluation and the complexity of the relationship between text and music, we collect MusicEval, the first generative music assessment dataset. This dataset contains 2,748 music clips generated by 31 advanced and widely used models in response to 384 text prompts, along with 13,740 ratings from 14 music experts. Furthermore, we design a CLAP-based assessment model built on this dataset, and our experimental results validate the feasibility of the proposed task, providing a valuable reference for future development in TTM evaluation. The dataset is available at https://www.aishelltech.com/AISHELL_7A.

cs.SD↗

arXiv2025

Causal Inference based Transfer Learning with LLMs: An Efficient Framework for Industrial RUL Prediction

Accurate prediction of Remaining Useful Life (RUL) for complex industrial machinery is critical for the reliability and maintenance of mechatronic systems, but it is challenged by high-dimensional, noisy sensor data. We propose the Causal-Informed Data Pruning Framework (CIDPF), which pioneers the use of causal inference to identify sensor signals with robust causal relationships to RUL through PCMCI-based stability analysis, while a Gaussian Mixture Model (GMM) screens for anomalies. By training on only 10% of the pruned data, CIDPF fine-tunes pre-trained Large Language Models (LLMs) using parameter-efficient strategies, reducing training time by 90% compared to traditional approaches. Experiments on the N-CMAPSS dataset demonstrate that CIDPF achieves a 26% lower RMSE than existing methods and a 25% improvement over full-data baselines, showcasing superior accuracy and computational efficiency in industrial mechatronic systems. The framework's adaptability to multi-condition scenarios further underscores its practicality for industrial deployment.

eess.SP↗

arXiv2025

ChildMandarin: A Comprehensive Mandarin Speech Dataset for Young Children Aged 3-5

Automatic speech recognition (ASR) systems have advanced significantly with models like Whisper, Conformer, and self-supervised frameworks such as Wav2vec 2.0 and HuBERT. However, developing robust ASR models for young children's speech remains challenging due to differences in pronunciation, tone, and pace compared to adult speech. In this paper, we introduce a new Mandarin speech dataset focused on children aged 3 to 5, addressing the scarcity of resources in this area. The dataset comprises 41.25 hours of speech with carefully crafted manual transcriptions, collected from 397 speakers across various provinces in China, with balanced gender representation. We provide a comprehensive analysis of speaker demographics, speech duration distribution and geographic coverage. Additionally, we evaluate ASR performance on models trained from scratch, such as Conformer, as well as fine-tuned pre-trained models like HuBERT and Whisper, where fine-tuning demonstrates significant performance improvements. Furthermore, we assess speaker verification (SV) on our dataset, showing that, despite the challenges posed by the unique vocal characteristics of young children, the dataset effectively supports both ASR and SV tasks. This dataset is a valuable contribution to Mandarin child speech research. The dataset is now open-source and freely available for all academic purposes on https://github.com/flageval-baai/ChildMandarin.

cs.SD↗

arXiv2025

Few-shot crack image classification using clip based on bayesian optimization

This study proposes a novel few-shot crack image classification model based on CLIP and Bayesian optimization. By combining multimodal information and Bayesian approach, the model achieves efficient classification of crack images in a small number of training samples. The CLIP model employs its robust feature extraction capabilities to facilitate precise classification with a limited number of samples. In contrast, Bayesian optimisation enhances the robustness and generalization of the model, while reducing the reliance on extensive labelled data. The results demonstrate that the model exhibits robust performance across a diverse range of dataset scales, particularly in the context of small sample sets. The study validates the potential of the method in civil engineering crack classification.

cs.CV↗

arXiv2025

Motion-Coupled Mapping Algorithm for Hybrid Rice Canopy

This paper presents a motion-coupled mapping algorithm for contour mapping of hybrid rice canopies, specifically designed for Agricultural Unmanned Ground Vehicles (Agri-UGV) navigating complex and unknown rice fields. Precise canopy mapping is essential for Agri-UGVs to plan efficient routes and avoid protected zones. The motion control of Agri-UGVs, tasked with impurity removal and other operations, depends heavily on accurate estimation of rice canopy height and structure. To achieve this, the proposed algorithm integrates real-time RGB-D sensor data with kinematic and inertial measurements, enabling efficient mapping and proprioceptive localization. The algorithm produces grid-based elevation maps that reflect the probabilistic distribution of canopy contours, accounting for motion-induced uncertainties. It is implemented on a high-clearance Agri-UGV platform and tested in various environments, including both controlled and dynamic rice field settings. This approach significantly enhances the mapping accuracy and operational reliability of Agri-UGVs, contributing to more efficient autonomous agricultural operations.

cs.RO↗

arXiv2025

Visualizing Nanodomain Superlattices in Halide Perovskites Giving Picosecond Quantum Transients

The high optoelectronic quality of halide perovskites lends them to be utilized in optoelectronic devices and recently in emerging quantum emission applications. Advancements in perovskite nanomaterials have led to the discovery of processes in which luminescence decay times are sub-100 picoseconds, stimulating the exploration of even faster radiative rates for advanced quantum applications, which have only been prominently realised in III-V materials grown through costly epitaxial growth methods. Here, we discovered ultrafast quantum transients of time scales ~2 picoseconds at low temperature in bulk formamidinium lead iodide films grown through scalable solution or vapour approaches. Using a multimodal strategy, combining ultrafast spectroscopy, optical and electron microscopy, we show that these transients originate from quantum tunnelling in nanodomain superlattices. The outcome of the transient decays, photoluminescence, mirrors the photoabsorption of the states, with an ultra-narrow linewidth at low temperature as low as <2 nm (~4 meV). Localized correlation of the emission and structure reveals that the nanodomain superlattices are formed by alternating ordered layers of corner sharing and face sharing octahedra. This discovery opens new applications leveraging intrinsic quantum properties and demonstrates powerful multimodal approaches for quantum investigations.

cond-mat.mtrl-sci↗

arXiv2025

S$^2$R: Teaching LLMs to Self-verify and Self-correct via Reinforcement Learning

Recent studies have demonstrated the effectiveness of LLM test-time scaling. However, existing approaches to incentivize LLMs' deep thinking abilities generally require large-scale data or significant training efforts. Meanwhile, it remains unclear how to improve the thinking abilities of less powerful base models. In this work, we introduce S$^2$R, an efficient framework that enhances LLM reasoning by teaching models to self-verify and self-correct during inference. Specifically, we first initialize LLMs with iterative self-verification and self-correction behaviors through supervised fine-tuning on carefully curated data. The self-verification and self-correction skills are then further strengthened by both outcome-level and process-level reinforcement learning, with minimized resource requirements, enabling the model to adaptively refine its reasoning process during inference. Our results demonstrate that, with only 3.1k self-verifying and self-correcting behavior initialization samples, Qwen2.5-math-7B achieves an accuracy improvement from 51.0\% to 81.6\%, outperforming models trained on an equivalent amount of long-CoT distilled data. Extensive experiments and analysis based on three base models across both in-domain and out-of-domain benchmarks validate the effectiveness of S$^2$R. Our code and data are available at https://github.com/NineAbyss/S2R.

cs.CL↗

arXiv2025

Controlling the superradiant phase transition in the quantum Rabi model

In the ultrastrong-coupling regime, the quantum Rabi model can exhibit quantum phase transition (QPT) when the ratio of the qubit transition frequency to the frequency of the cavity field approaches infinity. However, it is challenging to control the QPT in few-body systems because of the limited coupling strength and the A^2 term. Here, we propose a practical scheme to manipulate the QPT of the quantum Rabi model in the strong-coupling regime. By applying a periodic frequency modulation to the two-level system in a quantum Rabi model in the strong-coupling regime, an anisotropic quantum Rabi model with ultrastrong and tunable coupling strengths for rotating and counterrotating terms is obtained. The ground state and excitation energy of this model, in terms of the modulation parameters, are studied. We find that the QPT of the quantum Rabi model can be observed in the strong-coupling regime and externally controlled by the modulation.

quant-ph↗

arXiv2025

MakeAnything: Harnessing Diffusion Transformers for Multi-Domain Procedural Sequence Generation

A hallmark of human intelligence is the ability to create complex artifacts through structured multi-step processes. Generating procedural tutorials with AI is a longstanding but challenging goal, facing three key obstacles: (1) scarcity of multi-task procedural datasets, (2) maintaining logical continuity and visual consistency between steps, and (3) generalizing across multiple domains. To address these challenges, we propose a multi-domain dataset covering 21 tasks with over 24,000 procedural sequences. Building upon this foundation, we introduce MakeAnything, a framework based on the diffusion transformer (DIT), which leverages fine-tuning to activate the in-context capabilities of DIT for generating consistent procedural sequences. We introduce asymmetric low-rank adaptation (LoRA) for image generation, which balances generalization capabilities and task-specific performance by freezing encoder parameters while adaptively tuning decoder layers. Additionally, our ReCraft model enables image-to-process generation through spatiotemporal consistency constraints, allowing static images to be decomposed into plausible creation sequences. Extensive experiments demonstrate that MakeAnything surpasses existing methods, setting new performance benchmarks for procedural generation tasks.

cs.CV↗

arXiv2025

Sequential Multi-objective Multi-agent Reinforcement Learning Approach for Predictive Maintenance

Existing predictive maintenance (PdM) methods typically focus solely on whether to replace system components without considering the costs incurred by inspection. However, a well-considered approach should be able to minimize Remaining Useful Life (RUL) at engine replacement while maximizing inspection interval. To achieve this, multi-agent reinforcement learning (MARL) can be introduced. However, due to the sequential and mutually constraining nature of these 2 objectives, conventional MARL is not applicable. Therefore, this paper introduces a novel framework and develops a Sequential Multi-objective Multi-agent Proximal Policy Optimization (SMOMA-PPO) algorithm. Furthermore, to provide comprehensive and effective degradation information to RL agents, we also employed Gated Recurrent Unit, quantile regression, and probability distribution fitting to develop a GRU-based RUL Prediction (GRP) model. Experiments demonstrate that the GRP method significantly improves the accuracy of RUL predictions in the later stages of system operation compared to existing methods. When incorporating its output into SMOMA-PPO, we achieve at least a 15% reduction in average RUL without unscheduled replacements (UR), nearly a 10% increase in inspection interval, and an overall decrease in maintenance costs. Importantly, our approach offers a new perspective for addressing multi-objective maintenance planning with sequential constraints, effectively enhancing system reliability and reducing maintenance expenses.

eess.SY↗