LaTeX公式

第一次LaTeX公式

\usepackage{package}
\usepackage{amsmath}
\usepackage{mathdots}
\usepackage{microtype}
\usepackage{geometry}


\begin{document}
\begin{spacing}{2.0}
\section{Class F,Consider conv(F)}

\\
Lemma:
\\
R(conv(F))=R(F)

\\
\begin{aligned}
    & \mathbb{E}_{\xi_{i}...\xi_{n}}\left(\mathop{sup}\limits_{f\in F}\mathbb{E}_{x_{1}...x_{n}}\left[\frac{1}{n}\sum\limits_{i = 1}^{n} \xi_{i} f\left(x_{i}\right) \right]\right)
    \end{aligned}

\\
\text{for any fixed signs}

\begin{aligned}
    \xi_{1},...,\xi_{n}
\end{aligned}

\text{is lim in f}

\begin{aligned}
    f = \alpha f_{1} +\beta f_{\alpha }
\end{aligned}

\\
\begin{aligned}
    & \mathbb{E}_{\lambda}\left[\frac{1}{n} \sum\limits_{i=1}^{n} \xi_{i} \left[\alpha f_{1}\left(x_{i}\right)+\beta f_{2}\left(x_{i}\right)\right]\right] = \alpha \mathbb{E}_{x}\left[\frac{1}{n} \sum\limits_{i=1}^{n}\xi_i f_{1}(x)\right]+\beta \mathbb{E}_{x}\left[\frac{1}{n} \sum\limits_{i=1}^{n} \xi_{i} f_{2}(x)\right]
    \end{aligned}

\\
\begin{aligned}
    x \in \operatorname{ext}(C) \quad \text { if } \quad & x=\frac{1}{2} x_{1}+\frac{1}{2} x_{2}  , x_{1}, x_{2} \in C \\
    & \Rightarrow x_{1}=x_{2}=x .
    \end{aligned}

\\
\operatorname{ext}(\operatorname{cosv}(F)) \subset F

\text { Suppose sup is achieved at  } \quad f \in \operatorname{conv}(F) \\
\\
\begin{array}{1}
    f=\sum\limits_{i=1}^{N} a_{i} f_{i},\quad f_{i} \in F, \quad \sum\limits_{i=1}^{m} a_{\lambda}=1
    \end{array}
\\
\ell(f)=l\left(\sum\limits_{i=1}^{N} a_{i} f_{i}\right)=\sum\limits_{i=1}^{w} a_{i} l\left(f_{i}\right)
\\
F=\left\{\pm \sigma_{2}(w \cdot x+b)\right\}
\\
$$
F=\left\{\pm \sigma_{\alpha}(\omega \cdot x)\right\}
$$
\\
Rademacher Complexity of a function class
G is defined by.

\\

\operatorname{R_{n}}(G)=E_{z} E_{\sigma}\left[\sup\limits _{g \in G}\left|\frac{1}{n} \sum\limits_{j=1}^{n} \sigma_{j} g\left(z_{j}\right)\right| \mid z_{1}, \cdots, z_{n}\right] .
\\

modified Rademacher Complexity \widetilde{R}_{n}\left(G\right) 
\\
without absolute value sign:
\\
\operatorname{\widetilde{R} _{n}}(G)=E_{z} E_{\sigma}\left[\sup\limits _{g \in G}\left|\frac{1}{n} \sum\limits_{j=1}^{n} \sigma_{j} g\left(z_{j}\right)\right|| \mid z_{1}, \cdots, z_{n}\right] .
\\
Then
\\
R_{n}(G) \leq 2 \widetilde{R}_{n}(G)
\\
Case I : choose \quad
G=D=P_{2}^{\alpha}:=\left\{\sigma_{2}(w \cdot z+b): w \in S^{\alpha-1},|b| \leqslant 2\right\}
\\
R_{n}(D)=E_{z} E_{\sigma}\left[\sup _{g \in D}\left(\frac{1}{n} \sum_{j=1}^{n} \sigma_{j} g\left(z_{j}\right)|| z_{1}, \cdots, z_{n}\right)\right]
\\
=E_{z} E_{\sigma}\left[\sup _{w \in S^{\alpha +1} , |b| \leq 2}\left|\frac{1}{n} \sum_{j=1}^{n} \sigma_{j} \sigma_{2}\left(w \cdot z_{j}+b\right)\right| \mid z_{1} \cdots z_{n}\right]
\\
=9E_{z} E_{\sigma}\left[\sup _{w \in S^{\alpha-1} | b |  \leq 2}\left|\frac{1}{n} \sum_{j=1}^{n} \sigma_{j}\left(w \cdot z_{j}+b\right)\right| z_{1}, \cdots, z_{n}\right]
\\
\leq 9 \times \sqrt{5} E_{x} E_{\sigma}\left[\sup _{\|C\|\leq 1}\left|\frac{1}{n} \sum_{j=1}^{n} \sigma_{j} c \cdot x_{j}\right| x_{1}, \cdots, x_{n}\right]
\\
\leq 2 \times 9 \times \sqrt{5} E_{x} E_{\sigma}\left[\sup _{\|C\|\leq 1}\left|\frac{1}{n} \sum_{j=1}^{n} \sigma_{j} c \cdot x_{j}\right| x_{1}, \cdots, x_{n}\right]
\\
\leqslant 2 \times 9 \times \sqrt{5} \cdot R_{n}(\cos ) \leqslant 18 \sqrt{5}\left\|x_{i}\right\|_{\infty} \sqrt{\frac{2 \ln 2 d}{n}}
\\
S=\left(x_{1}, \dots, x_{n}\right)  \quad\leq 18 \sqrt{5} \sqrt{\frac{2 \ln 2 d}{n}}
\\
\text { Let } G=\operatorname{Conv}(D)=\left\{\sum\limits_{i=1}^{m} q_{i} h_{i} m \in N, h_{j} \in D \sum\limits_{i=1}^{m}|a_{i}|\leq 1 \right\}
\\
R_{n}(\operatorname{con} v(D))=R_{n}(D)
\\
Next\quad let G =B_{1}(D)=\overline{\operatorname{Conv}(D)} \quad  c=\left(\mathbf{w}^\mathrm{T},b\right)^\mathrm{T}
\\
R_{n}(\overline{\operatorname{con}(D)})=R_{n}(\operatorname{con} v(D))
\\
further $ G=K_{1}(D) $,Nothing that
\\
{f \in K_{1}(D)}\limits_{|| f ||\leq M} , M^{-1} f \in B_{1}(D)=\overline{\operatorname{conv}(D)}

\\
Here \quad R_{n}\left(K_{1}(D)\right)=M R_{n}\left(B_{1}(D)\right)

\\
M R_{n}(\operatorname{conv}(D))=M R_{n}(D)
\\
But for genneral D just satisfying  $||D||<\infty 
\\
Usually how to compute $R_{n}\left(D\right)$

\\
\left\{g_{m} \sum\limits_{m=1}^{\infty} \epsilon G\right]










\end{spacing}
\end{document}
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包

打赏作者

Hyacinth&

你的鼓励将是我创作的最大动力

¥1 ¥2 ¥4 ¥6 ¥10 ¥20
扫码支付:¥1
获取中
扫码支付

您的余额不足,请更换扫码支付或充值

打赏作者

实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值