The SCVB0 algorithm outperforms stochastic VB (Hoffman et al., 2010) on large corpora by converging faster and often to a better solution (Foulds et al., 2013).
the SCVB0 algorithm does not leverage sparsity, and hence requires O(K) operations per word token.