feat: publish language model origins chapter
This commit is contained in:
File diff suppressed because it is too large
Load Diff
@@ -9,7 +9,7 @@ const items = [
|
||||
{ id: "roadmap", href: "/roadmap/", label: "学习地图" },
|
||||
{ id: "k3", href: "/k3/", label: "K3 解剖" },
|
||||
{ id: "deepseek", href: "/deepseek/", label: "DeepSeek" },
|
||||
{ id: "foundations", href: "/foundations/", label: "基础原理" },
|
||||
{ id: "foundations", href: "/foundations/language-models/", label: "基础原理" },
|
||||
{ id: "scaling", href: "/scaling/", label: "Scaling" },
|
||||
{ id: "data", href: "/pretraining/data/", label: "数据工程" },
|
||||
{ id: "moe", href: "/moe/", label: "MoE" },
|
||||
|
||||
@@ -35,9 +35,9 @@ export const chapters: Chapter[] = [
|
||||
kicker: "LANGUAGE MODELING",
|
||||
question: "预测下一个 Token,为什么能产生通用能力?",
|
||||
summary: "从 N-gram、神经概率语言模型、词向量一路走到 Seq2Seq,理解 Transformer 出现前的瓶颈。",
|
||||
status: "researching",
|
||||
progress: 24,
|
||||
papers: 10,
|
||||
status: "published",
|
||||
progress: 78,
|
||||
papers: 33,
|
||||
prerequisites: [],
|
||||
highlights: ["概率分解", "分布式表示", "序列瓶颈"],
|
||||
},
|
||||
|
||||
+195
-3
@@ -33,6 +33,102 @@ export const papers: Paper[] = [
|
||||
contribution: "信息熵与序列概率的理论起点。",
|
||||
verified: true,
|
||||
},
|
||||
{
|
||||
year: 1951,
|
||||
title: "Prediction and Entropy of Printed English",
|
||||
url: "https://doi.org/10.1002/j.1538-7305.1951.tb01366.x",
|
||||
topics: ["基础"],
|
||||
contribution: "用已知前文时的下一字母猜测实验估计英语熵与冗余,是 next-symbol 预测的概念先声。",
|
||||
verified: true,
|
||||
},
|
||||
{
|
||||
year: 1953,
|
||||
title: "The Population Frequencies of Species and the Estimation of Population Parameters",
|
||||
url: "https://doi.org/10.1093/biomet/40.3-4.237",
|
||||
topics: ["基础"],
|
||||
contribution: "以 frequency of frequencies 估计低频与未见事件的概率质量,奠定 Good–Turing 主线。",
|
||||
verified: true,
|
||||
},
|
||||
{
|
||||
year: 1977,
|
||||
title: "Perplexity—a measure of the difficulty of speech recognition tasks",
|
||||
url: "https://doi.org/10.1121/1.2016299",
|
||||
topics: ["基础", "评测"],
|
||||
contribution: "早期把 perplexity 用作语音识别语言约束难度的历史节点。",
|
||||
verified: true,
|
||||
},
|
||||
{
|
||||
year: 1987,
|
||||
title: "Estimation of Probabilities from Sparse Data for the Language Model Component of a Speech Recognizer",
|
||||
url: "https://ieeexplore.ieee.org/document/1165125",
|
||||
topics: ["基础"],
|
||||
contribution: "用折扣与回退把高阶 N-gram 的未见概率质量交给低阶模型。",
|
||||
verified: true,
|
||||
},
|
||||
{
|
||||
year: 1990,
|
||||
title: "Finding Structure in Time",
|
||||
url: "https://doi.org/10.1207/s15516709cog1402_1",
|
||||
topics: ["基础"],
|
||||
contribution: "Elman 网络用循环 context units 在预测任务中形成序列相关的隐藏结构。",
|
||||
verified: true,
|
||||
},
|
||||
{
|
||||
year: 1990,
|
||||
title: "Indexing by Latent Semantic Analysis",
|
||||
url: "https://doi.org/10.1002/(SICI)1097-4571(199009)41:6%3C391::AID-ASI1%3E3.0.CO;2-9",
|
||||
topics: ["基础"],
|
||||
contribution: "用词—文档矩阵的低秩分解构造全局潜在语义空间。",
|
||||
verified: true,
|
||||
},
|
||||
{
|
||||
year: 1992,
|
||||
title: "Class-Based n-gram Models of Natural Language",
|
||||
url: "https://aclanthology.org/J92-4003/",
|
||||
topics: ["基础"],
|
||||
contribution: "用离散词类在 N-gram 中共享统计,是连续词向量之前的重要参数共享路线。",
|
||||
verified: true,
|
||||
},
|
||||
{
|
||||
year: 1994,
|
||||
title: "Learning long-term dependencies with gradient descent is difficult",
|
||||
url: "https://ieeexplore.ieee.org/document/279181",
|
||||
topics: ["基础"],
|
||||
contribution: "系统阐明循环网络学习长期存储时的梯度与动力学困难。",
|
||||
verified: true,
|
||||
},
|
||||
{
|
||||
year: 1995,
|
||||
title: "Improved Backing-off for M-gram Language Modeling",
|
||||
url: "https://doi.org/10.1109/ICASSP.1995.479394",
|
||||
topics: ["基础"],
|
||||
contribution: "用不同续接上下文的数量构造低阶分布,形成 Kneser–Ney smoothing 的核心直觉。",
|
||||
verified: true,
|
||||
},
|
||||
{
|
||||
year: 1996,
|
||||
title: "An Empirical Study of Smoothing Techniques for Language Modeling",
|
||||
url: "https://aclanthology.org/P96-1041/",
|
||||
topics: ["基础", "评测"],
|
||||
contribution: "跨数据规模和模型阶数系统比较平滑方法,建立 modified Kneser–Ney 的实证坐标。",
|
||||
verified: true,
|
||||
},
|
||||
{
|
||||
year: 1997,
|
||||
title: "Long Short-Term Memory",
|
||||
url: "https://doi.org/10.1162/neco.1997.9.8.1735",
|
||||
topics: ["基础"],
|
||||
contribution: "用受门控的恒定误差通路缓解循环网络的长期依赖与衰减误差回流。",
|
||||
verified: true,
|
||||
},
|
||||
{
|
||||
year: 2001,
|
||||
title: "A Bit of Progress in Language Modeling",
|
||||
url: "https://arxiv.org/abs/cs/0108005",
|
||||
topics: ["基础", "评测"],
|
||||
contribution: "组合 cache、高阶 N-gram、skipping、Kneser–Ney 与 clustering,展现计数时代的强系统基线。",
|
||||
verified: true,
|
||||
},
|
||||
{
|
||||
year: 2003,
|
||||
title: "A Neural Probabilistic Language Model",
|
||||
@@ -41,6 +137,22 @@ export const papers: Paper[] = [
|
||||
contribution: "用分布式词表示和神经网络突破 N-gram 稀疏泛化。",
|
||||
verified: true,
|
||||
},
|
||||
{
|
||||
year: 2005,
|
||||
title: "Hierarchical Probabilistic Neural Network Language Model",
|
||||
url: "https://proceedings.mlr.press/r5/morin05a.html",
|
||||
topics: ["基础"],
|
||||
contribution: "用二叉词树把全词表预测改成路径二分类,直面神经 LM 的 Softmax 词表税。",
|
||||
verified: true,
|
||||
},
|
||||
{
|
||||
year: 2010,
|
||||
title: "Recurrent neural network based language model",
|
||||
url: "https://www.isca-archive.org/interspeech_2010/mikolov10_interspeech.html",
|
||||
topics: ["基础", "评测"],
|
||||
contribution: "把变长循环状态带入真实语音识别 LM,并明确暴露高训练复杂度。",
|
||||
verified: true,
|
||||
},
|
||||
{
|
||||
year: 2013,
|
||||
title: "Efficient Estimation of Word Representations in Vector Space",
|
||||
@@ -49,6 +161,38 @@ export const papers: Paper[] = [
|
||||
contribution: "Word2Vec 把大规模词向量训练变得简单高效。",
|
||||
verified: true,
|
||||
},
|
||||
{
|
||||
year: 2013,
|
||||
title: "Distributed Representations of Words and Phrases and their Compositionality",
|
||||
url: "https://proceedings.neurips.cc/paper/2013/hash/9aa42b31882ec039965f3c4923ce901b-Abstract.html",
|
||||
topics: ["基础"],
|
||||
contribution: "以 negative sampling、频繁词子采样和短语发现扩展高效静态词表示。",
|
||||
verified: true,
|
||||
},
|
||||
{
|
||||
year: 2013,
|
||||
title: "One Billion Word Benchmark for Measuring Progress in Statistical Language Modeling",
|
||||
url: "https://arxiv.org/abs/1312.3005",
|
||||
topics: ["基础", "评测"],
|
||||
contribution: "提供接近十亿词的可比 LM 基准,并并列计数、循环与组合系统。",
|
||||
verified: true,
|
||||
},
|
||||
{
|
||||
year: 2014,
|
||||
title: "GloVe: Global Vectors for Word Representation",
|
||||
url: "https://aclanthology.org/D14-1162/",
|
||||
topics: ["基础"],
|
||||
contribution: "在全局共现计数上拟合加权 log-bilinear 关系,连接矩阵分解与局部窗口表示。",
|
||||
verified: true,
|
||||
},
|
||||
{
|
||||
year: 2014,
|
||||
title: "Learning Phrase Representations using RNN Encoder-Decoder for Statistical Machine Translation",
|
||||
url: "https://aclanthology.org/D14-1179/",
|
||||
topics: ["基础"],
|
||||
contribution: "引入 RNN encoder–decoder 与 GRU 门控,把变长源序列映射到条件生成。",
|
||||
verified: true,
|
||||
},
|
||||
{
|
||||
year: 2014,
|
||||
title: "Sequence to Sequence Learning with Neural Networks",
|
||||
@@ -65,6 +209,14 @@ export const papers: Paper[] = [
|
||||
contribution: "用可微软对齐让 decoder 直接检索全部 encoder state。",
|
||||
verified: true,
|
||||
},
|
||||
{
|
||||
year: 2015,
|
||||
title: "Effective Approaches to Attention-based Neural Machine Translation",
|
||||
url: "https://aclanthology.org/D15-1166/",
|
||||
topics: ["基础", "Transformer"],
|
||||
contribution: "系统化 global/local attention 与多种打分形式,澄清 Attention 前夜的设计空间。",
|
||||
verified: true,
|
||||
},
|
||||
{
|
||||
year: 2015,
|
||||
title: "Neural Machine Translation of Rare Words with Subword Units",
|
||||
@@ -73,6 +225,46 @@ export const papers: Paper[] = [
|
||||
contribution: "把 BPE 引入神经机器翻译,形成现代子词分词主线。",
|
||||
verified: true,
|
||||
},
|
||||
{
|
||||
year: 2016,
|
||||
title: "Character-Aware Neural Language Models",
|
||||
url: "https://arxiv.org/abs/1508.06615",
|
||||
topics: ["基础"],
|
||||
contribution: "用字符 CNN 与 highway network 构造词表示,再交给 LSTM LM 建模。",
|
||||
verified: true,
|
||||
},
|
||||
{
|
||||
year: 2016,
|
||||
title: "Exploring the Limits of Language Modeling",
|
||||
url: "https://arxiv.org/abs/1602.02410",
|
||||
topics: ["基础", "训练系统", "评测"],
|
||||
contribution: "在 Transformer 前夜把 RNN/CNN 词级语言模型推向大数据、大词表与大计算。",
|
||||
verified: true,
|
||||
},
|
||||
{
|
||||
year: 2016,
|
||||
title: "Efficient softmax approximation for GPUs",
|
||||
url: "https://arxiv.org/abs/1609.04309",
|
||||
topics: ["基础", "训练系统"],
|
||||
contribution: "Adaptive Softmax 利用词频长尾分配不同计算,降低全词表输出的期望成本。",
|
||||
verified: true,
|
||||
},
|
||||
{
|
||||
year: 2016,
|
||||
title: "Language Modeling with Gated Convolutional Networks",
|
||||
url: "https://arxiv.org/abs/1612.08083",
|
||||
topics: ["基础", "训练系统"],
|
||||
contribution: "以门控卷积建立可并行的强语言模型路线,说明历史并非 RNN 单线演进。",
|
||||
verified: true,
|
||||
},
|
||||
{
|
||||
year: 2017,
|
||||
title: "Regularizing and Optimizing LSTM Language Models",
|
||||
url: "https://arxiv.org/abs/1708.02182",
|
||||
topics: ["基础", "训练系统"],
|
||||
contribution: "以 DropConnect 与 NT-ASGD 等配方建立 AWD-LSTM 强基线。",
|
||||
verified: true,
|
||||
},
|
||||
{
|
||||
year: 1991,
|
||||
title: "Adaptive Mixtures of Local Experts",
|
||||
@@ -474,7 +666,7 @@ export const papers: Paper[] = [
|
||||
year: 2024,
|
||||
title: "DeepSeek-V3 Technical Report",
|
||||
url: "https://arxiv.org/abs/2412.19437",
|
||||
topics: ["MoE", "Scaling", "数据", "训练系统", "低精度"],
|
||||
topics: ["基础", "MoE", "Scaling", "数据", "训练系统", "低精度"],
|
||||
contribution: "671B-A37B;FP8、MTP、无辅助损失平衡与 DualPipe。",
|
||||
spotlight: "DeepSeek",
|
||||
verified: true,
|
||||
@@ -1814,7 +2006,7 @@ export const papers: Paper[] = [
|
||||
year: 2026,
|
||||
title: "DeepSeek-V4: Towards Highly Efficient Million-Token Context Intelligence",
|
||||
url: "https://arxiv.org/abs/2606.19348",
|
||||
topics: ["长上下文", "MoE", "数据", "训练系统", "推理"],
|
||||
topics: ["基础", "长上下文", "MoE", "数据", "训练系统", "推理"],
|
||||
contribution: "32/33T 长文与 agentic 数据、CSA/HCA、mHC、Muon 和 1M 上下文双模型。",
|
||||
spotlight: "DeepSeek",
|
||||
verified: true,
|
||||
@@ -1823,7 +2015,7 @@ export const papers: Paper[] = [
|
||||
year: 2026,
|
||||
title: "Kimi K3: Open Frontier Intelligence",
|
||||
url: "https://arxiv.org/abs/2607.24653",
|
||||
topics: ["长上下文", "MoE", "数据", "训练系统", "低精度", "推理", "Agent", "多模态", "评测"],
|
||||
topics: ["基础", "长上下文", "MoE", "数据", "训练系统", "低精度", "推理", "Agent", "多模态", "评测"],
|
||||
contribution: "四文本域与视觉语料、2.8T-A104B、KDA/MLA、Stable LatentMoE 与 1M Agentic RL。",
|
||||
spotlight: "Kimi",
|
||||
verified: true,
|
||||
|
||||
@@ -63,6 +63,11 @@ const toc = [
|
||||
文本先被切成 Token,Token 变成向量;自注意力让每个位置从其他位置收集信息,
|
||||
前馈网络在每个位置内部加工;残差和归一化让几十上百层能够稳定堆叠。
|
||||
</p>
|
||||
<a class="previous-chapter" href="/foundations/language-models/">
|
||||
<span>PREVIOUS / CHAPTER 01</span>
|
||||
<div><b>语言模型从哪里来</b><p>如果 N-gram、Embedding、RNN/LSTM、Seq2Seq 或 Attention 的来由还不清楚,先回到完整前史。</p></div>
|
||||
<em>返回上一章 →</em>
|
||||
</a>
|
||||
<div class="token-journey" role="img" aria-label="一个 Token 通过 Transformer 的旅程">
|
||||
<div><span>01</span><b>Tokenizer</b><small>文字 → 离散 ID</small></div><i>→</i>
|
||||
<div><span>02</span><b>Embedding</b><small>ID → 连续向量</small></div><i>→</i>
|
||||
@@ -312,6 +317,40 @@ const toc = [
|
||||
</div>
|
||||
|
||||
<style>
|
||||
.previous-chapter {
|
||||
display: grid;
|
||||
grid-template-columns: 150px 1fr auto;
|
||||
gap: 22px;
|
||||
align-items: center;
|
||||
max-width: 940px;
|
||||
margin: 28px 0 36px;
|
||||
padding: 20px;
|
||||
border: 1px solid var(--line);
|
||||
color: var(--ink);
|
||||
}
|
||||
|
||||
.previous-chapter > span {
|
||||
color: var(--copper);
|
||||
font: 0.62rem/1.5 var(--mono);
|
||||
}
|
||||
|
||||
.previous-chapter b {
|
||||
font-size: 0.95rem;
|
||||
}
|
||||
|
||||
.previous-chapter p {
|
||||
margin-top: 6px;
|
||||
color: var(--muted);
|
||||
font-size: 0.68rem;
|
||||
line-height: 1.55;
|
||||
}
|
||||
|
||||
.previous-chapter em {
|
||||
color: var(--copper);
|
||||
font: 0.64rem/1 var(--mono);
|
||||
white-space: nowrap;
|
||||
}
|
||||
|
||||
.token-journey {
|
||||
display: grid;
|
||||
grid-template-columns: repeat(4, minmax(120px, 1fr) 24px) minmax(120px, 1fr);
|
||||
@@ -563,6 +602,10 @@ const toc = [
|
||||
}
|
||||
|
||||
@media (max-width: 760px) {
|
||||
.previous-chapter {
|
||||
grid-template-columns: 1fr;
|
||||
}
|
||||
|
||||
.token-journey {
|
||||
grid-template-columns: 1fr;
|
||||
}
|
||||
|
||||
File diff suppressed because it is too large
Load Diff
+29
-1
@@ -6,6 +6,7 @@ import { chapters, statusLabel } from "@/data/chapters";
|
||||
|
||||
const routes: Record<string, string> = {
|
||||
roadmap: "/roadmap/",
|
||||
"foundations/language-models": "/foundations/language-models/",
|
||||
foundations: "/foundations/",
|
||||
scaling: "/scaling/",
|
||||
"pretraining/data": "/pretraining/data/",
|
||||
@@ -79,6 +80,7 @@ const paths = [
|
||||
</p>
|
||||
<div class="hero-actions">
|
||||
<a class="button primary" href="/roadmap/">选择学习路径 <span aria-hidden="true">↓</span></a>
|
||||
<a class="button" href="/foundations/language-models/">语言模型从哪里来</a>
|
||||
<a class="button" href="/k3/">直接解剖 K3</a>
|
||||
<a class="button" href="/deepseek/">DeepSeek 专题</a>
|
||||
<a class="button" href="/scaling/">Scaling Laws 专题</a>
|
||||
@@ -97,7 +99,7 @@ const paths = [
|
||||
<div class="hero-stats">
|
||||
<div><b>16</b><span>核心专题</span></div>
|
||||
<div><b>151</b><span>K3 报告来源</span></div>
|
||||
<div><b>223</b><span>关键论文索引</span></div>
|
||||
<div><b>247</b><span>关键论文索引</span></div>
|
||||
<div><b>47p</b><span>K3 技术报告</span></div>
|
||||
</div>
|
||||
</aside>
|
||||
@@ -111,6 +113,22 @@ const paths = [
|
||||
|
||||
<section class="section compact release-section" id="new-chapters">
|
||||
<div class="release-grid">
|
||||
<a class="release-card foundation-release" href="/foundations/language-models/">
|
||||
<div>
|
||||
<p class="eyebrow"><span>NEW / CHAPTER 01</span> LANGUAGE MODELING ORIGINS</p>
|
||||
<h2>预测下一个 Token,为什么会走到今天的大模型?</h2>
|
||||
<p>
|
||||
用预测单位、概率信息、上下文、稀疏性、分布式表示、循环记忆、序列转导与系统成本八张账,
|
||||
从 Shannon、N-gram、Kneser–Ney、Bengio、RNN/LSTM 一路走到 Seq2Seq、Attention 与 K3 / DeepSeek。
|
||||
</p>
|
||||
</div>
|
||||
<dl>
|
||||
<div><dt>LINEAGE</dt><dd>1948 → 2026</dd></div>
|
||||
<div><dt>PAPERS</dt><dd>33 个一手节点</dd></div>
|
||||
<div><dt>LAB</dt><dd>概率 · 向量 · 记忆 · 对齐</dd></div>
|
||||
</dl>
|
||||
<span class="release-arrow" aria-hidden="true">从语言模型的起点开始 →</span>
|
||||
</a>
|
||||
<a class="release-card numerics-release" href="/systems/numerics/">
|
||||
<div>
|
||||
<p class="eyebrow"><span>NEW / CHAPTER 09</span> PRECISION · OPTIMIZATION · STABILITY</p>
|
||||
@@ -456,6 +474,7 @@ const paths = [
|
||||
transition: transform 180ms ease, border-color 180ms ease;
|
||||
}
|
||||
|
||||
.foundation-release,
|
||||
.numerics-release,
|
||||
.data-release,
|
||||
.scaling-release,
|
||||
@@ -473,6 +492,14 @@ const paths = [
|
||||
var(--paper-raised);
|
||||
}
|
||||
|
||||
.foundation-release {
|
||||
background:
|
||||
radial-gradient(circle at 82% 18%, rgba(159, 91, 52, 0.2), transparent 30%),
|
||||
repeating-linear-gradient(90deg, transparent 0 72px, rgba(159, 91, 52, 0.045) 72px 73px),
|
||||
repeating-linear-gradient(0deg, transparent 0 72px, rgba(48, 64, 82, 0.035) 72px 73px),
|
||||
var(--paper-raised);
|
||||
}
|
||||
|
||||
.data-release {
|
||||
background:
|
||||
radial-gradient(circle at 82% 18%, rgba(76, 118, 112, 0.2), transparent 30%),
|
||||
@@ -563,6 +590,7 @@ const paths = [
|
||||
padding-bottom: 76px;
|
||||
}
|
||||
|
||||
.foundation-release,
|
||||
.numerics-release,
|
||||
.data-release,
|
||||
.scaling-release,
|
||||
|
||||
@@ -10,6 +10,7 @@ const workstreams = [
|
||||
{ label: "研究框架与规范", value: 83, next: "给 Scaling 与推理专题补逐篇图表/实验精读层级" },
|
||||
{ label: "网站设计系统", value: 89, next: "打印样式与更多通用可视化组件" },
|
||||
{ label: "Kimi K3 深读", value: 66, next: "扩写 pre-training / infra 逐图笔记" },
|
||||
{ label: "语言模型前史", value: 78, next: "逐图精读 Kneser–Ney、LSTM 与 Bahdanau,并加入真实小语料复现" },
|
||||
{ label: "Transformer 基础", value: 52, next: "加入矩阵形状动画与手算练习" },
|
||||
{ label: "Scaling Laws", value: 74, next: "加入真实拟合复现、置信区间与更多模型族对照" },
|
||||
{ label: "数据工程与预训练配方", value: 73, next: "逐图精读 FineWeb / DCLM,加入真实去重与 mixture traces" },
|
||||
@@ -43,7 +44,7 @@ const workstreams = [
|
||||
<div><dt>OVERALL</dt><dd>专题平均 {average}%</dd></div>
|
||||
<div><dt>READABLE</dt><dd>{published} 个首版可读专题</dd></div>
|
||||
<div><dt>ACTIVE</dt><dd>{researching} 个研究/写作中</dd></div>
|
||||
<div><dt>UPDATED</dt><dd>2026-07-29 03:55 CST</dd></div>
|
||||
<div><dt>UPDATED</dt><dd>2026-07-29 04:48 CST</dd></div>
|
||||
<div><dt>MODE</dt><dd>持续迭代,不锁死版本</dd></div>
|
||||
</dl>
|
||||
</div>
|
||||
@@ -53,7 +54,7 @@ const workstreams = [
|
||||
<div class="section-heading">
|
||||
<div>
|
||||
<p class="eyebrow"><span>01</span> WORKSTREAMS</p>
|
||||
<h2>十四条工作流同时推进,但不混淆“有页面”和“已核验”</h2>
|
||||
<h2>十五条工作流同时推进,但不混淆“有页面”和“已核验”</h2>
|
||||
</div>
|
||||
<p class="section-lead">
|
||||
内容首版优先打通全局脉络;随后每轮迭代选择一个专题推进到论文/工程层,并做独立事实复核。
|
||||
@@ -90,8 +91,9 @@ const workstreams = [
|
||||
<article><span>✓</span><h3>K3 报告已结构化拆解</h3><p>47 页报告目录、151 条参考来源和架构/后训练/系统主线已经提取。</p></article>
|
||||
<article><span>✓</span><h3>16 专题知识图</h3><p>从语言模型基础到评测安全,包含先修依赖和三条贯穿案例。</p></article>
|
||||
<article><span>✓</span><h3>编辑式网站系统</h3><p>响应式导航、章节模板、侧栏、进度、论文链和证据提示组件。</p></article>
|
||||
<article><span>✓</span><h3>二十四个原创交互视图</h3><p>K3、注意力、DeepSeek、长上下文、MoE、推理,以及训练系统、Scaling、数据工程和数值专题的多页签实验。</p></article>
|
||||
<article><span>✓</span><h3>十篇首版长文</h3><p>K3、Transformer、DeepSeek、Scaling、数据工程、长上下文、MoE、推理、训练系统与数值优化专题。</p></article>
|
||||
<article><span>✓</span><h3>二十八个原创交互视图</h3><p>K3、语言模型前史、注意力、DeepSeek、长上下文、MoE、推理,以及训练系统、Scaling、数据工程和数值专题的多页签实验。</p></article>
|
||||
<article><span>✓</span><h3>十一篇首版长文</h3><p>K3、语言模型前史、Transformer、DeepSeek、Scaling、数据工程、长上下文、MoE、推理、训练系统与数值优化专题。</p></article>
|
||||
<article><span>✓</span><h3>语言模型前史深度专题</h3><p>八张独立问题账、33 个正式节点、20 段长文与概率—向量—记忆—对齐四联实验。</p></article>
|
||||
<article><span>✓</span><h3>Scaling Laws 深度专题</h3><p>九张账、29 个一手节点、DeepSeek/Kimi 双谱系与曲面—部署—复用—涌现四联实验。</p></article>
|
||||
<article><span>✓</span><h3>数据工程深度专题</h3><p>十二张账、31 个一手节点、DeepSeek/Kimi 双谱系与流水线—去重—混合—改写四联实验。</p></article>
|
||||
<article><span>✓</span><h3>长上下文深度专题</h3><p>五张成本账、26 篇一手论文、10+ 机制图与 8 策略交互实验室。</p></article>
|
||||
@@ -99,7 +101,7 @@ const workstreams = [
|
||||
<article><span>✓</span><h3>推理深度专题</h3><p>八张账、30 篇一手论文链、DeepSeek/Kimi 双主线与三页签互动实验室。</p></article>
|
||||
<article><span>✓</span><h3>训练系统深度专题</h3><p>九张账、37 个一手节点、DeepSeek/Kimi 双谱系与显存—网格—气泡—通信实验室。</p></article>
|
||||
<article><span>✓</span><h3>数值、优化器与稳定性深度专题</h3><p>十张账、36 个一手节点、K2/K3 与 DeepSeek-V3/V4 双谱系,以及格式—状态—更新—失稳四联实验。</p></article>
|
||||
<article><span>✓</span><h3>223 篇关键论文索引</h3><p>新增「优化器」标签和 21 个一手节点,继续支持全文搜索与 Kimi/DeepSeek 聚光主线。</p></article>
|
||||
<article><span>✓</span><h3>247 篇关键论文索引</h3><p>新增 24 个语言模型前史节点,并把 DeepSeek-V3/V4 与 K3 映射回 next-token 主线。</p></article>
|
||||
<article><span>✓</span><h3>公开仓库与自托管发布</h3><p>源码公开到 git.k1412.top,网站由不可变镜像、Compose Manager 与 HTTPS 交付。</p></article>
|
||||
</div>
|
||||
</section>
|
||||
@@ -114,6 +116,7 @@ const workstreams = [
|
||||
</div>
|
||||
<div class="queue-table">
|
||||
<div class="head"><b>优先级</b><b>专题</b><b>本轮交付</b><b>完成闸门</b></div>
|
||||
<div><span>P0</span><strong>语言模型前史二轮</strong><p>Kneser–Ney / LSTM / Bahdanau 逐图 → 真实小语料复现 → tokenizer 公平性</p><em>可复现实验 + 逐图笔记</em></div>
|
||||
<div><span>P0</span><strong>Scaling Laws 二轮</strong><p>真实拟合复现 → 置信区间 → 更多模型族与下游任务外推</p><em>可复现实验 + 逐图笔记</em></div>
|
||||
<div><span>P1</span><strong>数据工程二轮</strong><p>FineWeb / DCLM 逐图 → 真实去重误伤 → mixture traces 与污染案例</p><em>逐图笔记 + 案例库</em></div>
|
||||
<div><span>P1</span><strong>大规模训练系统二轮</strong><p>真实集群 traces → 故障恢复 → 精确 topology / kernel 配置</p><em>案例库 + 实测边界</em></div>
|
||||
@@ -167,6 +170,8 @@ const workstreams = [
|
||||
<div><time>2026-07-29</time><b>Grok 数据线索与正式账本永久分离</b><p>1264 行正式研究账本只接受回查一手来源后的结论;203 行 Grok 产物保留为未核验发现队列。</p></div>
|
||||
<div><time>2026-07-29</time><b>数值专题按十张账组织</b><p>把格式、缩放、计算、累加、搬运、更新、参数化、观测、恢复与证据经济分开核算。</p></div>
|
||||
<div><time>2026-07-29</time><b>低精度结论必须写完整角色合同</b><p>对象、格式、scale 粒度、accumulator、输出与硬件不再被压缩成一个 dtype 标签。</p></div>
|
||||
<div><time>2026-07-29</time><b>语言模型前史按八张账组织</b><p>预测单位、概率信息、上下文、稀疏性、分布式表示、循环记忆、序列转导与系统成本不再混成单一架构年表。</p></div>
|
||||
<div><time>2026-07-29</time><b>NTP、MTP 与多模态永久分角色</b><p>K3 的统一视觉/文本 next-token objective、one MTP layer 与 EAGLE-3 draft bridge 分开记账;DeepSeek MTP 也不写成取代自回归。</p></div>
|
||||
</div>
|
||||
</section>
|
||||
|
||||
|
||||
Reference in New Issue
Block a user