|
Download benchmarks/math/README.md from JustinTX/sky2: direct link, hf CLI and curl.
- Browser
- Download file 2.39 kB
-
https://huggingface.co/JustinTX/sky2/resolve/main/benchmarks/math/README.md
- Command line
-
hf download hf://JustinTX/sky2/benchmarks/math/README.md
-
curl -L -o README.md https://huggingface.co/JustinTX/sky2/resolve/main/benchmarks/math/README.md
2.39 kB
| # Math Benchmarks | |
| Mathematical optimization and algorithm evolution problems. | |
| ## Problems | |
| ### Signal processing & geometry (from SkyDiscover demos) | |
| - [signal_processing](signal_processing/) β Real-time adaptive filtering for non-stationary time series | |
| - [circle_packing](circle_packing/) β Pack 26 circles in a unit square to maximize sum of radii (AlphaEvolve B.12) | |
| ### AlphaEvolve mathematical problems | |
| 12 problems from [AlphaEvolve Appendices A and B](https://storage.googleapis.com/deepmind-media/DeepMind.com/Blog/alphaevolve-a-gemini-powered-coding-agent-for-designing-advanced-algorithms/AlphaEvolve.pdf). All evaluators are normalized to **maximize** the target metric. | |
| **Appendix A:** | |
| - [matmul](matmul/) β Faster algorithm for matrix multiplication (A) | |
| **Appendix B:** | |
| 1. [first_autocorr_ineq](first_autocorr_ineq/) β Upper bound on autoconvolution constant (B.1) | |
| 2. [second_autocorr_ineq](second_autocorr_ineq/) β Lower bound on autoconvolution norm constant (B.2) | |
| 3. [third_autocorr_ineq](third_autocorr_ineq/) β Upper bound on absolute autoconvolution constant (B.3) | |
| 4. [uncertainty_ineq](uncertainty_ineq/) β Upper bound on Fourier uncertainty constant (B.4) | |
| 5. [erdos_min_overlap](erdos_min_overlap/) β Upper bound on Erdos minimum overlap constant (B.5) | |
| 6. [sums_diffs_finite_sets](sums_diffs_finite_sets/) β Lower bound on sums/differences of finite sets (B.6) | |
| 7. [hexagon_packing](hexagon_packing/) β Pack unit hexagons in a regular hexagon, n=11,12 (B.7) | |
| 8. [minimizing_max_min_dist](minimizing_max_min_dist/) β Minimize max/min distance ratio, n=16 d=2 and n=14 d=3 (B.8) | |
| 9. [heilbronn_triangle](heilbronn_triangle/) β Heilbronn problem for triangles, n=11 (B.9) | |
| 10. [heilbronn_convex](heilbronn_convex/) β Heilbronn problem for convex regions, n=13,14 (B.10) | |
| 11. [circle_packing_rect](circle_packing_rect/) β Pack circles in a rectangle of perimeter 4 (B.13) | |
| ## Run | |
| ```bash | |
| uv run skydiscover-run \ | |
| benchmarks/math/signal_processing/initial_program.py \ | |
| benchmarks/math/signal_processing/evaluator.py \ | |
| -c benchmarks/math/signal_processing/config.yaml \ | |
| -s [your_algorithm] \ | |
| -i 100 | |
| ``` | |
| Each problem directory contains `initial_program.py`, `evaluator.py`, and either `config.yaml` or per-search configs. Some multi-variant problems have numbered subdirectories (e.g., `heilbronn_convex/13/`, `hexagon_packing/11/`). | |