A skeleton is a short, abstract description of a problem's structure (what is known, what is unknown, which concepts
or tools apply) that guides the model's reasoning without giving solution steps or the answer. In a multilingual setting,
skeleton-based reasoning involves three language choices: the query language ℓq, the skeleton language
ℓs, and the answer language ℓa used for both reasoning and the final answer. LASEF is a training-free
analysis framework (Figure 1) that varies only these languages while keeping the skeleton format fixed:
- Skeleton generation. From the query q(ℓq), the model generates a skeleton
s(ℓs) under one rule: describe what the problem structure is, never how to solve it. Skeletons average about
120 tokens regardless of language.
- Skeleton-guided reasoning. The model then produces the answer conditioned on the query and skeleton,
a^=f(q(ℓq),s(ℓs),ℓa), where f is the pre-trained LLM.
- Language configurations. For a target language ℓt, four baselines are compared:
target-language CoT (ℓt,−,ℓt), the same with an English skeleton (ℓt,en,ℓt),
English-pivot CoT on a Google-translated query (en,−,ℓt), and the same with an English skeleton
(en,en,ℓt). The study then replaces the English skeleton with Chinese, Spanish, Russian, Korean, and Thai
skeletons.
- Multi-level evaluation. Configurations are scored with exact match on samples whose answer is in the
target language, under greedy decoding and multi-rollout sampling (T = 0.7, N = 5), with a translation ablation
(English skeletons translated by GPT-5-mini, so content is fixed and only surface language varies) and cross-benchmark
checks on MSVAMP.
Experiments use Qwen2.5-7B/14B/72B-Instruct (Llama 3.1 results are in the paper's appendix) on MGSM (elementary
arithmetic), MATH-500 (intermediate), and PolyMath (advanced), with target languages ranging from high-resource (zh, es) to
low-resource (19 low-resource MGSM languages such as Kazakh, Uyghur, Basque, Maltese, and Lao).