東京大学 情報理工学系研究科 コンピュータ科学専攻 2017年8月実施 専門科目II 問題5
Author
祭音Myyura (co-authored with GPT 5.6 SOL)
Description
Denote the set of real numbers with R \mathbb R R and the absolute value of a real value w w w with ∣ w ∣ |w| ∣ w ∣ . For a d d d -dimensional real column vector w \boldsymbol w w , we write its i i i -th element as w i w_i w i , and define ∥ w ∥ 1 = ∣ w 1 ∣ + ∣ w 2 ∣ + ⋯ + ∣ w d ∣ \|\boldsymbol w\|_1=|w_1|+|w_2|+\cdots+|w_d| ∥ w ∥ 1 = ∣ w 1 ∣ + ∣ w 2 ∣ + ⋯ + ∣ w d ∣ and ∥ w ∥ 2 = w 1 2 + w 2 2 + ⋯ + w d 2 \|\boldsymbol w\|_2=\sqrt{w_1^2+w_2^2+\cdots+w_d^2} ∥ w ∥ 2 = w 1 2 + w 2 2 + ⋯ + w d 2 . The transpose of w \boldsymbol w w is written as w ⊤ \boldsymbol w^\top w ⊤ .
A vector g ∈ R d \boldsymbol g\in\mathbb R^d g ∈ R d is a subgradient of a convex function f f f at x ∈ R d \boldsymbol x\in\mathbb R^d x ∈ R d if
∀ z ∈ R d , f ( z ) ≥ f ( x ) + g ⊤ ( z − x ) \forall\boldsymbol z\in\mathbb R^d,\quad
f(\boldsymbol z)\ge f(\boldsymbol x)+\boldsymbol g^\top(\boldsymbol z-\boldsymbol x) ∀ z ∈ R d , f ( z ) ≥ f ( x ) + g ⊤ ( z − x )
holds. The set of subgradients of a convex function f f f at x \boldsymbol x x , { g ∈ R d ∣ ∀ z ∈ R d , f ( z ) ≥ f ( x ) + g ⊤ ( z − x ) } \{\boldsymbol g\in\mathbb R^d\mid\forall\boldsymbol z\in\mathbb R^d,\ f(\boldsymbol z)\ge f(\boldsymbol x)+\boldsymbol g^\top(\boldsymbol z-\boldsymbol x)\} { g ∈ R d ∣ ∀ z ∈ R d , f ( z ) ≥ f ( x ) + g ⊤ ( z − x )} , is called the subdifferential of f f f at x \boldsymbol x x , and is denoted by ∂ f ( x ) \partial f(\boldsymbol x) ∂ f ( x ) . You may use the following facts (i), (ii) and (iii).
(i) A differentiable convex function f ( x ) f(\boldsymbol x) f ( x ) satisfies
∂ f ( x ) = { ∇ f ( x ) } , ∇ f ( x ) = ( ∂ f ( x ) / ∂ x 1 ⋮ ∂ f ( x ) / ∂ x d ) . \partial f(\boldsymbol x)=\{\nabla f(\boldsymbol x)\},\qquad
\nabla f(\boldsymbol x)=
\begin{pmatrix}
\partial f(\boldsymbol x)/\partial x_1\\
\vdots\\
\partial f(\boldsymbol x)/\partial x_d
\end{pmatrix}. ∂ f ( x ) = { ∇ f ( x )} , ∇ f ( x ) = ∂ f ( x ) / ∂ x 1 ⋮ ∂ f ( x ) / ∂ x d .
(ii) For convex functions f 1 f_1 f 1 and f 2 f_2 f 2 , it holds that ∂ ( f 1 + f 2 ) ( x ) = { g 1 + g 2 ∣ g 1 ∈ ∂ f 1 ( x ) , g 2 ∈ ∂ f 2 ( x ) } \partial(f_1+f_2)(\boldsymbol x)=\{\boldsymbol g_1+\boldsymbol g_2\mid \boldsymbol g_1\in\partial f_1(\boldsymbol x),\ \boldsymbol g_2\in\partial f_2(\boldsymbol x)\} ∂ ( f 1 + f 2 ) ( x ) = { g 1 + g 2 ∣ g 1 ∈ ∂ f 1 ( x ) , g 2 ∈ ∂ f 2 ( x )} . (iii) 0 ∈ ∂ f ( w ∗ ) 0\in\partial f(\boldsymbol w^*) 0 ∈ ∂ f ( w ∗ ) is a necessary and sufficient condition that a convex function f ( w ) f(\boldsymbol w) f ( w ) is minimized by w = w ∗ \boldsymbol w=\boldsymbol w^* w = w ∗ .
Answer the following questions.
(1) (a) For f ( w ) = ∣ w ∣ f(w)=|w| f ( w ) = ∣ w ∣ (w ∈ R w\in\mathbb R w ∈ R ), obtain ∂ f ( w ) \partial f(w) ∂ f ( w ) . (b) For f ( w ) = ∥ w ∥ 1 f(\boldsymbol w)=\|\boldsymbol w\|_1 f ( w ) = ∥ w ∥ 1 (w ∈ R d \boldsymbol w\in\mathbb R^d w ∈ R d ), obtain ∂ f ( w ) \partial f(\boldsymbol w) ∂ f ( w ) .
(2) For f ( w ) = 1 2 ( w − z ) 2 + β ∣ w ∣ f(w)=\frac12(w-z)^2+\beta|w| f ( w ) = 2 1 ( w − z ) 2 + β ∣ w ∣ (w , z ∈ R w,z\in\mathbb R w , z ∈ R , 0 < β ∈ R 0<\beta\in\mathbb R 0 < β ∈ R ), obtain ∂ f ( w ) \partial f(w) ∂ f ( w ) . Also obtain w ∗ ∈ R w^*\in\mathbb R w ∗ ∈ R that minimizes f ( w ) f(w) f ( w ) .
(3) For f ( w ) = 1 2 ∥ w − z ∥ 2 2 + β ∥ w ∥ 1 f(\boldsymbol w)=\frac12\|\boldsymbol w-\boldsymbol z\|_2^2+\beta\|\boldsymbol w\|_1 f ( w ) = 2 1 ∥ w − z ∥ 2 2 + β ∥ w ∥ 1 (w , z ∈ R d \boldsymbol w,\boldsymbol z\in\mathbb R^d w , z ∈ R d , 0 < β ∈ R 0<\beta\in\mathbb R 0 < β ∈ R ), obtain ∂ f ( w ) \partial f(\boldsymbol w) ∂ f ( w ) . Also, assuming that w = w ∗ ∈ R d \boldsymbol w=\boldsymbol w^*\in\mathbb R^d w = w ∗ ∈ R d minimizes f ( w ) f(\boldsymbol w) f ( w ) , and letting j j j be an integer satisfying 1 ≤ j ≤ d 1\le j\le d 1 ≤ j ≤ d , obtain a necessary and sufficient condition for w j ∗ = 0 w_j^*=0 w j ∗ = 0 .
Consider the problem of predicting one dimensional real-valued label y ∈ R y\in\mathbb R y ∈ R from a d d d -dimensional real vector x ∈ R d \boldsymbol x\in\mathbb R^d x ∈ R d . Suppose that a set of n n n training samples
{ ( x i , y i ) ∣ x i ∈ R d , y i ∈ R , i = 1 , 2 , … , n } \{(\boldsymbol x_i,y_i)\mid\boldsymbol x_i\in\mathbb R^d,\ y_i\in\mathbb R,\ i=1,2,\ldots,n\} {( x i , y i ) ∣ x i ∈ R d , y i ∈ R , i = 1 , 2 , … , n }
is given where ( x i , y i ) (\boldsymbol x_i,y_i) ( x i , y i ) means that y i y_i y i is the real-valued label of x i \boldsymbol x_i x i .
By using a d d d -dimensional parameter w ∈ R d \boldsymbol w\in\mathbb R^d w ∈ R d , define a loss function as
L ( w ) = 1 2 n ∑ i = 1 n ( y i − w ⊤ x i ) 2 . L(\boldsymbol w)=\frac1{2n}\sum_{i=1}^n(y_i-\boldsymbol w^\top\boldsymbol x_i)^2. L ( w ) = 2 n 1 i = 1 ∑ n ( y i − w ⊤ x i ) 2 .
We formulate the training of a predictor as the following optimization problem with a positive real value λ \lambda λ :
w ∗ = argmin w ∈ R d { L ( w ) + λ ∥ w ∥ 1 } . \boldsymbol w^*=\underset{\boldsymbol w\in\mathbb R^d}{\operatorname{argmin}}
\{L(\boldsymbol w)+\lambda\|\boldsymbol w\|_1\}. w ∗ = w ∈ R d argmin { L ( w ) + λ ∥ w ∥ 1 } .
The following algorithm is known for obtaining the optimal solution w ∗ \boldsymbol w^* w ∗ . It iteratively solves the optimization problem († \dagger † ) from an initial value w ( 0 ) ∈ R d \boldsymbol w^{(0)}\in\mathbb R^d w ( 0 ) ∈ R d and using the step size η t > 0 \eta_t>0 η t > 0 :
w ( t + 1 ) = argmin w ∈ R d { ∇ L ( w ( t ) ) ⊤ ( w − w ( t ) ) + λ ∥ w ∥ 1 + 1 2 η t ∥ w − w ( t ) ∥ 2 2 } , t = 0 , 1 , 2 , … (†) \boldsymbol w^{(t+1)}
=\underset{\boldsymbol w\in\mathbb R^d}{\operatorname{argmin}}
\left\{
\nabla L(\boldsymbol w^{(t)})^\top(\boldsymbol w-\boldsymbol w^{(t)})
+\lambda\|\boldsymbol w\|_1
+\frac1{2\eta_t}\|\boldsymbol w-\boldsymbol w^{(t)}\|_2^2
\right\},
\qquad t=0,1,2,\ldots
\tag{†} w ( t + 1 ) = w ∈ R d argmin { ∇ L ( w ( t ) ) ⊤ ( w − w ( t ) ) + λ ∥ w ∥ 1 + 2 η t 1 ∥ w − w ( t ) ∥ 2 2 } , t = 0 , 1 , 2 , … ( † )
Answer the following question.
(4) Express a ∈ R a\in\mathbb R a ∈ R using η t \eta_t η t and λ \lambda λ such that w j ( t ) − η t ∂ L ∂ w j ( w ( t ) ) ∈ [ − a , a ] w_j^{(t)}-\eta_t\frac{\partial L}{\partial w_j}(\boldsymbol w^{(t)})\in[-a,a] w j ( t ) − η t ∂ w j ∂ L ( w ( t ) ) ∈ [ − a , a ] is a necessary and sufficient condition for w j ( t + 1 ) = 0 w_j^{(t+1)}=0 w j ( t + 1 ) = 0 , where j j j is an integer satisfying 1 ≤ j ≤ d 1\le j\le d 1 ≤ j ≤ d .
题目描述
以 R \mathbb R R 表示实数集,∣ w ∣ |w| ∣ w ∣ 表示实数 w w w 的绝对值。对实列向量 w ∈ R d \boldsymbol w\in\mathbb R^d w ∈ R d ,以 w i w_i w i 表示第 i i i 个分量,w T \boldsymbol w^{\mathsf T} w T 表示转置,定义
∥ w ∥ 1 = ∑ i = 1 d ∣ w i ∣ \|\boldsymbol w\|_1=\sum_{i=1}^d|w_i| ∥ w ∥ 1 = ∑ i = 1 d ∣ w i ∣ 、∥ w ∥ 2 = ( ∑ i = 1 d w i 2 ) 1 / 2 \|\boldsymbol w\|_2=(\sum_{i=1}^dw_i^2)^{1/2} ∥ w ∥ 2 = ( ∑ i = 1 d w i 2 ) 1/2 。若 g , x ∈ R d \boldsymbol g,\boldsymbol x\in\mathbb R^d g , x ∈ R d ,且对所有 z ∈ R d \boldsymbol z\in\mathbb R^d z ∈ R d 都有
f ( z ) ≥ f ( x ) + g T ( z − x ) , f(\boldsymbol z)\ge f(\boldsymbol x)+\boldsymbol g^{\mathsf T}(\boldsymbol z-\boldsymbol x), f ( z ) ≥ f ( x ) + g T ( z − x ) ,
则称 g \boldsymbol g g 是凸函数 f f f 在 x \boldsymbol x x 处的次梯度;其集合记为
∂ f ( x ) \partial f(\boldsymbol x) ∂ f ( x ) 。可以使用以下事实:可微凸函数的次梯度唯一且等于梯度;
∂ ( f 1 + f 2 ) \partial(f_1+f_2) ∂ ( f 1 + f 2 ) 是两个次梯度集合的 Minkowski 和;0 ∈ ∂ f ( w ∗ ) 0\in\partial f(\boldsymbol w^*) 0 ∈ ∂ f ( w ∗ ) 是 w ∗ \boldsymbol w^* w ∗ 最小化 f f f 的充要条件。
(1)求(a)f ( w ) = ∣ w ∣ f(w)=|w| f ( w ) = ∣ w ∣ (w ∈ R w\in\mathbb R w ∈ R )的 ∂ f ( w ) \partial f(w) ∂ f ( w ) ;(b)f ( w ) = ∥ w ∥ 1 f(\boldsymbol w)=\|\boldsymbol w\|_1 f ( w ) = ∥ w ∥ 1 (w ∈ R d \boldsymbol w\in\mathbb R^d w ∈ R d )的 ∂ f ( w ) \partial f(\boldsymbol w) ∂ f ( w ) 。
(2)对 f ( w ) = 1 2 ( w − z ) 2 + β ∣ w ∣ f(w)=\frac12(w-z)^2+\beta|w| f ( w ) = 2 1 ( w − z ) 2 + β ∣ w ∣ (w , z ∈ R , β > 0 w,z\in\mathbb R,\beta>0 w , z ∈ R , β > 0 ),求
∂ f ( w ) \partial f(w) ∂ f ( w ) 及最小点 w ∗ ∈ R w^*\in\mathbb R w ∗ ∈ R 。
(3)对 f ( w ) = 1 2 ∥ w − z ∥ 2 2 + β ∥ w ∥ 1 f(\boldsymbol w)=\frac12\|\boldsymbol w-\boldsymbol z\|_2^2+
\beta\|\boldsymbol w\|_1 f ( w ) = 2 1 ∥ w − z ∥ 2 2 + β ∥ w ∥ 1 (w , z ∈ R d , β > 0 \boldsymbol w,\boldsymbol z\in\mathbb R^d,\beta>0 w , z ∈ R d , β > 0 ),求 ∂ f ( w ) \partial f(\boldsymbol w) ∂ f ( w ) ;若 w ∗ ∈ R d \boldsymbol w^*\in\mathbb R^d w ∗ ∈ R d 为最小点,且 j j j 为满足 1 ≤ j ≤ d 1\le j\le d 1 ≤ j ≤ d 的整数,给出 w j ∗ = 0 w_j^*=0 w j ∗ = 0 的充要条件。
现由 x ∈ R d \boldsymbol x\in\mathbb R^d x ∈ R d 预测实值标签 y ∈ R y\in\mathbb R y ∈ R ,给定 n n n 个训练样本 { ( x i , y i ) ∣ x i ∈ R d , y i ∈ R , i = 1 , … , n } \{(\boldsymbol x_i,y_i)\mid\boldsymbol x_i\in\mathbb R^d,\ y_i\in\mathbb R,\ i=1,\ldots,n\} {( x i , y i ) ∣ x i ∈ R d , y i ∈ R , i = 1 , … , n } ,其中 y i y_i y i 是 x i \boldsymbol x_i x i 的标签。用参数 w ∈ R d \boldsymbol w\in\mathbb R^d w ∈ R d 定义损失并以带 ℓ 1 \ell_1 ℓ 1 正则的最小二乘训练线性模型,其中 λ > 0 \lambda>0 λ > 0 :
L ( w ) = 1 2 n ∑ i = 1 n ( y i − w T x i ) 2 , w ∗ = arg min w ∈ R d { L ( w ) + λ ∥ w ∥ 1 } . L(\boldsymbol w)=\frac1{2n}\sum_{i=1}^n(y_i-\boldsymbol w^{\mathsf T}\boldsymbol x_i)^2,
\qquad
\boldsymbol w^*=\arg\min_{\boldsymbol w\in\mathbb R^d}\{L(\boldsymbol w)+\lambda\|\boldsymbol w\|_1\}. L ( w ) = 2 n 1 i = 1 ∑ n ( y i − w T x i ) 2 , w ∗ = arg w ∈ R d min { L ( w ) + λ ∥ w ∥ 1 } .
从 w ( 0 ) ∈ R d \boldsymbol w^{(0)}\in\mathbb R^d w ( 0 ) ∈ R d 出发,取步长 η t > 0 \eta_t>0 η t > 0 ,迭代算法为
w ( t + 1 ) = arg min w ∈ R d { ∇ L ( w ( t ) ) T ( w − w ( t ) ) + λ ∥ w ∥ 1 + 1 2 η t ∥ w − w ( t ) ∥ 2 2 } , t = 0 , 1 , 2 , … . \boldsymbol w^{(t+1)}=\arg\min_{\boldsymbol w\in\mathbb R^d}
\left\{
\nabla L(\boldsymbol w^{(t)})^{\mathsf T}(\boldsymbol w-\boldsymbol w^{(t)})
+\lambda\|\boldsymbol w\|_1
+\frac1{2\eta_t}\|\boldsymbol w-\boldsymbol w^{(t)}\|_2^2
\right\},\qquad t=0,1,2,\ldots. w ( t + 1 ) = arg w ∈ R d min { ∇ L ( w ( t ) ) T ( w − w ( t ) ) + λ ∥ w ∥ 1 + 2 η t 1 ∥ w − w ( t ) ∥ 2 2 } , t = 0 , 1 , 2 , … .
(4)设 j j j 为满足 1 ≤ j ≤ d 1\le j\le d 1 ≤ j ≤ d 的整数,用 η t \eta_t η t 和 λ \lambda λ 表示 a ∈ R a\in\mathbb R a ∈ R ,使
w j ( t ) − η t ∂ L ∂ w j ( w ( t ) ) ∈ [ − a , a ] w_j^{(t)}-\eta_t\frac{\partial L}{\partial w_j}(\boldsymbol w^{(t)})
\in[-a,a] w j ( t ) − η t ∂ w j ∂ L ( w ( t ) ) ∈ [ − a , a ]
成为 w j ( t + 1 ) = 0 w_j^{(t+1)}=0 w j ( t + 1 ) = 0 的充要条件。
Kai
(1)
∂ ∣ w ∣ = { { − 1 } , w < 0 , [ − 1 , 1 ] , w = 0 , { 1 } , w > 0. \partial|w|=
\begin{cases}
\{-1\},&w<0,\\
[-1,1],&w=0,\\
\{1\},&w>0.
\end{cases} ∂ ∣ w ∣ = ⎩ ⎨ ⎧ { − 1 } , [ − 1 , 1 ] , { 1 } , w < 0 , w = 0 , w > 0.
并且
∂ ∥ w ∥ 1 = { g ∈ R d ∣ g i ∈ ∂ ∣ w i ∣ ( i = 1 , … , d ) } . \partial\|\boldsymbol w\|_1
=\{\boldsymbol g\in\mathbb R^d\mid g_i\in\partial|w_i|\ (i=1,\ldots,d)\}. ∂ ∥ w ∥ 1 = { g ∈ R d ∣ g i ∈ ∂ ∣ w i ∣ ( i = 1 , … , d )} .
(2)
∂ f ( w ) = w − z + β ∂ ∣ w ∣ . \partial f(w)=w-z+\beta\,\partial|w|. ∂ f ( w ) = w − z + β ∂ ∣ w ∣.
由 0 ∈ ∂ f ( w ∗ ) 0\in\partial f(w^*) 0 ∈ ∂ f ( w ∗ ) ,得软阈值解
w ∗ = sgn ( z ) ( ∣ z ∣ − β ) + = { z − β , z > β , 0 , ∣ z ∣ ≤ β , z + β , z < − β . w^*=\operatorname{sgn}(z)(|z|-\beta)_+
=\begin{cases}
z-\beta,&z>\beta,\\
0,&|z|\le\beta,\\
z+\beta,&z<-\beta.
\end{cases} w ∗ = sgn ( z ) ( ∣ z ∣ − β ) + = ⎩ ⎨ ⎧ z − β , 0 , z + β , z > β , ∣ z ∣ ≤ β , z < − β .
(3)
∂ f ( w ) = w − z + β ∂ ∥ w ∥ 1 . \partial f(\boldsymbol w)
=\boldsymbol w-\boldsymbol z+\beta\,\partial\|\boldsymbol w\|_1. ∂ f ( w ) = w − z + β ∂ ∥ w ∥ 1 .
各坐标相互独立,故
w j ∗ = 0 ⟺ ∣ z j ∣ ≤ β . w_j^*=0\quad\Longleftrightarrow\quad |z_j|\le\beta. w j ∗ = 0 ⟺ ∣ z j ∣ ≤ β .
(4)
令
q j = w j ( t ) − η t ∂ L ∂ w j ( w ( t ) ) . q_j=w_j^{(t)}-\eta_t\frac{\partial L}{\partial w_j}(\boldsymbol w^{(t)}). q j = w j ( t ) − η t ∂ w j ∂ L ( w ( t ) ) .
配方后,每个坐标的子问题是
1 2 η t ( w j − q j ) 2 + λ ∣ w j ∣ \frac1{2\eta_t}(w_j-q_j)^2+\lambda|w_j| 2 η t 1 ( w j − q j ) 2 + λ ∣ w j ∣ ,由(2)知
w j ( t + 1 ) = 0 ⟺ ∣ q j ∣ ≤ η t λ . w_j^{(t+1)}=0
\Longleftrightarrow |q_j|\le\eta_t\lambda. w j ( t + 1 ) = 0 ⟺ ∣ q j ∣ ≤ η t λ .
因此 a = η t λ \boxed{a=\eta_t\lambda} a = η t λ 。