Searcharxiv⌕ Search

arXiv subjects

Xiaoyu Peng

Publications and source records attributed to Xiaoyu Peng.

16 recordsLinked to original sources

Unifying Heterogeneous Dissipativity for Distributed Power-System Stability Analysis

Compositional dissipativity is attractive for large-scale interconnected systems, but its application to modern heterogeneous power systems is limited by conservative descriptions of nodal dissipativity and inefficient distributed implementation. This paper introduces a common first-order dynamic lifting of the physical voltage-current port, providing an enriched dissipativity representation that captures complementary frequency-dependent energy behavior while preserving network composability. The resulting representation accommodates heterogeneous power system buses within a unified dissipativity description and enables less conservative compositional stability analysis. A centralized stability-certification problem is then formulated and solved through a dual-guided column-generation scheme. Its matrix dual reveals the network-critical dissipation direction, which guides parallel local certificate generation toward the current system bottleneck. This leads to a distributed Network-Critical Margin Exchange (NCME) method with early stability certification. Case studies demonstrate substantially reduced conservatism of the dynamic-port formulation and improved computational and communication scalability of NCME for heterogeneous power systems.

eess.SY↗

Pervasive Vulnerability Analysis and Defense for QKD-based Quantum Private Query

Quantum Private Query (QPQ) based on Quantum Key Distribution (QKD) is among the most practically viable quantum communication protocols, with application value second only to QKD itself. However, prevalent security vulnerabilities in the post-processing stages of most existing QKD-based QPQ protocols have been severely overlooked. This study focuses on hidden information extraction under undetermined signal bits, revealing that most such QPQ protocols face severe security threats even without complex quantum resources. Specifically, direct observation attack causes incremental information leakage, while the minimum error discrimination attack efficiently steals additional database inforamtion. To address these critical flaws, the proposed multi-encryption defense scheme is compatible with existing QPQ protocols. The study demonstrates the necessity of the multi-encryption strategy for the security of databases in QPQ, providing key theoretical and technical support for constructing practical QPQ protocols resistant to real-world attacks.

quant-ph↗

When Can Phasor-Domain Device Models Be Trusted for Electromechanical Stability Analysis of Grid-Forming Converter-Dominated Microgrids?

Grid-forming (GFM) converter-dominated microgrids are often analyzed using reduced-order phasor-domain electromechanical GFM models, but the validity of these models is often taken for granted. Assuming ideal inner-loop tracking (IILT) of terminal-voltage references, these models neglect the inner-loop and filter dynamics at the electromagnetic-transient (EMT) timescale to simplify stability analysis. This paper argues that such neglected dynamics can destabilize the system, invalidating the stability conclusions drawn from the IILT model. To address this cross-timescale stability issue, we formulate the validity of the IILT stability conclusion as a robust-stability certification problem. The EMT-induced model mismatch between the reduced-order converter model and the actual converter model is represented as a structured uncertainty embedded around the IILT feedback loop. This yields a frequency-resolved interaction index and a structured singular-value sufficient certificate for determining when the stability conclusion of the IILT model can be certified with respect to a prescribed EMT uncertainty weight. The uncertainty weight can be obtained from detailed EMT models or terminal reference-response measurements. Case studies confirm that the proposed certificate correctly certifies model validity and identifies the loss of trustworthiness. We also demonstrate that the measurement-based uncertainty weights closely match the model-based ones, which enables deployment without accessing inner-loop models.

eess.SY↗

Information-Induced Conservatism Frontier of Distributed Stability Certificates

Conservatism in distributed stability certification is often treated as a limitation of the certificate itself, motivating richer Lyapunov functions, tighter relaxations, or stronger optimization. But a more fundamental limitation may arise from the reporting interface: once information is compressed, physically different systems can become indistinguishable. If stable and unstable systems produce the same report, no sound method can separate them. This paper asks where this information limit lies and how much additional information is needed to move it. We model information as an information structure that partitions admissible systems into information fibers. The strongest sound certificate for a fiber is determined by its smallest stability margin, yielding a method-independent benchmark. This separates total conservatism into information-induced and method-induced parts and characterizes information order, task sufficiency, and the stability value of additional information. Three network-node studies show that network-spectrum, scalar/eigenvalue-only passivity, and independent-local reports respectively lose network--node alignment, local directional alignment, and cross-node relation. They show that critical missing information is often relational rather than dimensional. We then move from diagnosis to information design. An information-conservatism frontier gives the smallest irreducible conservatism achievable under a prescribed budget, while its inverse gives the minimum information required for a target conservatism. A witness-pair characterization turns this into a weighted covering problem. Besides, a local sensitivity law provides a computable approximation and identifies valuable unresolved quantities. The framework indicates whether conservatism should be reduced by improving the certificate or enriching the information.

eess.SY↗

Compositional and Equilibrium-Free Stability Certification for Power Systems--Part I: Theory

Stability certification for large-scale power systems is challenging due to heterogeneous device dynamics and time-varying operating conditions. This two-part paper develops an equilibrium-free compositional framework based on local delta dissipativity. In Part I, we introduce the concept of local delta dissipativity (LDD), a localized extension of delta dissipativity in which the dissipation inequality is required only on a prescribed local state--input region, thereby relaxing the global requirement of standard delta dissipativity. Using LDD, we establish asymptotic stability with respect to an equilibrium set, rather than with respect to a single equilibrium point, and derive compositional sufficient conditions that decompose into device-level LDD certificates and a network-level coupling inequality. We further specialize the results to structure-preserving power-system models described by differential-algebraic equations, yielding equilibrium-free stability certificates that are verifiable at the device level and composable through a network constraint. Part II of this two-part paper develops the corresponding certificate computational methods and demonstrates, on modified IEEE 9-, 39-, and 118-bus systems, how the compositional theory established here enables scalable stability certification. A single-machine single-load benchmark illustrates the derived conditions and the resulting certified stability region under load variations.

eess.SY↗

Compositional and Equilibrium-Free Stability Certification for Power Systems--Part II: Algorithms and Applications

This two-part study develops a compositional and equilibrium-free framework for power system stability analysis. Building on the theoretical foundation established in Part I, i.e., local delta dissipativity (LDD), this second part translates the theory into a practical assessment tool. We address two core implementation challenges: 1) how to certify the LDD conditions for heterogeneous power device models, and 2) how to verify the network-wide coupling condition in a scalable manner. To this end, we present a method that employs Krasovskii-type storage functions to verify LDD conditions for heterogeneous power devices and applies to a wide range of nonlinear power device models. For coupling conditions, we propose an ADMM-based distributed algorithm, enhanced with a $p$-check subroutine, for interconnection verification. Our method enables three primary application scenarios that have been hindered by equilibrium-point-oriented and centralized methods: stability assessment for systems with multiple equilibria, rapid stability screening under varying operating conditions, and a privacy-preserving distributed assessment architecture for large-scale systems. Case studies on modified IEEE 9-bus, 39-bus, and 118-bus test systems demonstrate the effectiveness of the proposed methods across different network configurations and scales.

eess.SY↗

Performance Limits and Tradeoffs of Power Systems Synchronization Recovery in Complex-Frequency Representation

Power-system synchronization studies mainly ask whether synchronization can be achieved, whereas a complementary question is how well post-disturbance synchronization recovery can be shaped. In inverter-dominated systems, this recovery involves coupled phase-angle and voltage-magnitude dynamics, for which complex frequency provides a unified representation. This paper establishes a conservation law for synchronization recovery in this representation. For a given system and its initial state, the logarithmic integral of the proposed recovery residual is fixed by the initial contraction rate and the right-half-plane (RHP) zero--pole structure. Hence, synchronization recovery performance cannot be improved uniformly over frequencies and variables unless the budget set by these terms changes; controller tuning that preserves them can only redistribute the residual response across frequencies. The conservation law applies to both linear and nonlinear recovery responses satisfying the mild analyticity conditions. It further yields finite-frequency peak--bandwidth limits and a lower bound on the time-domain integral of squared complex frequency recovery. A system-level extension recovers classical Bode-type sensitivity conservation as an LTI special case. Studies on a heterogeneous IEEE 39-bus system verify the theory.

eess.SY↗

Relative-Degree Wall Restricts Passivity-Based Stability Analysis in Inverter-Dominant Grids

This letter reveals a fundamental limitation of passivity-based distributed stability analysis in power systems. Under the standard formulation, passivity certification inherently imposes a relative-degree compatibility constraint that excludes many high-fidelity inverter dynamic models (e.g., those that include electromagnetic transients). Potential extensions of passivity frameworks are discussed to break this limitation.

eess.SY↗

Positive Damping Region: A Graphic Tool for Passivization Analysis with Passivity Index

This paper presents a geometric framework for analyzing output-feedback and input-feedforward passivization of linear time-invariant systems. We reveal that a system is passivizable with a given passivity index when the Nyquist plot for SISO systems or the Rayleigh quotient of the transfer function for MIMO systems lies within a specific, index-dependent region in the complex plane, termed the positive damping region. The criteria enable a convenient graphic tool for analyzing the passivization, the associated frequency bands, the maximum achievable passivity index, and the waterbed effect between them. Additionally, the tool can be encoded into classical tools such as the Nyquist plot, the Nichols plot, and the generalized KYP lemma to aid control design. Finally, we demonstrate its application in passivity-based power system stability analysis and discuss its implications for electrical engineers regarding device controller design trade-offs.

math.OC↗

MeshTok: Efficient Multi-Scale Tokenization for Scalable PDE Transformers

Conventional patchified Transformers operate on uniform spatial partitions, distributing computational effort evenly across the domain irrespective of local features. This inflexible tokenization scheme is inherently limited in its ability to efficiently represent and process solutions to complex PDEs. To address this, we propose MeshTok, an adaptive mesh refinement (AMR)-inspired tokenization and sequence modeling framework. This method selectively refines spatial regions exhibiting sharp gradients, transient features, or multiscale structures, generating a heterogeneous set of multiscale tokens defined on a fixed simulation grid. These tokens are processed within a unified Transformer sequence, enabling the model to simultaneously capture coarse-grained global context and fine-grained local details without requiring specialized architectural components. Although adaptive refinement moderately increases token count, it promotes a more targeted allocation of computational resources to physically informative regions, which we view as a practical inductive bias rather than a formal optimality guarantee. Experimental evaluations across multiple PDE families and benchmark datasets demonstrate that MeshTok consistently improves the efficiency-accuracy trade-off compared to uniform-grid baselines. This suggests adaptive multiscale tokenization as a scalable and generalizable design principle for neural PDE modeling. Code is available at https://github.com/SCAILab-USTC/MeshTok.

cs.LG↗

Decentralized Frequency-Domain Conditions for D-Stability with Application to DC Microgrids

This paper proposes a decentralized method for regional pole placement, or $\mathcal{D}$-stability, in linearized networked systems. Existing LMI-based methods are hindered by confidentiality concerns regarding proprietary subsystem models and the absence of communication infrastructures. To overcome these barriers, we map the target region $\mathcal{D}$ of pole placement to an auxiliary left-half plane and introduce positive functions to handle the resulting complex-coefficient dynamics. We prove that $\mathcal{D}$-stability is guaranteed via local frequency-domain criteria without requiring shared subsystem models or inter-subsystem communication. This method is then tailored to DC microgrids, where a loop transformation is utilized to reallocate the burden of stability certification, deriving a broadcastable grid code for decentralized parameter synthesis. Numerical examples verify the efficacy of the proposed method.

eess.SY↗

Toward less conservative distributed stability analysis of power systems via matrix-valued differential passivity indices

Passivity indices have been widely adopted to derive distributed stability certificates for power systems. Nevertheless, conventional passivity indices remain scalar-valued even for multi-input-multi-output (MIMO) systems, which can introduce excessive conservatism and compromise analysis accuracy. To overcome these limitations, this paper extends the differential passivity index to a matrix-valued formulation that captures both channel-wise passivity properties and inter-channel coupling effects in MIMO subsystems. On this basis, semi-distributed and fully distributed stability criteria are developed for power systems with heterogeneous nonlinear devices. It is shown that system stability is guaranteed when the aggregate passivity excess of devices compensates for the passivity shortage imposed by the network. Furthermore, analytical passivity matrix expressions for typical power system components are derived, facilitating compositional stability analysis. Case studies on a three-bus system and a modified IEEE 118-bus system validate the effectiveness of the proposed framework.

eess.SY↗

Matrix-Valued Passivity Indices: Foundations, Properties, and Stability Implications

The passivity index, a quantitative measure of a system's passivity deficiency or excess, has been widely used in stability analysis and control. Existing studies mostly rely on scalar forms of indices, which are restrictive for multi-input, multi-output (MIMO) systems. This paper extends the classical scalar indices to a systematic matrix-valued framework, referred to as passivity matrices. A broad range of classical results in passivity theory can be naturally generalized in this framework. We first show that, under the matrix representation, passivity indices essentially correspond to the curvature of the dissipativity functional under a second-variation interpretation. This result reveals that the intrinsic geometric structure of passivity consists of its directions and intensities, which a scalar index cannot fully capture. For linear time-invariant (LTI) systems, we examine the structural properties of passivity matrices with respect to the Loewner partial order and propose two principled criteria for selecting representative matrices. Compared with conventional scalar indices, the matrix-valued indices capture the passivity coupling among different input-output channels in MIMO systems and provide a more comprehensive description of system passivity. This richer information leads to lower passivation effort and less conservative stability assessment.

eess.SY↗

Controlled Evolution-Based Day-Ahead Robust Dispatch Considering Frequency Security with Frequency Regulation Loads and Curtailable Loads

With the extensive integration of volatile and uncertain renewable energy, power systems face significant challenges in primary frequency regulation due to instantaneous power fluctuations. However, the maximum frequency deviation constraint is inherently non-convex, and commonly used two-stage dispatch methods overlook causality, potentially resulting in infeasible day-ahead decisions. This paper presents a controlled evolution-based day-ahead robust dispatch method to address these issues. First, we suggest the convex relaxation technique to transform the maximum frequency deviation constraint to facilitate optimization. Then, an evolution-based robust dispatch framework is introduced to align day-ahead decisions with intraday strategies, ensuring both frequency security and power supply reliability. Additionally, a novel controlled evolution-based algorithm is developed to solve this framework efficiently. Case studies on a modified IEEE 14-bus system demonstrate the superiority of the proposed method in enhancing frequency security and system reliability.

eess.SY↗

Modeling Adaptive Fine-grained Task Relatedness for Joint CTR-CVR Estimation

In modern advertising and recommender systems, multi-task learning (MTL) paradigm has been widely employed to jointly predict diverse user feedbacks (e.g. click and purchase). While, existing MTL approaches are either rigid to adapt to different scenarios, or only capture coarse-grained task relatedness, thus making it difficult to effectively transfer knowledge across tasks. To address these issues, in this paper, we propose an Adaptive Fine-grained Task Relatedness modeling approach, AdaFTR, for joint CTR-CVR estimation. Our approach is developed based on a parameter-sharing MTL architecture, and introduces a novel adaptive inter-task representation alignment method based on contrastive learning.Given an instance, the inter-task representations of the same instance are considered as positive, while the representations of another random instance are considered as negative. Furthermore, we explicitly model fine-grained task relatedness as the contrast strength (i.e. the temperature coefficient in InfoNCE loss) at the instance level. For this purpose, we build a relatedness prediction network, so that it can predict the contrast strength for inter-task representations of an instance. In this way, we can adaptively set the temperature for contrastive learning in a fine-grained way (i.e. instance level), so as to better capture task relatedness. Both offline evaluation with public e-commerce datasets and online test in a real advertising system at Alibaba have demonstrated the effectiveness of our approach.

cs.IR↗

AdaSparse: Learning Adaptively Sparse Structures for Multi-Domain Click-Through Rate Prediction

Click-through rate (CTR) prediction is a fundamental technique in recommendation and advertising systems. Recent studies have proved that learning a unified model to serve multiple domains is effective to improve the overall performance. However, it is still challenging to improve generalization across domains under limited training data, and hard to deploy current solutions due to their computational complexity. In this paper, we propose a simple yet effective framework AdaSparse for multi-domain CTR prediction, which learns adaptively sparse structure for each domain, achieving better generalization across domains with lower computational cost. In AdaSparse, we introduce domain-aware neuron-level weighting factors to measure the importance of neurons, with that for each domain our model can prune redundant neurons to improve generalization. We further add flexible sparsity regularizations to control the sparsity ratio of learned structures. Offline and online experiments show that AdaSparse outperforms previous multi-domain CTR models significantly.

cs.IR↗