In this framework, we will adopt the latter, as -from our experience -entropy-based measures tend to work well for natural language.
we want to find the matrices W and H for which the Kullback-Leibler divergence between V and W H (the multiplication of W and H) is the smallest.