1. What is the goal of NMF?
The goal of NMF (Non-negative Matrix Factorization) is to approximate an observed data matrix as a product of basis and weight matrices. The approximation is achieved by minimizing the cost function J(W, H), where W and H are the basis and weight matrices, respectively. The rank of the approximation is determined by the number of bases, which is denoted as min(R+, min(R,)). In audio applications, the data matrix is organized using ymn = |y Cmn|^2, where Cmn is the complex spectrogram at the th frequency bin and th frame. NMF parameters can be estimated by minimizing the cost function J(W, H) using algorithms like MUA (Algorithm 1 and 2). The MUAs update the basis and weight matrices iteratively, with the aim of achieving a low-rank approximation of the observed data matrix.
read more
2. What is Bregman divergence in NMF?
Bregman divergence in NMF is a function that satisfies axiom A1 and A2, where D(u, v) >= 0 for all u in R+ and D(u, v) = 0 if and only if v = u. It is defined as EQUATION, where is a strictly convex function and is the derivative. Early NMF literature introduced Bregman divergence, and it is used in update rules for NMF. It includes special cases like squared Euclidean distance, generalized Kullback-Leibler divergence, and Itakura-Saito divergence. It is a tractable case of the Bregman divergence and is often used in signal separation methods.
read more
3. Design of DeMUA for NMF?
DeMUA for NMF is an architecture that estimates NMF parameters, extending update rules with trainable parameters. It offers flexibility over MUAs, treating the update sub-block U as a recurrent NN. The design challenge lies in creating U for Bregman and CPDF-based divergences. For Bregman divergence, U is designed using a neural network function Ps B, while for CPDF-based divergence, U is designed using a neural network function Ph C. Both divergences are minimized by the DeMUA, as shown in Fig. 1(b) and (d) for Bregman, and Fig. 1(c) and (e) for CPDF-based divergence.
read more
4. How to design Ps B and Ph C for divergence axiom?
Designing Ps B and Ph C is crucial for satisfying the axiom of divergence. According to [11], if Ps B is strictly convex, D B B reconstructed from Eq. (16) becomes a divergence. Ps B's structure is shown in Appendix A.1. The design ensures that the update units generate operative outputs, avoiding inoperative outputs caused by improper divergence. The restrictions on Ps B and Ph C are derived to ensure the divergence axiom is met, leading to effective neural-based divergences.
read more