Suppose $a,b\in(0,1)$. I'm interested in comparison of an asymptotic behavior of $\operatorname{Li}_{-n}(a)$ and $\operatorname{Li}_{-n}(b)$ for $n\to\infty$.
Such functions exhibit approximately factorial-like (faster than exponential) growth rate. The particular case $\operatorname{Li}_{-n}\!\left(\tfrac12\right)$ for $n\ge1$ gives (up to a coefficient) a combinatorial sequence called Fubini numbers or ordered Bell numbers$^{[1]}$$\!^{[2]}$$\!^{[3]}$ (number of outcomes of a horse race provided that ties are possible). This sequence is known to have the following asymptotic behavior: $$\operatorname{Li}_{-n}\!\left(\tfrac12\right)\sim\frac{n!}{\ln^{n+1}2}.\tag1$$
After some numerical experimentation I conjectured the following behavior: $$\ln\!\left(\frac{\operatorname{Li}_{-n}(a)}{\operatorname{Li}_{-n}(b)}\right)=(n+1)\cdot\ln\!\left(\frac{\ln b}{\ln a}\right)+o\!\left(n^{-N}\right)\tag2$$ for arbitrarily large $N$ (so, the remainder term decays faster than any negative power of $n$). It looks like the remainder term is oscillating with exponentially decreasing amplitude, but I haven't yet found the exact exponent base or asymptotic oscillation frequency.
Could you suggest a proof of $(2)$ or further refinements of this formula?