math-skill 3.0.1 → 3.1.0

package/knowledge-base/optimization/constrained-optimization.en.md

@@ -13,7 +13,7 @@ Minimizes an objective $f(x)$ over a constraint set $\mathcal{C} = \{x : g_i(x)
   - $\lambda_i g_i(x) = 0$ (complementary slackness)
 - Projected gradient method: $x_{k+1} = \text{proj}_{\mathcal{C}}(x_k - \alpha \nabla f(x_k))$
 - Penalty function method: $\min_x f(x) + \frac{\rho}{2}\sum [\max(0, g_i(x))]^2 + \frac{\rho}{2}\sum h_j(x)^2$
-- Augmented Lagrangian: $\mathcal{L}_\rho(x,\lambda) = f(x) + \sum \lambda_i g_i(x) + \frac{\rho}{2}\sum g_i(x)^2$
+- Augmented Lagrangian (inequality constraints $g_i(x) \leq 0$): $\mathcal{L}_\rho(x,\lambda) = f(x) + \frac{\rho}{2}\sum_i \left[\max\!\left(0,\; \frac{\lambda_i}{\rho} + g_i(x)\right)^2 - \left(\frac{\lambda_i}{\rho}\right)^2\right]$ (strictly feasible constraints where $g_i(x) < 0$ and $\lambda_i/\rho + g_i(x) \leq 0$ are not penalized; for equality constraints this reduces to $\mathcal{L}_\rho = f(x) + \sum \nu_j h_j(x) + \frac{\rho}{2}\sum h_j(x)^2$)
 - Armijo line search (constrained version): $\alpha$ satisfies $f(\text{proj}_\mathcal{C}(x - \alpha \nabla f)) \leq f(x) - \sigma \alpha \|\nabla f\|^2$
 
 ## Applicable Problems
@@ -27,7 +27,7 @@ Minimizes an objective $f(x)$ over a constraint set $\mathcal{C} = \{x : g_i(x)
 ## AI Design Translation
 
 - **Weight clipping (WGAN)**: $W \leftarrow \text{clamp}(W, -c, c)$ is projection onto an $\ell_\infty$-box constraint. Implemented as `torch.clamp(W, -c, c)`, an elementwise operation with zero additional computation. Simple but coarse, less refined than spectral normalization.
-- **Spectral normalization**: Constrains $\sigma_{\max}(W) \leq 1$, i.e., projects onto the operator norm ball. Uses power iteration to estimate $u \leftarrow W^T W u / \|W^T W u\|$, then normalizes $W \leftarrow W / \sigma_{\max}$. Two matvec + norm operations per step; built into PyTorch as `torch.nn.utils.spectral_norm`.
+- **Spectral normalization**: A common engineering way to enforce $\sigma_{\max}(W) \leq 1$ is the scaling reparameterization $W \leftarrow W / \max(1,\sigma_{\max})$, with $\sigma_{\max}$ estimated by power iteration. This is not the Frobenius-nearest projection onto the operator-norm ball; the exact projection clips singular values individually. About two matvec + norm operations per step; built into PyTorch as `torch.nn.utils.spectral_norm`.
 - **Projected gradient for $\ell_2$-ball constraints**: $\text{proj}(w) = w \cdot \min(1, R/\|w\|_2)$, implemented as `w * min(1, R / w.norm())`, one norm + elementwise operation, $O(d)$. Used in trust regions and adversarial robustness $\epsilon$-ball constraints.
 - **Augmented Lagrangian for RLHF/PPO**: $\mathcal{L} = -\mathbb{E}[r] + \lambda(\text{KL}(\pi\|\pi_{\text{ref}}) - \epsilon) + \frac{\rho}{2}(\text{KL} - \epsilon)^2$. The inner loop optimizes $\pi$ via PPO; the outer loop updates $\lambda \leftarrow \lambda + \rho(\text{KL} - \epsilon)$. KL computation involves softmax + elementwise log-ratio, GPU-friendly.
 - **Penalty method for sparsity/low-rank constraints**: $\mathcal{L}_{\text{penalty}} = \mathcal{L}_{\text{task}} + \rho \sum_i \max(0, \|w_i\|_1 - \tau)^2$ constrains per-layer sparsity to not exceed $\tau$. The penalty term is elementwise + reduce, differentiable and GPU-friendly. $\rho$ increasing schedule: $\rho \leftarrow \beta \rho$ ($\beta > 1$), doubling every several steps.
@@ -49,5 +49,19 @@ Minimizes an objective $f(x)$ over a constraint set $\mathcal{C} = \{x : g_i(x)
 
 ## Further References
 
-- Distilled notes: references/books/optimization-ml.md (Ch 20-21 Equality/Inequality Constraints and KKT, Ch 24 Constrained Algorithms Section 24.3 Projected Gradient, Section 24.5 Augmented Lagrangian, Section 24.6 Penalty Methods)
+- Distilled notes: ../../references/books/optimization-ml.en.md (Ch 20-21 Equality/Inequality Constraints and KKT, Ch 24 Constrained Algorithms Section 24.3 Projected Gradient, Section 24.5 Augmented Lagrangian, Section 24.6 Penalty Methods)
 - Original text: Chong, Lu, Zak, *An Introduction to Optimization* 5th Ed., Chapter 20-21 (Equality & Inequality Constraints) + Chapter 24 (Algorithms for Constrained Optimization Section 24.2-24.6)
+
+
+## Routing Extensions
+- If a dual perspective is needed -> `lagrangian-duality.en.md` (Lagrangian duality theory)
+- If constraints are on a manifold -> `riemannian-optimization.en.md` (Riemannian optimization for manifold constraints)
+- If penalty term design is needed -> `constraint-penalty` (design pattern layer for constraint penalties)
+
+## Extensible Directions
+- Penalty / barrier methods: converting constraints to penalty terms
+- Sequential quadratic programming (SQP): second-order methods for constrained optimization
+- Active set methods: identifying the active constraint set
+- Constraint qualification: LICQ, MFCQ and other regularity conditions
+- Exact penalty: exact solutions with finite penalty parameters
+- Augmented Lagrangian methods: combining duality and penalty functions

package/knowledge-base/optimization/constrained-optimization.md

@@ -13,7 +13,7 @@
   - $\lambda_i g_i(x) = 0$（互补松弛）
 - 投影梯度法：$x_{k+1} = \text{proj}_{\mathcal{C}}(x_k - \alpha \nabla f(x_k))$
 - 惩罚函数法：$\min_x f(x) + \frac{\rho}{2}\sum [\max(0, g_i(x))]^2 + \frac{\rho}{2}\sum h_j(x)^2$
-- 增广 Lagrangian：$\mathcal{L}_\rho(x,\lambda) = f(x) + \sum \lambda_i g_i(x) + \frac{\rho}{2}\sum g_i(x)^2$
+- 增广 Lagrangian（不等式约束 $g_i(x) \leq 0$）：$\mathcal{L}_\rho(x,\lambda) = f(x) + \frac{\rho}{2}\sum_i \left[\max\!\left(0,\; \frac{\lambda_i}{\rho} + g_i(x)\right)^2 - \left(\frac{\lambda_i}{\rho}\right)^2\right]$（严格可行约束 $g_i(x) < 0$ 且 $\lambda_i/\rho + g_i(x) \leq 0$ 时不受惩罚；等式约束退化为 $\mathcal{L}_\rho = f(x) + \sum \nu_j h_j(x) + \frac{\rho}{2}\sum h_j(x)^2$）
 - Armijo 线搜索（约束版）：$\alpha$ 满足 $f(\text{proj}_\mathcal{C}(x - \alpha \nabla f)) \leq f(x) - \sigma \alpha \|\nabla f\|^2$
 
 ## 适用问题
@@ -27,7 +27,7 @@
 ## AI 设计翻译
 
 - **Weight Clipping (WGAN)**：$W \leftarrow \text{clamp}(W, -c, c)$ 即投影到 $\ell_\infty$-box 约束。实现为 `torch.clamp(W, -c, c)`，elementwise 操作，零额外计算。简单但粗糙，不如谱归一化精细。
-- **谱归一化 (Spectral Normalization)**：约束 $\sigma_{\max}(W) \leq 1$，即投影到算子范数球。用 power iteration 估 $u \leftarrow W^T W u / \|W^T W u\|$，归一化 $W \leftarrow W / \sigma_{\max}$。每步 2 次 matvec + norm，PyTorch 内置 `torch.nn.utils.spectral_norm`。
+- **谱归一化 (Spectral Normalization)**：约束 $\sigma_{\max}(W) \leq 1$ 的常用工程做法是缩放重参数化 $W \leftarrow W / \max(1,\sigma_{\max})$，其中 $\sigma_{\max}$ 用 power iteration 估计。注意这不是 Frobenius 范数下到算子范数球的最近投影；真正最近投影需对奇异值逐个裁剪。每步约 2 次 matvec + norm，PyTorch 内置 `torch.nn.utils.spectral_norm`。
 - **投影梯度做 $\ell_2$-ball 约束**：$\text{proj}(w) = w \cdot \min(1, R/\|w\|_2)$，实现为 `w * min(1, R / w.norm())`，一次 norm + elementwise，$O(d)$。用于 trust region、对抗鲁棒的 $\epsilon$-ball 约束。
 - **增广 Lagrangian 做 RLHF/PPO**：$\mathcal{L} = -\mathbb{E}[r] + \lambda(\text{KL}(\pi\|\pi_{\text{ref}}) - \epsilon) + \frac{\rho}{2}(\text{KL} - \epsilon)^2$。内层对 $\pi$ 用 PPO 优化，外层 $\lambda \leftarrow \lambda + \rho(\text{KL} - \epsilon)$。KL 计算是 softmax + elementwise log-ratio，GPU 友好。
 - **惩罚法做稀疏/低秩约束**：$\mathcal{L}_{\text{penalty}} = \mathcal{L}_{\text{task}} + \rho \sum_i \max(0, \|w_i\|_1 - \tau)^2$ 约束每层稀疏度不超 $\tau$。惩罚项是 elementwise + reduce，可微且 GPU 友好。$\rho$ 递增策略：$\rho \leftarrow \beta \rho$（$\beta > 1$），每若干步加倍。
@@ -49,5 +49,19 @@
 
 ## 深入参考
 
-- 蒸馏稿：references/books/optimization-ml.md（Ch 20-21 等式/不等式约束与 KKT、Ch 24 约束算法 §24.3 投影梯度 §24.5 增广 Lagrange §24.6 惩罚法）
+- 蒸馏稿：../../references/books/optimization-ml.md（Ch 20-21 等式/不等式约束与 KKT、Ch 24 约束算法 §24.3 投影梯度 §24.5 增广 Lagrange §24.6 惩罚法）
 - 原书：Chong, Lu, Zak, *An Introduction to Optimization* 5th Ed., Chapter 20-21 (Equality & Inequality Constraints) + Chapter 24 (Algorithms for Constrained Optimization §24.2-24.6)
+
+
+## 路由扩展
+- 若需要从对偶视角分析 → `lagrangian-duality.md`（Lagrange 对偶理论）
+- 若约束在流形上 → `riemannian-optimization.md`（流形约束的黎曼优化）
+- 若需要惩罚项设计 → `constraint-penalty`（设计模式层的约束惩罚）
+
+## 可扩展方向
+- 罚函数/障碍函数（penalty / barrier methods）：将约束转化为惩罚项
+- 序列二次规划（SQP）：约束优化的二阶方法
+- 有效集方法（active set methods）：识别活跃约束集
+- 约束规范（constraint qualification）：LICQ, MFCQ 等正则条件
+- 精确罚函数（exact penalty）：有限罚参数下的精确解
+- 增广 Lagrangian 方法（augmented Lagrangian methods）：结合对偶与罚函数

package/knowledge-base/optimization/convex-optimization.en.md

@@ -2,7 +2,7 @@
 
 ## Minimal Definition
 
-Optimization problems that minimize a convex function over a convex set. Convexity guarantees that a local optimum is also a global optimum, and the first-order condition ($\nabla f = 0$) is both necessary and sufficient. Convex problems are the only class in optimization theory that guarantees global optimality with efficient solvability.
+Optimization problems that minimize a convex function over a convex set. Convexity guarantees that a local optimum is also a global optimum. For **unconstrained, differentiable** convex optimization, the first-order condition ($\nabla f(x^*) = 0$) is both necessary and sufficient; for **constrained** convex optimization ($\min f(x)$ s.t. $x \in C$), the KKT conditions are necessary and sufficient under Slater's condition; for **non-smooth** convex optimization, the optimality condition is $0 \in \partial f(x^*) + N_C(x^*)$, where $N_C$ is the normal cone of the constraint set. Convex problems are the only class in optimization theory that guarantees global optimality with efficient solvability.
 
 ## Core Formulas
 
@@ -46,5 +46,18 @@ Optimization problems that minimize a convex function over a convex set. Convexi
 
 ## Further References
 
-- Distilled notes: references/books/optimization-ml.md (Ch 22 Convex Optimization, Section 22.2 Convex Functions, Section 22.3 Convex Problems, Section 22.4 SDP/LMI)
+- Distilled notes: ../../references/books/optimization-ml.en.md (Ch 22 Convex Optimization, Section 22.2 Convex Functions, Section 22.3 Convex Problems, Section 22.4 SDP/LMI)
 - Original text: Chong, Lu, Zak, *An Introduction to Optimization* 5th Ed., Chapter 22 (Convex Optimization Problems Section 22.1-22.4)
+
+
+## Routing Extensions
+- If the problem has constraints -> `constrained-optimization.en.md` (constrained convex optimization methods)
+- If the objective is non-smooth -> `proximal-method.en.md` (proximal methods for non-smooth parts)
+
+## Extensible Directions
+- Self-concordant functions: convergence guarantees for Newton's method
+- Interior point methods: polynomial-time methods for large-scale convex optimization
+- First-order method convergence rates: optimal convergence rates for gradient descent
+- Accelerated methods (Nesterov acceleration): Nesterov momentum and optimal first-order methods
+- Online convex optimization: regret analysis for sequential decision-making
+- Bandit convex optimization: convex optimization with zeroth-order information

package/knowledge-base/optimization/convex-optimization.md

@@ -2,7 +2,7 @@
 
 ## 最小定义
 
-在凸集上最小化凸函数的优化问题。凸性保证局部最优即全局最优，且一阶条件（$\nabla f = 0$）是充分必要的。凸问题是优化理论中唯一能保证全局最优且可高效求解的类别。
+在凸集上最小化凸函数的优化问题。凸性保证局部最优即全局最优。对于**无约束可微**凸优化，一阶条件（$\nabla f(x^*) = 0$）是充分必要的；对于**约束**凸优化（$\min f(x)$ s.t. $x \in C$），KKT 条件在 Slater 条件满足时是充分必要的；对于**非光滑**凸优化，最优性条件为 $0 \in \partial f(x^*) + N_C(x^*)$，其中 $N_C$ 为约束集的法锥。凸问题是优化理论中唯一能保证全局最优且可高效求解的类别。
 
 ## 核心公式
 
@@ -46,5 +46,18 @@
 
 ## 深入参考
 
-- 蒸馏稿：references/books/optimization-ml.md（Ch 22 Convex Optimization、§22.2 凸函数、§22.3 凸问题、§22.4 SDP/LMI）
+- 蒸馏稿：../../references/books/optimization-ml.md（Ch 22 Convex Optimization、§22.2 凸函数、§22.3 凸问题、§22.4 SDP/LMI）
 - 原书：Chong, Lu, Zak, *An Introduction to Optimization* 5th Ed., Chapter 22 (Convex Optimization Problems §22.1-22.4)
+
+
+## 路由扩展
+- 若问题有约束 → `constrained-optimization.md`（约束凸优化方法）
+- 若目标不可微 → `proximal-method.md`（近端方法处理非光滑部分）
+
+## 可扩展方向
+- 自协调函数（self-concordant functions）：Newton 法的收敛保证
+- 内点法（interior point methods）：大规模凸优化的多项式时间方法
+- 一阶方法收敛率（first-order convergence rates）：梯度下降的最优收敛速率
+- 加速方法（Nesterov acceleration）：Nesterov 动量加速与最优一阶方法
+- 在线凸优化（online convex optimization）：序列决策的 regret 分析
+- Bandit 凸优化（bandit convex optimization）：零阶信息下的凸优化

package/knowledge-base/optimization/index.en.md

@@ -0,0 +1,50 @@
+# Optimization Activation Index
+
+## Domain Signals
+Activate this domain direction when the problem involves:
+- Constrained optimization: objective function must satisfy equality or inequality constraints
+- Duality gap: need to analyze the relationship between primal and dual problems
+- Saddle point problems: min-max optimization or game-theoretic structure
+- Non-convex landscape: geometric structure analysis of loss functions
+- Manifold constraints: parameters need to be optimized on a manifold
+- Splitting operators: objective decomposes into multiple components for combined optimization
+
+## Core Anchors
+- `lagrangian-duality.en.md` — Lagrangian duality theory
+- `convex-optimization.en.md` — Convex optimization fundamentals
+- `constrained-optimization.en.md` — Constrained optimization methods
+- `riemannian-optimization.en.md` — Riemannian optimization
+- `proximal-method.en.md` — Proximal methods
+
+## Extended Concepts
+When core anchors are insufficient, the following concepts may need temporary activation:
+- ADMM: alternating direction method of multipliers, suitable for splitting structures
+- mirror descent: mirror descent, suitable for non-Euclidean geometry
+- Frank-Wolfe: conditional gradient method, suitable for sparsity constraints
+- stochastic optimization (SGD / SAdam convergence): convergence theory for stochastic optimization
+- second-order methods (Newton / quasi-Newton): second-order and quasi-Newton methods
+- trust region: trust region methods
+- line search: line search strategies and convergence guarantees
+- gradient clipping theory: theoretical analysis of gradient clipping
+- sharpness-aware minimization (SAM): sharpness-aware minimization
+- neural tangent kernel optimization landscape: optimization landscape under NTK
+- implicit regularization: implicit regularization effects
+- bilevel optimization: bilevel optimization and hyperparameter optimization
+- minimax optimization: minimax optimization theory
+- meta-learning optimization: optimization framework for meta-learning
+
+## Reference Book Directions
+- `../../references/books/optimization-ml.en.md`: comprehensive coverage of ML optimization, including convex optimization, stochastic methods, and second-order methods
+
+## AI Translation Directions
+- lagrangian duality → primal-dual training / adversarial loss / constrained generation
+- convex optimization → convex regularizers / proximal updates / mirror descent optimizer
+- constrained optimization → projected gradient / penalty loss / barrier methods in training
+- riemannian optimization → manifold-constrained parameters / natural gradient / geodesic update
+- proximal method → sparse regularization / ISTA/FISTA layers / proximal neural networks
+
+## Temporary Activation Rules
+When the problem requires mathematics not in the core anchors:
+1. First check whether extended concepts contain a match
+2. If yes, generate a temporary knowledge card based on the lens
+3. If no, enter the Knowledge Gap Protocol

package/knowledge-base/optimization/index.md

@@ -0,0 +1,50 @@
+# 最优化 激活索引 / Optimization Activation Index
+
+## 领域信号
+当问题涉及以下信号时，激活本领域方向：
+- 约束优化：目标函数需要满足等式或不等式约束
+- 对偶间隙：需要分析原始问题与对偶问题的关系
+- 鞍点问题：min-max 优化或博弈论结构
+- 非凸 landscape：损失函数的几何结构分析
+- 流形约束：参数需要在流形上优化
+- 分裂算子：目标函数可分解为多个部分的组合优化
+
+## 核心锚点
+- `lagrangian-duality.md` — Lagrange 对偶理论
+- `convex-optimization.md` — 凸优化基础
+- `constrained-optimization.md` — 约束优化方法
+- `riemannian-optimization.md` — 黎曼优化
+- `proximal-method.md` — 近端方法
+
+## 扩展概念
+当核心锚点不够时，以下概念可能需要临时激活：
+- ADMM：交替方向乘子法，适用于分裂结构
+- mirror descent：镜像下降，适用于非欧几何
+- Frank-Wolfe：条件梯度法，适用于稀疏约束
+- stochastic optimization（SGD / SAdam convergence）：随机优化的收敛理论
+- second-order methods（Newton / quasi-Newton）：二阶与拟牛顿方法
+- trust region：信赖域方法
+- line search：线搜索策略与收敛保证
+- gradient clipping theory：梯度裁剪的理论分析
+- sharpness-aware minimization (SAM)：尖锐度感知最小化
+- neural tangent kernel optimization landscape：NTK 下的优化景观
+- implicit regularization：隐式正则化效应
+- bilevel optimization：双层优化与超参数优化
+- minimax optimization：极小极大优化理论
+- meta-learning optimization：元学习的优化框架
+
+## 参考书方向
+- `../../references/books/optimization-ml.md`：机器学习优化的全面覆盖，包括凸优化、随机方法和二阶方法
+
+## AI 翻译方向
+- lagrangian duality → primal-dual training / adversarial loss / constrained generation
+- convex optimization → convex regularizers / proximal updates / mirror descent optimizer
+- constrained optimization → projected gradient / penalty loss / barrier methods in training
+- riemannian optimization → manifold-constrained parameters / natural gradient / geodesic update
+- proximal method → sparse regularization / ISTA/FISTA layers / proximal neural networks
+
+## 临时激活规则
+当问题需要的数学不在核心锚点中时：
+1. 先检查扩展概念中是否有匹配
+2. 若有，根据透镜生成临时知识卡
+3. 若无，进入 Knowledge Gap Protocol

package/knowledge-base/optimization/lagrangian-duality.en.md

@@ -24,9 +24,9 @@ Transforms a constrained optimization problem (primal) into a maximization probl
 
 ## AI Design Translation
 
-- **Minimax framework for adversarial training**: $L(\theta, \phi) = \mathbb{E}[\log D_\phi(x)] + \mathbb{E}[\log(1 - D_\phi(G_\theta(z)))]$. $G$ and $D$ alternate between gradient ascent and descent; the core operations are forward + backward passes (matmul chains). Gradient penalty / spectral norm constrains the Lipschitz constant of $D$ to ensure the existence of a saddle point.
+- **Minimax framework for adversarial training**: $L(\theta, \phi) = \mathbb{E}[\log D_\phi(x)] + \mathbb{E}[\log(1 - D_\phi(G_\theta(z)))]$. $G$ and $D$ alternate between gradient ascent and descent; the core operations are forward + backward passes (matmul chains). Gradient penalty / spectral norm can control the Lipschitz constant of $D$ and improve training stability, but it does not guarantee that a non-convex minimax problem has, or converges to, a benign saddle point.
 - **SVM dual + kernel trick**: Primal $\min_w \frac{1}{2}\|w\|^2 + C\sum\xi_i$ converted to dual $\max_\alpha \sum\alpha_i - \frac{1}{2}\alpha^T(K \circ yy^T)\alpha$. The kernel Gram matrix $K_{ij} = k(x_i, x_j)$ is computed via matmul (linear kernel) or elementwise operations (RBF kernel). Dual variables $\alpha \in \mathbb{R}^n$ are solved using SMO or gradient projection.
-- **Augmented Lagrangian constrained training**: $\mathcal{L}_{\text{AL}} = f(x) + \sum \lambda_i g_i(x) + \frac{\rho}{2}\sum g_i(x)^2$. The inner loop optimizes $x$ via SGD; the outer loop updates $\lambda$ via gradient ascent: $\lambda \leftarrow [\lambda + \rho g(x)]_+$. The $\rho$ term ensures inner-loop convexity, enabling convergence even for non-convex original problems.
+- **Augmented Lagrangian constrained training**: $\mathcal{L}_{\text{AL}} = f(x) + \sum \lambda_i g_i(x) + \frac{\rho}{2}\sum g_i(x)^2$. The inner loop optimizes $x$ via SGD; the outer loop updates $\lambda$ via gradient ascent: $\lambda \leftarrow [\lambda + \rho g(x)]_+$. The $\rho$ term improves the concavity of the dual function (making the dual problem easier to solve), but does NOT guarantee global convergence for non-convex original problems. Convergence depends on: (a) constraint qualifications (e.g., LICQ/MFCQ), (b) second-order sufficient conditions, (c) $\rho$ being large enough to satisfy local convexity conditions.
 - **Dual decomposition**: $\min \sum_k f_k(x_k)$ s.t. $\sum x_k \leq b$ decomposes into independent subproblems $\min_{x_k} f_k(x_k) + \lambda^T x_k$, with the master problem $\max_\lambda g(\lambda)$ solved via subgradient ascent. Naturally parallelizable, suitable for distributed training.
 - **Dual perspective on the information bottleneck**: $\min I(Z;X) - \beta I(Z;Y)$ can be formulated as constrained optimization, where $\beta$ is the dual variable. The variational IB relaxes this via the ELBO, reducing to standard VAE training (reparameterization trick + SGD).
 
@@ -39,12 +39,26 @@ Transforms a constrained optimization problem (primal) into a maximization probl
 
 ## Risks and Failure Conditions
 
-- **Duality gap for non-convex problems**: Strong duality is only guaranteed for convex problems + Slater's condition. In non-convex neural network training, $d^* < p^*$ is common, and the dual solution does not yield a primal-feasible solution. Solution: augmented Lagrangian (eliminates the gap when $\rho$ is sufficiently large) or SQP.
+- **Duality gap for non-convex problems**: Strong duality is only guaranteed for convex problems + Slater's condition. In non-convex neural network training, $d^* < p^*$ is common, and the dual solution does not yield a primal-feasible solution. Solution: for convex problems, augmented Lagrangian (with the exact penalty property when $\rho$ is sufficiently large, which can eliminate the duality gap); for non-convex problems, the duality gap may persist regardless of $\rho$, and the augmented Lagrangian only guarantees local convergence to KKT points -- alternatively, use SQP.
 - **Dual variable oscillation**: Improper step sizes for gradient ascent on $\lambda$ can cause dual variable oscillation and primal infeasibility. Solution: use adaptive step sizes (Adam updates for $\lambda$) or an increasing $\rho$ schedule in the augmented Lagrangian.
 - **Numerical determination of complementary slackness**: $\lambda_i g_i(x) = 0$ can only be satisfied to $\sim 10^{-6}$ in floating point; strict complementary slackness is unattainable. This affects SVM support vector identification; a threshold must be set.
 - **Mode collapse in minimax training**: The non-convex-non-concave game in GAN $\min\max$ leads to mode collapse or training instability. Additional regularization such as gradient penalty (WGAN-GP) or spectral normalization is required.
 
 ## Further References
 
-- Distilled notes: references/books/optimization-ml.md (Ch 23 Lagrangian Duality, Section 23.5 Strong Duality, Section 23.6.3 Slater's Condition)
+- Distilled notes: ../../references/books/optimization-ml.en.md (Ch 23 Lagrangian Duality, Section 23.5 Strong Duality, Section 23.6.3 Slater's Condition)
 - Original text: Chong, Lu, Zak, *An Introduction to Optimization* 5th Ed., Chapter 23 (Lagrangian Duality Section 23.1-23.6) + Chapter 17 (LP Duality)
+
+
+## Routing Extensions
+- If starting from the primal problem -> `constrained-optimization.en.md` (primal constrained optimization)
+- If strong duality conditions are needed -> `convex-optimization.en.md` (strong duality theorem for convex problems)
+- If the dual form of IB objective is involved -> `../probability/information-bottleneck.md` (variational dual of information bottleneck)
+
+## Extensible Directions
+- Augmented Lagrangian: penalty-enhanced Lagrangian methods
+- Saddle point theory: existence and computation of Lagrangian saddle points
+- KKT condition regularity: constraint qualifications and KKT necessary conditions
+- Conic duality: duality theory for conic programming
+- Fenchel duality: convex conjugates and Fenchel-Rockafellar duality
+- Minimax duality: min-max theorems and duality gaps

package/knowledge-base/optimization/lagrangian-duality.md

@@ -24,9 +24,9 @@
 
 ## AI 设计翻译
 
-- **对抗训练的 minimax 框架**：$L(\theta, \phi) = \mathbb{E}[\log D_\phi(x)] + \mathbb{E}[\log(1 - D_\phi(G_\theta(z)))]$。$G$ 和 $D$ 交替梯度上升/下降，核心操作是前向 + 反向传播（matmul 链）。梯度惩罚 / spectral norm 约束 $D$ 的 Lipschitz 保证 minimax 有鞍点。
+- **对抗训练的 minimax 框架**：$L(\theta, \phi) = \mathbb{E}[\log D_\phi(x)] + \mathbb{E}[\log(1 - D_\phi(G_\theta(z)))]$。$G$ 和 $D$ 交替梯度上升/下降，核心操作是前向 + 反向传播（matmul 链）。梯度惩罚 / spectral norm 可控制 $D$ 的 Lipschitz 常数并改善训练稳定性，但不保证非凸 minimax 一定存在或收敛到良性鞍点。
 - **SVM 对偶 + 核技巧**：原始 $\min_w \frac{1}{2}\|w\|^2 + C\sum\xi_i$ 转对偶 $\max_\alpha \sum\alpha_i - \frac{1}{2}\alpha^T(K \circ yy^T)\alpha$。核 Gram $K_{ij} = k(x_i, x_j)$ 是 matmul（线性核）或 elementwise（RBF 核）。对偶变量 $\alpha \in \mathbb{R}^n$，用 SMO 或梯度投影求解。
-- **增广 Lagrangian 约束训练**：$\mathcal{L}_{\text{AL}} = f(x) + \sum \lambda_i g_i(x) + \frac{\rho}{2}\sum g_i(x)^2$。内层对 $x$ 用 SGD 优化，外层对 $\lambda$ 梯度上升更新：$\lambda \leftarrow [\lambda + \rho g(x)]_+$。$\rho$ 项保证内层凸性，即使原问题非凸也收敛。
+- **增广 Lagrangian 约束训练**：$\mathcal{L}_{\text{AL}} = f(x) + \sum \lambda_i g_i(x) + \frac{\rho}{2}\sum g_i(x)^2$。内层对 $x$ 用 SGD 优化，外层对 $\lambda$ 梯度上升更新：$\lambda \leftarrow [\lambda + \rho g(x)]_+$。$\rho$ 项改善对偶函数的凹性（使对偶问题更容易求解），但对非凸原问题不保证全局收敛。收敛性依赖于：(a) 约束规格（如 LICQ/MFCQ），(b) 二阶充分条件，(c) $\rho$ 足够大以满足局部凸性条件。
 - **对偶分解 (Dual Decomposition)**：$\min \sum_k f_k(x_k)$ s.t. $\sum x_k \leq b$ 分解为各子问题 $\min_{x_k} f_k(x_k) + \lambda^T x_k$ 独立求解，主问题 $\max_\lambda g(\lambda)$ 用次梯度上升。天然可并行，适合分布式训练。
 - **信息瓶颈的对偶视角**：$\min I(Z;X) - \beta I(Z;Y)$ 可写为带约束优化，$\beta$ 是对偶变量。Variational IB 用 ELBO 松弛后变成标准 VAE 训练（reparameterization trick + SGD）。
 
@@ -39,12 +39,26 @@
 
 ## 风险与失效条件
 
-- **非凸问题的对偶间隙**：强对偶仅对凸问题 + Slater 条件保证。非凸神经网络训练中 $d^* < p^*$ 常见，对偶解不给出原始可行解。解决：增广 Lagrangian（$\rho$ 足够大时消除间隙）或 SQP。
+- **非凸问题的对偶间隙**：强对偶仅对凸问题 + Slater 条件保证。非凸神经网络训练中 $d^* < p^*$ 常见，对偶解不给出原始可行解。解决：对凸问题，增广 Lagrangian（$\rho$ 足够大时具有 exact penalty 性质，可消除对偶间隙）；对非凸问题，对偶间隙可能持续存在，增广 Lagrangian 只能保证局部收敛到 KKT 点，或改用 SQP。
 - **对偶变量振荡**：$\lambda$ 的梯度上升步长不当会导致对偶变量振荡、原始不可行。解决：使用自适应步长（Adam 更新 $\lambda$）或增广 Lagrangian 的 $\rho$ 递增策略。
 - **互补松弛的数值判定**：$\lambda_i g_i(x) = 0$ 在浮点下只能达到 $\sim 10^{-6}$，严格互补松弛不可得。影响 SVM 支持向量识别等，需设阈值。
 - **Minimax 训练的 mode collapse**：GAN 中 $\min\max$ 的非凸-非凹博弈导致模式坍缩或训练不稳定。需梯度惩罚（WGAN-GP）、谱归一化等额外正则化。
 
 ## 深入参考
 
-- 蒸馏稿：references/books/optimization-ml.md（Ch 23 Lagrangian Duality、§23.5 强对偶、§23.6.3 Slater 条件）
+- 蒸馏稿：../../references/books/optimization-ml.md（Ch 23 Lagrangian Duality、§23.5 强对偶、§23.6.3 Slater 条件）
 - 原书：Chong, Lu, Zak, *An Introduction to Optimization* 5th Ed., Chapter 23 (Lagrangian Duality §23.1-23.6) + Chapter 17 (LP Duality)
+
+
+## 路由扩展
+- 若需要从原始问题出发 → `constrained-optimization.md`（原始约束优化）
+- 若需要强对偶条件 → `convex-optimization.md`（凸问题的强对偶定理）
+- 若涉及 IB 目标函数的对偶形式 → `../probability/information-bottleneck.md`（信息瓶颈的变分对偶）
+
+## 可扩展方向
+- 增广 Lagrangian（augmented Lagrangian）：罚项增强的 Lagrangian 方法
+- 鞍点理论（saddle point theory）：Lagrangian 鞍点的存在性与求解
+- KKT 条件正则性（KKT regularity）：约束规范与 KKT 必要条件
+- 锥对偶（conic duality）：锥规划的对偶理论
+- Fenchel 对偶（Fenchel duality）：凸共轭与 Fenchel-Rockafellar 对偶
+- 极小极大对偶（minimax duality）：min-max 定理与对偶间隙

package/knowledge-base/optimization/proximal-method.en.md

@@ -48,5 +48,19 @@ For non-smooth or non-differentiable objective functions $f(x) = g(x) + h(x)$ ($
 
 ## Further References
 
-- Distilled notes: references/books/optimization-ml.md (Ch 8 Gradient Methods Section 8.3 Convergence Analysis, Ch 11 Quasi-Newton Section 11.5 BFGS, Ch 24 Constrained Algorithms Section 24.5 Augmented Lagrangian)
+- Distilled notes: ../../references/books/optimization-ml.en.md (Ch 8 Gradient Methods Section 8.3 Convergence Analysis, Ch 11 Quasi-Newton Section 11.5 BFGS, Ch 24 Constrained Algorithms Section 24.5 Augmented Lagrangian)
 - Original text: Chong, Lu, Zak, *An Introduction to Optimization* 5th Ed., Chapter 24 (Constrained Algorithms Section 24.5 Augmented Lagrangian) + Parikh & Boyd, *Proximal Algorithms*, Foundations and Trends in Optimization, 2014
+
+
+## Routing Extensions
+- If the smooth part dominates -> `convex-optimization.en.md` (convex optimization for smooth parts)
+- If the proximal operator corresponds to a constraint -> `constrained-optimization.en.md` (equivalence of indicator functions and constraints)
+- If used for variational loss regularization -> `variational-loss` (design pattern layer for proximal regularization)
+
+## Extensible Directions
+- Proximal gradient (ISTA / FISTA): fast proximal methods for L1 regularization
+- Douglas-Rachford splitting: optimizing sums of two non-smooth functions
+- Primal-dual hybrid gradient (PDHG): first-order methods for saddle point problems
+- Alternating minimization: block-wise optimization for block-separable objectives
+- Block coordinate descent: block update strategies for high-dimensional problems
+- Proximal neural networks: embedding proximal operators into network architecture

package/knowledge-base/optimization/proximal-method.md

@@ -48,5 +48,19 @@
 
 ## 深入参考
 
-- 蒸馏稿：references/books/optimization-ml.md（Ch 8 梯度法 §8.3 收敛分析、Ch 11 拟牛顿 §11.5 BFGS、Ch 24 约束算法 §24.5 增广 Lagrange）
+- 蒸馏稿：../../references/books/optimization-ml.md（Ch 8 梯度法 §8.3 收敛分析、Ch 11 拟牛顿 §11.5 BFGS、Ch 24 约束算法 §24.5 增广 Lagrange）
 - 原书：Chong, Lu, Zak, *An Introduction to Optimization* 5th Ed., Chapter 24 (Constrained Algorithms §24.5 Augmented Lagrangian) + Parikh & Boyd, *Proximal Algorithms*, Foundations and Trends in Optimization, 2014
+
+
+## 路由扩展
+- 若可微部分主导 → `convex-optimization.md`（光滑部分的凸优化方法）
+- 若近端算子对应约束 → `constrained-optimization.md`（指示函数与约束的等价）
+- 若用于变分损失的正则化 → `variational-loss`（设计模式层的近端正则化）
+
+## 可扩展方向
+- 近端梯度（ISTA / FISTA）：L1 正则化的快速近端方法
+- Douglas-Rachford 分裂：两个非光滑函数之和的优化
+- 原始-对偶混合梯度（PDHG）：鞍点问题的一阶方法
+- 交替最小化（alternating minimization）：块可分目标的分块优化
+- 块坐标下降（block coordinate descent）：高维问题的分块更新策略
+- 近端神经网络（proximal neural networks）：将近端算子嵌入网络结构

package/knowledge-base/optimization/riemannian-optimization.en.md

@@ -9,10 +9,11 @@ Optimization on smooth manifolds $\mathcal{M}$ (e.g., the orthogonal group $O(n)
 - Riemannian gradient: $\text{grad} f(x) = \text{proj}_{T_x\mathcal{M}}(\nabla f(x))$ (Euclidean gradient projected onto the tangent space)
 - Riemannian gradient descent: $x_{k+1} = R_{x_k}(-\alpha_k \cdot \text{grad} f(x_k))$, where $R$ is a retraction
 - Tangent space of the orthogonal group $O(n)$: $T_Q O(n) = \{Q\Omega : \Omega^T = -\Omega\}$ (left multiplication by skew-symmetric matrices)
-- Cayley retraction for the orthogonal group: $R_Q(\xi) = Q(I + \frac{1}{2}\Omega)^{-1}(I - \frac{1}{2}\Omega)$, $\xi = Q\Omega$
+- Cayley retraction for the orthogonal group: $R_Q(\xi) = Q(I + \frac{1}{2}\Omega)^{-1}(I - \frac{1}{2}\Omega)$, $\xi = Q\Omega$; equivalently in $A$-form: let $G = \nabla f(Q)$ be the Euclidean gradient and $A = GQ^T - QG^T$ (skew-symmetric), then $R_Q(t) = (I + \frac{t}{2}A)^{-1}(I - \frac{t}{2}A)Q$, with step size $t > 0$ moving along the negative gradient (descent direction)
 - Polar decomposition retraction: $R_Q(\xi) = (Q + \xi)(I + \xi^T\xi)^{-1/2}$ (projection onto the nearest orthogonal matrix)
 - Newton-Schulz orthogonalization: $X_{k+1} = \frac{1}{2}X_k(3I - X_k^T X_k)$, converging to the nearest orthogonal matrix
 - Hyperbolic space (Poincaré ball): $\text{grad}_{\mathcal{H}} f = \frac{(1-\|x\|^2)^2}{4} \nabla f(x)$
+- Riemannian gradient on the Stiefel manifold $St(n,p) = \{W : W^TW = I_p\}$: $\text{grad} f(W) = G - W \cdot \text{sym}(W^TG)$, where $G = \nabla f(W)$ is the Euclidean gradient and $\text{sym}(A) = \frac{A + A^T}{2}$ is the symmetric correction term. Note: one cannot simply use $G - WW^TG$ (orthogonal projection); the symmetric correction is essential to ensure the gradient lies in the tangent space.
 
 ## Applicable Problems
 
@@ -24,8 +25,8 @@ Optimization on smooth manifolds $\mathcal{M}$ (e.g., the orthogonal group $O(n)
 
 ## AI Design Translation
 
-- **Muon optimizer (orthogonalized gradient updates)**: Projects the momentum matrix $M$ onto the nearest orthogonal matrix via Newton-Schulz iteration: $X_{k+1} = \frac{1}{2}X_k(3I - X_k^TX_k)$, converging in 5 steps. Update $W \leftarrow W - \alpha \cdot U$ ($U$ being the orthogonalized result). The core is a pure matmul chain, 2 matmul operations per step, fully tensor-core-friendly, stable under bf16.
-- **Manifold perspective on spectral normalization**: The constraint $\sigma_{\max}(W) = 1$ is equivalent to projection onto a tangent direction of the Stiefel manifold. Power iteration for direction estimation + normalization = an approximate Riemannian gradient projection. Implementation is identical to standard spectral norm.
+- **Muon optimizer (orthogonalized gradient updates)**: Approximates the orthogonal polar factor of a scaled momentum matrix $M$ via Newton-Schulz / polar iteration, e.g. $X_{k+1} = \frac{1}{2}X_k(3I - X_k^TX_k)$ (after normalization and under spectral conditions). A fixed 5-step iteration is an engineering approximation, not an unconditional convergence guarantee. Update $W \leftarrow W - \alpha \cdot U$ ($U$ being the orthogonalized result). The core is a matmul chain, tensor-core-friendly, with scaling and residual checks needed in low precision.
+- **Manifold perspective on spectral normalization**: The common constraint $\sigma_{\max}(W) \leq 1$ is enforced by scaling weights by the largest singular value, i.e. a reparameterization / normalization. It is not a Stiefel tangent projection and not the exact nearest projection onto the spectral-norm ball. Power iteration only estimates the top singular direction.
 - **Orthogonal RNN**: Hidden state recurrence $h_t = \sigma(W h_{t-1} + U x_t)$, constraining $W \in O(n)$ to avoid vanishing/exploding gradients. During training, uses the Cayley parameterization $W = (I-A)(I+A)^{-1}$ ($A$ skew-symmetric), with backpropagation computing unconstrained gradients with respect to $A$. The core is matrix inversion $O(n^3)$ (acceptable for small layer dimensions).
 - **Poincaré embeddings (hyperbolic space)**: Embeds hierarchical data into the Poincaré ball $\mathcal{B}^n = \{x : \|x\| < 1\}$. Distance $d(x,y) = \text{arcosh}(1 + 2\|x-y\|^2 / ((1-\|x\|^2)(1-\|y\|^2)))$. The gradient is simply scaled by the metric factor $(1-\|x\|^2)^2/4$. Implemented as elementwise scaling, $O(d)$.
 - **Subspace learning on the Grassmann manifold**: Treats low-rank subspaces as points on the Grassmann manifold, updated online via Riemannian SGD. More suitable for streaming data than SVD. The projection $P = QQ^T$ update is implemented via QR decomposition, with the core being matmul + thin QR.
@@ -47,5 +48,18 @@ Optimization on smooth manifolds $\mathcal{M}$ (e.g., the orthogonal group $O(n)
 
 ## Further References
 
-- Distilled notes: references/books/matrix-analysis.md (Section 7.3 Polar Decomposition, Newton-Schulz Iteration, Section 2.6 SVD and Orthogonal Factors)
+- Distilled notes: ../../references/books/matrix-analysis.en.md (Section 7.3 Polar Decomposition, Newton-Schulz Iteration, Section 2.6 SVD and Orthogonal Factors)
 - Original text: Horn & Johnson, *Matrix Analysis* 2nd Ed., Chapter 7 Section 7.3 (Polar Decomposition) + Absil, Mahony, Sepulchre, *Optimization Algorithms on Matrix Manifolds*, Princeton University Press, 2008
+
+
+## Routing Extensions
+- If local linearization is needed -> `../differential-geometry/tangent-space.en.md` (gradient computation in tangent space)
+- If retraction choice is needed -> `../differential-geometry/metric-tensor.en.md` (metric determines retraction map)
+- If the metric comes from Fisher information -> `../information-geometry/natural-gradient.en.md` (natural gradient under Fisher metric)
+
+## Extensible Directions
+- Retraction types: exponential map, projection retraction, Cayley transform
+- Vector transport: transporting vectors between different tangent spaces on a manifold
+- Riemannian conjugate gradient: conjugate gradient method on manifolds
+- Riemannian trust region: trust region methods on manifolds
+- Stochastic Riemannian optimization: SGD variants on manifolds

package/knowledge-base/optimization/riemannian-optimization.md

@@ -9,10 +9,11 @@
 - 黎曼梯度：$\text{grad} f(x) = \text{proj}_{T_x\mathcal{M}}(\nabla f(x))$（欧氏梯度投影到切空间）
 - 黎曼梯度下降：$x_{k+1} = R_{x_k}(-\alpha_k \cdot \text{grad} f(x_k))$，$R$ 为收缩映射（retraction）
 - 正交群 $O(n)$ 的切空间：$T_Q O(n) = \{Q\Omega : \Omega^T = -\Omega\}$（反对称矩阵左乘）
-- 正交群收缩映射（Cayley）：$R_Q(\xi) = Q(I + \frac{1}{2}\Omega)^{-1}(I - \frac{1}{2}\Omega)$，$\xi = Q\Omega$
+- 正交群收缩映射（Cayley）：$R_Q(\xi) = Q(I + \frac{1}{2}\Omega)^{-1}(I - \frac{1}{2}\Omega)$，$\xi = Q\Omega$；等价地用 $A$-形式：设 $G = \nabla f(Q)$ 为欧氏梯度，$A = GQ^T - QG^T$（反对称），则 $R_Q(t) = (I + \frac{t}{2}A)^{-1}(I - \frac{t}{2}A)Q$，步长 $t > 0$ 沿负梯度方向移动（下降方向）
 - 极分解收缩：$R_Q(\xi) = (Q + \xi)(I + \xi^T\xi)^{-1/2}$（投影到最近正交矩阵）
 - Newton-Schulz 正交化：$X_{k+1} = \frac{1}{2}X_k(3I - X_k^T X_k)$，收敛到最近正交矩阵
 - 双曲空间（Poincaré ball）：$\text{grad}_{\mathcal{H}} f = \frac{(1-\|x\|^2)^2}{4} \nabla f(x)$
+- Stiefel 流形 $St(n,p) = \{W : W^TW = I_p\}$ 的黎曼梯度：$\text{grad} f(W) = G - W \cdot \text{sym}(W^TG)$，其中 $G = \nabla f(W)$ 为欧氏梯度，$\text{sym}(A) = \frac{A + A^T}{2}$ 为对称修正项。注意：不能简单用 $G - WW^TG$（正交投影），必须包含对称修正才能保证梯度在切空间中。
 
 ## 适用问题
 
@@ -24,8 +25,8 @@
 
 ## AI 设计翻译
 
-- **Muon 优化器 (正交化梯度更新)**：将动量矩阵 $M$ 通过 Newton-Schulz 迭代投影到最近正交矩阵：$X_{k+1} = \frac{1}{2}X_k(3I - X_k^TX_k)$，5 步收敛。更新 $W \leftarrow W - \alpha \cdot U$（$U$ 为正交化结果）。核心是纯 matmul 链，每步 2 次 matmul，完全 tensor core 友好，bf16 稳定。
-- **谱归一化的流形视角**：约束 $\sigma_{\max}(W) = 1$ 等价于在 Stiefel 流形的某个切方向上做投影。Power iteration 估计方向 + 归一化 = 一种近似的黎曼梯度投影。实现同标准 spectral norm。
+- **Muon 优化器 (正交化梯度更新)**：将缩放后的动量矩阵 $M$ 通过 Newton-Schulz / polar 迭代近似其正交极因子，例如 $X_{k+1} = \frac{1}{2}X_k(3I - X_k^TX_k)$（需先归一化并满足谱条件）。固定 5 步是工程近似而非无条件收敛保证。更新 $W \leftarrow W - \alpha \cdot U$（$U$ 为正交化结果）。核心是 matmul 链，tensor core 友好，低精度下需缩放和残差监控。
+- **谱归一化的流形视角**：约束 $\sigma_{\max}(W) \leq 1$ 的常用做法是按最大奇异值缩放权重，属于重参数化/归一化；它不是 Stiefel 流形切空间投影，也不是到谱范数球的精确最近投影。Power iteration 只用于估计最大奇异方向。
 - **正交 RNN (orthogonal RNN)**：隐藏状态递推 $h_t = \sigma(W h_{t-1} + U x_t)$，约束 $W \in O(n)$ 避免梯度消失/爆炸。训练时用 Cayley 参数化 $W = (I-A)(I+A)^{-1}$（$A$ 反对称），反向传播走 $A$ 的无约束梯度。核心是矩阵求逆 $O(n^3)$（层维度小，可接受）。
 - **Poincaré 嵌入 (双曲空间)**：将层次数据嵌入 Poincaré ball $\mathcal{B}^n = \{x : \|x\| < 1\}$。距离 $d(x,y) = \text{arcosh}(1 + 2\|x-y\|^2 / ((1-\|x\|^2)(1-\|y\|^2)))$。梯度乘以度量因子 $(1-\|x\|^2)^2/4$ 即可。实现为 elementwise 缩放，$O(d)$。
 - **Grassmann 流形上的子空间学习**：将低秩子空间视为 Grassmann 流形上的点，用黎曼 SGD 在线更新。比 SVD 更适合 streaming 数据。投影 $P = QQ^T$ 的更新通过 QR 分解实现，核心是 matmul + thin QR。
@@ -47,5 +48,18 @@
 
 ## 深入参考
 
-- 蒸馏稿：references/books/matrix-analysis.md（§7.3 极分解、Newton-Schulz 迭代、§2.6 SVD 与正交因子）
+- 蒸馏稿：../../references/books/matrix-analysis.md（§7.3 极分解、Newton-Schulz 迭代、§2.6 SVD 与正交因子）
 - 原书：Horn & Johnson, *Matrix Analysis* 2nd Ed., Chapter 7 §7.3 (Polar Decomposition) + Absil, Mahony, Sepulchre, *Optimization Algorithms on Matrix Manifolds*, Princeton University Press, 2008
+
+
+## 路由扩展
+- 若需要局部线性化 → `../differential-geometry/tangent-space.md`（切空间上的梯度计算）
+- 若需要收缩映射的具体选择 → `../differential-geometry/metric-tensor.md`（度量决定收缩映射）
+- 若度量来自 Fisher 信息 → `../information-geometry/natural-gradient.md`（Fisher 度量下的自然梯度）
+
+## 可扩展方向
+- 收缩映射类型（retraction types）：指数映射、投影收缩、Cayley 变换
+- 向量传输（vector transport）：流形上向量在不同切空间间的传输
+- 黎曼共轭梯度（Riemannian conjugate gradient）：流形上的共轭梯度法
+- 黎曼信赖域（Riemannian trust region）：流形上的信赖域方法
+- 随机黎曼优化（stochastic Riemannian optimization）：流形上的 SGD 变体

package/knowledge-base/overview.en.md

@@ -1,6 +1,6 @@
-# Knowledge Base Navigation
+# Mathematical Activation Anchor Index
 
-> This file is the v3 knowledge base index, helping you find specific knowledge cards from problem types.
+> knowledge-base/ is not a closed encyclopedia but an activation entry point for high-frequency mathematical structures. Each card is an activation anchor that answers: what mathematical concept to activate, what deeper knowledge it connects to, what AI design actions it translates to, and where to extend when it is insufficient.
 
 ## Knowledge Base Structure
 
@@ -28,12 +28,24 @@ The knowledge base is organized by mathematical domain, with 7 domains and 31 kn
 | Need information compression | information-bottleneck, entropy, kl-divergence |
 | Need topological regularization | persistent-homology, euler-characteristic |
 
-## Relationship to Thinking Lenses
+## When Anchors Are Not Enough
 
-Thinking lenses (`../lenses/`) handle "what perspective to use"; the knowledge base provides "concrete mathematical tools." Typical chain:
+The current 31 anchors cover the most commonly used mathematical structures in AI research. When a problem requires mathematical tools not among them:
 
-```
-Lens diagnosis → Knowledge card provides tools → Design pattern translates to AI module
-```
+1. Check the corresponding domain's `*/index.en.md` (e.g., `topology/index.en.md`) for extended concepts and reference book directions
+2. Enter the **Knowledge Gap Protocol** defined in `../skills/math-research-activator/SKILL.en.md` to generate a temporary knowledge card
+3. Never respond with "knowledge base does not cover this" or force-fit the closest card
 
-For deeper study, `../references/books/*.md` provides 7 book distillations.
+## Domain Extension Index
+
+Each domain has an `*/index.en.md` that lists: domain trigger signals, core anchors, extended concepts, reference book directions, and temporary activation rules.
+
+| Domain | Extension Index |
+|--------|----------------|
+| Matrix Analysis | `matrix-analysis/index.en.md` |
+| Optimization | `optimization/index.en.md` |
+| Differential Geometry | `differential-geometry/index.en.md` |
+| Lie Theory | `lie-theory/index.en.md` |
+| Topology | `topology/index.en.md` |
+| Probability & Information | `probability/index.en.md` |
+| Information Geometry | `information-geometry/index.en.md` |

package/knowledge-base/overview.md

@@ -1,6 +1,6 @@
-# 数学知识库导航 / Knowledge Base Navigation
+# 数学激活锚点索引 / Mathematical Activation Anchor Index
 
-> 本文件是 v3 知识库的索引，帮助你从问题类型找到具体的知识卡片。
+> knowledge-base/ 不是封闭百科，而是高频数学结构的激活入口。每张卡片是一个激活锚点，回答：激活什么数学概念、连接哪些更深知识、可翻译成哪些 AI 设计动作、不足时应该往哪里扩展。
 
 ## 知识库结构
 
@@ -28,12 +28,24 @@
 | 需要信息压缩 | information-bottleneck, entropy, kl-divergence |
 | 需要拓扑正则 | persistent-homology, euler-characteristic |
 
-## 与思想透镜的关系
+## 当锚点不够时
 
-思想透镜（`../lenses/`）负责"用什么视角看问题"，知识库负责"提供具体数学工具"。典型链路：
+现有 31 个锚点覆盖 AI 研究中最常用的数学结构。当问题需要的数学工具不在其中时：
 
-```
-透镜诊断 → 知识卡片提供工具 → 设计模式翻译成 AI 模块
-```
+1. 查看对应领域的 `*/index.md`（如 `topology/index.md`），获取扩展概念和参考书方向
+2. 进入 SKILL.md 中定义的**知识缺口协议**，生成临时知识卡
+3. 不得回答"知识库未覆盖"或强行套用最相近卡片
 
-深入查阅时，`../references/books/*.md` 提供 7 本书的蒸馏稿。
+## 领域扩展索引
+
+每个领域有一个 `*/index.md`，列出：领域触发信号、核心锚点、扩展概念、参考书方向、临时激活规则。
+
+| 领域 | 扩展索引 |
+|------|---------|
+| 矩阵分析 | `matrix-analysis/index.md` |
+| 最优化 | `optimization/index.md` |
+| 微分几何 | `differential-geometry/index.md` |
+| 李理论 | `lie-theory/index.md` |
+| 拓扑 | `topology/index.md` |
+| 概率与信息 | `probability/index.md` |
+| 信息几何 | `information-geometry/index.md` |

package/knowledge-base/probability/concentration-inequality.en.md

@@ -39,7 +39,21 @@ $$P(|f(X_1,\ldots,X_n) - \mathbb{E}[f]| \geq t) \leq 2\exp\left(-\frac{2t^2}{\su
 - **Boundedness assumption violated**: Under heavy-tailed distributions (e.g., power laws), Hoeffding does not apply; Bernstein or truncation tricks are needed. In LLM training, when gradients occasionally take extreme values, naive concentration bounds yield a false sense of security.
 
 ## Further References
-- Distillation draft: `references/books/` — no dedicated probability distillation draft at present; this card is based on standard probability theory textbooks
+- Distillation draft: `../../references/books/` — no dedicated probability distillation draft at present; this card is based on standard probability theory textbooks
 - Boucheron, Lugosi, Massart. *Concentration Inequalities: A Nonasymptotic Theory of Independence*. Oxford, 2013
 - Vershynin. *High-Dimensional Probability*. Cambridge, 2018 (Chapters 2-3)
-- Related knowledge cards: `probability/entropy.md`, `probability/fisher-information.md`
+- Related knowledge cards: `entropy.en.md`, `fisher-information.en.md`
+
+
+## Routing Extensions
+- If information-theoretic bounds are needed -> `entropy.en.md` (entropy-based concentration inequalities)
+- If Donsker-Varadhan representation is needed -> `kl-divergence.en.md` (variational representation of KL divergence)
+- If random matrix bounds are involved -> `../matrix-analysis/matrix-perturbation.md` (concentration behavior of random matrices)
+
+## Extensible Directions
+- Martingale concentration (Azuma / Freedman): concentration inequalities for martingale differences
+- Log-Sobolev inequalities: implying hypercontractivity and concentration
+- Transportation inequalities: relationship between Wasserstein distance and relative entropy
+- Talagrand's inequality: dimension-free concentration on product spaces
+- Concentration on product spaces: concentration of functions of independent variables
+- Dimension-free bounds: concentration bounds that do not degrade with dimension

package/knowledge-base/probability/concentration-inequality.md

@@ -39,7 +39,21 @@ $$P(|f(X_1,\ldots,X_n) - \mathbb{E}[f]| \geq t) \leq 2\exp\left(-\frac{2t^2}{\su
 - **有界性假设违反**：重尾分布（如幂律）下 Hoeffding 不适用，需改用 Bernstein 或截断技巧。在 LLM 训练中梯度偶尔出现极大值时，朴素浓度界给出虚假安全感。
 
 ## 深入参考
-- 蒸馏稿：`references/books/` 暂无专用概率蒸馏稿，本卡基于标准概率论教材
+- 蒸馏稿：`../../references/books/` 暂无专用概率蒸馏稿，本卡基于标准概率论教材
 - Boucheron, Lugosi, Massart. *Concentration Inequalities: A Nonasymptotic Theory of Independence*. Oxford, 2013
 - Vershynin. *High-Dimensional Probability*. Cambridge, 2018（第 2-3 章）
-- 关联知识卡：`probability/entropy.md`、`probability/fisher-information.md`
+- 关联知识卡：`entropy.md`、`fisher-information.md`
+
+
+## 路由扩展
+- 若需要信息论界 → `entropy.md`（基于熵的集中不等式）
+- 若需要 Donsker-Varadhan 表示 → `kl-divergence.md`（KL 散度的变分表示）
+- 若涉及随机矩阵界 → `../matrix-analysis/matrix-perturbation.md`（随机矩阵的集中行为）
+
+## 可扩展方向
+- 鞅集中（Azuma / Freedman）：鞅差的集中不等式
+- 对数 Sobolev 不等式（log-Sobolev inequalities）：蕴含超收缩和集中
+- 传输不等式（transportation inequalities）：Wasserstein 距离与相对熵的关系
+- Talagrand 不等式：乘积空间上的维度无关集中
+- 乘积空间集中（concentration on product spaces）：独立变量函数的集中
+- 维度无关界（dimension-free bounds）：不随维度退化的集中界