System Identification Based on Tensor Decompositions: A Trilinear Approach
Bibliographic record
Abstract
The theory of nonlinear systems can currently be encountered in many important fields, while the nonlinear behavior of electronic systems and devices has been studied for a long time. However, a global approach for dealing with nonlinear systems does not exist and the methods to address this problem differ depending on the application and on the types of nonlinearities. An interesting category of nonlinear systems is one that can be regarded as an ensemble of (approximately) linear systems. Some popular examples in this context are nonlinear electronic devices (such as acoustic echo cancellers, which are used in applications for two-party or multi-party voice communications, e.g., videoconferencing), which can be modeled as a cascade of linear and nonlinear systems, similar to the Hammerstein model. Multiple-input/single-output (MISO) systems can also be regarded as separable multilinear systems and be treated using the appropriate methods. The high dimension of the parameter space in such problems can be addressed with methods based on tensor decompositions and modelling. In recent work, we focused on a particular type of multilinear structure—namely the bilinear form (i.e., two-dimensional decompositions)—in the framework of identifying spatiotemporal models. In this paper, we extend the work to the decomposition of more complex systems and we propose an iterative Wiener filter tailored for the identification of trilinear forms (where third-order tensors are involved), which can then be further extended to higher order multilinear structures. In addition, we derive the least-mean-square (LMS) and normalized LMS (NLMS) algorithms tailored for such trilinear forms. Simulations performed in the context of system identification (based on the MISO system approach) indicate the good performance of the proposed solution, as compared to conventional approaches.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.002 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.002 |
| Insufficient payload (model declined to judge) | 0.002 | 0.001 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".