Multiplication in Multimodal LLMs: Computation with Text, Image, and Audio Inputs

[PDF] [Leaderboard] [Video]
[Slides] [Code] [Data] [.mp3] [.bib]

Authors: Samuel G. Balter | Ethan Jerzak | Connor T. Jerzak

This paper introduces a controlled benchmark for testing whether multimodal large language models can perform exact multi-digit multiplication when the same arithmetic problem is presented as text, rendered images, or audio. The central finding is that models often perceive the numbers correctly but fail as arithmetic load increases, suggesting that multimodal multiplication failures are primarily computational rather than perceptual.

TL;DR: The benchmark pairs 10,000 multiplication problems across modalities, defines an interpretable arithmetic-load score, and shows that model accuracy drops systematically as digit structure becomes more computationally demanding, with the slope of this decline varying by modality (with numerical text yielding superior performance compared to audio or visual inputs).

What does this paper contribute to multimodal LLM evaluation?

The paper contributes a reproducible multimodal multiplication benchmark and a set of interpretability probes for measuring arithmetic failure in large language models. Unlike broad math benchmarks, this benchmark holds the underlying multiplication problem fixed while varying digit length, digit sparsity, representation, and modality.

  • Controlled multimodal benchmark: The same multiplication instances are rendered as numeric text, number words, images, and audio where supported.
  • Arithmetic-load measure: The paper defines C = total digits × non-zero digits as an interpretable proxy for operation count.
  • Perception-versus-computation decomposition: Perception checks exceed 99% accuracy across modalities, while multiplication accuracy drops substantially.
  • Heuristic fingerprinting: Forced-completion loss probes compare columnar multiplication, distributive decomposition, and rounding-compensation strategies.
  • Adapter-geometry analysis: Heuristic-specific LoRA adapters reveal separated update directions but generally degrade arithmetic accuracy.

How is the multimodal multiplication benchmark designed?

The benchmark uses paired multiplication problems so that modality effects can be measured without changing the arithmetic task. It factorially varies digit length, non-zero digit count, representation, and modality to isolate whether errors come from perception, representation, or computation.

Benchmark and probe dataset summary
ComponentValueWhy it matters
Paired multimodal multiplication instances10,000Supports direct text, image, and audio comparisons on the same arithmetic problems.
Heuristic-Disagreement Set1,000 problemsTests cases where different multiplication strategies make competing predictions.
Held-out probe split144 problemsUsed for reported Qwen3-VL strategy-fingerprinting results.
Probe split target composition49 RC / 44 DD / 51 OTBalances rounding-compensation, decomposition, and columnar-style target families.
Train / validation / test split70 / 15 / 15Prevents probe and LoRA results from relying on overlapping evaluation items.
Adversarial traps30 problemsStress-tests misleading surface cues such as tempting but unreliable rounding.
Mean arithmetic load on probe splitC = 177.4Summarizes the structural arithmetic difficulty of the held-out probe items.

What is arithmetic load in this paper?

Arithmetic load is the paper’s compact difficulty measure for multiplication problems. It is defined as C = d_total × d_non-zero, where d_total is the total number of digits across both operands and d_non-zero is the number of non-zero digits.

Example: For 47 × 36, the total digit count is 4 and the non-zero digit count is 4, so C = 16. The paper reports that this simple load score remains predictive across modalities and models, with reported R² ≈ 0.50–0.67.

What are the key results across text and image inputs?

Accuracy falls as arithmetic load increases, and non-text inputs often degrade earlier than clean numeric text. On the held-out HDS probe split, Qwen3-VL-235B performs better than Qwen3-VL-30B, but both models show a measurable drop from text to image inputs.

Held-out HDS probe accuracy for Qwen3-VL models at C ≈ 177
ModelText accuracyImage accuracyInterpretation
Qwen3-VL-30B-A3B49.3% ± 4.2%46.5% ± 4.2%Image presentation slightly reduces accuracy on matched held-out items.
Qwen3-VL-235B-A22B57.6% ± 4.1%53.5% ± 4.2%The larger model improves accuracy but still shows multimodal degradation.

Which multiplication strategy do the models prefer?

The forced-completion loss probe finds that distributive decomposition is the most compatible strategy for both Qwen3-VL model sizes. This preference appears in text and image inputs, although image presentation changes the margins between heuristic continuations.

Lowest-loss heuristic pattern on the held-out HDS probe split
ModelDD detection in textDD detection in imageOT detection in textRC detection in text
Qwen3-VL-30B-A3B68.2% ± 7.0%90.9% ± 4.3%23.5% ± 5.9%14.3% ± 5.0%
Qwen3-VL-235B-A22B93.2% ± 3.8%100.0% ± 0.0%0.0% ± 0.0%0.0% ± 0.0%

A contrastive step probe further confirms that the models usually prefer correct intermediate arithmetic steps over matched incorrect ones. Correct-step preference is 100.0% for both models in text, 97.9% ± 1.2% for Qwen3-VL-30B in image, and 100.0% for Qwen3-VL-235B in image.

Do heuristic-specific LoRA adapters improve multiplication?

Heuristic-specific LoRA adapters change model behavior but usually do not improve arithmetic accuracy. Across held-out comparisons, degradations strongly outnumber improvements, suggesting that the base model’s native strategy routing is more reliable than forcing a single synthetic reasoning style.

LoRA nudge results on held-out HDS problems
ModelComparisonsBehavioral flipsImproved casesDegraded casesHeuristic flips
Qwen3-VL-30B-A3B4321141113313
Qwen3-VL-235B-A22B4321214117291

The adapter-geometry analysis shows that heuristic updates are separated in parameter space. Effective-update cosine similarities are low: 0.0726–0.1247 for Qwen3-VL-30B and 0.0342–0.0586 for Qwen3-VL-235B across the DD, OT, and RC heuristic adapters.

Why does this contribution matter for multimodal AI systems?

The results show that exact arithmetic remains fragile even when multimodal models correctly perceive the input. This matters for real workflows involving screenshots, spreadsheets, slides, scanned documents, spoken prompts, and tool-using agents that must preserve mathematical structure before calling calculators or verifying results.

The benchmark separates three issues that are often entangled in math evaluation: recognizing the input, choosing a computation strategy, and executing exact arithmetic. That separation makes the benchmark useful for diagnosing whether future multimodal systems fail because they misread the problem or because they cannot reliably perform the computation.

Where is the multimodal multiplication benchmark available?

The benchmark data are available as paired text, image, and audio renderings of multiplication items. Access the MultimodalMathBenchmarks dataset on Hugging Face .

FAQ: Multimodal multiplication in LLMs

What problem does this paper study?

It studies exact multi-digit multiplication in multimodal LLMs, comparing performance when the same arithmetic problem is shown as text, rendered image, or audio.

What is the main benchmark contribution?

The paper introduces a controlled benchmark of 10,000 paired multiplication problems that vary digit length, digit sparsity, representation, and modality.

What is arithmetic load?

Arithmetic load is C = total digits × non-zero digits. It is an interpretable proxy for the number of primitive operations needed to solve a multiplication problem.

Do multimodal models fail because they misread the numbers?

The paper finds that perception checks are near-perfect, exceeding 99% accuracy across modalities, even when multiplication accuracy drops. This indicates that many failures are computational rather than perceptual.

Which heuristic does the forced-completion probe identify most often?

Distributive decomposition is the dominant low-loss heuristic for both Qwen3-VL-30B and Qwen3-VL-235B across text and image inputs.

Do LoRA adapters improve arithmetic performance?

Not in these experiments. Heuristic-specific LoRA adapters change reasoning behavior, but degraded cases greatly outnumber improved cases on held-out multiplication problems.

–

Multimodal Model Leaderboard

Results across models and modalities are depicted below. Higher beta_0 indicates stronger baseline performance; higher (less negative) beta_1 indicates slower degradation as arithmetic load increases; the R-squared column indicates the fraction of outcome variability explained by the fit. 50% C indicates the load at which predicted accuracy is reduced to 50% (higher is better).

Model Modality beta_0 beta_1 C_50_percent R_squared
google-gemini-2.5-flash numerical 6.7901 -0.1271 53.4081 0.5823
google-gemini-2.5-flash alphabetic 6.8299 -0.1299 52.571 0.5944
google-gemini-2.5-flash image-numerical 6.4986 -0.123 52.854 0.5785
google-gemini-2.5-flash image-alphabetic 6.5135 -0.1238 52.6159 0.571
google-gemini-2.5-flash audio 6.7319 -0.1246 54.0088 0.5857
qwen-qwen3-vl-30b-a3b-instruct numerical 5.9834 -0.1167 51.2903 0.556
qwen-qwen3-vl-30b-a3b-instruct alphabetic 6.3232 -0.1273 49.6883 0.5604
qwen-qwen3-vl-30b-a3b-instruct image-numerical 5.9858 -0.1203 49.7559 0.5364
qwen-qwen3-vl-30b-a3b-instruct image-alphabetic 6.375 -0.1286 49.5609 0.5884
qwen-qwen3-vl-235b-a22b-instruct numerical 7.011 -0.0945 74.179 0.3812
qwen-qwen3-vl-235b-a22b-instruct alphabetic 7.0143 -0.0942 74.454 0.3693
qwen-qwen3-vl-235b-a22b-instruct image-numerical 6.6806 -0.0889 75.1491 0.3451
qwen-qwen3-vl-235b-a22b-instruct image-alphabetic 6.9417 -0.0934 74.3443 0.3753
openai-gpt-5.4 numerical 11.0759 -0.1614 68.6056 0.6405
openai-gpt-5.4 alphabetic 11.217 -0.1651 67.9324 0.6565
openai-gpt-5.4 image-numerical 10.522 -0.1572 66.918 0.6212
openai-gpt-5.4 image-alphabetic 6.4656 -0.1067 60.6038 0.6182
openai-gpt-4o numerical 7.4068 -0.1398 52.9859 0.632
openai-gpt-4o alphabetic 8.5268 -0.1611 52.9296 0.6883
openai-gpt-4o image-numerical 6.921 -0.1341 51.6105 0.6438
openai-gpt-4o image-alphabetic 7.1114 -0.1356 52.4258 0.6301
openai-gpt-4o-audio-preview audio 7.3132 -0.1378 53.0738 0.6208
x-ai-grok-4.20 numerical 8.1114 -0.116 69.9351 0.5236
x-ai-grok-4.20 alphabetic 8.0283 -0.123 65.2729 0.5024
x-ai-grok-4.20 image-numerical 5.5582 -0.0898 61.8681 0.5078
x-ai-grok-4.20 image-alphabetic 4.4572 -0.0877 50.8375 0.4071

Figures

References

Samuel Balter, Ethan Jerzak, Connor T. Jerzak. Multiplication in Multimodal LLMs: Computation with Text, Image, and Audio Inputs. Findings of the Association for Computational Linguistics (ACL), 2026
[PDF] [BibTeX]
[Overview] [Data] [>]

Related Work

Nicolas Audinet de Pieuchon, Adel Daoud, Connor T. Jerzak, Moa Johansson, Richard Johansson. Benchmarking Debiasing Methods for LLM-based Parameter Estimates. Proceedings of the 2025 Conference on Empirical Methods in Natural Language Processing (EMNLP), 2025.
[PDF] [BibTeX]
[Overview] [Video] [Data] [>]

Satiyabooshan Murugaboopathy, Connor T. Jerzak, Adel Daoud. Platonic Representations for Poverty Mapping: Unified Vision-Language Codes or Agent-Induced Novelty? Proceedings of the 7th International Conference on Social Computing (ICSC 2026), of Communications in Computer and Information Science, Springer Nature, 2026.
[PDF] [BibTeX]
[Overview] [Video] [Data]

Brian Libgober, Connor T. Jerzak. Linking Datasets on Organizations Using Half-a-Billion Open-Collaborated Records. Political Science Research and Methods: 1-20, 2024.
[PDF] [BibTeX]
[Overview] [Data] [Code] [>]

Connor T. Jerzak, Gary King, Anton Strezhnev. An Improved Method of Automated Nonparametric Content Analysis for Social Science. Political Analysis, 31(1): 42-58, 2023.
[PDF] [BibTeX]
[Overview] [Data] [Code] [>]

Adel Daoud, Connor T. Jerzak, Richard Johansson. Conceptualizing Treatment Leakage in Text-based Causal Inference. Proceedings of the Annual Conference of the North American Chapter of the Association for Computational Linguistics (NAACL): 5638-5645, 2022.
[PDF] [BibTeX]
[Overview] [Video] [>]

Nicolas Audinet de Pieuchon, Adel Daoud, Connor T. Jerzak, Moa Johansson, Richard Johansson. Can Large Language Models (or Humans) Disentangle Text? Proceedings of the Sixth Workshop on Natural Language Processing and Computational Social Science (NLP+ CSS 2024): 57-67, 2024.
[PDF] [BibTeX]
[Overview] [Data] [Code] [>]