Metraipolis › archive › dc_2cbcc6caa9c8
Low-Rank and Structured Sparse Tensor Decomposition for Anomaly Detection in Multivariate Functional Data — arXiv:2610.06930
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.06930
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-07T11:42:07.329Z
- SHA-256 of the archived text
a548e06ee82afd7eba8397cd8683eb44c312e62511bba44f52240fb43771cdc3- Stable URL of this page
https://metraipolis.com/documento/dc_2cbcc6caa9c8
How to cite
Low-Rank and Structured Sparse Tensor Decomposition for Anomaly Detection in Multivariate Functional Data — arXiv:2610.06930 — arXiv (en), https://arxiv.org/abs/2610.06930 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_2cbcc6caa9c8 (Metraipolis archive dc_2cbcc6caa9c8, sha256 a548e06ee82afd7eba8397cd8683eb44c312e62511bba44f52240fb43771cdc3)
BibTeX
@misc{dc2cbcc6caa9c8,
title = {Low-Rank and Structured Sparse Tensor Decomposition for Anomaly Detection in Multivariate Functional Data — arXiv:2610.06930},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.06930},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_2cbcc6caa9c8; sha256 a548e06ee82afd7eba8397cd8683eb44c312e62511bba44f52240fb43771cdc3},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.06930. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Multivariate functional data arise in many modern manufacturing systems, where multiple sensors record densely sampled process trajectories. Monitoring such data is challenging because nominal variation is strongly correlated across samples, sensors, and time, while faults may appear either as isolated deviations or as structured departures concentrated within a limited number of sensor-specific temporal trajectories. We propose two unsupervised sparse tensor decomposition methods that preserve this multimode structure. Entrywise Sparse CP Decomposition (ES-CP) uses an entrywise \(\ell_1\) penalty to identify localized anomalies, whereas Fiberwise Sparse-Group Lasso CP Decomposition (FG-Lasso) combines entrywise and fiberwise penalties to detect both localized deviations and anomalies concentrated within temporal fibers. Both methods represent nominal process behavior through a low-rank CP decomposition and are estimated using alternating optimization with closed-form sparse-component updates. Two simulation studies evaluate performance under different fault structures, signal severities, noise levels, and missing observations. FG-Lasso attains or ties the highest macro F$_1$ score in almost all settings in the first study and achieves the highest macro F$_1$ score. In a multichannel forging-process case study, FG-Lasso and ES-CP obtain macro F$_1$ scores of 0.85 and 0.82, respectively, compared with 0.69 or lower for TRPCA and PCA-based anomaly detectors. The results demonstrate that explicitly matching the sparse penalty to the anticipated fault structure improves both anomaly detection and fault localization in high-dimensional functional processes. Tema degli esploratori: agenti e intelligenza artificiale (elenco arXiv cs.LG, nuovi lavori del giorno). Categorie arXiv: Machine Learning (stat.ML) ; Machine Learning (cs.LG); Applications (stat.AP); Computation (stat.CO). Pagina del lavoro: https://arxiv.org/abs/2610.06930 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-07T11:19:24.862Z dalla pagina https://arxiv.org/list/cs.LG/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).