Exploring Prime Number Classification: Achieving High Recall Rate and Rapid Convergence with Sparse Encoding
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866914432015138816 |
|---|---|
| author | Lee, Serin Kim, S. |
| author_facet | Lee, Serin Kim, S. |
| contents | This paper presents a novel approach at the intersection of machine learning and number theory, focusing on the classification of prime and non-prime numbers. At the core of our research is the development of a highly sparse encoding method, integrated with conventional neural network architectures. This combination has shown promising results, achieving a recall of over 99\% in identifying prime numbers and 79\% for non-prime numbers from an inherently imbalanced sequential series of integers, while exhibiting rapid model convergence before the completion of a single training epoch. We performed training using $10^6$ integers starting from a specified integer and tested on a different range of $2 \times 10^6$ integers extending from $10^6$ to $3 \times 10^6$, offset by the same starting integer. While constrained by the memory capacity of our resources, which limited our analysis to a span of $3\times10^6$, we believe that our study contribute to the application of machine learning in prime number analysis. This work aims to demonstrate the potential of such applications and hopes to inspire further exploration and possibilities in diverse fields. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2402_03363 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Exploring Prime Number Classification: Achieving High Recall Rate and Rapid Convergence with Sparse Encoding Lee, Serin Kim, S. Number Theory Machine Learning 11, 68 G.0; G.1.0; G.1.10; G.1.m; I.0; I.m; I.1.1; I.2.0; I.2.6; I.2.m; J.2 This paper presents a novel approach at the intersection of machine learning and number theory, focusing on the classification of prime and non-prime numbers. At the core of our research is the development of a highly sparse encoding method, integrated with conventional neural network architectures. This combination has shown promising results, achieving a recall of over 99\% in identifying prime numbers and 79\% for non-prime numbers from an inherently imbalanced sequential series of integers, while exhibiting rapid model convergence before the completion of a single training epoch. We performed training using $10^6$ integers starting from a specified integer and tested on a different range of $2 \times 10^6$ integers extending from $10^6$ to $3 \times 10^6$, offset by the same starting integer. While constrained by the memory capacity of our resources, which limited our analysis to a span of $3\times10^6$, we believe that our study contribute to the application of machine learning in prime number analysis. This work aims to demonstrate the potential of such applications and hopes to inspire further exploration and possibilities in diverse fields. |
| title | Exploring Prime Number Classification: Achieving High Recall Rate and Rapid Convergence with Sparse Encoding |
| topic | Number Theory Machine Learning 11, 68 G.0; G.1.0; G.1.10; G.1.m; I.0; I.m; I.1.1; I.2.0; I.2.6; I.2.m; J.2 |
| url | https://arxiv.org/abs/2402.03363 |