atlas

Research map / Probabilistic and scientific modeling / Molecules and proteins

Unsupervised Discovery of Formulas for Mathematical Constants

NeurIPS 2024 · Probabilistic and scientific modeling › Molecules and proteins · approach: Counterfactual and statistical explanations · 0 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's full text. Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Proposes dynamics-based metrics (irrationality measure via a Blind-delta algorithm, convergence-rate and denominator-growth fits) to cluster ~1.5M polynomial continued fractions, rediscovering known constant formulas and finding new ones for pi, ln(2), Gauss and Lemniscate constants.

Problem

Formulas for mathematical constants (continued fractions) lack a distance metric because a near-correct formula is simply wrong, so automated discovery and clustering of such formulas is hard.

Approach

Cluster polynomial continued fractions by their convergence dynamics (irrationality measure estimated without knowing the limit via the Blind-delta algorithm, plus fitted growth coefficients of error and denominators) rather than by coefficients or numerical value; use known formulas as anchors and PSLQ to label clusters.

Key results

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Use irrationality measure δ instead of limit L as the clustering metricPCF clustering · 25K converging PCFsDavies-Bouldin Index: 67.23 -> 1.11Helped
Use denominator growth exponential coefficient γ′ instead of limit L as the clustering metricPCF clustering · 25K converging PCFsDavies-Bouldin Index: 67.23 -> 0.51Helped
Use denominator growth factorial coefficient η′ instead of limit L as the clustering metricPCF clustering · 25K converging PCFsDavies-Bouldin Index: 67.23 -> 0.13Helped
Use error rate exponential coefficient γ instead of limit L as the clustering metricPCF clustering · 25K converging PCFsDavies-Bouldin Index: 67.23 -> 14.83Helped
Use error rate factorial coefficient η instead of limit L as the clustering metricPCF clustering · 25K converging PCFsDavies-Bouldin Index: 67.23 -> 0.77Helped
Fit using 5 evenly spread points instead of 1000 pointsPCF metric curve fitting · 450 randomly selected PCFsRelative error average for denominator growth γ′: 0.0124No clear effect
Fit using 5 evenly spread points instead of 1000 pointsPCF metric curve fitting · 450 randomly selected PCFsRelative error average for denominator growth η′: 0.0007No clear effect
Fit using 5 evenly spread points instead of 1000 pointsPCF metric curve fitting · 450 randomly selected PCFsRelative error average for convergence rate γ: 0.0078No clear effect
Fit using 5 evenly spread points instead of 1000 pointsPCF metric curve fitting · 450 randomly selected PCFsRelative error average for convergence rate η: 0.0005No clear effect
Fit using 5 logarithmically spread points instead of 1000 pointsPCF metric curve fitting · 450 randomly selected PCFsRelative error average for denominator growth γ′: 0.0175No clear effect
Fit using 5 logarithmically spread points instead of 1000 pointsPCF metric curve fitting · 450 randomly selected PCFsRelative error average for denominator growth η′: 0.0004No clear effect
Fit using 5 logarithmically spread points instead of 1000 pointsPCF metric curve fitting · 450 randomly selected PCFsRelative error average for convergence rate γ: 0.0024No clear effect

Surprising findings

Limitations

Experimental setup

Datasets: polynomial continued fractions with coefficients in [-5,5] (1,768,900 formulas; 1,543,926 converging) 126 known anchor formulas for constants

Benchmarks: Davies-Bouldin Index on 25K sampled PCFs known formulas for pi, e, golden ratio, sqrt constants as anchors

Metrics: Davies-Bouldin Index irrationality measure PSLQ identification success

Baselines: PCF numerical limit clustering coefficient-based classification

Builds on: HDBSCAN Euler's continued fraction formula PSLQ

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy