math-skill 3.0.0 → 3.1.0

package/design-patterns/loss/variational-loss.en.md

@@ -1,12 +1,12 @@
 # Variational Loss
-> **Rigor disclaimer**: Claims about complexity, memory, FlashAttention fusion, Tensor Core, and KV-Cache compression are marked as ✅ verified / ⚠️ retrofittable (needs validation) / ❌ infeasible. Unmarked claims are theoretically possible but require engineering validation.
+> **Rigor disclaimer**: Claims about complexity, memory, FlashAttention fusion, Tensor Core, and KV-Cache compression are marked as [v] verified / [~] retrofittable (needs validation) / [x] infeasible. Unmarked claims are theoretically possible but require engineering validation.
 
 ## Applicable Problems
 When sampling from latent variable distributions is required to generate diverse outputs. Typical scenarios: (1) Expert selection introduces discrete latent variables $z$ that need end-to-end variational; (2) Representation spaces need to model uncertainty; (3) Generative routing requires sampling from posterior distributions $p(z|x)$; (4) Bayesian mixture of experts. Core objective: **model distributions rather than point estimates in latent space, enabling uncertainty awareness and diversity**.
 
 ## Mathematical Inspiration
-- Lenses: lenses/probabilistic.md (variational inference and ELBO), lenses/probabilistic.md (posterior and prior)
-- Knowledge: knowledge-base/probability/entropy.md (KL divergence, variational families), knowledge-base/probability/kl-divergence.md (ELBO derivation)
+- Lenses: ../../lenses/probabilistic.en.md (variational inference and ELBO), ../../lenses/probabilistic.en.md (posterior and prior)
+- Knowledge: ../../knowledge-base/probability/entropy.en.md (KL divergence, variational families), ../../knowledge-base/probability/kl-divergence.en.md (ELBO derivation)
 
 ## Required Mathematical Knowledge
 - **ELBO (Evidence Lower Bound)**: $\log p(x) \geq \mathbb{E}_{q(z|x)}[\log p(x|z)] - \text{KL}(q(z|x) \| p(z))$ -- the first term is reconstruction likelihood, the second regularizes the posterior toward the prior
@@ -31,8 +31,8 @@ Method 2 - Gumbel-Softmax (discrete expert selection):
   L_gumbel = CE(task_head(z_soft * features), y)  // straight-through estimator backprop
 
 Method 3 - Variational Information Bottleneck:
-  L_IB = -I(X; Z) + beta * I(Z; Y)  // maximize MI between Z and X, minimize redundancy between Z and Y
-  ~ E[-log q(x|z)] + beta * KL(q(z|x) || p(z))  // variational approximation
+  L_IB = I(X; Z) - beta * I(Z; Y)  // minimize information redundancy of Z about X, maximize predictive power of Z about Y
+  ~ E[-log q(y|z)] + beta * KL(q(z|x) || p(z))  // variational approximation (first term is prediction loss, second is compression penalty)
 ```
 
 ## Implementable Architectures

package/design-patterns/loss/variational-loss.md

@@ -1,5 +1,5 @@
 # Variational Loss（变分损失）
-> **严谨性声明**：本文件中涉及复杂度、显存、FlashAttention 融合、Tensor Core、KV-Cache 压缩的结论均标注为「✅ 已验证 / ⚠️ 可改造需验证 / ❌ 不可行」。未标注的视为理论可行，需工程验证。
+> **严谨性声明**：本文件中涉及复杂度、显存、FlashAttention 融合、Tensor Core、KV-Cache 压缩的结论均标注为「[v] 已验证 / [~] 可改造需验证 / [x] 不可行」。未标注的视为理论可行，需工程验证。
 
 ## 适用问题
 当需要从隐变量分布中采样并生成多样化输出时使用。典型场景：
@@ -8,9 +8,9 @@
 核心诉求：**在潜空间中建模分布而非点估计，获得不确定性感知与多样性**。
 
 ## 数学思想来源
-- 透镜：lenses/probabilistic.md（变分推断与 ELBO）、lenses/probabilistic.md（后验与先验）
-- 知识：knowledge-base/probability/entropy.md（KL 散度、变分族）、
-  knowledge-base/probability/kl-divergence.md（ELBO 推导）
+- 透镜：../../lenses/probabilistic.md（变分推断与 ELBO）、../../lenses/probabilistic.md（后验与先验）
+- 知识：../../knowledge-base/probability/entropy.md（KL 散度、变分族）、
+  ../../knowledge-base/probability/kl-divergence.md（ELBO 推导）
 
 ## 需要的数学知识
 - **ELBO（证据下界）**：log p(x) ≥ E_{q(z|x)}[log p(x|z)] - KL(q(z|x) ‖ p(z))
@@ -39,8 +39,8 @@
   L_gumbel = CE(task_head(z_soft ⊙ features), y)  // 直通估计器反向传播
 
 方法3 - 信息瓶颈变分：
-  L_IB = -I(X; Z) + β · I(Z; Y)  // 最大化 Z 与 X 的互信息，最小化 Z 与 Y 的冗余
-  ≈ E[-log q(x|z)] + β · KL(q(z|x) ‖ p(z))  // 变分近似
+  L_IB = I(X; Z) - β · I(Z; Y)  // 最小化 Z 对 X 的信息冗余，最大化 Z 对 Y 的预测能力
+  ≈ E[-log q(y|z)] + β · KL(q(z|x) ‖ p(z))  // 变分近似（第一项为预测损失，第二项为压缩惩罚）
 ```
 
 ## 可实现结构

package/design-patterns/overview.en.md

@@ -0,0 +1,36 @@
+# Design Translation Pattern Library
+
+> The design pattern library is not a complete model repository but a collection of "math → AI design" translation prototypes.
+> When existing patterns are insufficient, generate a temporary design candidate from the mathematical source and label it as a temporary design pattern, rather than refusing or force-fitting existing patterns.
+> Rigor convention: claims about complexity, memory, FlashAttention / Tensor Core / KV-Cache, and other engineering properties should be marked [v]/[~]/[x]; unmarked claims are theoretical possibilities requiring engineering validation.
+
+## Translation Paradigms
+
+| Mathematical Structure | AI Design Direction |
+|----------------------|-------------------|
+| Projection / Decomposition | subspace split / conflict removal / low-rank attention |
+| Spectral structure | token pruning / stability monitor / spectral filter |
+| Information theory | bottleneck loss / entropy gate / uncertainty routing |
+| Geometry / Metric | manifold representation / metric-aware update |
+| Topology | topology-preserving compression / obstruction loss |
+| Duality | constrained optimization / primal-dual training |
+| Symmetry / Group | equivariant features / weight sharing / orbit aggregation |
+| Variational | energy minimization / variational regularization |
+
+## Relationship to Activation Anchors
+
+```
+Activation anchors provide math tools → Design patterns translate into AI modules
+```
+
+When an activation anchor triggers the Knowledge Gap Protocol to generate a temporary knowledge card, a corresponding temporary design candidate should also be generated here.
+
+## By Component Type
+
+| Component | Directory | Count |
+|-----------|-----------|-------|
+| Attention | `attention/` | 5 |
+| Loss Functions | `loss/` | 5 |
+| Routing | `routing/` | 4 |
+| Representation | `representation/` | 4 |
+| Compression | `compression/` | 4 |

package/design-patterns/overview.md

@@ -0,0 +1,36 @@
+# 设计翻译原型库 / Design Translation Pattern Library
+
+> 设计模式库不是完整模型仓库，而是"数学 → AI 设计"的翻译原型集合。
+> 当现有模式不足时，应根据数学来源生成临时设计草案，并标记为 temporary design pattern，而不是拒绝或强行套用已有模式。
+> 严谨性约定：复杂度、显存、FlashAttention/Tensor Core/KV-Cache 等工程结论需用 [v]/[~]/[x] 标注；未标注结论视为理论可行但需工程验证。
+
+## 翻译范式
+
+| 数学结构 | AI 设计方向 |
+|---------|-----------|
+| 投影/分解 | subspace split / conflict removal / low-rank attention |
+| 谱结构 | token pruning / stability monitor / spectral filter |
+| 信息论 | bottleneck loss / entropy gate / uncertainty routing |
+| 几何/度量 | manifold representation / metric-aware update |
+| 拓扑 | topology-preserving compression / obstruction loss |
+| 对偶 | constrained optimization / primal-dual training |
+| 对称/群 | equivariant features / weight sharing / orbit aggregation |
+| 变分 | energy minimization / variational regularization |
+
+## 与知识锚点的关系
+
+```
+知识锚点提供数学工具 → 设计模式翻译成 AI 模块
+```
+
+当知识锚点触发 Knowledge Gap Protocol 生成临时知识卡时，此处也应生成对应的临时设计草案。
+
+## 按组件类型
+
+| 组件 | 目录 | 模式数 |
+|------|------|--------|
+| 注意力 | `attention/` | 5 |
+| 损失函数 | `loss/` | 5 |
+| 路由 | `routing/` | 4 |
+| 表示 | `representation/` | 4 |
+| 压缩 | `compression/` | 4 |

package/design-patterns/representation/equivariant-split.en.md

@@ -1,5 +1,5 @@
 # Equivariant Split
-> **Rigor disclaimer**: Claims about complexity, memory, FlashAttention fusion, Tensor Core, and KV-Cache compression are marked as ✅ verified / ⚠️ retrofittable (needs validation) / ❌ infeasible. Unmarked claims are theoretically possible but require engineering validation.
+> **Rigor disclaimer**: Claims about complexity, memory, FlashAttention fusion, Tensor Core, and KV-Cache compression are marked as [v] verified / [~] retrofittable (needs validation) / [x] infeasible. Unmarked claims are theoretically possible but require engineering validation.
 
 ## Applicable Problems
 Use when the input possesses symmetries (e.g., permutations, rotations, translations) and the representation should preserve or reflect those symmetries.
@@ -10,9 +10,9 @@ Typical scenarios: (1) Token permutation equivariance -- representation should c
 Core requirement: **encode symmetry priors into network architecture to reduce learning burden and improve generalization**.
 
 ## Mathematical Inspiration
-- Lenses: lenses/geometric.md (group actions, invariant/equivariant maps), lenses/probabilistic.md (symmetry and information redundancy)
-- Knowledge: knowledge-base/matrix-analysis/projection.md (group representation theory, irreducible representations),
-  knowledge-base/differential-geometry/manifold.md (Lie groups, homogeneous spaces)
+- Lenses: ../../lenses/geometric.en.md (group actions, invariant/equivariant maps), ../../lenses/probabilistic.en.md (symmetry and information redundancy)
+- Knowledge: ../../knowledge-base/matrix-analysis/projection.en.md (group representation theory, irreducible representations),
+  ../../knowledge-base/differential-geometry/manifold.en.md (Lie groups, homogeneous spaces)
 
 ## Required Mathematical Background
 - **Group Action and Equivariance**: A map f is equivariant with respect to group G if and only if f(g * x) = g * f(x) for all g in G
@@ -78,7 +78,7 @@ Method 3 - Group convolution / group pooling:
 - **Operator fusion**: Split -> batched matmul -> concat can be fused; group pooling scatter + reduce can be fused
 
 ## Paper-Worthy Formulation
-"Leveraging Schur's lemma from group representation theory, we decompose the d-dimensional feature space into a direct sum of irreducible representations of symmetry group G, with each component independently processed by equivariance-constrained linear layers. This achieves a |G| / sum(m_i^2) improvement in parameter efficiency while guaranteeing network equivariance under group actions, reducing generalization error by O(1/sqrt(|G|)) on symmetric data."
+"Leveraging Schur's lemma from group representation theory, we decompose the d-dimensional feature space into a direct sum of irreducible representations of the symmetry group G, with each component processed by equivariance-constrained linear layers. Under the assumed group action this enforces equivariance and reduces learnable degrees of freedom; the exact parameter savings depend on the representation decomposition and channel multiplicities. Generalization gains must be measured on tasks with the corresponding symmetry and should not be stated as an unconditional O(1/sqrt(|G|)) rate."
 
 ## Risks
 - Improper group selection (too large constrains cause underfitting, too small fails to capture symmetries)

package/design-patterns/representation/equivariant-split.md

@@ -1,5 +1,5 @@
 # Equivariant Split（等变分割）
-> **严谨性声明**：本文件中涉及复杂度、显存、FlashAttention 融合、Tensor Core、KV-Cache 压缩的结论均标注为「✅ 已验证 / ⚠️ 可改造需验证 / ❌ 不可行」。未标注的视为理论可行，需工程验证。
+> **严谨性声明**：本文件中涉及复杂度、显存、FlashAttention 融合、Tensor Core、KV-Cache 压缩的结论均标注为「[v] 已验证 / [~] 可改造需验证 / [x] 不可行」。未标注的视为理论可行，需工程验证。
 
 ## 适用问题
 当输入具有对称性（如排列、旋转、平移），且表示应保持或反映这些对称性时使用。
@@ -10,9 +10,9 @@
 核心诉求：**让网络结构编码对称性先验，减少学习负担，提升泛化**。
 
 ## 数学思想来源
-- 透镜：lenses/geometric.md（群作用、不变/等变映射）、lenses/probabilistic.md（对称性与信息冗余）
-- 知识：knowledge-base/matrix-analysis/projection.md（群表示论、不可约表示）、
-  knowledge-base/differential-geometry/manifold.md（李群、齐性空间）
+- 透镜：../../lenses/geometric.md（群作用、不变/等变映射）、../../lenses/probabilistic.md（对称性与信息冗余）
+- 知识：../../knowledge-base/matrix-analysis/projection.md（群表示论、不可约表示）、
+  ../../knowledge-base/differential-geometry/manifold.md（李群、齐性空间）
 
 ## 需要的数学知识
 - **群作用与等变性**：映射 f 对群 G 等变 ⟺ f(g·x) = g·f(x), ∀g∈G
@@ -79,8 +79,7 @@
 
 ## 论文表述方式
 "利用群表示论的 Schur 引理，将 d 维特征空间按对称群 G 的不可约表示分解为直和 ⊕mᵢVᵢ，
-每个分量使用受等变约束的线性层独立处理，参数效率提升 |G|/Σmᵢ² 倍，
-同时保证网络对群作用的等变性，在对称数据上泛化误差降低 O(1/√|G|)。"
+每个分量使用受等变约束的线性层独立处理，从而在满足群作用假设时严格保持等变性并减少可学习自由度。参数节省量取决于具体表示分解与通道重数；泛化收益需在具有相应对称性的任务上实测，不能无条件写成 O(1/√|G|)。"
 
 ## 风险
 - 群的选择不当（过大约束导致欠拟合，过小无法捕获对称性）

package/design-patterns/representation/manifold-representation.en.md

@@ -1,5 +1,5 @@
 # Manifold Representation
-> **Rigor disclaimer**: Claims about complexity, memory, FlashAttention fusion, Tensor Core, and KV-Cache compression are marked as ✅ verified / ⚠️ retrofittable (needs validation) / ❌ infeasible. Unmarked claims are theoretically possible but require engineering validation.
+> **Rigor disclaimer**: Claims about complexity, memory, FlashAttention fusion, Tensor Core, and KV-Cache compression are marked as [v] verified / [~] retrofittable (needs validation) / [x] infeasible. Unmarked claims are theoretically possible but require engineering validation.
 
 ## Applicable Problems
 Use when input data resides in a high-dimensional space but is actually distributed on a low-dimensional manifold. Typical scenarios:
@@ -10,9 +10,9 @@ Use when input data resides in a high-dimensional space but is actually distribu
 Core requirement: **leverage the low-dimensional manifold structure of data to improve representation efficiency and generalization**.
 
 ## Mathematical Inspiration
-- Lenses: lenses/geometric.md (Riemannian geometry, geodesics, curvature), lenses/probabilistic.md (intrinsic dimensionality)
-- Knowledge: knowledge-base/differential-geometry/manifold.md (manifolds, tangent spaces, exponential maps),
-  knowledge-base/matrix-analysis/projection.md (SVD, low-rank approximation, PCA)
+- Lenses: ../../lenses/geometric.en.md (Riemannian geometry, geodesics, curvature), ../../lenses/probabilistic.en.md (intrinsic dimensionality)
+- Knowledge: ../../knowledge-base/differential-geometry/manifold.en.md (manifolds, tangent spaces, exponential maps),
+  ../../knowledge-base/matrix-analysis/projection.en.md (SVD, low-rank approximation, PCA)
 
 ## Required Mathematical Background
 - **Manifold Hypothesis**: Data x in R^D actually lies on a smooth d-dimensional manifold M with d << D
@@ -66,17 +66,17 @@ Method 3 - Riemannian Optimization (optimize directly on the manifold):
 - **Adaptive d**: Local dimensionality varies across regions; estimate locally via PCA
 
 ## GPU Feasibility
-- **Tensorization**: Local linear projections are GEMM (d x D) @ (D x N); graph Laplacian regularization is SpMM
-- **GEMM-mappable**: K linear projections in Chart MoE form a batched GEMM (K x d x D) @ (D x N)
-- **Complexity**: k-NN construction O(N * D * log N) requires FAISS; manifold regularization O(N^2) requires sampling approximation
-- **Memory & KV-Cache**: K chart parameters K * d * D typically < 10 MB; k-NN graph N * k * 4 bytes
-- **Low-precision stability**: Distance computations and exp in fp16 require attention to numerical range; Riemannian retract recommended in fp32
-- **Parallelism & Communication**: K charts computed independently, perfectly parallel; k-NN search accelerated with FAISS GPU
-- **Sparse structure**: k-NN graph is naturally sparse; manifold regularization L is a sparse matrix, enabling SpMM acceleration
-- **Operator fusion**: Matmul + bias + activation within a chart can be fused; gating softmax + weighted-sum can be fused
+- **D1[v]**: Local linear projections are GEMM (d x D) @ (D x N); graph Laplacian regularization is SpMM
+- **D2[v]**: K linear projections in Chart MoE form a batched GEMM (K x d x D) @ (D x N)
+- **D3[~]**: k-NN construction O(N * D * log N) requires FAISS; manifold regularization O(N^2) requires sampling approximation
+- **D4[v]**: K chart parameters K * d * D typically < 10 MB; k-NN graph N * k * 4 bytes
+- **D5[~]**: Distance computations and exp in fp16 require attention to numerical range; Riemannian retract recommended in fp32
+- **D6[v]**: K charts computed independently, perfectly parallel; k-NN search accelerated with FAISS GPU
+- **D7[v]**: k-NN graph is naturally sparse; manifold regularization L is a sparse matrix, enabling SpMM acceleration
+- **D8[v]**: Matmul + bias + activation within a chart can be fused; gating softmax + weighted-sum can be fused
 
 ## Paper-Worthy Formulation
-"Based on the manifold hypothesis, we constrain D-dimensional token representations to a d*-dimensional (intrinsic dimension estimate) submanifold, achieving piecewise-linear approximation via K local coordinate charts (Chart MoE) and preserving global geodesic structure through graph Laplacian manifold regularization, with theoretical guarantees that embedding error converges at rate O(N^{-2/d*})."
+"Based on the manifold hypothesis, we model D-dimensional token representations as a low-intrinsic-dimensional structure, approximate it with K local coordinate charts (Chart MoE), and use graph-Laplacian regularization to encourage local-neighborhood consistency. Embedding-error or geodesic-preservation bounds require assumptions on sampling density, manifold smoothness, graph construction, and estimator choice; in practice report neighborhood preservation, reconstruction error, and downstream metrics."
 
 ## Risks
 - Inaccurate intrinsic dimension d* estimation leads to over-compression or dimension waste

package/design-patterns/representation/manifold-representation.md

@@ -1,5 +1,5 @@
 # Manifold Representation（流形表示）
-> **严谨性声明**：本文件中涉及复杂度、显存、FlashAttention 融合、Tensor Core、KV-Cache 压缩的结论均标注为「✅ 已验证 / ⚠️ 可改造需验证 / ❌ 不可行」。未标注的视为理论可行，需工程验证。
+> **严谨性声明**：本文件中涉及复杂度、显存、FlashAttention 融合、Tensor Core、KV-Cache 压缩的结论均标注为「[v] 已验证 / [~] 可改造需验证 / [x] 不可行」。未标注的视为理论可行，需工程验证。
 
 ## 适用问题
 当输入数据虽然在高维空间中，但实际分布在低维流形上时使用。典型场景：
@@ -10,9 +10,9 @@
 核心诉求：**利用数据的低维流形结构，提高表示效率和泛化能力**。
 
 ## 数学思想来源
-- 透镜：lenses/geometric.md（黎曼几何、测地线、曲率）、lenses/probabilistic.md（内在维度）
-- 知识：knowledge-base/differential-geometry/manifold.md（流形、切空间、指数映射）、
-  knowledge-base/matrix-analysis/projection.md（SVD、低秩近似、PCA）
+- 透镜：../../lenses/geometric.md（黎曼几何、测地线、曲率）、../../lenses/probabilistic.md（内在维度）
+- 知识：../../knowledge-base/differential-geometry/manifold.md（流形、切空间、指数映射）、
+  ../../knowledge-base/matrix-analysis/projection.md（SVD、低秩近似、PCA）
 
 ## 需要的数学知识
 - **流形假设**：数据 x ∈ R^D 实际分布在 d << D 维的光滑流形 M 上
@@ -66,19 +66,18 @@
 - **自适应 d**：不同区域的局部维度不同，用 PCA 局部估计
 
 ## GPU 可行性
-- **张量化**：局部线性投影为 GEMM (d×D)@(D×N)；图拉普拉斯正则为 SpMM
-- **GEMM 可映射**：Chart MoE 的 K 个线性投影为 batched GEMM (K×d×D)@(D×N)
-- **复杂度**：k-NN 构建 O(N·D·log N) 需 FAISS；流形正则 O(N²) 需采样近似
-- **显存与 KV-Cache**：K 个 chart 参数 K·d·D 通常 <10MB；k-NN 图 N·k·4 bytes
-- **低精度稳定**：距离计算和 exp 在 fp16 下需注意数值范围；黎曼 retract 建议 fp32
-- **并行与通信**：K 个 chart 独立计算，完美并行；k-NN 搜索用 FAISS GPU 加速
-- **稀疏结构**：k-NN 图天然稀疏，流形正则 L 为稀疏矩阵，SpMM 加速
-- **算子融合**：chart 内的 matmul+bias+activation 可融合；门控 softmax+weighted-sum 可融合
+- **D1[v]**：局部线性投影为 GEMM (d×D)@(D×N)；图拉普拉斯正则为 SpMM
+- **D2[v]**：Chart MoE 的 K 个线性投影为 batched GEMM (K×d×D)@(D×N)
+- **D3[~]**：k-NN 构建 O(N·D·log N) 需 FAISS；流形正则 O(N²) 需采样近似
+- **D4[v]**：K 个 chart 参数 K·d·D 通常 <10MB；k-NN 图 N·k·4 bytes
+- **D5[~]**：距离计算和 exp 在 fp16 下需注意数值范围；黎曼 retract 建议 fp32
+- **D6[v]**：K 个 chart 独立计算，完美并行；k-NN 搜索用 FAISS GPU 加速
+- **D7[v]**：k-NN 图天然稀疏，流形正则 L 为稀疏矩阵，SpMM 加速
+- **D8[v]**：chart 内的 matmul+bias+activation 可融合；门控 softmax+weighted-sum 可融合
 
 ## 论文表述方式
-"基于流形假设将 D 维 token 表示约束到 d*（内在维度估计）维子流形上，
-通过 K 个局部坐标卡（Chart MoE）实现分段线性近似，配合图拉普拉斯流形正则
-保持全局测地线结构，理论上保证嵌入误差以 O(N^{-2/d*}) 收敛。"
+"基于流形假设将 D 维 token 表示建模为低内在维度结构，
+通过 K 个局部坐标卡（Chart MoE）实现分段近似，并用图拉普拉斯正则鼓励局部邻域一致性。嵌入误差或测地线保持只在采样密度、流形光滑性、图构造和估计器假设满足时才有理论界，实际应报告邻域保持、重构误差和下游指标。"
 
 ## 风险
 - 内在维度 d* 估计不准确导致过度压缩或维度浪费

package/design-patterns/representation/shared-private-decomposition.en.md

@@ -1,5 +1,5 @@
 # Shared-Private Decomposition
-> **Rigor disclaimer**: Claims about complexity, memory, FlashAttention fusion, Tensor Core, and KV-Cache compression are marked as ✅ verified / ⚠️ retrofittable (needs validation) / ❌ infeasible. Unmarked claims are theoretically possible but require engineering validation.
+> **Rigor disclaimer**: Claims about complexity, memory, FlashAttention fusion, Tensor Core, and KV-Cache compression are marked as [v] verified / [~] retrofittable (needs validation) / [x] infeasible. Unmarked claims are theoretically possible but require engineering validation.
 
 ## Applicable Problems
 Use in multi-task/multi-domain learning when representations need to be decomposed into a "cross-task common component" and a "task-specific component."
@@ -9,16 +9,16 @@ Typical scenarios: (1) Multi-task MoE -- Shared experts handle linguistic common
 Core requirement: **explicitly separate commonality from individuality to prevent negative transfer and catastrophic forgetting**.
 
 ## Mathematical Inspiration
-- Lenses: lenses/projection.md (subspace decomposition, direct sum decomposition), lenses/probabilistic.md (information decomposition)
-- Knowledge: knowledge-base/matrix-analysis/projection.md (direct sum decomposition V = U + W, projection operators),
-  knowledge-base/probability/kl-divergence.md (information decomposition: shared/synergy/unique)
+- Lenses: ../../lenses/projection.en.md (subspace decomposition, direct sum decomposition), ../../lenses/probabilistic.en.md (information decomposition)
+- Knowledge: ../../knowledge-base/matrix-analysis/projection.en.md (direct sum decomposition V = U + W, projection operators),
+  ../../knowledge-base/probability/kl-divergence.en.md (information decomposition: shared/synergy/unique)
 
 ## Required Mathematical Background
 - **Direct Sum Decomposition**: R^d = S + P, where S intersect P = {0}, and every x = x_S + x_P is unique
   Projection matrices P_S + P_P = I, P_S * P_P = 0
 - **Information Decomposition (Williams & Beer PID)**:
   I(X; Y_1, Y_2) = Shared + Unique_1 + Unique_2 + Synergy
-  Shared = the redundant information component min(I(X; Y_1), I(X; Y_2))
+  Shared is the redundant-information term; min(I(X;Y_1), I(X;Y_2)) is only an early/simplified proxy, not the general Williams-Beer redundancy definition
 - **Low-Rank + Sparse Decomposition (RPCA)**: M = L + S, where L is low-rank (common) + S is sparse (specific)
   Solved via nuclear norm + L1 norm convex relaxation
 - **CCA (Canonical Correlation Analysis)**: max corr(W_1^T X, W_2^T Y), extracting shared variation between two sets of variables
@@ -42,12 +42,17 @@ Method 2 - Gated Decomposition (dynamic weighting):
   z = gate * z_shared + (1 - gate) * z_private
   // Gating allows per-dimension selection of shared/private contribution ratios
 
-Method 3 - Adversarial Decomposition (information-theoretic guarantee):
+Method 3 - Adversarial Decomposition (information-theoretic proxy):
   z_shared = E_shared(X)
   z_private = E_private[t](X)
   // Shared should be indistinguishable across tasks (adversarial gradient):
+  // ⚠ Sign correctness is critical! Original formula L_adv = -CE with flip_gradient creates a double sign reversal:
+  //   Discriminator minimizes -CE → gets worse at prediction; Encoder (sees +CE after reversal) → helps discriminator → shared becomes MORE task-specific!
+  // Correct approach: L_adv = +CE, combined with flip_gradient:
+  //   Discriminator minimizes +CE → learns to predict task from shared
+  //   Encoder (gradient reversed) sees -CE → maximizes discriminator loss → shared becomes task-independent
   task_pred = classifier(z_shared.flip_gradient())
-  L_adv = -CE(task_pred, t)        // Shared contains no task information
+  L_adv = CE(task_pred, t)        // Discriminator: minimize CE to predict task; Encoder: sees -CE after reversal, maximizes CE, making shared task-independent
   // Private should be discriminative across tasks:
   L_private = CE(classifier(z_private), t)
   L = L_task + lambda_adv * L_adv + lambda_priv * L_private
@@ -75,7 +80,7 @@ Dimension Allocation Principle:
 - **Operator fusion**: Additive fusion is trivial; gated fusion sigmoid -> multiply -> add can be fused
 
 ## Paper-Worthy Formulation
-"We decompose the multi-task representation space R^d into a direct sum S + P. The Shared subspace ensures task-invariance through adversarial training (H(T|Z_s) -> log T), while the Private subspace guarantees information complementarity with Shared via orthogonal regularization. Theoretical analysis shows that negative transfer decays as O(||P_S * P_P||_F) with increasing orthogonality."
+"We decompose the multi-task representation space R^d into a shared subspace S and task-private subspaces P: the shared branch reduces task identifiability through adversarial training, while the private branches use orthogonality / decorrelation regularization to reduce linear overlap with S. Information complementarity and reduced negative transfer must be validated with task-transfer matrices, mutual-information / PID proxies, and ablations; they are not automatically guaranteed by orthogonality alone."
 
 ## Risks
 - Min-max variational in adversarial training is unstable; the gradient reversal scale and lambda_adv require careful tuning

package/design-patterns/representation/shared-private-decomposition.md

@@ -1,5 +1,5 @@
 # Shared-Private Decomposition（共享-私有分解）
-> **严谨性声明**：本文件中涉及复杂度、显存、FlashAttention 融合、Tensor Core、KV-Cache 压缩的结论均标注为「✅ 已验证 / ⚠️ 可改造需验证 / ❌ 不可行」。未标注的视为理论可行，需工程验证。
+> **严谨性声明**：本文件中涉及复杂度、显存、FlashAttention 融合、Tensor Core、KV-Cache 压缩的结论均标注为「[v] 已验证 / [~] 可改造需验证 / [x] 不可行」。未标注的视为理论可行，需工程验证。
 
 ## 适用问题
 多任务/多领域学习中，需要将表示分解为"跨任务共性部分"和"任务特异部分"。
@@ -9,16 +9,16 @@
 核心诉求：**显式分离共性与个性，避免负迁移和灾难性遗忘**。
 
 ## 数学思想来源
-- 透镜：lenses/projection.md（子空间分解、直和分解）、lenses/probabilistic.md（信息分解）
-- 知识：knowledge-base/matrix-analysis/projection.md（直和分解 V = U ⊕ W、投影算子）、
-  knowledge-base/probability/kl-divergence.md（信息分解：shared/synergy/unique）
+- 透镜：../../lenses/projection.md（子空间分解、直和分解）、../../lenses/probabilistic.md（信息分解）
+- 知识：../../knowledge-base/matrix-analysis/projection.md（直和分解 V = U ⊕ W、投影算子）、
+  ../../knowledge-base/probability/kl-divergence.md（信息分解：shared/synergy/unique）
 
 ## 需要的数学知识
 - **直和分解**：R^d = S ⊕ P，其中 S ∩ P = {0}，每个 x = x_S + x_P 唯一
   投影矩阵 P_S + P_P = I，P_S · P_P = 0
 - **信息分解 (Williams & Beer PID)**：
   I(X;Y₁,Y₂) = Shared + Unique₁ + Unique₂ + Synergy
-  Shared = min(I(X;Y₁), I(X;Y₂)) 的冗余信息部分
+  Shared 为冗余信息项；min(I(X;Y₁), I(X;Y₂)) 只是早期/简化代理，不是 Williams-Beer 冗余的一般定义
 - **低秩+稀疏分解 (RPCA)**：M = L + S，L 低秩（共性）+ S 稀疏（特异）
   通过核范数 + L1 范数凸松弛求解
 - **CCA (典型相关分析)**：max corr(W₁^T X, W₂^T Y)，提取两组变量的共享变异
@@ -42,12 +42,17 @@
   z = gate ⊙ z_shared + (1 - gate) ⊙ z_private
   // 门控允许逐维度选择 shared/private 的贡献比例
 
-方法3 - 对抗分解（信息论保证）：
+方法3 - 对抗分解（信息论代理）：
   z_shared = E_shared(X)
   z_private = E_private[t](X)
   // Shared 应无法区分任务（对抗梯度）：
+  // ⚠ 符号正确性至关重要！原公式 L_adv = -CE 与 flip_gradient 形成双重符号反转：
+  //   判别器最小化 -CE → 变差；编码器（梯度反转后看到 +CE）→ 帮助判别器 → shared 变得更任务相关！
+  // 正确做法：L_adv = +CE，配合 flip_gradient：
+  //   判别器最小化 +CE → 学会从 shared 预测任务
+  //   编码器（梯度反转）看到 -CE → 最大化判别器损失 → shared 不含任务信息
   task_pred = classifier(z_shared.flip_gradient())
-  L_adv = -CE(task_pred, t)       // Shared 不含任务信息
+  L_adv = CE(task_pred, t)       // 判别器：最小化 CE 预测任务；编码器：梯度反转后最大化 CE，使 shared 任务无关
   // Private 应能区分任务：
   L_private = CE(classifier(z_private), t)
   L = L_task + λ_adv·L_adv + λ_priv·L_private
@@ -75,9 +80,7 @@
 - **算子融合**：加法融合 trivial；门控融合的 sigmoid→multiply→add 可融合
 
 ## 论文表述方式
-"将多任务表示空间 R^d 分解为直和 S ⊕ P，Shared 子空间通过对抗训练确保任务无关性
-（H(T|Z_s)→log T），Private 子空间通过正交正则保证与 Shared 的信息互补，
-理论分析表明负迁移随正交性以 O(‖P_S·P_P‖_F) 衰减。"
+"将多任务表示空间 R^d 分解为共享子空间 S 与任务私有子空间 P：共享分支通过对抗训练降低任务可识别性，私有分支通过正交/去相关正则减少与共享分支的线性重叠。信息互补与负迁移降低需通过任务间迁移矩阵、互信息/PID 代理和消融实验验证，不能仅由正交性自动保证。"
 
 ## 风险
 - 对抗训练的 min-max 优化不稳定，梯度反转的 scale 和 λ_adv 需精心调节

package/design-patterns/representation/subspace-alignment.en.md

@@ -1,5 +1,5 @@
 # Subspace Alignment
-> **Rigor disclaimer**: Claims about complexity, memory, FlashAttention fusion, Tensor Core, and KV-Cache compression are marked as ✅ verified / ⚠️ retrofittable (needs validation) / ❌ infeasible. Unmarked claims are theoretically possible but require engineering validation.
+> **Rigor disclaimer**: Claims about complexity, memory, FlashAttention fusion, Tensor Core, and KV-Cache compression are marked as [v] verified / [~] retrofittable (needs validation) / [x] infeasible. Unmarked claims are theoretically possible but require engineering validation.
 
 ## Applicable Problems
 Use when two or more representation spaces need to be aligned to a common subspace. Typical scenarios:
@@ -10,9 +10,9 @@ Use when two or more representation spaces need to be aligned to a common subspa
 Core requirement: **find the optimal linear/nonlinear mapping between two spaces such that corresponding semantics are aligned**.
 
 ## Mathematical Inspiration
-- Lenses: lenses/geometric.md (Grassmann manifold, principal angles), lenses/variational.md (Procrustes problem)
-- Knowledge: knowledge-base/matrix-analysis/projection.md (SVD, orthogonal Procrustes),
-  knowledge-base/differential-geometry/manifold.md (Grassmann distance, geodesics)
+- Lenses: ../../lenses/geometric.en.md (Grassmann manifold, principal angles), ../../lenses/variational.en.md (Procrustes problem)
+- Knowledge: ../../knowledge-base/matrix-analysis/projection.en.md (SVD, orthogonal Procrustes),
+  ../../knowledge-base/differential-geometry/manifold.en.md (Grassmann distance, geodesics)
 
 ## Required Mathematical Background
 - **Orthogonal Procrustes Problem**: min_{W in O(d)} ||AW - B||_F^2
@@ -71,17 +71,17 @@ Online Subspace Tracking (adaptation at inference):
 - **Chunked SVD**: Use randomized SVD approximation at large scale; sufficient precision and faster
 
 ## GPU Feasibility
-- **Tensorization**: A^T @ B is standard GEMM (d x N) @ (N x d); SVD has cuSOLVER implementations
-- **GEMM-mappable**: Procrustes core requires 1 GEMM + 1 SVD; CCA requires 2 GEMMs + 1 SVD
-- **Complexity**: GEMM O(N * d^2); SVD O(d^3) (d typically < 1024, acceptable); online tracking O(d^2)
-- **Memory & KV-Cache**: Storing covariance matrix d x d (~4 MB for d = 1024); no KV-Cache overhead
-- **Low-precision stability**: SVD strongly recommended in fp32; whitening matrix inversion requires fp32 + epsilon regularization
-- **Parallelism & Communication**: Subspace angle computations for multiple expert pairs are independent and parallel; CCA GEMMs are highly parallel
-- **Sparse structure**: When source/target representations are sparse, covariance matrix Sigma is sparse, enabling sparse SVD
-- **Operator fusion**: Whitening (mean-sub -> cov -> inv_sqrt -> transform) can be partially fused
+- **D1[v]**: A^T @ B is standard GEMM (d x N) @ (N x d); SVD has cuSOLVER implementations
+- **D2[v]**: Procrustes core requires 1 GEMM + 1 SVD; CCA requires 2 GEMMs + 1 SVD
+- **D3[v]**: GEMM O(N * d^2); SVD O(d^3) (d typically < 1024, acceptable); online tracking O(d^2)
+- **D4[v]**: Storing covariance matrix d x d (~4 MB for d = 1024); no KV-Cache overhead
+- **D5[~]**: SVD strongly recommended in fp32; whitening matrix inversion requires fp32 + epsilon regularization
+- **D6[v]**: Subspace angle computations for multiple expert pairs are independent and parallel; CCA GEMMs are highly parallel
+- **D7[~]**: When source/target representations are sparse, covariance matrix Sigma is sparse, enabling sparse SVD
+- **D8[~]**: Whitening (mean-sub -> cov -> inv_sqrt -> transform) can be partially fused
 
 ## Paper-Worthy Formulation
-"Based on orthogonal Procrustes theory, we obtain the optimal isometric mapping W* = UV^T (where USV^T = SVD(A^T B)) between source and target representations. Extending this to Deep CCA for nonlinear subspace alignment, principal angle analysis on the Grassmann manifold shows that post-alignment subspace distance converges at rate O(r/sqrt(N)), while the Barlow Twins redundancy reduction objective ensures feature dimension decorrelation."
+"Based on orthogonal Procrustes theory, we obtain the optimal isometric mapping W* = UV^T (where USV^T = SVD(A^T B)) between source and target representations. Extending this to Deep CCA for nonlinear subspace alignment, principal angles on the Grassmann manifold can measure pre/post alignment distance. Convergence rates depend on sample independence, spectral gaps, and covariance-estimation assumptions; the Barlow Twins objective penalizes cross-correlation but does not by itself guarantee semantic disentanglement, so report principal angles, CCA correlations, and downstream transfer metrics."
 
 ## Risks
 - SVD during backpropagation produces undefined gradients when singular values coincide; epsilon regularization is needed

package/design-patterns/representation/subspace-alignment.md

@@ -1,5 +1,5 @@
 # Subspace Alignment（子空间对齐）
-> **严谨性声明**：本文件中涉及复杂度、显存、FlashAttention 融合、Tensor Core、KV-Cache 压缩的结论均标注为「✅ 已验证 / ⚠️ 可改造需验证 / ❌ 不可行」。未标注的视为理论可行，需工程验证。
+> **严谨性声明**：本文件中涉及复杂度、显存、FlashAttention 融合、Tensor Core、KV-Cache 压缩的结论均标注为「[v] 已验证 / [~] 可改造需验证 / [x] 不可行」。未标注的视为理论可行，需工程验证。
 
 ## 适用问题
 当两个或多个表示空间需要对齐到共同的子空间时使用。典型场景：
@@ -10,9 +10,9 @@
 核心诉求：**找到两个空间之间的最优线性/非线性映射，使对应语义对齐**。
 
 ## 数学思想来源
-- 透镜：lenses/geometric.md（Grassmann 流形、主角度）、lenses/variational.md（Procrustes 问题）
-- 知识：knowledge-base/matrix-analysis/projection.md（SVD、正交 Procrustes）、
-  knowledge-base/differential-geometry/manifold.md（Grassmann 距离、测地线）
+- 透镜：../../lenses/geometric.md（Grassmann 流形、主角度）、../../lenses/variational.md（Procrustes 问题）
+- 知识：../../knowledge-base/matrix-analysis/projection.md（SVD、正交 Procrustes）、
+  ../../knowledge-base/differential-geometry/manifold.md（Grassmann 距离、测地线）
 
 ## 需要的数学知识
 - **正交 Procrustes 问题**：min_{W∈O(d)} ‖AW - B‖_F²
@@ -71,19 +71,19 @@
 - **分块 SVD**：大规模时用 randomized SVD 近似，精度足够且更快
 
 ## GPU 可行性
-- **张量化**：A^T@B 为标准 GEMM (d×N)@(N×d)；SVD 有 cuSOLVER 实现
-- **GEMM 可映射**：Procrustes 核心 1 次 GEMM + 1 次 SVD；CCA 2 次 GEMM + 1 次 SVD
-- **复杂度**：GEMM O(N·d²)；SVD O(d³)（d 通常 <1024，可接受）；在线追踪 O(d²)
-- **显存与 KV-Cache**：存储协方差矩阵 d×d（~4MB for d=1024），不增加 KV-Cache
-- **低精度稳定**：SVD 强烈建议 fp32；白化的矩阵逆需 fp32 + ε 正则化
-- **并行与通信**：多专家对的子空间角度计算独立并行；CCA 的 GEMM 高度并行
-- **稀疏结构**：当源/目标表示稀疏时，协方差矩阵 Σ 稀疏，可用稀疏 SVD
-- **算子融合**：白化 (mean-sub → cov → inv_sqrt → transform) 可部分融合
+- **D1[v]**：A^T@B 为标准 GEMM (d×N)@(N×d)；SVD 有 cuSOLVER 实现
+- **D2[v]**：Procrustes 核心 1 次 GEMM + 1 次 SVD；CCA 2 次 GEMM + 1 次 SVD
+- **D3[v]**：GEMM O(N·d²)；SVD O(d³)（d 通常 <1024，可接受）；在线追踪 O(d²)
+- **D4[v]**：存储协方差矩阵 d×d（~4MB for d=1024），不增加 KV-Cache
+- **D5[~]**：SVD 强烈建议 fp32；白化的矩阵逆需 fp32 + ε 正则化
+- **D6[v]**：多专家对的子空间角度计算独立并行；CCA 的 GEMM 高度并行
+- **D7[~]**：当源/目标表示稀疏时，协方差矩阵 Σ 稀疏，可用稀疏 SVD
+- **D8[~]**：白化 (mean-sub → cov → inv_sqrt → transform) 可部分融合
 
 ## 论文表述方式
 "基于正交 Procrustes 理论求得源-目标表示间的最优等距映射 W*=UV^T（USV^T=SVD(A^TB)），
 将其扩展为深度 CCA 实现非线性子空间对齐，Grassmann 流形上的主角度分析表明
-对齐后子空间距离以 O(r/√N) 收敛，同时 Barlow Twins 冗余减少目标保证特征维度解耦。"
+对齐前后的子空间距离可由主角度度量。收敛速率依赖样本独立性、谱间隙和协方差估计条件；Barlow Twins 目标只惩罚交叉相关，不能单独保证语义解耦，应报告主角度、CCA 相关系数和下游迁移指标。"
 
 ## 风险
 - SVD 在反向传播时奇异值重合导致梯度未定义，需添加 ε 正则化

package/design-patterns/routing/graph-routing.en.md

@@ -1,5 +1,5 @@
 # Graph Routing
-> **Rigor disclaimer**: Claims about complexity, memory, FlashAttention fusion, Tensor Core, and KV-Cache compression are marked as ✅ verified / ⚠️ retrofittable (needs validation) / ❌ infeasible. Unmarked claims are theoretically possible but require engineering validation.
+> **Rigor disclaimer**: Claims about complexity, memory, FlashAttention fusion, Tensor Core, and KV-Cache compression are marked as [v] verified / [~] retrofittable (needs validation) / [x] infeasible. Unmarked claims are theoretically possible but require engineering validation.
 
 ## Applicable Problems
 Use when there exists a known or learnable topological structure among modules/experts. Typical scenarios:
@@ -10,9 +10,9 @@ Use when there exists a known or learnable topological structure among modules/e
 Core requirement: **leverage structural priors to constrain routing decisions and reduce the search space**.
 
 ## Mathematical Inspiration
-- Lenses: lenses/geometric.md (graph Laplacian, spectral graph theory), lenses/probabilistic.md (message passing, information flow)
-- Knowledge: knowledge-base/matrix-analysis/projection.md (adjacency matrix, spectral decomposition),
-  knowledge-base/optimization/lagrangian-duality.md (variational on graphs, diffusion processes)
+- Lenses: ../../lenses/geometric.en.md (graph Laplacian, spectral graph theory), ../../lenses/probabilistic.en.md (message passing, information flow)
+- Knowledge: ../../knowledge-base/matrix-analysis/projection.en.md (adjacency matrix, spectral decomposition),
+  ../../knowledge-base/optimization/lagrangian-duality.en.md (variational on graphs, diffusion processes)
 
 ## Required Mathematical Background
 - **Graph Laplacian**: L = D - A (combinatorial) or L_sym = D^{-1/2} L D^{-1/2} (normalized)
@@ -60,14 +60,14 @@ Method 3 - Hierarchical Tree Routing (O(log K) complexity):
 - **Hierarchical tree implementation**: Represented as a complete binary tree array with level-wise vectorization
 
 ## GPU Feasibility
-- **Tensorization**: GCN layers perform sparse matrix times dense matrix (SpMM), supported by both PyTorch and cuSPARSE
-- **GEMM-mappable**: score_init @ P_t in Method 1 is standard GEMM (N x K) @ (K x K)
-- **Complexity**: Method 1 O(N * K^2) diffusion + O(N * K * d) gate; Method 3 O(N * d * log K) significantly better than O(N * d * K)
-- **Memory & KV-Cache**: A matrix stored sparsely at K x K; hierarchical tree parameters d x log K are negligible
-- **Low-precision stability**: Probability matrix P and softmax in fp16 require attention to normalization precision
-- **Parallelism & Communication**: GNN message passing can be batched in parallel; hierarchical tree nodes at the same level can be evaluated independently in parallel
-- **Sparse structure**: Graph adjacency matrices are naturally sparse (degree << K); SpMM reduces from O(K^2) to O(K * avg_deg)
-- **Operator fusion**: L_norm @ H @ W in GCN can be fused into a single sparse GEMM
+- **D1[v]**: GCN layers perform sparse matrix times dense matrix (SpMM), supported by both PyTorch and cuSPARSE
+- **D2[v]**: score_init @ P_t in Method 1 is standard GEMM (N x K) @ (K x K)
+- **D3[v]**: Method 1 O(N * K^2) diffusion + O(N * K * d) gate; Method 3 O(N * d * log K) significantly better than O(N * d * K)
+- **D4[v]**: A matrix stored sparsely at K x K; hierarchical tree parameters d x log K are negligible
+- **D5[v]**: Probability matrix P and softmax in fp16 require attention to normalization precision
+- **D6[v]**: GNN message passing can be batched in parallel; hierarchical tree nodes at the same level can be evaluated independently in parallel
+- **D7[v]**: Graph adjacency matrices are naturally sparse (degree << K); SpMM reduces from O(K^2) to O(K * avg_deg)
+- **D8[v]**: L_norm @ H @ W in GCN can be fused into a single sparse GEMM
 
 ## Paper-Worthy Formulation
 "Leveraging hierarchical tree/graph topology among experts, we compress routing decisions from a flat O(N * K) search to O(N * log K) tree traversal or O(N * K * avg_deg) graph diffusion. Fiedler spectral analysis reveals that the graph's algebraic connectivity lambda_2 directly governs the diversity-coherence trade-off in routing."