Moreover, the task of building the alias tables can be outsourced to other cores.
with the combination of both Cholesky and Alias tricks, the sampling complexity can thus be brought down to O(K d M 2 ) where K d represents the number of actually instantiated topics in the document and K d K. we plot the sampling rate achieved naively, with Cholesky (CH) trick and with Cholesky+Alias (A+CH) trick in figure 2 demonstrating better likelihood at much less time.