CDW-CoT: Clustered Distance-Weighted Chain-of-Thoughts Reasoning

Yuanheng Fang, Guoqing Chao, Wenqiang Lei, Shaobo Li, Dianhui Chu

TL;DR

CDW-CoT (Clustered Distance-Weighted Chain-of-Thought) moves away from "one-size-fits-all" prompting by dynamically tailoring reasoning exemplars to individual data instances. By combining unsupervised clustering with distance-weighted probability distributions, the method achieves significant accuracy gains—up to 25% on LLaMA2—across commonsense, symbolic, and mathematical reasoning tasks.

What Problem Does This Paper Address?

Chain-of-Thought (CoT) prompting has revolutionized how Large Language Models (LLMs) handle complex reasoning by asking them to "think step-by-step." However, most current methods (whether manual or automated) use a static set of prompts for an entire dataset.

The authors argue that this "one-size-fits-all" approach ignores the inherent diversity within datasets. A math dataset might contain both simple arithmetic and complex word problems; using the same reasoning exemplars for both is sub-optimal. While "Auto-CoT" attempted to fix this by clustering questions, it still typically assigns a single representative prompt to each cluster. CDW-CoT addresses this lack of granularity by creating a "soft" assignment: it calculates a unique prompt strategy for every single test instance based on its similarity to various data clusters.

Methods

The CDW-CoT framework operates in three distinct phases:

  1. Cluster-Based Prompt Candidate Pool Initialization: The training dataset is converted into vector embeddings using a sentence transformer and grouped into $K$ clusters via K-means. Representative "candidate prompts" are then selected from each cluster and refined using Zero-Shot-CoT to create a diverse pool.
  2. Optimizing Prompt Probability Distributions: Instead of just picking the "best" prompt, the system uses Black-Box Prompt Learning (BBPL). It treats the prompt selection as a reinforcement learning problem, optimizing a probability distribution ($p^{(i)}$) for each cluster. This ensures that the prompts most effective for a specific category of questions are given higher weights.
  3. Distance-Weighted Prompt Selection and Inference: This is the "secret sauce." When a new test question arrives, the system calculates its Euclidean distance to every cluster center. These distances are converted into weights using a temperature-scaled softmax function. The final prompt used for reasoning is selected from a unique probability distribution tailored specifically for that instance—a weighted blend of the optimized distributions from all clusters.

Datasets

The authors evaluated their method on six benchmark datasets across three reasoning domains:

  • Commonsense Reasoning: CSQA and StrategyQA.
  • Symbolic Reasoning: Last Letter Concatenation (Letter) and Coin Flip (Coin).
  • Mathematical Reasoning: MultiArith and AQuA.

No new benchmarks were introduced, but the variety of these existing sets demonstrates the generalizability of the approach across very different logic requirements.

Key Insights and Ideas

  • Soft Assignment vs. Hard Assignment: The most important insight is that "hard" clustering (assigning a question to exactly one group) is brittle. By using distance-weighting, CDW-CoT allows for a "fuzzy" logic where a question that sits between two clusters can benefit from the reasoning strategies of both.
  • The "Diversity Mining" Effect: The paper shows that even within a single dataset, there is category-specific information that a global prompt misses. By forcing the model to develop cluster-specific distributions, they "mine" more effective reasoning paths.
  • Optimization over Heuristics: Unlike Auto-CoT, which uses simple heuristics to pick exemplars, CDW-CoT uses gradient-based optimization (via BBPL) to find the mathematically optimal distribution of prompts, leading to much higher stability.

Key Results

The performance gains are substantial, particularly on older or mid-sized models:

  • LLaMA2 (13B): CDW-CoT achieved an average accuracy improvement of 25.34% over Manual-CoT. On the "Letter" symbolic reasoning task, accuracy jumped from 15.80% (Manual) to 82.67% (CDW-CoT).
  • LLaMA3 (8B): The method showed a 15.72% average improvement over Manual-CoT, proving that even highly capable newer models benefit from tailored prompting.
  • Ablation Success: In their ablation studies, the "Distance-Weighted" version (Dist-W) consistently outperformed a "Nearest Cluster" (Near-C) approach, confirming that the weighted blend of clusters is superior to simply picking the single closest one.

Limitations and Future Work

The authors acknowledge a few hurdles:

  • Computational Overhead: The initial clustering and the BBPL optimization phase require significant pre-computation compared to simple zero-shot prompting.
  • Hyperparameter Sensitivity: The system relies on a "Temperature" parameter ($T$) to control how much weight is given to distant clusters. The authors found $T=0.3$ to be optimal, but this might vary across different models or tasks.
  • Modality: Currently, the framework is text-only. The authors suggest that future work will involve extending CDW-CoT to multimodal tasks, such as image-text reasoning, where visual "clusters" could inform text-based reasoning chains.

Summary updated

Abstract

Large Language Models (LLMs) have recently achieved impressive results in complex reasoning tasks through Chain of Thought (CoT) prompting. However, most existing CoT methods rely on using the same prompts, whether manually designed or automatically generated, to handle the entire dataset. This one-size-fits-all approach may fail to meet the specific needs arising from the diversities within a single dataset. To solve this problem, we propose the Clustered Distance-Weighted Chain of Thought (CDW-CoT) method, which dynamically constructs prompts tailored to the characteristics of each data instance by integrating clustering and prompt optimization techniques. Our method employs clustering algorithms to categorize the dataset into distinct groups, from which a candidate pool of prompts is selected to reflect the inherent diversity within the dataset. For each cluster, CDW-CoT trains the optimal prompt probability distribution tailored to their specific characteristics. Finally, it dynamically constructs a unique prompt probability distribution for each test instance, based on its proximity to cluster centers, from which prompts are selected for reasoning. CDW-CoT consistently outperforms traditional CoT methods across six datasets, including commonsense, symbolic, and mathematical reasoning tasks. Specifically, when compared to manual CoT, CDW-CoT achieves an average accuracy improvement of 25.34% on LLaMA2 (13B) and 15.72% on LLaMA3 (8B).
BibTeX
@inproceedings{fang2025cdw,
  author = {Yuanheng Fang and Guoqing Chao and Wenqiang Lei and Shaobo Li and Dianhui Chu},
  title = {{CDW-CoT: Clustered Distance-Weighted Chain-of-Thoughts Reasoning}},
  booktitle = {AAAI Conference on Artificial Intelligence},
  year = {2025},
  url = {https://openreview.net/forum?id=3KiwVZp9Dm},
}

Loading related content...

Figure