REVIEW 2 cited by
Predicting root numbers with neural networks
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
abstract
We report on two machine learning experiments in search of statistical relationships between Dirichlet coefficients and root numbers or analytic ranks of certain low-degree $L$-functions. The first experiment is to construct interpretable models based on murmurations, a recently discovered correlation between Dirichlet coefficients and root numbers. We show experimentally that these models achieve high accuracy by learning a combination of Mestre-Nagao type heuristics and murmurations, noting that the relative importance of these features varies with degree. The second experiment is to search for a low-complexity statistic of Dirichlet coefficients that can be used to predict root numbers in polynomial time. We give experimental evidence and provide heuristics that suggest this can not be done with standard machine learning techniques.
Forward citations
Cited by 2 Pith papers
-
Learning Euler Factors of Elliptic Curves
Neural networks predict the parity of Frobenius traces of elliptic curves from other traces with high accuracy, and their embeddings reveal learned mod-2 and mod-4 structure.
-
Machine learning the vanishing order of rational L-functions
LDA and convolutional neural networks classify the central vanishing order of 176,156 rational L-functions with over 95% held-out accuracy using Dirichlet coefficients at primes below 1000.
Discussion (0). Continue with ORCID to comment.