Adali, TulayKantar, FurkanAkhonda, Mohammad Abu Baker SiddiqueStrother, StephenCalhoun, Vince D.Acar, Evrim2022-08-052022-08-052022-06-28T. Adali, F. Kantar, M. A. B. S. Akhonda, S. Strother, V. D. Calhoun and E. Acar, "Reproducibility in Matrix and Tensor Decompositions: Focus on model match, interpretability, and uniqueness," in IEEE Signal Processing Magazine, vol. 39, no. 4, pp. 8-24, July 2022, doi: 10.1109/MSP.2022.3163870.https://doi.org/10.1109/MSP.2022.3163870http://hdl.handle.net/11603/25288Data-driven solutions are playing an increasingly important role in numerous practical problems across multiple disciplines. The shift from the traditional model-driven approaches to those that are data driven naturally emphasizes the importance of the explainability of solutions, as, in this case, the connection to a physical model is often not obvious. Explainability is a broad umbrella and includes interpretability, but it also implies that the solutions need to be complete, in that one should be able to “audit” them, ask appropriate questions, and hence gain further insight about their inner workings [1]. Thus, interpretability, reproducibility, and, ultimately, our ability to generalize these solutions to unseen scenarios and situations are all strongly tied to the starting point of explainability.29 pagesen-US© 2022 IEEE.  Personal use of this material is permitted.  Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.Text