Weighted tensor decomposition for approximate decoupling of multivariate polynomials
Gabriel Hollander, Philippe Dreesen, Mariya Ishteva, Johan, Schoukens

TL;DR
This paper introduces a weighted tensor decomposition method for approximate decoupling of multivariate polynomials, extending existing techniques to handle noisy data and improving system identification accuracy.
Contribution
It generalizes tensor-based polynomial decoupling to noisy scenarios by incorporating a weight factor, enhancing practical applicability.
Findings
Smaller model errors in system identification
Effective handling of noisy polynomial data
Improved tensor decomposition accuracy
Abstract
Multivariate polynomials arise in many different disciplines. Representing such a polynomial as a vector of univariate polynomials can offer useful insight, as well as more intuitive understanding. For this, techniques based on tensor methods are known, but these have only been studied in the exact case. In this paper, we generalize an existing method to the noisy case, by introducing a weight factor in the tensor decomposition. Finally, we apply the proposed weighted decoupling algorithm in the domain of system identification, and observe smaller model errors.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsTensor decomposition and applications · Power System Optimization and Stability · Model Reduction and Neural Networks
