paper-with-me

Papers

Pulling Back Theorem for Generalizing the Diagonal Averaging Principle in Symplectic Geometry Mode Decomposition and Singular Spectrum Analysis

2025-03-12 · Hong-Yan Zhang, Haoting Liu, Zhi-Qiang Feng, Ci-Fei Dong, Rui-Jia Lin, Yu Zhou, Fu-Yun Li

The symplectic geometry mode decomposition (SGMD) is a powerful method for analyzing time sequences. The SGMD is based on the upper conversion via embedding and down conversion via diagonal averaging principle (DAP) inherited from the singular spectrum analysis (SSA). However, there are two defects in the DAP: it just hold for the time delay $\tau=1$ in the trajectory matrix and it fails for the time sequence of type-1 with the form $X=\{x[n]\}^N_{n=1}$. In order to overcome these disadvantages, the inverse step for embedding is explored with binary Diophantine equation in number theory. The contributions of this work lie in three aspects: firstly, the pulling back theorem is proposed and proved, which state the general formula for converting the component of trajectory matrix to the component of time sequence for the general representation of time sequence and for any time delay $\tau\ge 1$; secondly a unified framework for decomposing both the deterministic and random time sequences into multiple modes is presented and explained; finally, the guidance of configuring the time delay is suggested, namely the time delay should be selected in a limited range via balancing the efficiency of matrix computation and accuracy of state estimation. It could be expected that the pulling back theorem will help the researchers and engineers to deepen the understanding of the theory and extend the applications of the SGMD and SSA in analyzing time sequences.

📄 PDF Abstract BibTeX arXiv:2503.09584

Code (0)

등록된 구현이 없습니다.

Tasks

State Estimation

Similar Papers 제목 키워드 기반

A networked small-gain theorem based on discrete-time diagonal stability

2024-11-05 · Ron Ofir, Michael Margaliot

We present a new sufficient condition for finite-gain $L_2$ input-to-output stability of a networked system. The condition requires a matrix, that combines information on the $L_2$ gains of the sub-systems and their inte…

Diagonal Symmetrization of Neural Network Solvers for the Many-Electron Schrödinger Equation

2025-02-07 · Kevin Han Huang, Ni Zhan, Elif Ertekin, Peter Orbanz 외

Incorporating group symmetries into neural networks has been a cornerstone of success in many AI-for-science applications. Diagonal groups of isometries, which describe the invariance under a simultaneous movement of mul…

Data AugmentationVariational Monte Carlo

Convergence Rates of Stochastic Gradient Descent under Infinite Noise Variance

2021-02-20 · NeurIPS 2021 12 · Hongjian Wang, Mert Gürbüzbalaban, Lingjiong Zhu, Umut Şimşekli 외

Recent studies have provided both empirical and theoretical evidence illustrating that heavy tails can emerge in stochastic gradient descent (SGD) in various scenarios. Such heavy tails potentially result in iterates wit…

Virtual Contraction Approach to Decentralized Adaptive Stabilization of Nonlinear Time-Delayed Networks

2025-04-15 · Yu Kawano, Zhiyong Sun

In this paper, we utilize a diagonally dominant structure for the decentralized stabilization of unknown nonlinear time-delayed networks. Generalizing the idea of virtual contraction analysis to time-delayed systems, we …

Efficient methods for determining folding free energies in single-molecule pulling experiments

2019-12-12

The remarkable accuracy and versatility of single-molecule techniques make possible new measurements that are not feasible in bulk assays. Among these, the precise estimation of folding free energies using fluctuation th…