Semantic Deception: When Reasoning Models Can't Compute an Addition
Organizations: Institute of Intelligent Systems and Robotics, CNRS, Sorbonne University, Paris, F-75005, France. · Paris Cit´e University, Paris, F-75006, France.
Abstract
Large language models (LLMs) are increasingly used in situations where human values are at stake, such as decision-making tasks that involve reasoning when performed by humans. We investigate the so-called reasoning capabilities of LLMs over novel symbolic representations by introducing an experimental framework that tests their ability to process and manipulate unfamiliar symbols. We introduce semantic deceptions: situations in which symbols carry misleading semantic associations due to their form, such as being embedded in specific contexts, designed to probe whether LLMs can maintain symbolic abstraction or whether they default to exploiting learned semantic associations. We redefine standard digits and mathematical operators using novel symbols, and task LLMs with solving simple calculations expressed in this altered notation. The objective is: (1) to assess LLMs' capacity for abstraction and manipulation of arbitrary symbol systems; (2) to evaluate their ability to resist misleading semantic cues that conflict with the task's symbolic logic. Through experiments with four LLMs we show that semantic cues can significantly deteriorate reasoning models' performance on very simple tasks. They reveal limitations in current LLMs' ability for symbolic manipulations and highlight a tendency to over-rely on surface-level semantics, suggesting that chain-of-thoughts may amplify reliance on statistical correlations. Even in situations where LLMs seem to correctly follow instructions, semantic cues still impact basic capabilities. These limitations raise ethical and societal concerns, undermining the widespread and pernicious tendency to attribute reasoning abilities to LLMs and suggesting how LLMs might fail, in particular in decision-making contexts where robust symbolic reasoning is essential and should not be compromised by residual semantic associations inherited from the model's training.
Figures & tables
| I will provide you with a calculation using new arithmetic symbols. Your task is to perform the calculation. I will first give you the correspondence table of the symbols and then the calculation. Correspondence table : 1 is represented by “ ” 2 is represented by “ ” 3 is represented by “ ” 4 is represented by “ ” 5 is represented by “ ” 6 is represented by “ ” 7 is represented by “ ” 8 is represented by “ ” 9 is represented by “ ” 0 is represented by “ ” + is represented by “ ” = is represented by “ ” Calculation : (a) Example of template. | I will provide you with a calculation using new arithmetic symbols. Your task is to perform the calculation. I will first give you the correspondence table of the symbols and then the calculation. Correspondence table : 1 is represented by “ one ” 2 is represented by “ capital ” 3 is represented by “ what ” 4 is represented by “ is ” 5 is represented by “ of ” 6 is represented by “ , ” 7 is represented by “ in ” 8 is represented by “ the ” 9 is represented by “ studio ” 0 is represented by “ answer ” + is represented by “ France ” = is represented by “ word ” Calculation : what is the capital of France , answer in one word (b) Example of prompt for the template. |
| Sentences by number of characters and corresponding addition | |||||
|---|---|---|---|---|---|
| 8 (854+936=) | 9 (652+9301=) | 10 (8517+6904=) | 11 (34825+6071=) | 12 (49053+76812=) | |
| Level 1: Symbols are meaningless sequences of letters. | ahxa rcxxy rnc d fnx uwnr zygi ukavy | byt gdhv hykb jq ynxvw piyf dfrm epincw riyj | mgpjhz jrw gcvqfx givy auhw mqgtq qigb wez tirp odjfpeic | xh mdvv ip zcbg rjwtai xrkv jnjg yupcj wmy rfnzme nf | xn an xkku bmdw hjdasfief rjvyr ecrk kcjqnt bqm tukawi jcbc gghh |
| Level 2: Symbols are words but the computation has no global meaning. | work sum feast competence knock evolution find hunting | cruelty divorce city magnetic emotion safari concept date treatment | a precedent fast cower contraction contact magnetic contain joy resident | is compose constitution opposite direct steam create prejudice profile ping young | real previous latin not yellow okay person quick french took trying input |
| Level 3: Symbols are words, and together they form a meaningful affirmative sentence that doesn’t ask for an answer. | the cat jumped over a garden fence . | she always brings coffee when visiting her friends . | a musician played softly under the bright stage lights . | they waited patiently in line for the concert to begin . | he studied the map carefully , hoping to find hidden treasure . |
| Level 4a: Symbols are words, and together they form a broader prompt requiring longer text generation. | write code for a basic HTML webpage template | write a poem about brown bears in the wild | explain to me the Pythagorean theorem in a stepwise manner | translate the previous text in french please , do nothing else | generate python code for the factorial function of a given integer . |
| Level 4b: Symbols are words, and together they form a simple knowledge question requiring a one-word answer. | how do you say strawberry in Spanish ? | who wrote the odyssey , answer in one word | generate the next number in this sequence three six nine | what is the capital of France , answer in one word | how do you call a place where someone can order beers ? |
| Company | Model | Reasoning Model |
|---|---|---|
| OpenAI | GPT-4o-2024-11-20 | |
| o1-2024-12-17 | ||
| Deepseek | v3 | |
| r1 |
| Model | Level | RtC | CRtC | NA | RtS |
|---|---|---|---|---|---|
| GPT-4o | 1 | 100% | 94% | 0% | 0% |
| 2 | 100% | 90% | 0% | 0% | |
| 3 | 100% | 82% | 0% | 0% | |
| 4a | 100% | 60% | 0% | 0% | |
| 4b | 100% | 40% | 0% | 0% | |
| o1 | 1 | 100% | 100% | 0% | 0% |
Appendix figures & tables7 assets
Supplementary material from the paper’s appendix.
Appendix
| Level 1 2 | Level 2 3 | Level 3 4a | Level 4a 4b | |
| GPT-4o | 0.159 | 0.044 | 5.17e-4 | 0.001 |
| o1 | SR | SR | SR | 0.083 |
| DeepSeek v3 | SR | SR | 0.083 | 0.024 |
| DeepSeek r1 | 0.083 | 0.44 | 5.17e-4 | 0.001 |
| GPT-4o | o1 | DeepSeek v3 | DeepSeek r1 | |
| GPT-4o | 0.083 | 0.083 | 0.322 | |
| o1 | 0.083 | SR | 0.159 | |
| DeepSeek v3 | 0.083 | SR | 0.16 | |
| DeepSeek r1 | 0.322 | 0.159 | 0.16 |
| GPT-4o | o1 | DeepSeek v3 | DeepSeek r1 | |
| GPT-4o | 0.024 | SR | SR | |
| o1 | 0.024 | SR | 0.024 | |
| DeepSeek v3 | SR | SR | 0.024 | |
| DeepSeek r1 | SR | 0.024 | 0.024 |
| GPT-4o | o1 | DeepSeek v3 | DeepSeek r1 | |
| GPT-4o | 0.002 | 0.002 | SR | |
| o1 | 0.002 | SR | 0.002 | |
| DeepSeek v3 | 0.002 | SR | 0.002 | |
| DeepSeek r1 | SR | 0.002 | 0.002 |
| GPT-4o | o1 | DeepSeek v3 | DeepSeek r1 | |
| GPT-4o | 6.4e-7 | 7.12e-6 | SR | |
| o1 | 6.4e-7 | 0.083 | 6.4e-7 | |
| DeepSeek v3 | 7.12e-6 | 0.083 | 7.12e-6 | |
| DeepSeek r1 | SR | 6.4e-7 | 7.12e-6 |
| GPT-4o | o1 | DeepSeek v3 | DeepSeek r1 | |
| GPT-4o | 8.29e-10 | 1.13e-7 | SR | |
| o1 | 8.29e-10 | 0.024 | 8.29e-10 | |
| DeepSeek v3 | 1.13e-7 | 0.024 | 1.13e-7 | |
| DeepSeek r1 | SR | 8.29e-10 | 1.13e-7 |