Rain-Bus/Obsidian
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

vault backup: 2024-09-29 20:49:22

Browse Source
This commit is contained in:
RainBus
2024-09-29 20:49:22 +08:00
parent 64b8bc34f0
commit fb4c240c9f
1 changed files with 2 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
Record/DL/CoT Prompt.md
View File

@@ -12,5 +12,5 @@ Output: (Q + (Q + Let's think step by step ｜ LLM) + The answer is) | LLM
## LtM ## LtM
Least-to-Most prompt(最少到最多提示过程)，进一步将问题分解为子问题，然后逐个解决。主要分为以下两个阶段： Least-to-Most prompt(最少到最多提示过程)，进一步将问题分解为子问题，然后逐个解决。主要分为以下两个阶段：
- 分解问题 - 分解问题
将问题分解为子问题： 将问题分解为子问题：使用 "To solve {Q}, we need to" 来让 LLM 生成子问题。
- 解决问题 - 解决问题：根据生成的we