arXiv (All)
open access
Heteroskedastic Canonical Polyadic Tensor Decomposition
When minimizing the squared-error loss, the popular CP decomposition can be interpreted as parameter inference in a Gaussian model with a low-rank mean tensor and constant variance across the tensor entries. We introduce heteroskedastic-CP (HCP), which models entrywise variability with a non-constan
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
- CP-factorization for high dimensional tensor time series and double projection iterations#1012229
- Casewise and Cellwise Robust Tensor-on-Tensor Regression#1156310
- 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
- Robust low-rank tensor completion via factorized weighted tensor schatten-p norm minimization#1083759
Record · ID 1155433
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