From fb4c240c9f6fc19701eb966a8dbdf83f2f18b7b5 Mon Sep 17 00:00:00 2001 From: RainBus Date: Sun, 29 Sep 2024 20:49:22 +0800 Subject: [PATCH] vault backup: 2024-09-29 20:49:22 --- Record/DL/CoT Prompt.md | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/Record/DL/CoT Prompt.md b/Record/DL/CoT Prompt.md index 55f731c..959f89b 100644 --- a/Record/DL/CoT Prompt.md +++ b/Record/DL/CoT Prompt.md @@ -12,5 +12,5 @@ Output: (Q + (Q + Let's think step by step ｜ LLM) + The answer is) | LLM ## LtM Least-to-Most prompt(最少到最多提示过程)，进一步将问题分解为子问题，然后逐个解决。主要分为以下两个阶段： - 分解问题 - 将问题分解为子问题： -- 解决问题 \ No newline at end of file + 将问题分解为子问题：使用 "To solve {Q}, we need to" 来让 LLM 生成子问题。 +- 解决问题：根据生成的we \ No newline at end of file