Skip to content

fix: tighten tutorial validation and site metadata#49

Open
WtxwNs wants to merge 1 commit into
walkinglabs:mainfrom
WtxwNs:fix/tutorial-review-obvious-issues
Open

fix: tighten tutorial validation and site metadata#49
WtxwNs wants to merge 1 commit into
walkinglabs:mainfrom
WtxwNs:fix/tutorial-review-obvious-issues

Conversation

@WtxwNs

@WtxwNs WtxwNs commented Jul 11, 2026

Copy link
Copy Markdown

Summary

  • enforce LF checkouts so scripts/verify.sh no longer loses set -eu on Windows and falsely reports success
  • narrow several overgeneralized statements around DQN, policy gradients, exploration, baselines, and RLHF advantages
  • make the landing-page redirect respect VitePress base
  • exclude archive, construction, and stale placeholder pages from the sitemap
  • replace stale private-repository links and outdated progress claims on the construction page

Validation

  • npx prettier --check on all changed Markdown/JavaScript files
  • npm run lint
  • npm run build
  • npm run sitemap (355 published pages; excluded targets absent)

Existing baseline issue

npm run verify now fails correctly instead of falsely passing. It currently stops at the repository-wide prettier --check . because 406 pre-existing files do not match the configured Prettier format. This PR intentionally does not reformat the entire repository.

@Billy1900 Billy1900 left a comment

Copy link
Copy Markdown
Contributor

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

我对于其中的内容改进没有任何意见;基本都是 语句改写+章数纠正

# 第 6 章 · 策略梯度方法

第 4 章走了路线一——先学 $Q(s,a)$ 给每个动作打分,再选分数最高的(回顾:[Q(s,a) 与贪心策略](../chapter03_mdp/value-q))。DQN 在 CartPole 和 Atari 上效果很好,但它有一个根本性的局限:**只能处理有限个离散动作。**
第 4 章走了路线一——先学 $Q(s,a)$ 给每个动作打分,再选分数最高的(回顾:[Q(s,a) 与贪心策略](../chapter03_mdp/value-q))。经典 DQN 在 CartPole 和 Atari 上效果很好,但它需要枚举网络输出的所有动作再取最大值,因此直接适用于有限离散动作空间。

Copy link
Copy Markdown
Contributor

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

这个改动是有效的 进一步将描述清晰了

第 4 章走了路线一——先学 $Q(s,a)$ 给每个动作打分,再选分数最高的(回顾:[Q(s,a) 与贪心策略](../chapter03_mdp/value-q))。经典 DQN 在 CartPole 和 Atari 上效果很好,但它需要枚举网络输出的所有动作再取最大值,因此直接适用于有限离散动作空间。

CartPole 只有"左推"和"右推"两个选项,DQN 给每个动作算一个 $Q$ 值,取最大的就行。但如果要控制一个机械臂呢?肩关节、肘关节、腕关节各有多个自由度,每个自由度能施加连续的力矩——可能的动作组合有无穷多种,不可能给每种组合都算一个 $Q$ 值。更不用说大模型生成文本——每一步要从几万个 token 中采样,策略本身是一个连续的概率分布,$\arg\max$ 的思路完全行不通
CartPole 只有"左推"和"右推"两个选项,DQN 给每个动作算一个 $Q$ 值,取最大的就行。但如果要控制一个机械臂呢?肩关节、肘关节、腕关节各有多个自由度,每个自由度都能施加连续力矩,无法为无限多个动作逐一输出 $Q$ 值。大模型的词表虽然有限,但生成需要在庞大的序列状态空间中逐步决策,还要保留随机采样能力,因此也更适合直接参数化策略分布

Copy link
Copy Markdown
Contributor

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

这个表述相对更优

Copy link
Copy Markdown
Contributor

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

是需要更新章数的

@WtxwNs

WtxwNs commented Jul 12, 2026

Copy link
Copy Markdown
Author

改的都是我对着学的时候一眼没太看懂的地方,和一些太绝对的表述

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

2 participants