In most interesting natural language applications, K is very large, making this algorithm intractable.
it is common in similar situations to approximate the Fisher information matrix with its diagonal (Nyffenegger et al., 2006).