Answers are grounded in this paper and cite their sources.
We consider the sum of squared logarithms inequality and investigate possible connections with the theory of majorization. We also discuss alternative sufficient conditions on two sets of vectors a,b₊ⁿ so that ∑ᵢ₌₁ⁿ(log aᵢ)²\ ≤\ ∑ᵢ₌₁ⁿ(log bᵢ)²\,. Generalizations of some inequalities from information theory are obtained, including a generalized information inequality and a generalized log sum inequality, which states for a,b₊ⁿ and k₁,...,kₙ∈ [0,∞): ∑ᵢ₌₁ⁿaᵢ\,log∏ₛ₌₁ᵐ(aᵢ/bᵢ + kₛ)\ ≥\ log∏ₛ₌₁ᵐ(1+kₛ)\,.
No takes yet. Share an insight, caveat, or question.
Neff et al. (2016) studied this question.