query: If entropy has log probabilities, why is exponential entropy used?
positive_passages.docid: 153557
positive_passages.text: What is exponential entropy?
negative_passages.docid: 44140
negative_passages.text: Chance of objects going against greater entropy?
negative_passages.docid: 67166
negative_passages.text: Interpreting log likelihood
negative_passages.docid: 153367
negative_passages.text: Calculating conditional entropy given two random variables
negative_passages.docid: 61024
negative_passages.text: Is there a mathematical relationship between time and entropy?
negative_passages.docid: 116513
negative_passages.text: Distributional Laplacian of logarithm and the Dirac delta distribution
negative_passages.docid: 22486
negative_passages.text: What does $\log^{2}{x}$ mean?
negative_passages.docid: 47030
negative_passages.text: Entropy as an arrow of time
negative_passages.docid: 75817
negative_passages.text: Why does the Coarse-grained Entropy increase?
negative_passages.docid: 41778
negative_passages.text: Distribution of $-\log X$ if $X$ is uniform.
negative_passages.docid: 88052
negative_passages.text: Reference for statistical mechanics from information theoretic view
negative_passages.docid: 148030
negative_passages.text: Entropy of sum is sum of entropies
negative_passages.docid: 13836
negative_passages.text: Statistical interpretation of Maximum Entropy Distribution
negative_passages.docid: 21151
negative_passages.text: $\log(n)$ is what power of $n$?
negative_passages.docid: 61480
negative_passages.text: Why in Variational Auto Encoder (Gaussian variational family) we model $\log\sigma^2$ and not $\sigma^2$ (or $\sigma$) itself?
negative_passages.docid: 48143
negative_passages.text: What is the need of exponential generating functions on combinatorial problems?
negative_passages.docid: 122136
negative_passages.text: Why is pseudorapidity defined as $-\log \tan \theta/2$