MetroLLM-Bench: Evaluating Language Models as Transit Kiosk Runtimes

Remco Hendriks

Continker

Published September 9, 2026 · on the feed September 11, 2026 · ▲ 28 · arXiv 2609.10016

The abstract

We introduce MetroLLM-Bench, a 955-case benchmark for testing language models as the policy layer of a transit kiosk. It covers six real metro systems, ranging from 37 to 414 stations, and eleven categories that include routing, fare calculation, disruptions, accessibility, and adversarial input. In each case, the model must call structured tools and submit a machine-renderable terminal state containing an outcome, a per-ticket fare quote when applicable, and a kiosk action. Fourteen deterministic scoring components form Tier 1; eight semantic-quality components form Tier 2, six of which use a language-model judge. We report Tier 1 and the combined score of both tiers. A stratified 75/25 split reserves 717 cases for training-data generation and 238 for held-out evaluation. We evaluate twenty-six models from six vendors, of which twenty-three are ranked. On the held-out partition, a 4B Qwen 3.5 student trained through parameter-efficient fine-tuning (PEFT) exceeds both GPT-5.6 tiers on Tier 1 (91.3 against 90.6 and 90.0) and matches GPT-5.4 full at maximum reasoning effort (91.4), with a 2.6 GB Q4_K_M footprint. Larger 9B and 27B students provide no further Tier 1 improvement over the 4B student at this training scale. Across the four Qwen sizes, the PEFT gain over the corresponding base model decreases from +7.03 points at 2B (three training seeds) to -0.91 at 27B; every seed shows the same direction at every size. A deterministic rule-based baseline reaches 84.6 on Tier 1, with the remaining language-model advantage concentrated in policy adaptation, compound scenarios, accessibility, and temporal reasoning. Muse Glimmer 30B leads the composite ranking, and serving configuration alone moves the Qwen 3.5-to-3.8 comparison by 2.7 Tier 1 points. The benchmark, harness, reproduction guide, and fine-tuned students are released at https://github.com/continker/metrollm-bench.

The Brief

3:20

A short podcast summary of the paper. Written and voiced by AI.

Transcript

MetroLLM-Bench. Evaluating Language Models as Transit Kiosk Runtimes. By Remco Hendriks, from Continker. Published on the ninth of September. Its code repository is worked out: about sixty source files, with a readme and a licence.

A transit kiosk has to do more than chat. It has to route a passenger, quote a fare, handle disruptions and accessibility needs, and refuse adversarial input, then end in an action the machine can actually carry out. MetroLLM-Bench asks whether a language model can serve as the policy layer of such a kiosk: the part that decides what the kiosk does.

The benchmark has nine hundred and fifty-five cases. They cover six real metro systems, ranging from thirty-seven stations to four hundred and fourteen, and eleven categories, among them routing, fare calculation, disruptions, accessibility, and adversarial input. In every case the model must call structured tools and then submit a terminal state that a machine can render. That state holds an outcome, a fare quote for each ticket where one applies, and a kiosk action.

Scoring comes in two tiers. Tier one is fourteen deterministic scoring components. Tier two is eight components of semantic quality, six of which rely on a language-model judge. Results are reported for Tier one alone and for the two tiers combined.

The cases are split, stratified, seventy-five to twenty-five. Seven hundred and seventeen cases are reserved for generating training data. Two hundred and thirty-eight are held out for evaluation. That split lets the benchmark ask not only how models score, but how far a small model can be trained toward the task.

Twenty-six models from six vendors were evaluated, and twenty-three of them are ranked. On the held-out partition, a Qwen 3.5 student with four billion parameters, trained through parameter-efficient fine-tuning, or PEFT, scores ninety-one point three on Tier one. That exceeds both GPT-5.6 tiers, at ninety point six and ninety point zero, and matches GPT-5.4 full at maximum reasoning effort, which scores ninety-one point four. The student's footprint is two point six gigabytes.

Bigger students did not help at this training scale: nine billion and twenty-seven billion parameter students give no further Tier one gain over the four billion one. Across four Qwen sizes, the PEFT gain over each base model shrinks with size, from seven point zero three points at two billion parameters to minus zero point nine one at twenty-seven billion. Every seed shows the same direction at every size.

A deterministic, rule-based baseline reaches eighty-four point six on Tier one. What advantage the language models keep is concentrated in policy adaptation, compound scenarios, accessibility, and temporal reasoning. Muse Glimmer 30B leads the composite ranking. And serving configuration alone moves the comparison between Qwen 3.5 and Qwen 3.8 by two point seven Tier one points.

The benchmark, the harness, a reproduction guide and the fine-tuned students are all released. Taken together, the results locate where a language model earns its place in a kiosk. Much of the job can be done by rules, and much of the rest by a small fine-tuned model. The remaining margin lives in the cases where policy must adapt, scenarios compound, or time matters, and even a change in serving configuration is large enough to reorder the comparison.

Paper Quest · 7 chapters · about 40 min

Play this paper

Learn it by doing: make the calls the authors made, guess the result before you see it, and defend it in a viva graded on your own words. Chapter 1 is right here.

Chapter 1 🧩 · The problem

A ticket machine cannot afford a creative answer. Can a language model still run one?

You run the software for metro ticket machines. Fare rules, routes and disruption responses are hard-coded, so every station closure or new fare bracket means a developer ticket, a patch, tests and a release window.

The road ahead

  1. 1 · The problem ~7 min Kiosk rules live in code, so every change costs a release, and nobody yet knows how to tell whether a language model could safely decide instead.
  2. 2 · What came before ~3 min
  3. 3 · The key idea ~8 min Make the model end each case in a checkable kiosk state, score it in two tiers, and reuse the program-checked tier to train small models.
  4. 4 · Choose your own research ~3 min
  5. 5 · Build the method ~8 min Freeze a train and held-out split, train a small Qwen student on the training cases, then run and score it on held-out cases.
  6. 6 · The experiment ~6 min You’ll guess: On held-out Tier 1, how did the 4B Qwen 3.5 PEFT student compare with both GPT-5.6 tiers?
  7. 7 · The viva ~5 min Three questions from the examiners, answered in your own words. Win it for the paper’s trophy.
Join free to play the whole quest ›

Free, with Google or an email address. Your stars and progress are kept.

KipQuest: the day’s AI research, as podcasts and quests. All papers Android app Privacy Contact Episodes are written and voiced by AI from each paper. Summaries can contain mistakes: the paper is the source.