Pith. sign in

REVIEW 14 cited by

LLMs for Mathematical Modeling: Towards Bridging the Gap between Natural and Mathematical Languages

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2405.13144 v3 pith:247BW4ZV submitted 2024-05-21 cs.AI cs.CL

LLMs for Mathematical Modeling: Towards Bridging the Gap between Natural and Mathematical Languages

classification cs.AI cs.CL
keywords mathematicalmodelsllmsmodelinglanguagenaturalabilitychallenging
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
Share X Bluesky LinkedIn Reddit HN
read the original abstract

Large Language Models (LLMs) have demonstrated strong performance across various natural language processing tasks, yet their proficiency in mathematical reasoning remains a key challenge. Addressing the gap between natural and mathematical language requires advanced reasoning capabilities, approaching those of Artificial General Intelligence (AGI). However, the evaluation remains challenging, as perfectly representing reality is inherently elusive, and traditional methods like manual or direct comparison of mathematical statements (Ramamonjison et al., 2023) are insufficient for assessing true modeling ability. We propose a process-oriented framework to evaluate LLMs' ability to construct mathematical models, using solvers to compare outputs with ground truth. Introducing Mamo, a benchmark with 1,209 questions covering ordinary differential equations, linear programming, and mixed-integer linear programming, we enable automatic evaluation of modeling accuracy. The results show that existing LLMs struggle with complex mathematical modeling tasks, with larger models demonstrating superior performance, while open-source models remain competitive in simpler cases but still fall short of proprietary models in more challenging problems.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 14 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Falsification-Based Verification of LLM-Generated Optimization Models: Sound Test Batteries and Their Detection Limits

    cs.SE 2026-07 conditional novelty 8.0

    A sound, threshold-free battery of optimization-theoretic tests can catch unfaithful LLM-generated MILP models while never flagging faithful ones, and provably cannot catch certain error classes.

  2. OR-Space: A Full-Lifecycle Workspace Benchmark for Industrial Optimization Agents

    cs.AI 2026-05 unverdicted novelty 7.0

    OR-Space is a benchmark for LLM agents performing full-lifecycle optimization tasks across Build, Revise, and Explain modes in executable multi-artifact workspaces.

  3. PEARL: Solver-in-the-Loop Interactive Optimization Modeling from Natural Language

    cs.AI 2026-05 reject novelty 7.0

    Training an LLM as a multi-turn agent that runs and repairs solver code raises verified optimization solve rates, with the 4B PEARL model outperforming DeepSeek-V3.2-685B in aggregate.

  4. Co-evolving Agent Architectures and Interpretable Reasoning for Automated Optimization

    cs.AI 2026-04 conditional novelty 7.0

    DeInfer reduces parallel inference communication cost for decomposed LLMs by up to 78% by moving collective operations into the low-rank latent space and redesigning KV-cache reconstruction for static graph compatibility.

  5. ReLoop: Structured Modeling and Behavioral Verification for Reliable LLM-Based Optimization

    cs.SE 2026-02 unverdicted novelty 7.0

    ReLoop closes the feasibility-correctness gap in LLM optimization code via structured generation and behavioral verification with parameter perturbations, reaching 100% executability and accuracy gains on benchmarks w...

  6. SciML Agents: Write the Solver, Not the Solution

    cs.LG 2025-09 unverdicted novelty 7.0

    LLMs prompted with domain knowledge can generate runnable, numerically valid code for stiff and non-stiff ODEs on new diagnostic and 1000-task benchmarks.

  7. PARM: Pipeline-Adapted Reward Model

    cs.AI 2026-04 unverdicted novelty 6.0

    PARM adapts reward models to multi-stage LLM pipelines via pipeline data and direct preference optimization, improving execution rate and solving accuracy on optimization benchmarks and showing transfer to GSM8K.

  8. Co-evolving Agent Architectures and Interpretable Reasoning for Automated Optimization

    cs.AI 2026-04 unverdicted novelty 6.0

    EvoOR-Agent co-evolves agent architectures as AOE-style networks with graph-mediated recombination and knowledge-base-assisted mutation to outperform fixed LLM pipelines on OR benchmarks.

  9. AutoOR: Scalably Post-training LLMs to Autoformalize Operations Research Problems

    cs.LG 2026-04 unverdicted novelty 6.0

    AutoOR uses synthetic data generation and RL post-training with solver feedback to enable 8B LLMs to autoformalize linear, mixed-integer, and non-linear OR problems, matching larger models on benchmarks.

  10. SAC-Opt: Semantic Anchors for Iterative Correction in Optimization Modeling

    cs.AI 2025-09 conditional novelty 6.0

    A semantic-anchor alignment loop that reconstructs and verifies constraints from generated solver code lifts average modeling accuracy by 7.8 percentage points over seven datasets.

  11. SLAI T-Rex: Full-Parameter Post-training of the DeepSeek-V4 Family on Ascend SuperPOD

    cs.CL 2026-07 conditional novelty 5.0

    An Ascend-NPU training stack reaches 34.22% MFU on DeepSeek-V4-Pro, and a solver-verified CPT+SFT recipe raises OR benchmark averages to 71.81% (Flash) and 77.33% (Pro).

  12. Uncertainty-Aware Simulation-Based Inference for Operations Research with Large Language Models

    cs.LG 2026-07 conditional novelty 5.0

    Lookahead resampling with entropy- and power-based rewards steers LLM decoding toward OR formulations whose short simulated continuations are most concentrated, giving reported pass@1 gains not yet separated from adde...

  13. Opt-Verifier: Unleashing the Power of LLMs for Optimization Modeling via Dual-Side Verification

    cs.AI 2026-05 unverdicted novelty 5.0

    Opt-Verifier adds structure-side and solution-side verification to LLM-generated optimization models and reports over 20% accuracy gains on standard benchmarks.

  14. A Systematic Survey on Large Language Models for Evolutionary Optimization: From Modeling to Solving

    cs.NE 2025-09 conditional novelty 4.0

    A literature survey that classifies LLM-based optimization research into modeling and solving, with solving divided into LLMs as optimizers, low-level components, and high-level managers.