京都大学 情報学研究科 知能情報学専攻 2022年2月実施 基礎科目 F1-2
Author
祭音Myyura (co-authored with GPT 5.6 SOL)
Description
Q.1
(1) Prove
log(xy)=logx+logy(x,y>1)
using the definition
logx=∫1xt1dt.
(2) Let f(x)=ax, where a>0. Derive df(x)/dx using the chain rule.
Q.2
Let
f(p1,p2,…,pn)=−i=1∑npilogpi,
where
i=1∑npi=1,0<pi<1,n≥2,
and log denotes the natural logarithm.
(1) Prove that f is strictly concave and non-negative.
(2) Using Lagrange multipliers, derive the pi that maximize f and give the
maximum value.
题目描述
-
使用 logx=∫1xdt/t 的定义证明
log(xy)=logx+logy(x,y>1);再用链式法则求
f(x)=ax(a>0)的导数。
-
在 ∑ipi=1、0<pi<1、n≥2 下,令
f(p1,…,pn)=−i=1∑npilogpi.
- 证明 f 严格凹且非负;
- 用拉格朗日乘数法求最大化 f 的 pi 及最大值。
Kai
Q.1
(1)
Split the integral at x and substitute t=xu in the second part:
log(xy)=∫1xytdt=∫1xtdt+∫xxytdt=logx+∫1yxuxdu=logx+logy.
(2)
Because f(x)>0,
logf(x)=log(ax)=xloga.
Differentiating both sides by the chain rule,
f(x)f′(x)=loga.
Thus
f′(x)=axloga.
Q.2
(1)
For 0<pi<1, logpi<0, so every term
−pilogpi is positive. Hence f>0, and in particular f is
non-negative.
Its Hessian is
∇2f=−diag(p11,…,pn1).
For every nonzero vector v,
vT∇2fv=−i=1∑npivi2<0.
Therefore f is strictly concave on the positive orthant, and hence also on
the probability simplex.
(2)
Use the Lagrangian
L=−i=1∑npilogpi+λ(i=1∑npi−1).
The stationary conditions are
∂pi∂L=−(logpi+1)+λ=0.
Thus all pi are equal. The constraint gives
pi=n1(i=1,…,n).
Strict concavity makes this stationary point the unique global maximum, whose
value is
fmax=−i=1∑nn1logn1=logn.