This is not a problem for SparseLDA because s is shared across all tokens.
we can achieve computational gains with an upper bound on s, A sampling algorithm can take advantage of this by not explicitly calculating s. Instead, we use s as proxy, and only compute the exact s if we hit the bucket s (Algorithm 1).