视频加载失败

人工智能领域常用LaTeX公式语法符号汇总

4707 字
24 分钟
人工智能领域常用LaTeX公式语法符号汇总

常用数学符号及 LaTeX 公式速查手册#

适用对象:写机器学习 / 深度学习笔记、论文、博客的任何人

兼容性说明:本文所有语法均在 KaTeX(Typora、Obsidian、VuePress、Hexo 默认)与 MathJax (Overleaf、Jupyter、知乎)下验证可用,无需额外宏包。

目录#


一、LaTeX 公式介绍#

1.1 两种公式模式#

模式语法用途
行内公式$E = mc^2$嵌在正文里,随文字流排版
独立公式$$E = mc^2$$单独成行并居中,用于重要公式

行内效果:E=mc2E = mc^2vs 独立效果:

E=mc2E = mc^2

注意独立公式的 $$ 必须独占一行,否则部分渲染器(尤其 KaTeX)会解析失败。

1.2 Typora 中的快捷键#

操作快捷键
插入公式块Ctrl/Cmd + Shift + M或输入 $$ 后回车
源码模式切换Ctrl/Cmd + /

1.3 公式环境的两个常用”容器”#

除了 $$...$$,多行公式通常在 $$ 内部再套环境:

环境用途
aligned多行公式按 & 对齐(最常用)
cases分段函数 / 条件分支
matrix 系列矩阵、行列式
array自定义列对齐的通用表格环境

1.4 六个必知的坑#

坑错误写法正确写法
公式里写中文$损失函数$$\text{损失函数}$
多字母变量名$loss$ → lossloss(变成 l·o·s·s 相乘)$\text{loss}$ 或 $\mathrm{loss}$
直接敲空格$a b$ 空格被忽略$a \, b$ / $a \quad b$
函数名用斜体$sin(x)$ → sin(x)sin(x)$\sin(x)$ → sin⁡(x)\sin(x)
保留字符% # & _ $ 需转义\% \# \& \_ \$

二、常用符号速查#

2.1 希腊字母(高频)#

渲染源码读音/用途渲染源码读音/用途
α\alpha\alphaalpha,学习率β\beta\betabeta,动量
γ\gamma\gammagamma,折扣因子δ\delta\deltadelta,增量
ϵ\epsilon\epsilonepsilon,噪声/精度ε\varepsilon\varepsilon变体写法
ζ\zeta\zetazetaη\eta\etaeta,学习率
θ\theta\thetatheta,模型参数ϑ\vartheta\vartheta变体写法
λ\lambda\lambdalambda,正则系数μ\mu\mumu,均值
ν\nu\nunuπ\pi\pipi
ρ\rho\rhorhoσ\sigma\sigmasigma,标准差/激活
τ\tau\tautau,温度系数ϕ\phi\phiphi
φ\varphi\varphi变体写法ψ\psi\psipsi
ω\omega\omegaomega,权重/角频率ξ\xi\xixi
Γ\Gamma\Gamma大写Δ\Delta\Delta差分
Θ\Theta\Theta参数集合Λ\Lambda\Lambda对角矩阵
Σ\Sigma\Sigma协方差矩阵Φ\Phi\Phi特征映射
Ω\Omega\Omega样本空间Π\Pi\Pi连乘

2.2 运算符与关系符#

渲染源码含义渲染源码含义
×\times\times叉乘⋅\cdot\cdot点乘
÷\div\div除±\pm\pm正负
∘\circ\circ复合/逐元素⊙\odot\odotHadamard 积
⊗\otimes\otimes卷积/Kronecker 积⊕\oplus\oplus直和/拼接
∗\ast\ast卷积运算符⋆\star\star星号
≠\neq\neq不等于≈\approx\approx约等于
≡\equiv\equiv恒等于∼\sim\sim服从/同阶
≤\leq\leq小于等于≥\geq\geq大于等于
≪\ll\ll远小于≫\gg\gg远大于
∝\propto\propto正比于∥\parallel\parallel平行/分布间
⊥\perp\perp垂直/独立≺\prec\prec优于

2.3 集合与数集#

渲染源码含义
R\mathbb{R}\mathbb{R}实数集
Rn\mathbb{R}^{n}\mathbb{R}^{n}n 维实向量空间
Rm×n\mathbb{R}^{m \times n}\mathbb{R}^{m \times n}实矩阵空间
N,Z,Q,C\mathbb{N}, \mathbb{Z}, \mathbb{Q}, \mathbb{C}\mathbb{N}, \mathbb{Z}, \mathbb{Q}, \mathbb{C}自然数/整数/有理数/复数
E[X]\mathbb{E}[X]\mathbb{E}[X]期望
1[⋅]\mathbb{1}[\cdot]\mathbb{1}[\cdot]指示函数
∈\in\in属于
∉\notin\notin不属于
⊂\subset\subset子集
⊆\subseteq\subseteq子集(含相等)
∪\cup\cup并集
∩\cap\cap交集
∖\setminus\setminus差集
∅\emptyset\emptyset 或 \varnothing空集
∀\forall\forall任意
∃\exists\exists存在
∄\nexists\nexists不存在
∞\infty\infty无穷
∣D∣\lvert \mathcal{D} \rvert\lvert \mathcal{D} \rvert集合基数

2.4 线性代数符号#

渲染源码含义
x\mathbf{x}\mathbf{x}向量
A\mathbf{A}\mathbf{A}矩阵
X\mathsf{X}\mathsf{X}张量(无衬线)
A⊤\mathbf{A}^\top\mathbf{A}^\top转置(推荐 \top)
A−1\mathbf{A}^{-1}\mathbf{A}^{-1}逆矩阵
A+\mathbf{A}^{+}\mathbf{A}^{+}伪逆
I\mathbf{I}\mathbf{I}单位矩阵
∥x∥2\lVert \mathbf{x} \rVert_2\lVert \mathbf{x} \rVert_2L2 范数
∥x∥1\lVert \mathbf{x} \rVert_1\lVert \mathbf{x} \rVert_1L1 范数
∥x∥p\lVert \mathbf{x} \rVert_p\lVert \mathbf{x} \rVert_pp 范数
∥x∥F\lVert \mathbf{x} \rVert_F\lVert \mathbf{x} \rVert_FFrobenius 范数
⟨x,y⟩\langle \mathbf{x}, \mathbf{y} \rangle\langle \mathbf{x}, \mathbf{y} \rangle内积
x⊤y\mathbf{x}^\top \mathbf{y}\mathbf{x}^\top \mathbf{y}内积(列向量)
det⁡(A)\det(\mathbf{A})\det(\mathbf{A})行列式
tr(A)\text{tr}(\mathbf{A})\text{tr}(\mathbf{A})迹
rank(A)\text{rank}(\mathbf{A})\text{rank}(\mathbf{A})秩
diag(v)\text{diag}(\mathbf{v})\text{diag}(\mathbf{v})对角矩阵
span(v1,v2)\text{span}(\mathbf{v}_1, \mathbf{v}_2)\text{span}(\mathbf{v}_1, \mathbf{v}_2)张成空间
N(A)\mathcal{N}(\mathbf{A})\mathcal{N}(\mathbf{A})零空间

2.5 微积分符号#

渲染源码含义
dydx\frac{dy}{dx}\frac{dy}{dx}导数
∂y∂x\frac{\partial y}{\partial x}\frac{\partial y}{\partial x}偏导数
∂xf\partial_x f\partial_x f偏导简写
∇f\nabla f\nabla f梯度
∇θJ(θ)\nabla_\theta J(\theta)\nabla_\theta J(\theta)对 θ 求梯度
∇2f\nabla^2 f\nabla^2 fHessian / 拉普拉斯
∇⋅F\nabla \cdot \mathbf{F}\nabla \cdot \mathbf{F}散度
f′(x),f′′(x)f'(x), f''(x)f'(x), f''(x)一阶/二阶导
∫abf(x) dx\int_a^b f(x) \, dx\int_a^b f(x) \, dx定积分
∬D\iint_D\iint_D二重积分
∮C\oint_C\oint_C曲线积分
lim⁡x→0\lim_{x \to 0}\lim_{x \to 0}极限
∑i=1n\sum_{i=1}^{n}\sum_{i=1}^{n}求和
∏i=1n\prod_{i=1}^{n}\prod_{i=1}^{n}连乘
dx\mathrm{d}x\mathrm{d}x正体微分号

2.6 概率与统计符号#

渲染源码含义
P(A)P(A)P(A)概率
P(A∣B)P(A \mid B)P(A \mid B)条件概率
p(x)p(x)p(x)概率密度
p(x;θ)p(x; \theta)p(x; \theta)带参数的密度
X∼N(μ,σ2)X \sim \mathcal{N}(\mu, \sigma^2)X \sim \mathcal{N}(\mu, \sigma^2)服从高斯分布
E[X]\mathbb{E}[X]\mathbb{E}[X]期望
Ex∼p[f(x)]\mathbb{E}_{x \sim p}[f(x)]\mathbb{E}_{x \sim p}[f(x)]关于分布的期望
Var(X)\text{Var}(X)\text{Var}(X)方差
Cov(X,Y)\text{Cov}(X, Y)\text{Cov}(X, Y)协方差
KL(p∥q)\text{KL}(p \parallel q)\text{KL}(p \parallel q)KL 散度
X⊥YX \perp YX \perp Y独立
X⊥Y∣ZX \perp Y \mid ZX \perp Y \mid Z条件独立
H(X)\mathcal{H}(X)\mathcal{H}(X)熵
I(X;Y)\mathcal{I}(X; Y)\mathcal{I}(X; Y)互信息
arg⁡max⁡θf(θ)\arg\max_\theta f(\theta)\arg\max_\theta f(\theta)取最大参数
arg⁡min⁡θf(θ)\arg\min_\theta f(\theta)\arg\min_\theta f(\theta)取最小参数

2.7 机器学习 / 深度学习专用符号#

渲染源码含义
θ,Θ\theta, \Theta\theta, \Theta模型参数(全集)
W,b\mathbf{W}, \mathbf{b}\mathbf{W}, \mathbf{b}权重矩阵、偏置
x,y\mathbf{x}, \mathbf{y}\mathbf{x}, \mathbf{y}输入、标签
y^\hat{y}\hat{y}预测值
L\mathcal{L}\mathcal{L}损失函数
D\mathcal{D}\mathcal{D}数据集
X,Y\mathcal{X}, \mathcal{Y}\mathcal{X}, \mathcal{Y}输入空间、输出空间
α,η\alpha, \eta\alpha, \eta学习率
λ\lambda\lambda正则化系数
γ\gamma\gamma折扣因子 / 衰减
ϵ\epsilon\epsilon数值稳定项 / 噪声
τ\tau\tau温度系数
σ(⋅)\sigma(\cdot)\sigma(\cdot)Sigmoid
Q,K,V\mathbf{Q}, \mathbf{K}, \mathbf{V}\mathbf{Q}, \mathbf{K}, \mathbf{V}Query/Key/Value
dk,dmodeld_k, d_{\text{model}}d_k, d_{\text{model}}维度
N,B,TN, B, TN, B, T样本数 / 批大小 / 序列长度
⊙\odot\odot逐元素乘
∗**卷积运算
⊕\oplus\oplus残差/拼接
softmax(z)\text{softmax}(\mathbf{z})\text{softmax}(\mathbf{z})Softmax
ReLU(⋅)\text{ReLU}(\cdot)\text{ReLU}(\cdot)激活函数

三、常用语法速查#

3.1 上下标#

渲染源码说明
x2x^2x^2上标
xix_ix_i下标
xi2x_i^2x_i^2同时上下标
ai,j(t)a_{i,j}^{(t)}a_{i,j}^{(t)}多字符必须加花括号
ex2e^{x^2}e^{x^2}嵌套上标
∑i=1n\sum\limits_{i=1}^{n}\sum\limits_{i=1}^{n}强制上下(行内也上下排)
=def\overset{\text{def}}{=}\overset{\text{def}}{=}上方标注”定义为”
arg⁡max⁡θ\underset{\theta}{\arg\max}\underset{\theta}{\arg\max}下方标注

⚠️ x^10 只渲染成 x10x^10(只有 1 在上标),必须写 x^{10} → x10x^{10}。

3.2 分式与根号#

渲染源码说明
ab\frac{a}{b}\frac{a}{b}分式
ab\dfrac{a}{b}\dfrac{a}{b}强制 display 大小
ab\tfrac{a}{b}\tfrac{a}{b}强制行内大小
∂xf\partial_x f 或 ∂f∂x\frac{\partial f}{\partial x}\frac{\partial f}{\partial x}偏导
x\sqrt{x}\sqrt{x}平方根
x3\sqrt[3]{x}\sqrt[3]{x}n 次根
(nk)\binom{n}{k}\binom{n}{k}二项式系数
11+1x\cfrac{1}{1 + \cfrac{1}{x}}\cfrac{1}{1 + \cfrac{1}{x}}连分式

3.3 括号与定界符#

渲染源码说明
(12)(\frac{1}{2})(\frac{1}{2})固定小括号(不缩放)
(12)\left(\frac{1}{2}\right)\left(\frac{1}{2}\right)自适应高度
[x]\left[ x \right]\left[ x \right]方括号
{x}\left\{ x \right\}\left\{ x \right\}花括号(要转义)
∣x∣\left\lvert x \right\rvert\left\lvert x \right\rvert绝对值
∥x∥2\left\lVert \mathbf{x} \right\rVert_2\left\lVert \mathbf{x} \right\rVert_2范数
⟨x,y⟩\left\langle x, y \right\rangle\left\langle x, y \right\rangle内积尖括号
dydx∣x=0\left. \frac{dy}{dx} \right\vert_{x=0}\left. \frac{dy}{dx} \right\vert_{x=0}单侧括号(. 占位)
a+b+c⏟求和\underbrace{a + b + c}_{\text{求和}}\underbrace{a + b + c}_{\text{求和}}下花括号标注
x1+x2⏞输入\overbrace{x_1 + x_2}^{\text{输入}}\overbrace{x_1 + x_2}^{\text{输入}}上花括号标注

\left 与 \right 必须成对出现,缺一个就编译报错。

3.4 求和、积分、极限#

渲染源码说明
∑i=1nxi\sum_{i=1}^{n} x_i\sum_{i=1}^{n} x_i求和
∑i∈Sxi\sum_{i \in \mathcal{S}} x_i\sum_{i \in \mathcal{S}} x_i带条件求和
∏i=1nxi\prod_{i=1}^{n} x_i\prod_{i=1}^{n} x_i连乘
∫0∞f(x) dx\int_0^\infty f(x) \, dx\int_0^\infty f(x) \, dx定积分
∬Df\iint_{\mathcal{D}} f\iint_{\mathcal{D}} f二重积分
∮C\oint_{\mathcal{C}}\oint_{\mathcal{C}}闭曲线积分
lim⁡n→∞an\lim_{n \to \infty} a_n\lim_{n \to \infty} a_n极限
lim⁡x→0+f(x)\lim_{x \to 0^+} f(x)\lim_{x \to 0^+} f(x)右极限
max⁡1≤i≤nxi\max_{1 \leq i \leq n} x_i\max_{1 \leq i \leq n} x_i最大值
⋃i=1nAi\bigcup_{i=1}^{n} A_i\bigcup_{i=1}^{n} A_i大并集

3.5 矩阵与行列式#

渲染源码说明
abcd\begin{matrix} a & b \\ c & d \end{matrix}\begin{matrix} a & b \\ c & d \end{matrix}无括号
(abcd)\begin{pmatrix} a & b \\ c & d \end{pmatrix}\begin{pmatrix} ... \end{pmatrix}小括号
[abcd]\begin{bmatrix} a & b \\ c & d \end{bmatrix}\begin{bmatrix} ... \end{bmatrix}方括号
∣abcd∣\begin{vmatrix} a & b \\ c & d \end{vmatrix}\begin{vmatrix} ... \end{vmatrix}行列式
{ab}\begin{Bmatrix} a & b \end{Bmatrix}\begin{Bmatrix} ... \end{Bmatrix}大花括号
(a⋯⋮⋱)\begin{pmatrix} a & \cdots \\ \vdots & \ddots \end{pmatrix}\cdots \vdots \ddots省略号占位

& 分列,\\ 换行。

3.6 多行公式对齐#

渲染源码说明
a=bc=d\begin{aligned} a &= b \\ c &= d \end{aligned}\begin{aligned} a &= b \\ c &= d \end{aligned}& 为对齐锚点
f(x)=(x+1)2+1\begin{aligned} f(x) &= (x+1)^2 \\ &\quad + 1 \end{aligned}&\quad + 1续行缩进
\begin{gather} a = b \\ c = d \end{gather}\begin{gather} ... \end{gather}全部居中不对齐
{x,x≥00,x<0\begin{cases} x, & x \geq 0 \\ 0, & x < 0 \end{cases}\begin{cases} ... \end{cases}分段函数

3.7 字体与文本#

渲染源码说明
A\mathbf{A}\mathbf{A}粗体(向量/矩阵)
θ\boldsymbol{\theta}\boldsymbol{\theta}粗斜体(参数)
d\mathrm{d}\mathrm{d}正体(微分号、单位)
time\mathit{time}\mathit{time}斜体多字母变量
L\mathcal{L}\mathcal{L}花体(损失/集合)
R\mathbb{R}\mathbb{R}空心体(数集)
X\mathsf{X}\mathsf{X}无衬线(张量)
code\mathtt{code}\mathtt{code}等宽体
中文文本\text{中文文本}\text{中文文本}公式内插入文本
y^\hat{y}\hat{y}帽子(预测值)
x~\tilde{x}\tilde{x}波浪号
xˉ\bar{x}\bar{x}均值横线
AB‾\overline{AB}\overline{AB}长横线
v⃗\vec{v}\vec{v}向量箭头

3.8 空格与间距#

渲染源码宽度
a ba\,ba\,b细(3/18 em)
a ba\:ba\:b中(4/18 em)
a  ba\;ba\;b宽(5/18 em)
a ⁣ba\!ba\!b负空格(收紧)
aba \quad ba \quad b一个字符宽
aba \qquad ba \qquad b两个字符宽
aba \\[4pt] b 换行\\[4pt]换行并加额外间距

四、机器学习常用公式#

4.1 线性回归#

假设函数

$$
\hat{y} = \mathbf{w}^\top \mathbf{x} + b = \sum_{j=1}^{d} w_j x_j + b
$$
y^=w⊤x+b=∑j=1dwjxj+b\hat{y} = \mathbf{w}^\top \mathbf{x} + b = \sum_{j=1}^{d} w_j x_j + b

向量化形式(整个数据集)

$$
\hat{\mathbf{y}} = \mathbf{X} \mathbf{w} + b, \quad \mathbf{X} \in \mathbb{R}^{N \times d}
$$
y^=Xw+b,X∈RN×d\hat{\mathbf{y}} = \mathbf{X} \mathbf{w} + b, \quad \mathbf{X} \in \mathbb{R}^{N \times d}

闭式解(正规方程)

$$
\mathbf{w}^* = (\mathbf{X}^\top \mathbf{X})^{-1} \mathbf{X}^\top \mathbf{y}
$$
w∗=(X⊤X)−1X⊤y\mathbf{w}^* = (\mathbf{X}^\top \mathbf{X})^{-1} \mathbf{X}^\top \mathbf{y}

4.2 逻辑回归#

$$
P(y = 1 \mid \mathbf{x}) = \sigma(\mathbf{w}^\top \mathbf{x} + b) = \frac{1}{1 + e^{-(\mathbf{w}^\top \mathbf{x} + b)}}
$$
P(y=1∣x)=σ(w⊤x+b)=11+e−(w⊤x+b)P(y = 1 \mid \mathbf{x}) = \sigma(\mathbf{w}^\top \mathbf{x} + b) = \frac{1}{1 + e^{-(\mathbf{w}^\top \mathbf{x} + b)}}

决策边界:y^=1\hat{y} = 1 当且仅当 w⊤x+b≥0\mathbf{w}^\top \mathbf{x} + b \geq 0

4.3 损失函数#

均方误差 MSE

$$
\mathcal{L}_{\text{MSE}} = \frac{1}{N} \sum_{i=1}^{N} \lVert \mathbf{y}_i - \hat{\mathbf{y}}_i \rVert_2^2
$$
LMSE=1N∑i=1N∥yi−y^i∥22\mathcal{L}_{\text{MSE}} = \frac{1}{N} \sum_{i=1}^{N} \lVert \mathbf{y}_i - \hat{\mathbf{y}}_i \rVert_2^2

二分类交叉熵 BCE

$$
\mathcal{L}_{\text{BCE}} = -\frac{1}{N} \sum_{i=1}^{N} \left[ y_i \log \hat{y}_i + (1 - y_i) \log (1 - \hat{y}_i) \right]
$$
LBCE=−1N∑i=1N[yilog⁡y^i+(1−yi)log⁡(1−y^i)]\mathcal{L}_{\text{BCE}} = -\frac{1}{N} \sum_{i=1}^{N} \left[ y_i \log \hat{y}_i + (1 - y_i) \log (1 - \hat{y}_i) \right]

多分类交叉熵

$$
\mathcal{L}_{\text{CE}} = -\frac{1}{N} \sum_{i=1}^{N} \sum_{c=1}^{C} y_{ic} \log \hat{y}_{ic}
$$
LCE=−1N∑i=1N∑c=1Cyiclog⁡y^ic\mathcal{L}_{\text{CE}} = -\frac{1}{N} \sum_{i=1}^{N} \sum_{c=1}^{C} y_{ic} \log \hat{y}_{ic}

0-1 损失与 Hinge 损失

$$
\mathcal{L}_{\text{hinge}} = \max(0, \, 1 - y_i f(\mathbf{x}_i))
$$
Lhinge=max⁡(0, 1−yif(xi))\mathcal{L}_{\text{hinge}} = \max(0, \, 1 - y_i f(\mathbf{x}_i))

4.4 正则化#

$$
\mathcal{L}_{\text{reg}} = \mathcal{L}(\mathbf{w}) + \lambda R(\mathbf{w}), \quad
R(\mathbf{w}) = \begin{cases}
\lVert \mathbf{w} \rVert_2^2 = \sum_j w_j^2, & \text{L2 (Ridge)} \\
\lVert \mathbf{w} \rVert_1 = \sum_j \lvert w_j \rvert, & \text{L1 (Lasso)}
\end{cases}
$$
Lreg=L(w)+λR(w),R(w)={∥w∥22=∑jwj2,L2 (Ridge)∥w∥1=∑j∣wj∣,L1 (Lasso)\mathcal{L}_{\text{reg}} = \mathcal{L}(\mathbf{w}) + \lambda R(\mathbf{w}), \quad R(\mathbf{w}) = \begin{cases} \lVert \mathbf{w} \rVert_2^2 = \sum_j w_j^2, & \text{L2 (Ridge)} \\ \lVert \mathbf{w} \rVert_1 = \sum_j \lvert w_j \rvert, & \text{L1 (Lasso)} \end{cases}

4.5 梯度下降#

批量梯度下降 BGD

$$
\theta_{t+1} = \theta_t - \eta \nabla_\theta \mathcal{L}(\theta_t)
= \theta_t - \eta \cdot \frac{1}{N} \sum_{i=1}^{N} \nabla_\theta \ell(f(\mathbf{x}_i; \theta), y_i)
$$
θt+1=θt−η∇θL(θt)=θt−η⋅1N∑i=1N∇θℓ(f(xi;θ),yi)\theta_{t+1} = \theta_t - \eta \nabla_\theta \mathcal{L}(\theta_t) = \theta_t - \eta \cdot \frac{1}{N} \sum_{i=1}^{N} \nabla_\theta \ell(f(\mathbf{x}_i; \theta), y_i)

随机梯度下降 SGD(每次只用一个样本)

$$
\theta_{t+1} = \theta_t - \eta \nabla_\theta \ell(f(\mathbf{x}_i; \theta_t), y_i), \quad i \sim \mathcal{U}\{1, \dots, N\}
$$
θt+1=θt−η∇θℓ(f(xi;θt),yi),i∼U{1,…,N}\theta_{t+1} = \theta_t - \eta \nabla_\theta \ell(f(\mathbf{x}_i; \theta_t), y_i), \quad i \sim \mathcal{U}\{1, \dots, N\}

4.6 贝叶斯公式#

$$
P(\theta \mid \mathcal{D}) = \frac{P(\mathcal{D} \mid \theta) \, P(\theta)}{P(\mathcal{D})}
= \frac{P(\mathcal{D} \mid \theta) \, P(\theta)}{\int_\Theta P(\mathcal{D} \mid \theta') P(\theta') \, d\theta'}
$$
P(θ∣D)=P(D∣θ) P(θ)P(D)=P(D∣θ) P(θ)∫ΘP(D∣θ′)P(θ′) dθ′P(\theta \mid \mathcal{D}) = \frac{P(\mathcal{D} \mid \theta) \, P(\theta)}{P(\mathcal{D})} = \frac{P(\mathcal{D} \mid \theta) \, P(\theta)}{\int_\Theta P(\mathcal{D} \mid \theta') P(\theta') \, d\theta'}

最大后验估计 MAP

$$
\theta_{\text{MAP}} = \arg\max_\theta \log P(\mathcal{D} \mid \theta) + \log P(\theta)
$$
θMAP=arg⁡max⁡θlog⁡P(D∣θ)+log⁡P(θ)\theta_{\text{MAP}} = \arg\max_\theta \log P(\mathcal{D} \mid \theta) + \log P(\theta)

最大似然估计 MLE

$$
\theta_{\text{MLE}} = \arg\max_\theta \prod_{i=1}^{N} p(\mathbf{x}_i \mid \theta)
= \arg\max_\theta \sum_{i=1}^{N} \log p(\mathbf{x}_i \mid \theta)
$$
θMLE=arg⁡max⁡θ∏i=1Np(xi∣θ)=arg⁡max⁡θ∑i=1Nlog⁡p(xi∣θ)\theta_{\text{MLE}} = \arg\max_\theta \prod_{i=1}^{N} p(\mathbf{x}_i \mid \theta) = \arg\max_\theta \sum_{i=1}^{N} \log p(\mathbf{x}_i \mid \theta)

4.7 高斯分布与 KL 散度#

多元高斯密度

$$
p(\mathbf{x}) = \frac{1}{(2\pi)^{d/2} \lvert \boldsymbol{\Sigma} \rvert^{1/2}}
\exp\left( -\frac{1}{2} (\mathbf{x} - \boldsymbol{\mu})^\top \boldsymbol{\Sigma}^{-1} (\mathbf{x} - \boldsymbol{\mu}) \right)
$$
p(x)=1(2π)d/2∣Σ∣1/2exp⁡(−12(x−μ)⊤Σ−1(x−μ))p(\mathbf{x}) = \frac{1}{(2\pi)^{d/2} \lvert \boldsymbol{\Sigma} \rvert^{1/2}} \exp\left( -\frac{1}{2} (\mathbf{x} - \boldsymbol{\mu})^\top \boldsymbol{\Sigma}^{-1} (\mathbf{x} - \boldsymbol{\mu}) \right)

KL 散度

$$
\text{KL}(p \parallel q) = \int p(\mathbf{x}) \log \frac{p(\mathbf{x})}{q(\mathbf{x})} \, d\mathbf{x}
= \mathbb{E}_{x \sim p}\left[ \log \frac{p(x)}{q(x)} \right]
$$
KL(p∥q)=∫p(x)log⁡p(x)q(x) dx=Ex∼p[log⁡p(x)q(x)]\text{KL}(p \parallel q) = \int p(\mathbf{x}) \log \frac{p(\mathbf{x})}{q(\mathbf{x})} \, d\mathbf{x} = \mathbb{E}_{x \sim p}\left[ \log \frac{p(x)}{q(x)} \right]

熵与互信息

$$
\mathcal{H}(X) = -\sum_{x} p(x) \log p(x), \quad
\mathcal{I}(X; Y) = \sum_{x, y} p(x, y) \log \frac{p(x, y)}{p(x) p(y)}
$$
H(X)=−∑xp(x)log⁡p(x),I(X;Y)=∑x,yp(x,y)log⁡p(x,y)p(x)p(y)\mathcal{H}(X) = -\sum_{x} p(x) \log p(x), \quad \mathcal{I}(X; Y) = \sum_{x, y} p(x, y) \log \frac{p(x, y)}{p(x) p(y)}

4.8 评估指标#

$$
\text{Accuracy} = \frac{TP + TN}{TP + TN + FP + FN}, \quad
\text{Precision} = \frac{TP}{TP + FP}, \quad
\text{Recall} = \frac{TP}{TP + FN}
$$
Accuracy=TP+TNTP+TN+FP+FN,Precision=TPTP+FP,Recall=TPTP+FN\text{Accuracy} = \frac{TP + TN}{TP + TN + FP + FN}, \quad \text{Precision} = \frac{TP}{TP + FP}, \quad \text{Recall} = \frac{TP}{TP + FN}
$$
F_1 = 2 \cdot \frac{\text{Precision} \cdot \text{Recall}}{\text{Precision} + \text{Recall}}, \quad
\text{AUC} = P(s_{\text{pos}} > s_{\text{neg}})
$$
F1=2⋅Precision⋅RecallPrecision+Recall,AUC=P(spos>sneg)F_1 = 2 \cdot \frac{\text{Precision} \cdot \text{Recall}}{\text{Precision} + \text{Recall}}, \quad \text{AUC} = P(s_{\text{pos}} > s_{\text{neg}})

4.9 距离度量#

$$
d_{\text{Euclidean}}(\mathbf{x}, \mathbf{y}) = \lVert \mathbf{x} - \mathbf{y} \rVert_2, \quad
d_{\cos}(\mathbf{x}, \mathbf{y}) = 1 - \frac{\mathbf{x}^\top \mathbf{y}}{\lVert \mathbf{x} \rVert_2 \lVert \mathbf{y} \rVert_2}
$$
dEuclidean(x,y)=∥x−y∥2,dcos⁡(x,y)=1−x⊤y∥x∥2∥y∥2d_{\text{Euclidean}}(\mathbf{x}, \mathbf{y}) = \lVert \mathbf{x} - \mathbf{y} \rVert_2, \quad d_{\cos}(\mathbf{x}, \mathbf{y}) = 1 - \frac{\mathbf{x}^\top \mathbf{y}}{\lVert \mathbf{x} \rVert_2 \lVert \mathbf{y} \rVert_2}

4.10 SVM 目标函数#

$$
\min_{\mathbf{w}, b} \frac{1}{2} \lVert \mathbf{w} \rVert^2 + C \sum_{i=1}^{N} \max(0, \, 1 - y_i(\mathbf{w}^\top \mathbf{x}_i + b))
$$
min⁡w,b12∥w∥2+C∑i=1Nmax⁡(0, 1−yi(w⊤xi+b))\min_{\mathbf{w}, b} \frac{1}{2} \lVert \mathbf{w} \rVert^2 + C \sum_{i=1}^{N} \max(0, \, 1 - y_i(\mathbf{w}^\top \mathbf{x}_i + b))

五、深度学习常用公式#

5.1 神经网络基础#

单层前向传播

$$
\mathbf{z}^{(l)} = \mathbf{W}^{(l)} \mathbf{a}^{(l-1)} + \mathbf{b}^{(l)}, \quad
\mathbf{a}^{(l)} = f(\mathbf{z}^{(l)})
$$
z(l)=W(l)a(l−1)+b(l),a(l)=f(z(l))\mathbf{z}^{(l)} = \mathbf{W}^{(l)} \mathbf{a}^{(l-1)} + \mathbf{b}^{(l)}, \quad \mathbf{a}^{(l)} = f(\mathbf{z}^{(l)})

其中 W(l)∈Rdl×dl−1\mathbf{W}^{(l)} \in \mathbb{R}^{d_l \times d_{l-1}},ff 为激活函数。

反向传播链式法则

$$
\frac{\partial \mathcal{L}}{\partial \mathbf{W}^{(l)}} = \frac{\partial \mathcal{L}}{\partial \mathbf{z}^{(l)}} \frac{\partial \mathbf{z}^{(l)}}{\partial \mathbf{W}^{(l)}}
= \boldsymbol{\delta}^{(l)} (\mathbf{a}^{(l-1)})^\top, \quad
\boldsymbol{\delta}^{(l)} = (\mathbf{W}^{(l+1)})^\top \boldsymbol{\delta}^{(l+1)} \odot f'(\mathbf{z}^{(l)})
$$
∂L∂W(l)=∂L∂z(l)∂z(l)∂W(l)=δ(l)(a(l−1))⊤,δ(l)=(W(l+1))⊤δ(l+1)⊙f′(z(l))\frac{\partial \mathcal{L}}{\partial \mathbf{W}^{(l)}} = \frac{\partial \mathcal{L}}{\partial \mathbf{z}^{(l)}} \frac{\partial \mathbf{z}^{(l)}}{\partial \mathbf{W}^{(l)}} = \boldsymbol{\delta}^{(l)} (\mathbf{a}^{(l-1)})^\top, \quad \boldsymbol{\delta}^{(l)} = (\mathbf{W}^{(l+1)})^\top \boldsymbol{\delta}^{(l+1)} \odot f'(\mathbf{z}^{(l)})

5.2 激活函数#

$$
\sigma(x) = \frac{1}{1 + e^{-x}}, \qquad
\tanh(x) = \frac{e^{x} - e^{-x}}{e^{x} + e^{-x}}, \qquad
\text{ReLU}(x) = \max(0, x)
$$
σ(x)=11+e−x,tanh⁡(x)=ex−e−xex+e−x,ReLU(x)=max⁡(0,x)\sigma(x) = \frac{1}{1 + e^{-x}}, \qquad \tanh(x) = \frac{e^{x} - e^{-x}}{e^{x} + e^{-x}}, \qquad \text{ReLU}(x) = \max(0, x)

Leaky ReLU / ELU / GELU

$$
\text{LeakyReLU}(x) = \begin{cases} x, & x \geq 0 \\ \alpha x, & x < 0 \end{cases}, \quad
\text{GELU}(x) = x \cdot \Phi(x) \approx x \sigma(1.702 x)
$$
LeakyReLU(x)={x,x≥0αx,x<0,GELU(x)=x⋅Φ(x)≈xσ(1.702x)\text{LeakyReLU}(x) = \begin{cases} x, & x \geq 0 \\ \alpha x, & x < 0 \end{cases}, \quad \text{GELU}(x) = x \cdot \Phi(x) \approx x \sigma(1.702 x)

Softmax

$$
\text{softmax}(\mathbf{z})_i = \frac{e^{z_i}}{\sum_{j=1}^{C} e^{z_j}}
= \frac{e^{z_i - \max_k z_k}}{\sum_{j=1}^{C} e^{z_j - \max_k z_k}} \quad \text{(数值稳定版)}
$$
softmax(z)i=ezi∑j=1Cezj=ezi−max⁡kzk∑j=1Cezj−max⁡kzk(数值稳定版)\text{softmax}(\mathbf{z})_i = \frac{e^{z_i}}{\sum_{j=1}^{C} e^{z_j}} = \frac{e^{z_i - \max_k z_k}}{\sum_{j=1}^{C} e^{z_j - \max_k z_k}} \quad \text{(数值稳定版)}

5.3 卷积神经网络#

二维离散卷积

$$
(f * g)(i, j) = \sum_{m} \sum_{n} f(m, n) \, g(i - m, \, j - n)
$$
(f∗g)(i,j)=∑m∑nf(m,n) g(i−m, j−n)(f * g)(i, j) = \sum_{m} \sum_{n} f(m, n) \, g(i - m, \, j - n)

卷积层前向(多通道)

$$
\mathbf{Y}_{c_{\text{out}}} = \sum_{c_{\text{in}}=1}^{C_{\text{in}}} \mathbf{X}_{c_{\text{in}}} * \mathbf{K}_{c_{\text{out}}, c_{\text{in}}} + b_{c_{\text{out}}}
$$
Ycout=∑cin=1CinXcin∗Kcout,cin+bcout\mathbf{Y}_{c_{\text{out}}} = \sum_{c_{\text{in}}=1}^{C_{\text{in}}} \mathbf{X}_{c_{\text{in}}} * \mathbf{K}_{c_{\text{out}}, c_{\text{in}}} + b_{c_{\text{out}}}

输出尺寸公式

$$
H_{\text{out}} = \left\lfloor \frac{H_{\text{in}} + 2p - k}{s} \right\rfloor + 1, \quad
W_{\text{out}} = \left\lfloor \frac{W_{\text{in}} + 2p - k}{s} \right\rfloor + 1
$$
Hout=⌊Hin+2p−ks⌋+1,Wout=⌊Win+2p−ks⌋+1H_{\text{out}} = \left\lfloor \frac{H_{\text{in}} + 2p - k}{s} \right\rfloor + 1, \quad W_{\text{out}} = \left\lfloor \frac{W_{\text{in}} + 2p - k}{s} \right\rfloor + 1

其中 kk 为卷积核大小,pp 为 padding,ss 为 stride。

5.4 循环神经网络#

RNN

$$
\mathbf{h}_t = \tanh(\mathbf{W}_{xh} \mathbf{x}_t + \mathbf{W}_{hh} \mathbf{h}_{t-1} + \mathbf{b}_h), \quad
\mathbf{y}_t = \mathbf{W}_{hy} \mathbf{h}_t + \mathbf{b}_y
$$
ht=tanh⁡(Wxhxt+Whhht−1+bh),yt=Whyht+by\mathbf{h}_t = \tanh(\mathbf{W}_{xh} \mathbf{x}_t + \mathbf{W}_{hh} \mathbf{h}_{t-1} + \mathbf{b}_h), \quad \mathbf{y}_t = \mathbf{W}_{hy} \mathbf{h}_t + \mathbf{b}_y

LSTM

$$
\begin{aligned}
\mathbf{f}_t &= \sigma(\mathbf{W}_f [\mathbf{h}_{t-1}, \mathbf{x}_t] + \mathbf{b}_f) &&\text{遗忘门} \\
\mathbf{i}_t &= \sigma(\mathbf{W}_i [\mathbf{h}_{t-1}, \mathbf{x}_t] + \mathbf{b}_i) &&\text{输入门} \\
\mathbf{o}_t &= \sigma(\mathbf{W}_o [\mathbf{h}_{t-1}, \mathbf{x}_t] + \mathbf{b}_o) &&\text{输出门} \\
\tilde{\mathbf{c}}_t &= \tanh(\mathbf{W}_c [\mathbf{h}_{t-1}, \mathbf{x}_t] + \mathbf{b}_c) &&\text{候选状态} \\
\mathbf{c}_t &= \mathbf{f}_t \odot \mathbf{c}_{t-1} + \mathbf{i}_t \odot \tilde{\mathbf{c}}_t &&\text{细胞状态} \\
\mathbf{h}_t &= \mathbf{o}_t \odot \tanh(\mathbf{c}_t) &&\text{隐藏状态}
\end{aligned}
$$
ft=σ(Wf[ht−1,xt]+bf)遗忘门it=σ(Wi[ht−1,xt]+bi)输入门ot=σ(Wo[ht−1,xt]+bo)输出门c~t=tanh⁡(Wc[ht−1,xt]+bc)候选状态ct=ft⊙ct−1+it⊙c~t细胞状态ht=ot⊙tanh⁡(ct)隐藏状态\begin{aligned} \mathbf{f}_t &= \sigma(\mathbf{W}_f [\mathbf{h}_{t-1}, \mathbf{x}_t] + \mathbf{b}_f) &&\text{遗忘门} \\ \mathbf{i}_t &= \sigma(\mathbf{W}_i [\mathbf{h}_{t-1}, \mathbf{x}_t] + \mathbf{b}_i) &&\text{输入门} \\ \mathbf{o}_t &= \sigma(\mathbf{W}_o [\mathbf{h}_{t-1}, \mathbf{x}_t] + \mathbf{b}_o) &&\text{输出门} \\ \tilde{\mathbf{c}}_t &= \tanh(\mathbf{W}_c [\mathbf{h}_{t-1}, \mathbf{x}_t] + \mathbf{b}_c) &&\text{候选状态} \\ \mathbf{c}_t &= \mathbf{f}_t \odot \mathbf{c}_{t-1} + \mathbf{i}_t \odot \tilde{\mathbf{c}}_t &&\text{细胞状态} \\ \mathbf{h}_t &= \mathbf{o}_t \odot \tanh(\mathbf{c}_t) &&\text{隐藏状态} \end{aligned}

&& 是 aligned 里的第二组对齐锚点,用来把注释文字对齐到右侧。

GRU

$$
\begin{aligned}
\mathbf{z}_t &= \sigma(\mathbf{W}_z [\mathbf{h}_{t-1}, \mathbf{x}_t]) &&\text{更新门} \\
\mathbf{r}_t &= \sigma(\mathbf{W}_r [\mathbf{h}_{t-1}, \mathbf{x}_t]) &&\text{重置门} \\
\tilde{\mathbf{h}}_t &= \tanh(\mathbf{W}_h [\mathbf{r}_t \odot \mathbf{h}_{t-1}, \mathbf{x}_t]) &&\text{候选} \\
\mathbf{h}_t &= (1 - \mathbf{z}_t) \odot \mathbf{h}_{t-1} + \mathbf{z}_t \odot \tilde{\mathbf{h}}_t &&\text{输出}
\end{aligned}
$$
zt=σ(Wz[ht−1,xt])更新门rt=σ(Wr[ht−1,xt])重置门h~t=tanh⁡(Wh[rt⊙ht−1,xt])候选ht=(1−zt)⊙ht−1+zt⊙h~t输出\begin{aligned} \mathbf{z}_t &= \sigma(\mathbf{W}_z [\mathbf{h}_{t-1}, \mathbf{x}_t]) &&\text{更新门} \\ \mathbf{r}_t &= \sigma(\mathbf{W}_r [\mathbf{h}_{t-1}, \mathbf{x}_t]) &&\text{重置门} \\ \tilde{\mathbf{h}}_t &= \tanh(\mathbf{W}_h [\mathbf{r}_t \odot \mathbf{h}_{t-1}, \mathbf{x}_t]) &&\text{候选} \\ \mathbf{h}_t &= (1 - \mathbf{z}_t) \odot \mathbf{h}_{t-1} + \mathbf{z}_t \odot \tilde{\mathbf{h}}_t &&\text{输出} \end{aligned}

5.5 注意力机制与 Transformer#

缩放点积注意力

$$
\text{Attention}(\mathbf{Q}, \mathbf{K}, \mathbf{V}) = \text{softmax}\left( \frac{\mathbf{Q} \mathbf{K}^\top}{\sqrt{d_k}} \right) \mathbf{V}
$$
Attention(Q,K,V)=softmax(QK⊤dk)V\text{Attention}(\mathbf{Q}, \mathbf{K}, \mathbf{V}) = \text{softmax}\left( \frac{\mathbf{Q} \mathbf{K}^\top}{\sqrt{d_k}} \right) \mathbf{V}

多头注意力

$$
\begin{aligned}
\text{MultiHead}(\mathbf{Q}, \mathbf{K}, \mathbf{V}) &= \text{Concat}(\text{head}_1, \dots, \text{head}_h) \mathbf{W}^O \\
\text{head}_i &= \text{Attention}(\mathbf{Q} \mathbf{W}_i^Q, \, \mathbf{K} \mathbf{W}_i^K, \, \mathbf{V} \mathbf{W}_i^V)
\end{aligned}
$$
MultiHead(Q,K,V)=Concat(head1,…,headh)WOheadi=Attention(QWiQ, KWiK, VWiV)\begin{aligned} \text{MultiHead}(\mathbf{Q}, \mathbf{K}, \mathbf{V}) &= \text{Concat}(\text{head}_1, \dots, \text{head}_h) \mathbf{W}^O \\ \text{head}_i &= \text{Attention}(\mathbf{Q} \mathbf{W}_i^Q, \, \mathbf{K} \mathbf{W}_i^K, \, \mathbf{V} \mathbf{W}_i^V) \end{aligned}

带 mask 的注意力(因果语言模型)

$$
\text{Attention}(\mathbf{Q}, \mathbf{K}, \mathbf{V}) = \text{softmax}\left( \frac{\mathbf{Q} \mathbf{K}^\top}{\sqrt{d_k}} + \mathbf{M} \right) \mathbf{V}, \quad
M_{ij} = \begin{cases} 0, & i \geq j \\ -\infty, & i < j \end{cases}
$$
Attention(Q,K,V)=softmax(QK⊤dk+M)V,Mij={0,i≥j−∞,i<j\text{Attention}(\mathbf{Q}, \mathbf{K}, \mathbf{V}) = \text{softmax}\left( \frac{\mathbf{Q} \mathbf{K}^\top}{\sqrt{d_k}} + \mathbf{M} \right) \mathbf{V}, \quad M_{ij} = \begin{cases} 0, & i \geq j \\ -\infty, & i < j \end{cases}

正弦位置编码

$$
PE_{(pos, \, 2i)} = \sin\left( \frac{pos}{10000^{2i/d_{\text{model}}}} \right), \quad
PE_{(pos, \, 2i+1)} = \cos\left( \frac{pos}{10000^{2i/d_{\text{model}}}} \right)
$$
PE(pos, 2i)=sin⁡(pos100002i/dmodel),PE(pos, 2i+1)=cos⁡(pos100002i/dmodel)PE_{(pos, \, 2i)} = \sin\left( \frac{pos}{10000^{2i/d_{\text{model}}}} \right), \quad PE_{(pos, \, 2i+1)} = \cos\left( \frac{pos}{10000^{2i/d_{\text{model}}}} \right)

前馈网络 FFN

$$
\text{FFN}(\mathbf{x}) = \max(0, \, \mathbf{x} \mathbf{W}_1 + \mathbf{b}_1) \mathbf{W}_2 + \mathbf{b}_2, \quad
\mathbf{W}_1 \in \mathbb{R}^{d_{\text{model}} \times d_{ff}}, \; d_{ff} = 4 d_{\text{model}}
$$
FFN(x)=max⁡(0, xW1+b1)W2+b2,W1∈Rdmodel×dff,  dff=4dmodel\text{FFN}(\mathbf{x}) = \max(0, \, \mathbf{x} \mathbf{W}_1 + \mathbf{b}_1) \mathbf{W}_2 + \mathbf{b}_2, \quad \mathbf{W}_1 \in \mathbb{R}^{d_{\text{model}} \times d_{ff}}, \; d_{ff} = 4 d_{\text{model}}

残差连接 + LayerNorm(Post-LN)

$$
\mathbf{x}' = \text{LayerNorm}\big( \mathbf{x} + \text{Sublayer}(\mathbf{x}) \big)
$$
x′=LayerNorm(x+Sublayer(x))\mathbf{x}' = \text{LayerNorm}\big( \mathbf{x} + \text{Sublayer}(\mathbf{x}) \big)

5.6 归一化层#

Layer Normalization

$$
\text{LN}(\mathbf{x}) = \boldsymbol{\gamma} \odot \frac{\mathbf{x} - \mu}{\sqrt{\sigma^2 + \epsilon}} + \boldsymbol{\beta}, \quad
\mu = \frac{1}{d} \sum_{i=1}^{d} x_i, \quad \sigma^2 = \frac{1}{d} \sum_{i=1}^{d} (x_i - \mu)^2
$$
LN(x)=γ⊙x−μσ2+ϵ+β,μ=1d∑i=1dxi,σ2=1d∑i=1d(xi−μ)2\text{LN}(\mathbf{x}) = \boldsymbol{\gamma} \odot \frac{\mathbf{x} - \mu}{\sqrt{\sigma^2 + \epsilon}} + \boldsymbol{\beta}, \quad \mu = \frac{1}{d} \sum_{i=1}^{d} x_i, \quad \sigma^2 = \frac{1}{d} \sum_{i=1}^{d} (x_i - \mu)^2

Batch Normalization(训练 / 推理)

$$
\hat{x}_i = \frac{x_i - \mu_{\mathcal{B}}}{\sqrt{\sigma_{\mathcal{B}}^2 + \epsilon}}, \quad
y_i = \gamma \hat{x}_i + \beta, \quad
\mu_{\mathcal{B}} = \frac{1}{m} \sum_{i=1}^{m} x_i
$$
x^i=xi−μBσB2+ϵ,yi=γx^i+β,μB=1m∑i=1mxi\hat{x}_i = \frac{x_i - \mu_{\mathcal{B}}}{\sqrt{\sigma_{\mathcal{B}}^2 + \epsilon}}, \quad y_i = \gamma \hat{x}_i + \beta, \quad \mu_{\mathcal{B}} = \frac{1}{m} \sum_{i=1}^{m} x_i

RMSNorm(LLaMA 系列常用)

$$
\text{RMSNorm}(\mathbf{x}) = \frac{\mathbf{x}}{\sqrt{\frac{1}{d} \sum_{i=1}^{d} x_i^2 + \epsilon}} \odot \boldsymbol{\gamma}
$$
RMSNorm(x)=x1d∑i=1dxi2+ϵ⊙γ\text{RMSNorm}(\mathbf{x}) = \frac{\mathbf{x}}{\sqrt{\frac{1}{d} \sum_{i=1}^{d} x_i^2 + \epsilon}} \odot \boldsymbol{\gamma}

5.7 优化器#

SGD + Momentum

$$
\mathbf{v}_t = \mu \mathbf{v}_{t-1} + \eta \nabla_\theta \mathcal{L}(\theta_{t-1}), \quad
\theta_t = \theta_{t-1} - \mathbf{v}_t
$$
vt=μvt−1+η∇θL(θt−1),θt=θt−1−vt\mathbf{v}_t = \mu \mathbf{v}_{t-1} + \eta \nabla_\theta \mathcal{L}(\theta_{t-1}), \quad \theta_t = \theta_{t-1} - \mathbf{v}_t

Adam

$$
\begin{aligned}
\mathbf{m}_t &= \beta_1 \mathbf{m}_{t-1} + (1 - \beta_1) \mathbf{g}_t &&\text{一阶动量} \\
\mathbf{v}_t &= \beta_2 \mathbf{v}_{t-1} + (1 - \beta_2) \mathbf{g}_t^2 &&\text{二阶动量} \\
\hat{\mathbf{m}}_t &= \frac{\mathbf{m}_t}{1 - \beta_1^t}, \quad \hat{\mathbf{v}}_t = \frac{\mathbf{v}_t}{1 - \beta_2^t} &&\text{偏差修正} \\
\theta_t &= \theta_{t-1} - \eta \frac{\hat{\mathbf{m}}_t}{\sqrt{\hat{\mathbf{v}}_t} + \epsilon} &&\text{更新}
\end{aligned}
$$
mt=β1mt−1+(1−β1)gt一阶动量vt=β2vt−1+(1−β2)gt2二阶动量m^t=mt1−β1t,v^t=vt1−β2t偏差修正θt=θt−1−ηm^tv^t+ϵ更新\begin{aligned} \mathbf{m}_t &= \beta_1 \mathbf{m}_{t-1} + (1 - \beta_1) \mathbf{g}_t &&\text{一阶动量} \\ \mathbf{v}_t &= \beta_2 \mathbf{v}_{t-1} + (1 - \beta_2) \mathbf{g}_t^2 &&\text{二阶动量} \\ \hat{\mathbf{m}}_t &= \frac{\mathbf{m}_t}{1 - \beta_1^t}, \quad \hat{\mathbf{v}}_t = \frac{\mathbf{v}_t}{1 - \beta_2^t} &&\text{偏差修正} \\ \theta_t &= \theta_{t-1} - \eta \frac{\hat{\mathbf{m}}_t}{\sqrt{\hat{\mathbf{v}}_t} + \epsilon} &&\text{更新} \end{aligned}

默认 β1=0.9, β2=0.999, ϵ=10−8\beta_1 = 0.9,\ \beta_2 = 0.999,\ \epsilon = 10^{-8}。

AdamW(解耦权重衰减)

$$
\theta_t = \theta_{t-1} - \eta \left( \frac{\hat{\mathbf{m}}_t}{\sqrt{\hat{\mathbf{v}}_t} + \epsilon} + \lambda \theta_{t-1} \right)
$$
θt=θt−1−η(m^tv^t+ϵ+λθt−1)\theta_t = \theta_{t-1} - \eta \left( \frac{\hat{\mathbf{m}}_t}{\sqrt{\hat{\mathbf{v}}_t} + \epsilon} + \lambda \theta_{t-1} \right)

5.8 学习率调度#

Cosine Annealing(带 warmup)

$$
\eta_t = \eta_{\min} + \frac{1}{2}(\eta_{\max} - \eta_{\min}) \left( 1 + \cos\left( \pi \frac{t - t_w}{T - t_w} \right) \right), \quad
\eta_t = \eta_{\max} \cdot \frac{t}{t_w} \;\; (t < t_w)
$$
ηt=ηmin⁡+12(ηmax⁡−ηmin⁡)(1+cos⁡(πt−twT−tw)),ηt=ηmax⁡⋅ttw    (t<tw)\eta_t = \eta_{\min} + \frac{1}{2}(\eta_{\max} - \eta_{\min}) \left( 1 + \cos\left( \pi \frac{t - t_w}{T - t_w} \right) \right), \quad \eta_t = \eta_{\max} \cdot \frac{t}{t_w} \;\; (t < t_w)

梯度裁剪(按范数)

$$
\mathbf{g} \leftarrow \begin{cases}
\mathbf{g}, & \lVert \mathbf{g} \rVert_2 \leq c \\
c \cdot \dfrac{\mathbf{g}}{\lVert \mathbf{g} \rVert_2}, & \lVert \mathbf{g} \rVert_2 > c
\end{cases}
$$
g←{g,∥g∥2≤cc⋅g∥g∥2,∥g∥2>c\mathbf{g} \leftarrow \begin{cases} \mathbf{g}, & \lVert \mathbf{g} \rVert_2 \leq c \\ c \cdot \dfrac{\mathbf{g}}{\lVert \mathbf{g} \rVert_2}, & \lVert \mathbf{g} \rVert_2 > c \end{cases}

5.9 正则化技巧#

Dropout(训练时)

$$
\tilde{\mathbf{a}} = \mathbf{m} \odot \mathbf{a}, \quad m_i \sim \text{Bernoulli}(1 - p), \quad
\mathbf{a}^{\text{test}} = (1 - p) \cdot \mathbf{a} \;\; \text{(Inverted Dropout)}
$$
a~=m⊙a,mi∼Bernoulli(1−p),atest=(1−p)⋅a    (Inverted Dropout)\tilde{\mathbf{a}} = \mathbf{m} \odot \mathbf{a}, \quad m_i \sim \text{Bernoulli}(1 - p), \quad \mathbf{a}^{\text{test}} = (1 - p) \cdot \mathbf{a} \;\; \text{(Inverted Dropout)}

权重初始化

$$
\text{Xavier: } \mathbf{W} \sim \mathcal{U}\left( -\sqrt{\frac{6}{d_{\text{in}} + d_{\text{out}}}}, \, \sqrt{\frac{6}{d_{\text{in}} + d_{\text{out}}}} \right), \qquad
\text{He: } \mathbf{W} \sim \mathcal{N}\left( 0, \, \frac{2}{d_{\text{in}}} \right)
$$
Xavier: W∼U(−6din+dout, 6din+dout),He: W∼N(0, 2din)\text{Xavier: } \mathbf{W} \sim \mathcal{U}\left( -\sqrt{\frac{6}{d_{\text{in}} + d_{\text{out}}}}, \, \sqrt{\frac{6}{d_{\text{in}} + d_{\text{out}}}} \right), \qquad \text{He: } \mathbf{W} \sim \mathcal{N}\left( 0, \, \frac{2}{d_{\text{in}}} \right)

5.10 深度学习损失函数#

Focal Loss(解决类别不平衡)

$$
\mathcal{L}_{\text{FL}} = -\alpha (1 - \hat{p}_t)^\gamma \log(\hat{p}_t), \quad
\hat{p}_t = \begin{cases} \hat{y}, & y = 1 \\ 1 - \hat{y}, & y = 0 \end{cases}
$$
LFL=−α(1−p^t)γlog⁡(p^t),p^t={y^,y=11−y^,y=0\mathcal{L}_{\text{FL}} = -\alpha (1 - \hat{p}_t)^\gamma \log(\hat{p}_t), \quad \hat{p}_t = \begin{cases} \hat{y}, & y = 1 \\ 1 - \hat{y}, & y = 0 \end{cases}

自回归语言模型损失

$$
\mathcal{L} = -\frac{1}{T} \sum_{t=1}^{T} \log P(x_t \mid x_{<t}; \theta), \quad
P(x_{1:T}) = \prod_{t=1}^{T} P(x_t \mid x_{<t})
$$
L=−1T∑t=1Tlog⁡P(xt∣x<t;θ),P(x1:T)=∏t=1TP(xt∣x<t)\mathcal{L} = -\frac{1}{T} \sum_{t=1}^{T} \log P(x_t \mid x_{<t}; \theta), \quad P(x_{1:T}) = \prod_{t=1}^{T} P(x_t \mid x_{<t})

困惑度 PPL

$$
\text{PPL} = \exp\left( -\frac{1}{T} \sum_{t=1}^{T} \log P(x_t \mid x_{<t}) \right) = \exp(\mathcal{L})
$$
PPL=exp⁡(−1T∑t=1Tlog⁡P(xt∣x<t))=exp⁡(L)\text{PPL} = \exp\left( -\frac{1}{T} \sum_{t=1}^{T} \log P(x_t \mid x_{<t}) \right) = \exp(\mathcal{L})

对比学习 InfoNCE

$$
\mathcal{L}_{\text{InfoNCE}} = -\log \frac{\exp(\text{sim}(\mathbf{q}, \mathbf{k}^+) / \tau)}
{\exp(\text{sim}(\mathbf{q}, \mathbf{k}^+) / \tau) + \sum_{j=1}^{K} \exp(\text{sim}(\mathbf{q}, \mathbf{k}_j^-) / \tau)}
$$
LInfoNCE=−log⁡exp⁡(sim(q,k+)/τ)exp⁡(sim(q,k+)/τ)+∑j=1Kexp⁡(sim(q,kj−)/τ)\mathcal{L}_{\text{InfoNCE}} = -\log \frac{\exp(\text{sim}(\mathbf{q}, \mathbf{k}^+) / \tau)} {\exp(\text{sim}(\mathbf{q}, \mathbf{k}^+) / \tau) + \sum_{j=1}^{K} \exp(\text{sim}(\mathbf{q}, \mathbf{k}_j^-) / \tau)}

5.11 生成模型#

VAE 变分下界(ELBO)

$$
\log p_\theta(\mathbf{x}) \geq \underbrace{\mathbb{E}_{q_\phi(\mathbf{z} \mid \mathbf{x})} \left[ \log p_\theta(\mathbf{x} \mid \mathbf{z}) \right]}_{\text{重构项}}
- \underbrace{\text{KL}\left( q_\phi(\mathbf{z} \mid \mathbf{x}) \parallel p(\mathbf{z}) \right)}_{\text{正则项}}
$$
log⁡pθ(x)≥Eqϕ(z∣x)[log⁡pθ(x∣z)]⏟重构项−KL(qϕ(z∣x)∥p(z))⏟正则项\log p_\theta(\mathbf{x}) \geq \underbrace{\mathbb{E}_{q_\phi(\mathbf{z} \mid \mathbf{x})} \left[ \log p_\theta(\mathbf{x} \mid \mathbf{z}) \right]}_{\text{重构项}} - \underbrace{\text{KL}\left( q_\phi(\mathbf{z} \mid \mathbf{x}) \parallel p(\mathbf{z}) \right)}_{\text{正则项}}

GAN 目标函数

$$
\min_G \max_D V(D, G) = \mathbb{E}_{\mathbf{x} \sim p_{\text{data}}} \left[ \log D(\mathbf{x}) \right]
+ \mathbb{E}_{\mathbf{z} \sim p_{\mathbf{z}}} \left[ \log \left( 1 - D(G(\mathbf{z})) \right) \right]
$$
min⁡Gmax⁡DV(D,G)=Ex∼pdata[log⁡D(x)]+Ez∼pz[log⁡(1−D(G(z)))]\min_G \max_D V(D, G) = \mathbb{E}_{\mathbf{x} \sim p_{\text{data}}} \left[ \log D(\mathbf{x}) \right] + \mathbb{E}_{\mathbf{z} \sim p_{\mathbf{z}}} \left[ \log \left( 1 - D(G(\mathbf{z})) \right) \right]

扩散模型(DDPM 简化训练目标)

$$
\mathcal{L}_{\text{simple}} = \mathbb{E}_{t, \mathbf{x}_0, \boldsymbol{\epsilon}} \left[ \lVert \boldsymbol{\epsilon} - \boldsymbol{\epsilon}_\theta(\mathbf{x}_t, t) \rVert_2^2 \right], \quad
\mathbf{x}_t = \sqrt{\bar{\alpha}_t} \, \mathbf{x}_0 + \sqrt{1 - \bar{\alpha}_t} \, \boldsymbol{\epsilon}
$$
Lsimple=Et,x0,ϵ[∥ϵ−ϵθ(xt,t)∥22],xt=αˉt x0+1−αˉt ϵ\mathcal{L}_{\text{simple}} = \mathbb{E}_{t, \mathbf{x}_0, \boldsymbol{\epsilon}} \left[ \lVert \boldsymbol{\epsilon} - \boldsymbol{\epsilon}_\theta(\mathbf{x}_t, t) \rVert_2^2 \right], \quad \mathbf{x}_t = \sqrt{\bar{\alpha}_t} \, \mathbf{x}_0 + \sqrt{1 - \bar{\alpha}_t} \, \boldsymbol{\epsilon}

附录:最常用 30 个命令#

\frac{}{} \sqrt{} \partial \nabla \sum_{}^{} \prod_{}^{} \int_{}^{}
\mathbb{R} \mathbb{E} \mathcal{L} \mathcal{D} \mathbf{x} \mathbf{W} \boldsymbol{\theta}
\theta \lambda \mu \sigma \epsilon \alpha \eta \tau
\times \cdot \odot \otimes \oplus \mid \sim \approx \propto \perp
\to \mapsto \Rightarrow \infty \hat{y} \tilde{x} \bar{x}
\lVert \rVert \langle \rangle \text{} \left( \right)

💡 建议把本文件存为 .md 放在笔记库根目录,写作时直接搜索复制。

支持与分享

如果这篇文章对你有帮助,欢迎分享给更多人或打赏支持!

打赏
人工智能领域常用LaTeX公式语法符号汇总
https://kulve.tech/posts/yuili/agent笔记/人工智能领域常用latex公式语法符号汇总/
作者
Kulve
发布于
2026-09-03
许可协议
CC BY-NC-SA 4.0
Profile Image of the Author
Kulve
Hello, I'm Kulve.
公告
你好,欢迎来到我的博客
分类
标签
最新动态
站点统计
文章
20
分类
8
标签
25
总字数
44,297
运行时长
0 天
最后活动
0 天前
站点信息
构建平台
GitHub Actions
博客版本
Firefly v6.16.7
文章许可
CC BY-NC-SA 4.0
文章目录