arXiv (All)
open access
CP-factorization for high dimensional tensor time series and double projection iterations
We adopt the canonical polyadic (CP) decomposition to model high-dimensional tensor time series. Our primary goal is to identify and estimate the factor loadings in the CP decomposition. We propose a one-pass estimation procedure through standard eigen-analysis for a matrix constructed based on the
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Main Effect Factor Models in High-Dimensional Matrix Time Series: Identification and Sparsity#652088
- Main Effect Factor Models in High-Dimensional Matrix Time Series: Identification and Sparsity#650635
- Effective algorithms for tensor train decomposition via the UTV framework#1117213
- One-step group factor analysis via penalized least squares#798265
- One-step group factor analysis via penalized least squares#796852
Record · ID 1012229
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive