- Rating
- 2
- Confidence
- 2
- Informativeness
- 3
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper addresses handwritten mathematical expression generation (HMEG), with the goal of synthesizing an online pen trajectory from a target LaTeX expression. The central contribution is RelAST, a compact structural representation obtained by converting LaTeX to Presentation MathML and serializing the resulting structure as symbol-relation-depth triplets. RelAST is intended to expose two-dimensional layout and hierarchy without requiring symbol bounding boxes, point-level alignment, or other explicit positional annotations. Based on RelAST, the authors propose DiffMath, which contains two main components. MathVAE encodes handwriting trajectories into a latent sequence and reconstructs them using a Gaussian-mixture trajectory decoder; an auxiliary CTC-based recognition objective encourages the latent space to preserve symbol and relation information. MathDiT then performs conditional diffusion in this latent space using RelAST tokens, depth embeddings, and a global symbol-count prior. On MathWriting, DiffMath reports 70.70% expression recognition accuracy and an FID of 5.43, outperforming the baselines included in the main table. Component ablations support the usefulness of symbol, relation, depth, and count conditioning. The generated samples also improve two handwriting-recognition models when used for data augmentation on MathWriting and CROHME.
Critical strengths
- A useful structural representation that avoids fine-grained positional supervision. RelAST makes symbol identity, spatial relation, and hierarchy explicit while remaining derivable from LaTeX alone. This directly addresses the central difficulty of HMEG and could be useful beyond the exact architecture proposed here.
- Consistent validation across main results, ablations, and a downstream task. DiffMath achieves strong reported recognition, perceptual, and user-preference results; the ablations show consistent gains from the proposed structural components; and generated data improve two OCR systems. This triangulation makes the empirical contribution more persuasive than a single benchmark result and suggests that the outputs preserve task-relevant mathematical structure.
Critical weaknesses
- The state-of-the-art claim is not established against the closest prior work or under a clearly controlled comparison.The paper cites the CVPR 2024 symbol-graph HMEG method and the ICDAR 2025 SFRD diffusion method, but neither is included in the main results. Meanwhile, the reported baselines mix online trajectory generation with raster-image generation and use different training regimes, whereas DiffMath is trained for roughly 220k steps on eight H800 GPUs. This is consequential because the claimed performance advantage is central to the paper, yet it is difficult to separate architectural benefit from differences in modality, data exposure, compute, and tuning.
- Several central technical and evaluation details are too ambiguous for reliable reproduction or interpretation. The separate symbol and relation losses in the ablation are not reconciled with the single interleaved CTC objective in the method; the alignment between variable-length RelAST and latent trajectory sequences is unspecified; and the VAE posterior and KL setup are incomplete. The synthetic-data source, deduplication protocol, and statistical variation are also missing. These omissions affect both the validity of the ablation conclusions and confidence in the downstream augmentation results.
Questions for authors
- Closest comparisons and fairness: Can the authors provide results for the symbol-graph HMEG method of Chen et al. (CVPR 2024) and SFRD (ICDAR 2025), or explain precisely why direct comparison is infeasible? For all main baselines, what are the effective numbers of training examples, optimization steps, parameter counts, compute budgets, and tuning procedures? How are raster-image outputs made comparable to online-trajectory outputs?
- Method definition: How are the separate and settings in Table 3 implemented when Equation 4 defines a single CTC loss on an interleaved symbol-relation target? How are RelAST features aligned with the latent trajectory sequence before channel-wise concatenation? Please also specify the VAE posterior heads, reparameterization operation, KL expression, and all associated loss weights.
- Augmentation validity and statistical reliability: What is the source of the LaTeX expressions used to generate the additional MathWriting and CROHME samples, and how are exact or structurally equivalent overlaps with validation and test expressions excluded? Are the number of added samples and optimization updates matched against conventional augmentation? Please provide variability across training seeds or other uncertainty estimates for the principal results.