How is the last assertion proved? Why is the smooth maximum regularized by the entropy term equal to logSumExp?
2026-03-28 10:17:22.1774693042
Prove that logSumExp is the smooth maximum regularized by entropy
382 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
1
There are 1 best solutions below
Related Questions in LOGARITHMS
- Confirmation of Proof: $\forall n \in \mathbb{N}, \ \pi (n) \geqslant \frac{\log n}{2\log 2}$
- Extracting the S from formula
- How to prove the following inequality (log)
- Rewriting $(\log_{11}5)/(\log_{11} 15)$
- How to solve this equation with $x$ to a logarithmic power?
- Show that $\frac{1}{k}-\ln\left(\frac{k+1}{k}\right)$ is bounded by $\frac{1}{k^2}$
- Why do we add 1 to logarithms to get number of digits?
- Is my method correct for to prove $a^{\log_b c} = c^{\log_b a}$?
- How to prove the inequality $\frac{1}{n}+\frac{1}{n+1}+\cdots+\frac{1}{2n-1}\geq \log (2)$?
- Unusual Logarithm Problem
Related Questions in CONVEX-OPTIMIZATION
- Optimization - If the sum of objective functions are similar, will sum of argmax's be similar
- Least Absolute Deviation (LAD) Line Fitting / Regression
- Check if $\phi$ is convex
- Transform LMI problem into different SDP form
- Can a linear matrix inequality constraint transform to second-order cone constraint(s)?
- Optimality conditions - necessary vs sufficient
- Minimization of a convex quadratic form
- Prove that the objective function of K-means is non convex
- How to solve a linear program without any given data?
- Distance between a point $x \in \mathbb R^2$ and $x_1^2+x_2^2 \le 4$
Related Questions in MACHINE-LEARNING
- KL divergence between two multivariate Bernoulli distribution
- Can someone explain the calculus within this gradient descent function?
- Gaussian Processes Regression with multiple input frequencies
- Kernel functions for vectors in discrete spaces
- Estimate $P(A_1|A_2 \cup A_3 \cup A_4...)$, given $P(A_i|A_j)$
- Relationship between Training Neural Networks and Calculus of Variations
- How does maximum a posteriori estimation (MAP) differs from maximum likelihood estimation (MLE)
- To find the new weights of an error function by minimizing it
- How to calculate Vapnik-Chervonenkis dimension?
- maximize a posteriori
Related Questions in ENTROPY
- Relation between Shanon entropy via relation of probabilities
- How to maximise the difference between entropy and expected length of an Huffman code?
- Appoximation of Multiplicity
- Two questions about limits (in an exercise about the axiomatic definition of entropy)
- Computing entropy from joint probability table
- Joint differential entropy of sum of random variables: $h(X,X+Y)=h(X,Y)$?
- What is the least prime which has 32 1-bits?
- Eggs, buildings and entropy
- Markov chains, entropy and mutual information
- Entropy and Maximum Mutual Information
Related Questions in KARUSH-KUHN-TUCKER
- Karush-Kuhn-Tucker in infinite horizon
- KKT Condition and Global Optimal
- Rewrite an Optimization problem for $\textrm {min } \:\textrm {max} \{f_1, \dots, f_N\}$
- Minimize $x^T A y$, subject to $ x^Ty\geq 0$, where $A=\Phi^T\Phi$ is symmtric and semi-positive definite.
- Why consider $s^T\nabla g_j = 0$ for sufficient condition in optimization
- Constrained optimization where the choice is a function over an interval
- KKT example nonlinear programming
- KKT conditions for general conic optimization problem
- KKT: What happens if $x^{*}$ is not in the borderline of inequality constraint
- How do I find KKT Conditions for the Quadratic Function?
Trending Questions
- Induction on the number of equations
- How to convince a math teacher of this simple and obvious fact?
- Find $E[XY|Y+Z=1 ]$
- Refuting the Anti-Cantor Cranks
- What are imaginary numbers?
- Determine the adjoint of $\tilde Q(x)$ for $\tilde Q(x)u:=(Qu)(x)$ where $Q:U→L^2(Ω,ℝ^d$ is a Hilbert-Schmidt operator and $U$ is a Hilbert space
- Why does this innovative method of subtraction from a third grader always work?
- How do we know that the number $1$ is not equal to the number $-1$?
- What are the Implications of having VΩ as a model for a theory?
- Defining a Galois Field based on primitive element versus polynomial?
- Can't find the relationship between two columns of numbers. Please Help
- Is computer science a branch of mathematics?
- Is there a bijection of $\mathbb{R}^n$ with itself such that the forward map is connected but the inverse is not?
- Identification of a quadrilateral as a trapezoid, rectangle, or square
- Generator of inertia group in function field extension
Popular # Hahtags
second-order-logic
numerical-methods
puzzle
logic
probability
number-theory
winding-number
real-analysis
integration
calculus
complex-analysis
sequences-and-series
proof-writing
set-theory
functions
homotopy-theory
elementary-number-theory
ordinary-differential-equations
circles
derivatives
game-theory
definite-integrals
elementary-set-theory
limits
multivariable-calculus
geometry
algebraic-number-theory
proof-verification
partial-derivative
algebra-precalculus
Popular Questions
- What is the integral of 1/x?
- How many squares actually ARE in this picture? Is this a trick question with no right answer?
- Is a matrix multiplied with its transpose something special?
- What is the difference between independent and mutually exclusive events?
- Visually stunning math concepts which are easy to explain
- taylor series of $\ln(1+x)$?
- How to tell if a set of vectors spans a space?
- Calculus question taking derivative to find horizontal tangent line
- How to determine if a function is one-to-one?
- Determine if vectors are linearly independent
- What does it mean to have a determinant equal to zero?
- Is this Batman equation for real?
- How to find perpendicular vector to another vector?
- How to find mean and median from histogram
- How many sides does a circle have?

I will go through the proof step-by-step, but it is interesting to first note that the first equation you wrote is the definition of the convex conjugate of the function $\Omega$. The result might then seem less surprising since a well-known result is that the log-sum-exp function is the convex conjugate of the negative of the entropy.
In the following, I will suppose $\gamma>0$. Let $$G(\textbf{q})=\langle\textbf{q}, \textbf{x}\rangle-\Omega(\textbf{q}) = \sum_{i=1}^{n}q_ix_i-\gamma\sum_{i=1}^{n}q_i\log (q_i).$$
We are going to find the max by computing the gradient and setting it to $0$. We have
$$\frac{\partial G}{\partial q_i} = x_i -\gamma(\log(q_i)+1)$$ and $$\frac{\partial G}{\partial q_i\partial q_j}=\begin{cases}-\frac{\gamma}{q_i},\quad\text{if }i=j\\0,\quad\text{otherwise.}\end{cases}$$ This last equation states that the Hessian matrix is negative-definite (since it is diagonal and $-\frac{\gamma}{q_i}<0$), and thus ensures that the stationary point we compute is actually the maximum. Setting the gradient to $\textbf{0}$ yields $q_i^* = \exp\left(\frac{x_i}{\gamma}-1\right)$, however the resulting $\textbf{q}^*$ might not be a probability distribution. To ensure $\sum_{i=1}^nq_i^*=1$, we add a normalization: $$q_i^* = \frac{\exp\left(\frac{x_i}{\gamma}-1\right)}{\sum_{j=1}^n\exp\left(\frac{x_j}{\gamma}-1\right)}=\frac{\exp\left(\frac{x_i}{\gamma}\right)}{\sum_{j=1}^n\exp\left(\frac{x_j}{\gamma}\right)}.$$
This new $\textbf{q}^*$ is still a stationary point and belongs to the probability simplex, so it must be the maximum. Hence, you get $$\mathrm{max}_{-\gamma H}(\textbf{x}) = G(\textbf{q}^*) = \sum_{i=1}^{n}\frac{\exp\left(\frac{x_i}{\gamma}\right)}{\sum_{j=1}^n\exp\left(\frac{x_j}{\gamma}\right)}x_i-\gamma\sum_{i=1}^{n}\frac{\exp\left(\frac{x_i}{\gamma}\right)}{\sum_{j=1}^n\exp\left(\frac{x_j}{\gamma}\right)}\left(\frac{x_i}{\gamma}-\log \sum_{i=1}^n\exp\left(\frac{x_j}{\gamma}\right)\right)\\=\gamma\log \sum_{i=1}^n\exp\left(\frac{x_j}{\gamma}\right),$$
as desired.