SearcharxivSearch

arXiv subjects

Myeong Jae Jeon

Publications and source records attributed to Myeong Jae Jeon.

2 recordsLinked to original sources

SHADOWBENCH: Toward Reliable Automatic Evaluation of Semantic Alignment in Autoformalization

Autoformalization translates informal mathematical theorems into code for proof assistants such as Lean. A central challenge is that current evaluation metrics can accept type-correct but misaligned statements or reject correct statements written in a different formulation. Inspired by Pass@$k$, we propose SA-Pass (*Semantic Alignment Pass*), which tests formal statements using auxiliary statements called *shadows* that characterize the intended statement. A generated statement receives full credit only when it compiles, implies each shadow (forward check), and is implied by their conjunction (backward check). We instantiate SA-Pass in ShadowBench, a Lean 4 full autoformalization benchmark of 178 postgraduate- to research-level problems spanning eight mathematical areas. Claude Code (Opus 4.8) with Numina-Lean-Agent reaches $61.8\%$ compile rate and $11.2\%$ SA-Pass. Across outputs generated by six agentic configurations, SA-Pass achieves $98.8\%$ binary agreement with expert judgments. An early version of ShadowBench served as the benchmark for Track 4 of the ICML 2026 AI4Math Challenge.

cs.CL

Resolution of indeterminacy of rational maps to proper tame stacks

We show the resolution of indeterminacy of rational maps from a regular surface to a tame stack locally of finite type over an excellent scheme. The proof uses the valuative criterion for proper tame morphisms, which was proved by Bresciani and Vistoli, together with the resolution of singularities for excellent surfaces and the root stack construction. Using Hironaka's results on the resolution of singularities over fields of characteristic zero, we extend the result to rational maps from a regular scheme of arbitrary dimension to a tame stack locally of finite type over a field of characteristic zero. We also provide a Purity Lemma for higher dimensional tame stacks, generalizing results of Abramovich, Olsson, and Vistoli, which also plays an essential role in the proof.

math.AG