Metacognitive Capabilities of LLMs: An Exploration in Mathematical Problem Solving
Metacognitive knowledge refers to humans’ intuitive knowledge of their own thinking and reasoning processes. Today’s best LLMs clearly possess some reasoning processes. The paper gives evidence that they also have metacognitive knowledge, including ability to name skills and procedures to apply given a task. We explore this primarily in context of math reasoning, developing a prompt-guided interaction procedure to get a powerful LLM to assign sensible skill labels to math questions, followed by having it perform semantic clustering to obtain coarser families of skill labels. These coarse skill labels look interpretable to humans.
core concept in human pedagogy is Metacognition [18], sometimes described as thinking about thinking. It refers to the ability to reason about one’s own cognitive processes as well as about learning-relevant properties of information or data. Metacognitive Knowledge refers to the learner’s accumulated knowledge of this type. Pedagogy research shows that improving learners’ metacognitive knowledge can improve their capabilities, for example on math [19, 20]. The current paper raises the question “Do LLMs also have metacognitive knowledge?” And if yes, “Can we bootstrap such knowledge to further improve LLM capabilities?”
Our automated approach for the discovery of skills utilizes state-of-the-art LLMs to identify their own catalog of math skills and then organize datasets using that catalog. Stage 1 of our methodology involves instructing the powerful LLM to assign skill labels to each example within a given dataset. Usually this results in fine-grained skills, and too many skill labels to be useful. In Stage 2, the same LLM is asked to perform semantic clustering on the labeled data, grouping examples by the similarity of their underlying skills (as perceived by the LLM). Each resulting cluster represents a more coarse-grained skill that is applicable to a larger set of examples. Our method retains only these coarse skills as well as their LLM-assigned label. (To give an example, for the MATH dataset, Stage 1 identified approximately 5000 skills, which Stage 2 reduced to 117 coarse skills.) A random subset of examples representing the coarse skills are retained as its skill exemplars. (See Figure 1 and Appendix 8).
Lines of inquiry this paper opens 24
Research framings built by reading the notes related to this paper — the questions it feeds into.
Why do vector embeddings fail to distinguish task relevance from semantic similarity?- How do embedding dimension limits constrain what concept models can represent?
- What mathematical limits constrain embedding-based retrieval systems?
- Do multi-vector or cross-encoder models escape these dimensional constraints?
- Can neural networks represent symbolic structures without explicit mechanisms?
- Does the linear representation hypothesis reflect networks or reflect our analysis tools?
- How does syntactic encoding relate to semantic feature representation?
- How does the distance between natural language and formal notation affect translation accuracy?
- Do language models encode deep syntactic structure or only surface-level patterns?
- Why do language models reproduce human EPA structure despite different architecture?
- What compression explains why syntax fits in low-dimensional subspaces?
- What other semantic relations benefit from explicit surface markers in text?
- How do functional features differ from representational abstract features?
- How should meaning spaces be systematically modeled across different applications?
- Can representation engineering cleanly isolate single features in entangled semantic space?
- What makes linear decodability a reliable signal of compositionality?
- Can scaling alone create compositional generalization without explicit binding mechanisms?