Numerical Optimization-Based Algorithms for Data Fusion
2019
Abstract Combining various sources of information to discover hidden patterns is key in data analysis. These sources can often be represented as matrices and/or multiway arrays, or tensors, which can be factorized jointly, e.g., as sums of simple terms, to gain insight into the data. In this chapter, an overview of (the rationale behind) numerically well-founded optimization techniques based on a Gauss–Newton framework is given, which has superior convergence properties and allows all multilinear structure to be exploited. Prior knowledge in the form of parametric, box, or soft constraints as well as regularization can be incorporated easily. We show how matrices and/or tensors can be coupled through (partially) shared factors or through common underlying variables. The framework is further extended to more general divergences allowing more suitable statistical assumptions. Finally, as tensor problems become large scale quickly, owing to the curse of dimensionality, techniques used to alleviate or overcome this curse are discussed.
Keywords:
- Correction
- Source
- Cite
- Save
- Machine Reading By IdeaReader
103
References
19
Citations
NaN
KQI