arXiv subjects

Peng Yang

Publications and source records attributed to Peng Yang.

At least 73 records · Page 4Linked to original sources

arXiv2025

From Observations to Parameters: Detecting Changepoint in Nonlinear Dynamics with Simulation-based Inference

Detecting regime shifts in chaotic time series is hard because observation-space signals are entangled with intrinsic variability. We propose Parameter--Space Changepoint Detection (Param--CPD), a two--stage framework that first amortizes Bayesian inference of governing parameters with a neural posterior estimator trained by simulation-based inference, and then applies a standard CPD algorithm to the resulting parameter trajectory. On Lorenz--63 with piecewise-constant parameters, Param--CPD improves F1, reduces localization error, and lowers false positives compared to observation--space baselines. We further verify identifiability and calibration of the inferred posteriors on stationary trajectories, explaining why parameter space offers a cleaner detection signal. Robustness analyses over tolerance, window length, and noise indicate consistent gains. Our results show that operating in a physically interpretable parameter space enables accurate and interpretable changepoint detection in nonlinear dynamical systems.

cs.LG↗

arXiv2025

Dynamical random field Ising model at zero temperature

In this paper, we study the evolution of the zero-temperature random field Ising model as the mean of the external field $M$ increases from $-\infty$ to $\infty$. We focus on two types of evolutions: the ground state evolution and the Glauber evolution. For the ground state evolution, we investigate the occurrence of global avalanche, a moment where a large fraction of spins flip simultaneously from minus to plus. In two dimensions, no global avalanche occurs, while in three or higher dimensions, there is a phase transition: a global avalanche happens when the noise intensity is small, but not when it is large. Additionally, we study the zero-temperature Glauber evolution, where spins are updated locally to minimize the Hamiltonian. Our results show that for small noise intensity, in dimensions $d =2$ or $3$, most spins flip around a critical time $c_d = \frac{2 \sqrt{d}}{1 + \sqrt{d}}$ (but we cannot decide whether such flipping occurs simultaneously or not). We also connect this process to polluted bootstrap percolation and solve an open problem on it.

math.PR↗

arXiv2025

Adaptive Subarray Segmentation: A New Paradigm of Spatial Non-Stationary Near-Field Channel Estimation for XL-MIMO Systems

To address the complexities of spatial non-stationary (SnS) effects and spherical wave propagation in near-field channel estimation (CE) for extremely large-scale multiple-input multiple-output (XL-MIMO) systems, this paper proposes an SnS-aware CE framework based on adaptive subarray partitioning. We first investigate spherical wave propagation and various SnS characteristics and construct an SnS near-field channel model for XL-MIMO systems. Due to the limitations of uniform array partitioning in capturing SnS, we analyze the adverse effects of the non-ideal array segmentation (over- and under-segmentation) on CE accuracy. To counter these issues, we develop a dynamic hybrid beamforming-assisted power-based subarray segmentation paradigm (DHBF-PSSP), which integrates power measurements with a dynamic hybrid beamforming structure to enable joint subarray partitioning and decoupling. A power-adaptive subarray segmentation (PASS) algorithm leverages the statistical properties of power profiles, while subarray decoupling is achieved via a subarray segmentation-based sampling method (SS-SM) under radio frequency (RF) chain constraints. For subarray CE, we propose a subarray segmentation-based assorted block sparse Bayesian learning algorithm under the multiple measurement vectors framework (SS-ABSBL-MMV). This algorithm exploits angular-domain block sparsity under a discrete Fourier transform (DFT) codebook and inter-subcarrier structured sparsity. Simulation results confirm that the proposed framework outperforms existing methods in CE performance.

eess.SP↗

arXiv2025

Adapting Segment Anything Model for Power Transmission Corridor Hazard Segmentation

Power transmission corridor hazard segmentation (PTCHS) aims to separate transmission equipment and surrounding hazards from complex background, conveying great significance to maintaining electric power transmission safety. Recently, the Segment Anything Model (SAM) has emerged as a foundational vision model and pushed the boundaries of segmentation tasks. However, SAM struggles to deal with the target objects in complex transmission corridor scenario, especially those with fine structure. In this paper, we propose ELE-SAM, adapting SAM for the PTCHS task. Technically, we develop a Context-Aware Prompt Adapter to achieve better prompt tokens via incorporating global-local features and focusing more on key regions. Subsequently, to tackle the hazard objects with fine structure in complex background, we design a High-Fidelity Mask Decoder by leveraging multi-granularity mask features and then scaling them to a higher resolution. Moreover, to train ELE-SAM and advance this field, we construct the ELE-40K benchmark, the first large-scale and real-world dataset for PTCHS including 44,094 image-mask pairs. Experimental results for ELE-40K demonstrate the superior performance that ELE-SAM outperforms the baseline model with the average 16.8% mIoU and 20.6% mBIoU performance improvement. Moreover, compared with the state-of-the-art method on HQSeg-44K, the average 2.9% mIoU and 3.8% mBIoU absolute improvements further validate the effectiveness of our method on high-quality generic object segmentation. The source code and dataset are available at https://github.com/Hhaizee/ELE-SAM.

cs.CV↗

arXiv2025

Dissipation induced elastic-mode instability with topological excitation in holographic non-equilibrium steady cnoidal wave supersolid

The possible existence of an exotic phase of matter rigid like a solid but able to sustain persistent and dissipation-less flow like a superfluid, a "supersolid", has been the subject of intense theoretical and experimental efforts since the discovery of superfluidity in Helium-4. Recently, it has been proposed that nonlinear periodic modulations known as cnoidal waves, that naturally emerge in Bose-Einstein condensates, provide a promising platform to find and study supersolidity in non-equilibrium phases of matter. Nevertheless, so far the analysis has been limited to a one-dimensional zero-temperature system. By combining the dissipative Gross-Pitaevskii equation with a finite temperature holographic model, we show that the proposed cnoidal wave supersolid phases of matter are dynamically unstable at finite temperature. We ascribe this instability to the dynamics of the "elastic" Goldstone mode, which arises as a direct consequence of translational order in the presence of dissipation, and establish a direct connection between the elastic-mode instability of the supersolid state and the nucleation of topological excitations during the relaxation towards a homogeneous equilibrium state, which resembles the Landau instability in superfluids. Finally, we numerically confirm the dominant role of the elastic-mode instability in the collision between cnoidal waves in the strong dissipation limit.

cond-mat.quant-gas↗

arXiv2025

Step-Audio-EditX Technical Report

We present Step-Audio-EditX, the first open-source LLM-based audio model excelling at expressive and iterative audio editing encompassing emotion, speaking style, and paralinguistics alongside robust zero-shot text-to-speech (TTS) capabilities. Our core innovation lies in leveraging only large-margin synthetic data, which circumvents the need for embedding-based priors or auxiliary modules. This large-margin learning approach enables both iterative control and high expressivity across voices, and represents a fundamental pivot from the conventional focus on representation-level disentanglement. Evaluation results demonstrate that Step-Audio-EditX surpasses both MiniMax-2.6-hd and Doubao-Seed-TTS-2.0 in emotion editing and other fine-grained control tasks.

cs.CL↗

arXiv2025

Evolving Generalizable Parallel Algorithm Portfolios for Binary Optimization Problems via Domain-Agnostic Instance Generation

Generalization is the core objective when training optimizers from data. However, limited training instances often constrain the generalization capability of the trained optimizers. Co-evolutionary approaches address this challenge by simultaneously evolving a parallel algorithm portfolio (PAP) and an instance population to eventually obtain PAPs with good generalization. Yet, when applied to a specific problem class, these approaches have a major limitation. They require practitioners to provide instance generators specially tailored to the problem class, which is often non-trivial to design. This work proposes a general-purpose, off-the-shelf PAP construction approach, named domain-agnostic co-evolution of parameterized search (DACE), for binary optimization problems where decision variables take values of 0 or 1. The key novelty of DACE lies in its neural network-based domain-agnostic instance representation and generation mechanism that eliminates the need for domain-specific instance generators. The strong generality of DACE is validated across three real-world binary optimization problems: the complementary influence maximization problem (CIMP), the compiler arguments optimization problem (CAOP), and the contamination control problem (CCP). Given only a small set of training instances from these problem classes, DACE, without requiring domain knowledge, constructs PAPs with even better generalization performance than existing approaches on all three classes, despite their use of domain-specific instance generators.

cs.NE↗

arXiv2025

Detecting Multilevel Manipulation from Limit Order Book via Cascaded Contrastive Representation Learning

Trade-based manipulation (TBM) undermines the fairness and stability of financial markets drastically. Spoofing, one of the most covert and deceptive TBM strategies, exhibits complex anomaly patterns across multilevel prices, while often being simplified as a single-level manipulation. These patterns are usually concealed within the rich, hierarchical information of the Limit Order Book (LOB), which is challenging to leverage due to high dimensionality and noise. To address this, we propose a representation learning framework combining a cascaded LOB representation architecture with supervised contrastive learning. Extensive experiments demonstrate that our framework consistently improves detection performance across diverse models, with Transformer-based architectures achieving state-of-the-art results. In addition, we conduct systematic analyses and ablation studies to investigate multilevel manipulation and the contributions of key components for detection, offering broader insights into representation learning and anomaly detection for complex time series data.

q-fin.CP↗

arXiv2025

Interactions between syn-rift magmatism and tectonic extension at intermediate rifted margins

Intermediate rifted margins exhibit neither seaward dipping reflectors nor exhumed mantle at the continent-ocean transition (COT). Instead, they transition into normal-thickness, magmatic Penrose-type oceanic crust, and thus diverge from the classic magma-rich and magma-poor end-member models. However, several intermediate margins, such as the South China Sea (SCS), display detachment faulting similar to magma-poor margins and magmatic underplating typical of magma-rich ones. How tectonics and magmatism interact in these intermediate environments is poorly understood. Here we use 2D numerical models to demonstrate that the elevated initial geotherm inherited from prior plate subduction in the SCS explains several key observations: an early phase of wide rifting, subsequent localization onto core complexes with substantial footwall magmatic intrusions, and eventual formation of normal igneous oceanic crust at break-up. Thermal weakening caused by syn-rift footwall magmatic intrusions facilitates lower crustal ductile flow, promoting the development of rolling-hinge type detachment faults and exhumation of core complexes. These structures are associated with accelerated tectonic subsidence, which is later moderated by detachment-related doming, as observed in the SCS. Normal-thickness oceanic crust occurs after break-up, even under ultra-slow extension rates used in our simulations, highlighting the importance of inheritance in determining margin architecture, the spatio-temporal distribution of syn-rift magmatism, and the nature of the COT. This behavior contrasts sharply with magma-poor margins, where a cooler lithosphere and similar ultra-slow extension produce no syn-rift magmatism, leading instead to crustal embrittlement, mantle serpentinization and exhumation at the COT.

physics.geo-ph↗

arXiv2025

On the Dolbeault Cohomology of Configuration Spaces

We compute the Dolbeault cohomology ring of the configuration spaces of $\mathbb{C}^n$ and construct a spectral sequence that converges to the Dolbeault cohomology ring of the configuration spaces of an arbitrary complex manifold.

math.AT↗

arXiv2025

RNDiff: Rainfall nowcasting with Condition Diffusion Model

Diffusion models are widely used in image generation because they can generate high-quality and realistic samples. This is in contrast to generative adversarial networks (GANs) and variational autoencoders (VAEs), which have some limitations in terms of image quality.We introduce the diffusion model to the precipitation forecasting task and propose a short-term precipitation nowcasting with condition diffusion model based on historical observational data, which is referred to as SRNDiff. By incorporating an additional conditional decoder module in the denoising process, SRNDiff achieves end-to-end conditional rainfall prediction. SRNDiff is composed of two networks: a denoising network and a conditional Encoder network. The conditional network is composed of multiple independent UNet networks. These networks extract conditional feature maps at different resolutions, providing accurate conditional information that guides the diffusion model for conditional generation.SRNDiff surpasses GANs in terms of prediction accuracy, although it requires more computational resources.The SRNDiff model exhibits higher stability and efficiency during training than GANs-based approaches, and generates high-quality precipitation distribution samples that better reflect future actual precipitation conditions. This fully validates the advantages and potential of diffusion models in precipitation forecasting, providing new insights for enhancing rainfall prediction.

cs.CV↗

arXiv2025

QoE-Aware Service Provision for Mobile AR Rendering: An Agent-Driven Approach

Mobile augmented reality (MAR) is envisioned as a key immersive application in 6G, enabling virtual content rendering aligned with the physical environment through device pose estimation. In this paper, we propose a novel agent-driven communication service provisioning approach for edge-assisted MAR, aiming to reduce communication overhead between MAR devices and the edge server while ensuring the quality of experience (QoE). First, to address the inaccessibility of MAR application-specific information to the network controller, we establish a digital agent powered by large language models (LLMs) on behalf of the MAR service provider, bridging the data and function gap between the MAR service and network domains. Second, to cope with the user-dependent and dynamic nature of data traffic patterns for individual devices, we develop a user-level QoE modeling method that captures the relationship between communication resource demands and perceived user QoE, enabling personalized, agent-driven communication resource management. Trace-driven simulation results demonstrate that the proposed approach outperforms conventional LLM-based QoE-aware service provisioning methods in both user-level QoE modeling accuracy and communication resource efficiency.

cs.NI↗

arXiv2025

Rationale-guided Prompting for Knowledge-based Visual Question Answering

Recently, Large Language Models (LLMs) have been used for knowledge-based Visual Question Answering (VQA). Despite the encouraging results of previous studies, prior methods prompt LLMs to predict answers directly, neglecting intermediate thought processes. We argue that prior methods do not sufficiently activate the capacities of LLMs. We propose a framework called PLRH that Prompts LLMs with Rationale Heuristics for knowledge-based VQA. The PLRH prompts LLMs with Chain of Thought (CoT) to generate rationale heuristics, i.e., intermediate thought processes, and then leverages the rationale heuristics to inspire LLMs to predict answers. Experiments show that our approach outperforms the existing baselines by more than 2.2 and 2.1 on OK-VQA and A-OKVQA, respectively.

cs.CL↗

arXiv2025

Multi-Agents Based on Large Language Models for Knowledge-based Visual Question Answering

Large Language Models (LLMs) have achieved impressive results in knowledge-based Visual Question Answering (VQA). However existing methods still have challenges: the inability to use external tools autonomously, and the inability to work in teams. Humans tend to know whether they need to use external tools when they encounter a new question, e.g., they tend to be able to give a direct answer to a familiar question, whereas they tend to use tools such as search engines when they encounter an unfamiliar question. In addition, humans also tend to collaborate and discuss with others to get better answers. Inspired by this, we propose the multi-agent voting framework. We design three LLM-based agents that simulate different levels of staff in a team, and assign the available tools according to the levels. Each agent provides the corresponding answer, and finally all the answers provided by the agents are voted to get the final answer. Experiments on OK-VQA and A-OKVQA show that our approach outperforms other baselines by 2.2 and 1.0, respectively.

cs.CL↗

arXiv2025

Learning from Expert Factors: Trajectory-level Reward Shaping for Formulaic Alpha Mining

Reinforcement learning (RL) has successfully automated the complex process of mining formulaic alpha factors, for creating interpretable and profitable investment strategies. However, existing methods are hampered by the sparse rewards given the underlying Markov Decision Process. This inefficiency limits the exploration of the vast symbolic search space and destabilizes the training process. To address this, Trajectory-level Reward Shaping (TLRS), a novel reward shaping method, is proposed. TLRS provides dense, intermediate rewards by measuring the subsequence-level similarity between partially generated expressions and a set of expert-designed formulas. Furthermore, a reward centering mechanism is introduced to reduce training variance. Extensive experiments on six major Chinese and U.S. stock indices show that TLRS significantly improves the predictive power of mined factors, boosting the Rank Information Coefficient by 9.29% over existing potential-based shaping algorithms. Notably, TLRS achieves a major leap in computational efficiency by reducing its time complexity with respect to the feature dimension from linear to constant, which is a significant improvement over distance-based baselines.

cs.LG↗

arXiv2025

Federated Learning in Active STARS-Aided Uplink Networks

Active simultaneously transmitting and reflecting surfaces (ASTARS) have attracted growing research interest due to its ability to alleviate multiplicative fading and reshape the electromagnetic environment across the entire space. In this paper, we utilise ASTARS to assist the federated learning (FL) uplink model transfer and further reduce the number of uploaded parameter counts through over-the-air (OTA) computing techniques. The impact of model aggregation errors on ASTARS-aided FL uplink networks is characterized. We derive an upper bound on the aggregation error of the OTA-FL model and quantify the training loss due to communication errors. Then, we define the performance of OTA-FL as a joint optimization problem that encompasses both the assignment of received beams and the phase shifting of ASTARS, aiming to achieve the maximum learning efficiency and high-quality signal transmission. Numerical results demonstrate that: i) The FL accuracy in ASTARS uplink networks are enhanced compared to that in state-of-the-art networks; ii) The ASTARS enabled FL system achieves the better learning accuracy using fewer active units than other baseline, especially when the dataset is more discrete; and iii) FL accuracy improves with higher amplification power, but excessive amplification makes thermal noise the dominant source of error.

eess.SP↗

arXiv2025

Alleviating Non-identifiability: a High-fidelity Calibration Objective for Financial Market Simulation with Multivariate Time Series Data

The non-identifiability issue has been frequently reported in social simulation works, where different parameters of an agent-based simulation model yield indistinguishable simulated time series data under certain discrepancy metrics. This issue largely undermines the simulation fidelity yet lacks dedicated investigations. This paper theoretically demonstrates that incorporating multiple time series data features during the model calibration phase can exponentially alleviate non-identifiability as the number of features increases. To implement this theoretical finding, a maximization-based aggregation function is proposed based on existing discrepancy metrics to form a new calibration objective function. For verification, the task of calibrating the Financial Market Simulation (FMS), a typical yet complex social simulation, is considered. Empirical studies confirm the significant improvements in alleviating the non-identifiability of calibration tasks. Furthermore, as a model-agnostic method, it achieves much higher simulation fidelity of the chosen FMS model on both synthetic and real market data. Moreover, it is both theoretically and empirically analyzed that as long as the features are selected and not linearly correlated, they can contribute to alleviation, which demonstrates the robustness of the proposed objective. Hence, this work is expected to provide not only a rigorous understanding of non-identifiability in social simulation but also an off-the-shelf high-fidelity calibration objective function for FMS.

q-fin.CP↗

arXiv2025

QuantFactor REINFORCE: Mining Steady Formulaic Alpha Factors with Variance-bounded REINFORCE

Alpha factor mining aims to discover investment signals from the historical financial market data, which can be used to predict asset returns and gain excess profits. Powerful deep learning methods for alpha factor mining lack interpretability, making them unacceptable in the risk-sensitive real markets. Formulaic alpha factors are preferred for their interpretability, while the search space is complex and powerful explorative methods are urged. Recently, a promising framework is proposed for generating formulaic alpha factors using deep reinforcement learning, and quickly gained research focuses from both academia and industries. This paper first argues that the originally employed policy training method, i.e., Proximal Policy Optimization (PPO), faces several important issues in the context of alpha factors mining. Herein, a novel reinforcement learning algorithm based on the well-known REINFORCE algorithm is proposed. REINFORCE employs Monte Carlo sampling to estimate the policy gradient-yielding unbiased but high variance estimates. The minimal environmental variability inherent in the underlying state transition function, which adheres to the Dirac distribution, can help alleviate this high variance issue, making REINFORCE algorithm more appropriate than PPO. A new dedicated baseline is designed to theoretically reduce the commonly suffered high variance of REINFORCE. Moreover, the information ratio is introduced as a reward shaping mechanism to encourage the generation of steady alpha factors that can better adapt to changes in market volatility. Evaluations on real assets data indicate the proposed algorithm boosts correlation with returns by 3.83\%, and a stronger ability to obtain excess returns compared to the latest alpha factors mining methods, which meets the theoretical results well.

q-fin.CP↗