arXiv paper· computer vision (document analysis and recognition)· method paper

PA-CDM: Position-Aware Character Detection Matching for Evaluating Handwritten Mathematical Expression Recognition

Shiliang Luo

cs.CV · cs.CL · cs.LG

Quick verdict

Well-built position-aware CDM metric for HMER evaluation; human correlation ρ=0.9535, claims carefully scoped; OOD advantage over TED not established.

Summary

The paper targets evaluation of handwritten mathematical expression recognition (HMER), arguing that exact-match and string-similarity metrics are blind to error location while tree-edit metrics are hostage to parser normalization coverage. It proposes PA-CDM, which augments render-based character detection matching (CDM) with a position-forest encoding of LaTeX structure, entity alignment, and divergence-level weighting that penalizes position-vetoed matches by structural depth. It also releases StructPerturb v2.0, a hash-frozen benchmark of 1,340 controlled perturbation pairs across 15 type-intensity cells, and a cross-metric protocol combining a seven-metric sensitivity matrix, a six-annotator human study (1,008 stratified pairs, Krippendorff's alpha = 0.9693), and calibration of a Kimi-K3 LLM judge. PA-CDM attains the highest human correlation among seven automatic metrics (Spearman rho = 0.9535, n = 990), slightly below the LLM judge (rho = 0.9613), which is costlier, nondeterministic, and API-dependent. The CDM-PA-CDM gap widens monotonically with perturbation intensity (frac swap 0.2342 to 0.4472). Limitations: strictness over CDM holds only at the mean level (per-pair inversions up to +0.1489 on UniMER-Test); on the OOD UniMER group TED leads (0.7999 vs 0.7748) as 294/799 pairs fall back to pure CDM; two nested-move cells are tiny (n=36, n=4); 43% of re-verified equiv left-right pairs remain visually non-equivalent; the GRPO reward study is only in progress.

Review complete

Assessment at a glance

computer vision (document analysis and recognition)

5

risk flags identified

● high 0

● medium 2

● low 3

Reproducibility readinessmedium
Code & data availableyes
Review confidencehigh
Deep research viableCode-reproducible

5 strengths · 5 weaknesses · 5 author questions

Levels reflect verification complexity — not a quality score. Evolve never rates your paper.

Key claims under review

  • PA-CDM attains the highest correlation with human judgments among seven automatic HMER metrics (Spearman rho = 0.9535, n = 990), within 0.0078 of a frontier LLM judge (rho = 0.9613) at zero marginal cost with deterministic, diagnosable behavior.
  • Render-based CDM is position-blind: on frozen fraction-operand-swap perturbations it scores 0.8595 versus 0.6253 for position-aware scoring, and the CDM-PA-CDM gap widens monotonically with intensity (0.2342/0.2999/0.4472 at L1-L3).
  • Tree-edit metrics penalize semantically equivalent rewrites outside their parser's normalization coverage: TED scores 0.8552 where CDM, PA-CDM, and IMS all score 1.0 on the over-rewrite cell.
  • PA-CDM is harsher than CDM only at the mean level; per-pair inversions occur (2/985 CROHME 2014, 33/799 UniMER-Test at max +0.1489, one frozen cell) and are disclosed.
  • LLM judges, though the strongest human correlate measured, are disqualified as default metrics by cost (~7.09M tokens, CNY 202.46 per run), nondeterminism, and API dependence, and are best reserved for periodic audits.

Strengths

  • Exact CDM reproduction grounds every CDM-relative claim

    Section II reports zero maximum absolute difference in per-sample F1, recall, and precision versus the official CDM implementation over 985 shared CROHME 2014 samples, and with wa=0 and structural checks disabled the scorer reproduces CDM score-for-score — the paper's central comparisons rest on an auditable substrate.

  • Frozen, deterministic benchmark with full provenance

    StructPerturb v2.0 (Section III) is hash-frozen with per-cell SHA-256, generator commit, and seed 20260824; regeneration reproduces every file byte-for-byte, and each perturbation traces back to the exact sites touched.

  • Pre-registered bars and published negative results

  • Claims scoped against their own counter-evidence

  • Judge calibration goes beyond a correlation number

Weaknesses

  • Structural advantage collapses out of distribution

  • Two of 15 benchmark cells are statistically hollow

  • Equivalence left-right cell partly fails its own premise

  • Headline ranking lacks between-metric significance testing

  • Central use case validated only by promise

Full Review Report

$1.99 · one-time

Unlock the complete preliminary analysis Evolve produced for this paper.

Report preview

Scope & Claims

This is a measurement paper, not a recognition model: it asks how handwritten mathematical expression recognition (HMER) systems should be scored. It delivers three artifacts. (1) **PA-CDM** (Section II): a position-aware extension of render-based CDM that encodes each formula as a position forest (role-path identifiers via pylatexenc), aligns entity and rendering token streams, and adds a third elimination pass — matched pairs with differing identifiers are position-vetoed and re-weighted by divergence depth (Eq. 1, p = 2 from a grid over {0,1,2}; structural cost weight wa = 0.5). (2) **StructPerturb v2.0** (Section III): a frozen benchmark of 1,340 controlled perturbation pairs across 15 type-intensity cells, hash-manifested under seed 20260824. (3) **A cross-metric consistency protocol** (Sections III-V): a seven-metric sensitivity matrix, a six-annotator human study, and an LLM-judge calibration. Headline results: Spearman rho = 0.9535 against human scores (n = 990), highest among seven automatic metrics and within 0.0078 of the Kimi-K3 judge (rho = 0.9613); the CDM-PA-CDM gap widens monotonically with perturbation intensity.

The remaining sections cover Methodology Assessment, Statistical Evidence, Results & Reproducibility, Limitations & Risks, and Verdict & Recommendations.

  • All 5 strengths & 5 weaknesses, analyzed in detail
  • 5 risk flags with severity, section & reviewer questions
  • Methods & statistical evidence assessment
  • 5 questions a peer reviewer would ask
  • Full six-dimension evaluation report & recommendations

One-time purchase · this paper only

One-time purchase, this paper only. AI-generated preliminary analysis — not peer review.

Frequently asked questions

What is PA-CDM?

PA-CDM (Position-Aware Character Detection Matching) is an evaluation metric for handwritten mathematical expression recognition. It builds on the render-based CDM metric — which renders predicted and reference LaTeX, detects character boxes, and matches them — but additionally encodes each formula's structure as a position forest. Glyph matches whose structural identifiers differ are vetoed, and the penalty grows with the structural depth at which they diverge, so swapping fraction operands is punished while harmless rewrites are not.

How does PA-CDM differ from CDM?

They share the same render-and-match pipeline; with structural checks disabled PA-CDM reproduces CDM exactly. With them enabled, PA-CDM is stricter than CDM on average (mean F1 0.9136 vs 0.9233 on 985 CROHME 2014 predictions) and increasingly so as perturbation intensity rises (frac swap gaps 0.2342/0.2999/0.4472 at L1-L3). The strictness holds only at the mean level: a small share of individual pairs score higher under PA-CDM.

Is PA-CDM better than using an LLM as a judge for grading math recognition?

According to the paper's six-annotator study, the Kimi-K3 LLM judge correlates slightly better with human scores (rho = 0.9613 vs 0.9535, n = 990), but each calibration pass cost about 7.09M API tokens (~CNY 202), outputs are nondeterministic, and the hosted model can drift. The authors therefore recommend PA-CDM as the default metric — free, deterministic, and inspectable — with LLM judges reserved for periodic audits.

What is StructPerturb v2.0?

A frozen benchmark for stress-testing HMER metrics: 1,340 controlled perturbation pairs across 15 type-intensity cells (script swap, fraction-operand swap, nested move at three intensity grades, equivalence rewrites, parser-coverage and glyph-confusion cells). Generation is deterministic under seed 20260824, each cell carries a SHA-256 hash, and regeneration reproduces every file byte-for-byte.

About this review

This is an AI-generated preliminary review by Evolve.Pub, produced from the openly available text of the paper. It is not peer review and does not represent the authors' views. The canonical record of the paper is at the publisher link above.

  • Figures 1 and 2 appear in the extraction as interleaved axis/annotation fragments (e.g., tick labels and bucket counts); figure-level visual claims are assessed from their captions and surrounding text, not inspectable plots.
  • Two of the 15 sensitivity-matrix cells (matrix variant, confusable) are absent from the entire text because the authors themselves omitted them from Table I for space, stating the full 15-cell matrix ships with the benchmark.
  • No repository URL or DOI for the claimed release of PA-CDM code or StructPerturb v2.0 appears anywhere in the provided text; release is asserted verbally only.

Go deeper on this paper

Wrote a paper? Stress-test it before reviewers do.

Upload your manuscript for the same structured scrutiny — reasoning, statistics, evidence, figures, and reproducibility.

Scan your paper
PA-CDM: Position-Aware Character Detection Matching for Evaluating Handwritten Mathematical Expression Recognition | Evolve.Pub