cs.LGFeb 8, 2026

What Does Machine Learning Learn from Numerical Calabi--Yau Geometry? A Controlled Study on the Fermat Quintic

Authors: D Yang Eng

Abstract

We study polynomial regression of numerical metric errors on the Fermat quintic. A known hypersurface volume-ratio identity gives the exact reference C−log⁡p4C-\log p_4 relative to the induced Fubini--Study metric, where p4=∑i∣zi∣8p_4=\sum_i|z_i|^8 on unit-normalized homogeneous coordinates. We optimize algebraic metrics at degrees 6,8,10,126,8,10,12 while preserving finite Fermat symmetry, then fit their remaining logarithmic volume-form error. Regression splits and bootstrap draws keep the five roots of each sampled line together, with all compared teachers evaluated on common clouds. Warm-start replication correlations exceed 0.99970.9997 at k=8,10,12k=8,10,12. Across degrees, source-derived modes fall short of target-specific fits, including in a post-hoc quartic check, but outperform random spans of matched rank in the tested libraries. Two independent random-invariant k=10k=10 starts have residual correlations 0.7680.768--0.8030.803, while their fitted cubic modes correlate at 0.9790.979--0.9830.983 and retain useful calibrated cross-start prediction. Their fitted modes agree poorly with those of the principal warm-start teacher. Adding the phase-sensitive invariant J7J_7 improves prediction beyond the cubic modulus-only library for all seven warm-start teachers. The gain depends on the library: at k=12k=12, a quartic modulus-only fit explains about 97--98% of residual variance and the conditional interval for the added J7J_7 gain includes zero for both replicas under both measures. The gains therefore establish neither phase independence nor irreducible phase necessity; fixed-baseline augmentation preserves this distinction. The fitted components depend on the numerical protocol; global optimality and a universal finite-degree correction remain unestablished.

Figures & tables

Appendix figures & tables4 assets

Supplementary material from the paper’s appendix.

Appendix

Explore similar work

Feb 26, 2026

On the Limits of Interpretable Machine Learning in Quintic Root Classification

Can Machine Learning (ML) autonomously recover interpretable mathematical structure from raw numerical data? We aim to answer this question using the classification of real-root configurations of polynomials up to degree five as a structured benchmark. We tested an extensive set of ML models, including decision trees, logistic regression, support vector machines, random forest, gradient boosting, XGBoost, symbolic regression, and neural networks. Neural networks achieved strong in-distribution performance on quintic classification using raw coefficients alone (84.3% + or - 0.9% balanced accuracy), whereas decision trees perform substantially worse (59.9% + or - 0.9%). However, when provided with an explicit feature capturing sign changes at critical points, decision trees match neural performance (84.2% + or - 1.2%) and yield explicit classification rules. Knowledge distillation reveals that this single invariant accounts for 97.5% of the extracted decision structure. Out-of-distribution, data-efficiency, and noise robustness analyses indicate that neural networks learn continuous, data-dependent geometric approximations of the decision boundary rather than recovering scale-invariant symbolic rules. This distinction between geometric approximation and symbolic invariance explains the gap between predictive performance and interpretability observed across models. Although high predictive accuracy is attainable, we find no evidence that the evaluated ML models autonomously recover discrete, human-interpretable mathematical rules from raw coefficients. These results suggest that, in structured mathematical domains, interpretability may require explicit structural inductive bias rather than purely data-driven approximation.
Sep 29, 2026

Can an AI Agent Rediscover a Blaschke-Curve Invariant?

We study generalized Blaschke curves as a controlled environment for AI-assisted mathematical rediscovery. For one fixed degree-four Blaschke product, an agent receives numerical coordinates of the six pair-lines determined by each of 80 boundary configurations. The target theorem is withheld from the task instructions. The saved research log reports rejected geometric hypotheses and a homogeneous cubic fitted to polygon sides. Its frozen coefficients predict 480 lines from 80 unseen parameter values, with a recorded RMS scale-free residual of 8.88×10−178.88\times10^{-17}. Discovery-set diagonals provide an out-of-fit consistency check, not a fully held-out test. A separate one-configuration run reports insufficient evidence for invariance. A post-review deterministic degree-search baseline also recovers the cubic, so the experiment does not establish an advantage over polynomial fitting. We present this single-instance case study as a protocol for separating conjecture, numerical validation, and proof, with explicit limitations concerning agent metadata, prior knowledge, and reproducibility.
Oct 5, 2026

Data, Numbers, and Geometry: Three Tutorials on Numerical Methods, Machine Learning, and Evaluation

We present three practical tutorials on numerical computation and machine learning for mathematical research, developed for the DANGER: Data, Numbers, and Geometry workshop held at the Banff International Research Station in April 2026. The first develops a numerical approach to exterior calculus from pointwise evaluations of differential forms, using a flux formulation of the exterior derivative. Examples in Euclidean space and on the sphere illustrate geometric identities, topological features, and the effects of approximation and finite precision. The second examines how mathematical structure guides neural network design through examples involving elliptic curves, quivers, and a boundary value problem. It explores how architectural choices affect learning and uses interval arithmetic to bound the residual of a trained network over the full interval of the boundary value problem. The third addresses the evaluation and presentation of machine learning results, covering performance metrics, statistical uncertainty, classification thresholds, receiver operating characteristic curves, and accessible figure design. Throughout, the tutorials distinguish numerical agreement, predictive accuracy, structural guarantees, and rigorous bounds as different forms of evidence. Each contribution can be read independently, with accompanying notebooks and exercises that allow readers to reproduce the examples and adapt the methods to other problems.