Localized Sparse Principal Component Analysis of Multivariate Time Series in Frequency Domain

• URL: http://arxiv.org/abs/2408.08177v1
• Date: Thu, 15 Aug 2024 14:30:34 GMT
• Title: Localized Sparse Principal Component Analysis of Multivariate Time Series in Frequency Domain
• Authors: Jamshid Namdari, Amita Manatunga, Fabio Ferrarelli, Robert Krafty,
• Abstract summary: We introduce a formulation and consistent estimation procedure for interpretable principal component analysis for high-dimensional time series in the frequency domain. An efficient frequency-sequential algorithm is developed to compute sparse-localized estimates of the low-dimensional principal subspaces of the signal process.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Principal component analysis has been a main tool in multivariate analysis for estimating a low dimensional linear subspace that explains most of the variability in the data. However, in high-dimensional regimes, naive estimates of the principal loadings are not consistent and difficult to interpret. In the context of time series, principal component analysis of spectral density matrices can provide valuable, parsimonious information about the behavior of the underlying process, particularly if the principal components are interpretable in that they are sparse in coordinates and localized in frequency bands. In this paper, we introduce a formulation and consistent estimation procedure for interpretable principal component analysis for high-dimensional time series in the frequency domain. An efficient frequency-sequential algorithm is developed to compute sparse-localized estimates of the low-dimensional principal subspaces of the signal process. The method is motivated by and used to understand neurological mechanisms from high-density resting-state EEG in a study of first episode psychosis.

Related papers

• Frequency-domain alignment of heterogeneous, multidimensional separations data through complex orthogonal Procrustes analysis [0.0]
  Multidimensional separations data have the capacity to reveal detailed information about complex biological samples. Data analysis has been an ongoing challenge in the area since the peaks that represent chemical factors may drift over the course of several analytical runs. This work offers a very simple solution to the alignment problem through a Procrustes analysis of the frequency-domain representation of synthetic multidimensional separations data.
  arXiv  Detail & Related papers  (2025-02-18T12:14:14Z)
• Spectral Estimators for Multi-Index Models: Precise Asymptotics and Optimal Weak Recovery [21.414505380263016]
  We focus on recovering the subspace spanned by the signals via spectral estimators. Our main technical contribution is a precise characterization of the performance of spectral methods. Our analysis unveils a phase transition phenomenon in which, as the sample complexity grows, eigenvalues escape from the bulk of the spectrum.
  arXiv  Detail & Related papers  (2025-02-03T18:08:30Z)
• Estimating the Spectral Moments of the Kernel Integral Operator from Finite Sample Matrices [16.331196225467707]
  We introduce a novel algorithm that provides unbiased estimates of the spectral moments of the kernel integral operator in the limit of infinite inputs and features. Our method, based on dynamic programming, is efficient and capable of estimating the moments of the operator spectrum.
  arXiv  Detail & Related papers  (2024-10-23T16:12:59Z)
• Supervised low-rank semi-nonnegative matrix factorization with frequency regularization for forecasting spatio-temporal data [6.725792598352138]
  We propose a methodology for forecasting-temporal data using supervised semi-nonnegative matrix factorization (SMF) with frequency regularization. We find that the results with the proposed methodology are comparable to previous research in the field of geophysical sciences but offer clearer interpretability.
  arXiv  Detail & Related papers  (2023-11-15T01:23:13Z)
• Provably Accelerating Ill-Conditioned Low-rank Estimation via Scaled Gradient Descent, Even with Overparameterization [48.65416821017865]
  This chapter introduces a new algorithmic approach, dubbed scaled gradient (ScaledGD) It converges linearly at a constant rate independent of the condition number of the low-rank object. It maintains the low periteration cost of gradient descent for a variety of tasks.
  arXiv  Detail & Related papers  (2023-10-09T21:16:57Z)
• Digital noise spectroscopy with a quantum sensor [57.53000001488777]
  We introduce and experimentally demonstrate a quantum sensing protocol to sample and reconstruct the auto-correlation of a noise process. Walsh noise spectroscopy method exploits simple sequences of spin-flip pulses to generate a complete basis of digital filters. We experimentally reconstruct the auto-correlation function of the effective magnetic field produced by the nuclear-spin bath on the electronic spin of a single nitrogen-vacancy center in diamond.
  arXiv  Detail & Related papers  (2022-12-19T02:19:35Z)
• Quantum Algorithms for Data Representation and Analysis [68.754953879193]
  We provide quantum procedures that speed-up the solution of eigenproblems for data representation in machine learning. The power and practical use of these subroutines is shown through new quantum algorithms, sublinear in the input matrix's size, for principal component analysis, correspondence analysis, and latent semantic analysis. Results show that the run-time parameters that do not depend on the input's size are reasonable and that the error on the computed model is small, allowing for competitive classification performances.
  arXiv  Detail & Related papers  (2021-04-19T00:41:43Z)
• Minimax Estimation of Linear Functions of Eigenvectors in the Face of Small Eigen-Gaps [95.62172085878132]
  Eigenvector perturbation analysis plays a vital role in various statistical data science applications. We develop a suite of statistical theory that characterizes the perturbation of arbitrary linear functions of an unknown eigenvector. In order to mitigate a non-negligible bias issue inherent to the natural "plug-in" estimator, we develop de-biased estimators.
  arXiv  Detail & Related papers  (2021-04-07T17:55:10Z)
• Stochastically forced ensemble dynamic mode decomposition for forecasting and analysis of near-periodic systems [65.44033635330604]
  We introduce a novel load forecasting method in which observed dynamics are modeled as a forced linear system. We show that its use of intrinsic linear dynamics offers a number of desirable properties in terms of interpretability and parsimony. Results are presented for a test case using load data from an electrical grid.
  arXiv  Detail & Related papers  (2020-10-08T20:25:52Z)
• Frequency-Weighted Robust Tensor Principal Component Analysis [36.85333789033387]
  tensor singular value decomposition (t-SVD) is a popularly selected one. We incorporate frequency component analysis into t-SVD to enhance the RTPCA performance. The newly obtained frequency-weighted RTPCA can be solved by alternating direction method of multipliers.
  arXiv  Detail & Related papers  (2020-04-21T14:58:21Z)
• Optimization with Momentum: Dynamical, Control-Theoretic, and Symplectic Perspectives [97.16266088683061]
  The article rigorously establishes why symplectic discretization schemes are important for momentum-based optimization algorithms. It provides a characterization of algorithms that exhibit accelerated convergence.
  arXiv  Detail & Related papers  (2020-02-28T00:32:47Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.