arXiv subjects

Peng Cheng

Publications and source records attributed to Peng Cheng.

At least 109 records · Page 6Linked to original sources

arXiv2025

Fully Distributed State Estimation for Multi-agent Systems and its Application in Cooperative Localization

In this paper, we investigate the distributed state estimation problem for a continuous-time linear multi-agent system (MAS) composed of $\mathit{m}$ agents and monitored by the agents themselves. To address this problem, we propose a distributed observer that enables each agent to reconstruct the state of the MAS. The main idea is to let each agent $\mathit{i}$ recover the state of agent $\mathit{j}$ by using leader-follower consensus rules to track agent $\mathit{j}$'s state estimate, which is generated by agent $\mathit{j}$ itself using a Luenberger-like estimation rule. Under the assumptions of node-level observability and topological ordering consistency, we show that the estimation error dynamics are stabilizable if and only if the communication graph is strongly connected. Moreover, we discuss the fully distributed design of the proposed observer, assuming that the agents only know basic MAS configuration information, such as the homogeneity and the maximum number of allowable agents. This design ensures that the proposed observer functions correctly when agents are added or removed. Building on this, we consider cooperative localization as a distributed estimation problem and develop two fully distributed localization algorithms that allow agents to track their own and other agents' positions (and velocities) within the MAS. Finally, we conduct simulations to demonstrate the effectiveness of our proposed theoretical results.

eess.SY↗

arXiv2025

Infinite Stream Estimation under Personalized $w$-Event Privacy

Streaming data collection is indispensable for stream data analysis, such as event monitoring. However, publishing these data directly leads to privacy leaks. $w$-event privacy is a valuable tool to protect individual privacy within a given time window while maintaining high accuracy in data collection. Most existing $w$-event privacy studies on infinite data stream only focus on homogeneous privacy requirements for all users. In this paper, we propose personalized $w$-event privacy protection that allows different users to have different privacy requirements in private data stream estimation. Specifically, we design a mechanism that allows users to maintain constant privacy requirements at each time slot, namely Personalized Window Size Mechanism (PWSM). Then, we propose two solutions to accurately estimate stream data statistics while achieving $w$-event level $ε$ personalized differential privacy ( ($w$, $ε$)-EPDP), namely Personalized Budget Distribution (PBD) and Peronalized Budget Absorption (PBA). PBD always provides at least the same privacy budget for the next time step as the amount consumed in the previous release. PBA fully absorbs the privacy budget from the previous $k$ time slots, while also borrowing from the privacy budget of the next $k$ time slots, to increase the privacy budget for the current time slot. We prove that both PBD and PBA outperform the state-of-the-art private stream estimation methods while satisfying the privacy requirements of all users. We demonstrate the efficiency and effectiveness of our PBD and PBA on both real and synthetic data sets, compared with the recent uniformity $w$-event approaches, Budget Distribution (BD) and Budget Absorption (BA). Our PBD achieves 68% less error than BD on average on real data sets. Besides, our PBA achieves 24.9% less error than BA on average on synthetic data sets.

cs.DB↗

arXiv2025

Distribution Functions of $Λ$ and $Σ^0$ Baryons

Treating baryons as quark + interacting-diquark bound states, a symmetry-preserving formulation of a vector$\,\times\,$vector contact interaction (SCI) is used to deliver an extensive, coherent set of predictions for $Λ, Σ^0$ baryon unpolarised and polarised distribution functions (DFs) -- valence, glue, and four-flavour separated sea -- and compare them with those of a like-structured nucleon. $Λ, Σ^0$ baryons are strangeness negative-one isospin partners within the SU$(3)$-flavour baryon octet. This makes such structural comparisons significant. The study reveals impacts of diquark correlations and SU$(3)$-flavour symmetry breaking on $Λ$, $Σ^0$ structure functions, some of which are significant. For instance, were it not for the presence of axialvector diquarks in the $Σ^0$ at the hadron scale, the $s$ quark could carry none of the $Σ^0$ spin. The discussion canvasses issues that include helicity retention in hard scattering processes; the sign and size of polarised gluon DFs; and the origin and decomposition of baryon spins. Interpreted judiciously, the SCI analysis delivers an insightful explanation of baryon structure as expressed in DFs.

hep-ph↗

arXiv2025

Quark + Diquark Description of Nucleon Elastic Electromagnetic Form Factors

Working with a Poincaré-covariant quark + diquark, $q(qq)$, Faddeev equation approach to nucleon structure, a refined symmetry preserving current for electron + nucleon elastic scattering is developed. The parameters in the interaction current are chosen to ensure that the $q(qq)$ picture reproduces selected results from contemporary $3$-body analyses of nucleon elastic electromagnetic form factors. Although the subset of fitted results is small, the $q(qq)$ picture reproduces almost all the $3$-body predictions and often results in better agreement with available data. Notably, the $q(qq)$ framework predicts a zero in $G_E^p/G_M^p$, the absence of such a zero in $G_E^n/G_M^n$, and a zero in the proton's $d$-quark Dirac form factor. Derived $q(qq)$ results for proton flavour-separated light-front-transverse number and anomalous magnetisation densities are also discussed. With the $q(qq)$ framework thus newly benchmarked, one may proceed to comparisons with a broader array of $3$-body results. This may enable new steps to be made toward answering an important question, viz. is the quark + fully-interacting diquark picture of baryon structure only a useful phenomenology or does it come close to expressing robust features of baryon structure?

hep-ph↗

arXiv2025

VSAG: An Optimized Search Framework for Graph-based Approximate Nearest Neighbor Search

Approximate nearest neighbor search (ANNS) is a fundamental problem in vector databases and AI infrastructures. Recent graph-based ANNS algorithms have achieved high search accuracy with practical efficiency. Despite the advancements, these algorithms still face performance bottlenecks in production, due to the random memory access patterns of graph-based search and the high computational overheads of vector distance. In addition, the performance of a graph-based ANNS algorithm is highly sensitive to parameters, while selecting the optimal parameters is cost-prohibitive, e.g., manual tuning requires repeatedly re-building the index. This paper introduces VSAG, an open-source framework that aims to enhance the in production performance of graph-based ANNS algorithms. VSAG has been deployed at scale in the services of Ant Group, and it incorporates three key optimizations: (i) efficient memory access: it reduces L3 cache misses with pre-fetching and cache-friendly vector organization; (ii) automated parameter tuning: it automatically selects performance-optimal parameters without requiring index rebuilding; (iii) efficient distance computation: it leverages modern hardware, scalar quantization, and smartly switches to low-precision representation to dramatically reduce the distance computation costs. We evaluate VSAG on real-world datasets. The experimental results show that VSAG achieves the state-of-the-art performance and provides up to 4x speedup over HNSWlib (an industry-standard library) while ensuring the same accuracy.

cs.DB↗

arXiv2025

ContextCache: Context-Aware Semantic Cache for Multi-Turn Queries in Large Language Models

Semantic caching significantly reduces computational costs and improves efficiency by storing and reusing large language model (LLM) responses. However, existing systems rely primarily on matching individual queries, lacking awareness of multi-turn dialogue contexts, which leads to incorrect cache hits when similar queries appear in different conversational settings. This demonstration introduces ContextCache, a context-aware semantic caching system for multi-turn dialogues. ContextCache employs a two-stage retrieval architecture that first executes vector-based retrieval on the current query to identify potential matches and then integrates current and historical dialogue representations through self-attention mechanisms for precise contextual matching. Evaluation of real-world conversations shows that ContextCache improves precision and recall compared to existing methods. Additionally, cached responses exhibit approximately 10 times lower latency than direct LLM invocation, enabling significant computational cost reductions for LLM conversational applications.

cs.CL↗

arXiv2025

Design and construction of the multiplexing cold neutron spectrometer BOYA with double-column Rowland focusing analyzers

Developing neutron spectrometers with higher counting efficiency has been an essential pursuit in neutron instrumentation. In this work, we present BOYA, a multiplexing cold neutron spectrometers designed and implemented at the China Advanced Research Reactor. Equipped with 34 angular analyzing channels spanning 119°, each containing 5 inelastic channels and 1 diffraction channel, BOYA enhances the measurement efficiency by two orders of magnitude over a traditional triple-axis spectrometer. To optimize both intensity and energy resolution, innovative double-column Rowland focusing analyzers have been developed. By filling the crystal gaps in the traditional Rowland focusing geometry, our design enhances the neutron beam coverage without introducing appreciable double-scattering. Our commissioning results on vanadium and MnWO4 have confirmed the success of the design, establishing BOYA as a successful multiplexing instrument for neutron spectroscopy.

physics.ins-det↗

arXiv2025

Reasoning on a Budget: A Survey of Adaptive and Controllable Test-Time Compute in LLMs

Large language models (LLMs) have rapidly progressed into general-purpose agents capable of solving a broad spectrum of tasks. However, current models remain inefficient at reasoning: they apply fixed inference-time compute regardless of task complexity, often overthinking simple problems while underthinking hard ones. This survey presents a comprehensive review of efficient test-time compute (TTC) strategies, which aim to improve the computational efficiency of LLM reasoning. We introduce a two-tiered taxonomy that distinguishes between L1-controllability, methods that operate under fixed compute budgets, and L2-adaptiveness, methods that dynamically scale inference based on input difficulty or model confidence. We benchmark leading proprietary LLMs across diverse datasets, highlighting critical trade-offs between reasoning performance and token usage. Compared to prior surveys on efficient reasoning, our review emphasizes the practical control, adaptability, and scalability of TTC methods. Finally, we discuss emerging trends such as hybrid thinking models and identify key challenges for future work towards making LLMs more computationally efficient, robust, and responsive to user constraints.

cs.AI↗

arXiv2025

Privacy-Preserving Resilient Vector Consensus

This paper studies privacy-preserving resilient vector consensus in multi-agent systems against faulty agents, where normal agents can achieve consensus within the convex hull of their initial states while protecting state vectors from being disclosed. Specifically, we consider a modification of an existing algorithm known as Approximate Distributed Robust Convergence Using Centerpoints (ADRC), i.e., Privacy-Preserving ADRC (PP-ADRC). Under PP-ADRC, each normal agent introduces multivariate Gaussian noise to its state during each iteration. We first provide sufficient conditions to ensure that all normal agents' states can achieve mean square convergence under PP-ADRC. Then, we analyze convergence accuracy from two perspectives, i.e., the Mahalanobis distance of the final value from its expectation and the Hausdorff distance-based alteration of the convex hull caused by noise when only partial dimensions are added with noise. Then, we employ concentrated geo-privacy to characterize privacy preservation and conduct a thorough comparison with differential privacy. Finally, numerical simulations demonstrate the theoretical results.

eess.SY↗

arXiv2025

ImprovDML: Improved Trade-off in Private Byzantine-Resilient Distributed Machine Learning

Jointly addressing Byzantine attacks and privacy leakage in distributed machine learning (DML) has become an important issue. A common strategy involves integrating Byzantine-resilient aggregation rules with differential privacy mechanisms. However, the incorporation of these techniques often results in a significant degradation in model accuracy. To address this issue, we propose a decentralized DML framework, named ImprovDML, that achieves high model accuracy while simultaneously ensuring privacy preservation and resilience to Byzantine attacks. The framework leverages a kind of resilient vector consensus algorithms that can compute a point within the normal (non-Byzantine) agents' convex hull for resilient aggregation at each iteration. Then, multivariate Gaussian noises are introduced to the gradients for privacy preservation. We provide convergence guarantees and derive asymptotic learning error bounds under non-convex settings, which are tighter than those reported in existing works. For the privacy analysis, we adopt the notion of concentrated geo-privacy, which quantifies privacy preservation based on the Euclidean distance between inputs. We demonstrate that it enables an improved trade-off between privacy preservation and model accuracy compared to differential privacy. Finally, numerical simulations validate our theoretical results.

cs.LG↗

arXiv2025

Atomic to mesoscale hierarchical structures and magnetic states in an anisotropic layered ferromagnet FePd2Te2

Two-dimensional (2D) magnetic materials have predominantly exhibited easy-axis or easy-plane anisotropy and display a high sensitivity to the underlying crystal structure and lattice symmetry. Recently, an in-plane anisotropic 2D ferromagnet of FePd2Te2 has been discovered with intriguing structure and quasi-one-dimensional spin system. Here, we report a real-space investigation of its twinning structure and magnetic states using atomic/magnetic force microscopy (AFM/MFM) combined with scanning tunneling microscopy (STM). The atomic to mesoscale hierarchical structures with the orthogonal and corrugated compressive /tensile(C/T) regions are directly observed due to the intrinsic twinning-domain characteristic. The structure-related intact ferromagnetic (FM), field-induced polarized-FM states and their transitions are comparatively discussed at the mesoscale with the corresponding macroscopic magnetic measurements. Temperature- and field-dependent evolution of magnetic phase are further investigated at the FM and PM states, and summarized to obtain a unique H-T phase diagram of FePd2Te2. Our work provides key results for understanding the complicated magnetic properties of FePd2Te2, and suggests new directions for manipulating magnetic states through the atomic and mesoscale structure engineering.

cond-mat.mtrl-sci↗

arXiv2025

Field-induced magnetic order in DyTa$_7$O$_{19}$ with two-dimensional pseudospin-$\frac{1}{2}$ triangular lattice

The magnetic ground state of geometrically frustrated antiferromagnet attracts great research interests due to the possibility to realize novel quantum magnetic state such as a quantum spin liquid. Here we present a comprehensive magnetic characterization of DyTa$_7$O$_{19}$ with ideal two-dimensional triangular lattice. DyTa$_7$O$_{19}$ exhibits $c$-axis single-ion magnetic anisotropy. Although long-range magnetic order is not observed down to 100 mK under zero field, by applying a small magnetic field ($\sim$0.1 T), a magnetically ordered state with net magnetization of $M_s$/3 below $T_m$=0.14 K is identified ($M_s$ denotes the saturated magnetization). We argue that this state is an up-up-down magnetic structure phase driven by the dipole-dipole interactions between Ising-like spins of Dy$^{3+}$ in a two-dimensional triangular lattice, since its ordering temperature and temperature-field phase diagram can be well explained by the theoretical calculations based on dipolar interactions. DyTa$_7$O$_{19}$ could be viewed as a rare material platform that realizing pure Ising-like dipolar interaction in a geometrically frustrated lattice.

cond-mat.str-el↗

arXiv2025

Skywork Open Reasoner 1 Technical Report

The success of DeepSeek-R1 underscores the significant role of reinforcement learning (RL) in enhancing the reasoning capabilities of large language models (LLMs). In this work, we present Skywork-OR1, an effective and scalable RL implementation for long Chain-of-Thought (CoT) models. Building on the DeepSeek-R1-Distill model series, our RL approach achieves notable performance gains, increasing average accuracy across AIME24, AIME25, and LiveCodeBench from 57.8% to 72.8% (+15.0%) for the 32B model and from 43.6% to 57.5% (+13.9%) for the 7B model. Our Skywork-OR1-32B model surpasses both DeepSeek-R1 and Qwen3-32B on the AIME24 and AIME25 benchmarks, while achieving comparable results on LiveCodeBench. The Skywork-OR1-7B and Skywork-OR1-Math-7B models demonstrate competitive reasoning capabilities among models of similar size. We perform comprehensive ablation studies on the core components of our training pipeline to validate their effectiveness. Additionally, we thoroughly investigate the phenomenon of entropy collapse, identify key factors affecting entropy dynamics, and demonstrate that mitigating premature entropy collapse is critical for improved test performance. To support community research, we fully open-source our model weights, training code, and training datasets.

cs.LG↗

arXiv2025

OSS-UAgent: An Agent-based Usability Evaluation Framework for Open Source Software

Usability evaluation is critical to the impact and adoption of open source software (OSS), yet traditional methods relying on human evaluators suffer from high costs and limited scalability. To address these limitations, we introduce OSS-UAgent, an automated, configurable, and interactive agent-based usability evaluation framework specifically designed for open source software. Our framework employs intelligent agents powered by large language models (LLMs) to simulate developers performing programming tasks across various experience levels (from Junior to Expert). By dynamically constructing platform-specific knowledge bases, OSS-UAgent ensures accurate and context-aware code generation. The generated code is automatically evaluated across multiple dimensions, including compliance, correctness, and readability, providing a comprehensive measure of the software's usability. Additionally, our demonstration showcases OSS-UAgent's practical application in evaluating graph analytics platforms, highlighting its effectiveness in automating usability evaluation.

cs.SE↗

arXiv2025

SoK: Dataset Copyright Auditing in Machine Learning Systems

As the implementation of machine learning (ML) systems becomes more widespread, especially with the introduction of larger ML models, we perceive a spring demand for massive data. However, it inevitably causes infringement and misuse problems with the data, such as using unauthorized online artworks or face images to train ML models. To address this problem, many efforts have been made to audit the copyright of the model training dataset. However, existing solutions vary in auditing assumptions and capabilities, making it difficult to compare their strengths and weaknesses. In addition, robustness evaluations usually consider only part of the ML pipeline and hardly reflect the performance of algorithms in real-world ML applications. Thus, it is essential to take a practical deployment perspective on the current dataset copyright auditing tools, examining their effectiveness and limitations. Concretely, we categorize dataset copyright auditing research into two prominent strands: intrusive methods and non-intrusive methods, depending on whether they require modifications to the original dataset. Then, we break down the intrusive methods into different watermark injection options and examine the non-intrusive methods using various fingerprints. To summarize our results, we offer detailed reference tables, highlight key points, and pinpoint unresolved issues in the current literature. By combining the pipeline in ML systems and analyzing previous studies, we highlight several future directions to make auditing tools more suitable for real-world copyright protection requirements.

cs.CR↗

arXiv2025

Optimizing Large Language Model Training Using FP4 Quantization

The growing computational demands of training large language models (LLMs) necessitate more efficient methods. Quantized training presents a promising solution by enabling low-bit arithmetic operations to reduce these costs. While FP8 precision has demonstrated feasibility, leveraging FP4 remains a challenge due to significant quantization errors and limited representational capacity. This work introduces the first FP4 training framework for LLMs, addressing these challenges with two key innovations: a differentiable quantization estimator for precise weight updates and an outlier clamping and compensation strategy to prevent activation collapse. To ensure stability, the framework integrates a mixed-precision training scheme and vector-wise quantization. Experimental results demonstrate that our FP4 framework achieves accuracy comparable to BF16 and FP8, with minimal degradation, scaling effectively to 13B-parameter LLMs trained on up to 100B tokens. With the emergence of next-generation hardware supporting FP4, our framework sets a foundation for efficient ultra-low precision training.

cs.LG↗

arXiv2025

Beyond Prompt Content: Enhancing LLM Performance via Content-Format Integrated Prompt Optimization

Large Language Models (LLMs) have shown significant capability across various tasks, with their real-world effectiveness often driven by prompt design. While recent research has focused on optimizing prompt content, the role of prompt formatting, a critical but often overlooked dimension, has received limited systematic investigation. In this paper, we introduce Content-Format Integrated Prompt Optimization (CFPO), an innovative methodology that jointly optimizes both prompt content and formatting through an iterative refinement process. CFPO leverages natural language mutations to explore content variations and employs a dynamic format exploration strategy that systematically evaluates diverse format options. Our extensive evaluations across multiple tasks and open-source LLMs demonstrate that CFPO demonstrates measurable performance improvements compared to content-only optimization methods. This highlights the importance of integrated content-format optimization and offers a practical, model-agnostic approach to enhancing LLM performance. Code is available at https://github.com/HenryLau7/CFPO.

cs.CL↗

arXiv2025

Velocitune: A Velocity-based Dynamic Domain Reweighting Method for Continual Pre-training

It is well-known that a diverse corpus is critical for training large language models, which are typically constructed from a mixture of various domains. In general, previous efforts resort to sampling training data from different domains with static proportions, as well as adjusting data proportions during training. However, few methods have addressed the complexities of domain-adaptive continual pre-training. To fill this gap, we propose Velocitune, a novel framework dynamically assesses learning velocity and adjusts data proportions accordingly, favoring slower-learning domains while shunning faster-learning ones, which is guided by a scaling law to indicate the desired learning goal for each domain with less associated cost. To evaluate the effectiveness of Velocitune, we conduct experiments in a reasoning-focused dataset with CodeLlama, as well as in a corpus specialised for system command generation with Llama3 and Mistral. Velocitune achieves performance gains in both math and code reasoning tasks and command-line generation benchmarks. Further analysis reveals that key factors driving Velocitune's effectiveness include target loss prediction and data ordering.

cs.CL↗