Reproducible code and precomputed numerical outputs for severe centered and shifted hyperbolic fixed-point benchmarks.
Author: David Ariza Ruiz (Valencian International University, Spain)
This repository contains:
benchmark_suite.py: the main simulation script;requirements.txt: Python dependencies;scripts/run_macos.sh: a ready-to-run command for macOS;data/: precomputed run-level outputs and aggregated CSV summaries.
The benchmark suite compares four methods under a matched evaluation budget:
GA_0.00: metric genetic algorithm without refresh;GA_0.10: metric genetic algorithm with refresh parameterepsilon = 0.10;Mann: Mann iteration;Halpern: Halpern iteration.
The default configuration is the severe regime used in the experiments:
- contraction parameter
gamma = 0.90; - working radius
rho_work = 0.97; - population size
N = 100; - generations
G = 250; - mutation probability
p_m = 0.40; - target residual
1e-5; - shifted fixed point
z* = (0.55, 0.25).
python3 -m pip install -r requirements.txtDefault execution:
python3 benchmark_suite.py --outdir results --runs 500 --jobs 8 --zstar-x 0.55 --zstar-y 0.25Quick smoke test:
python3 benchmark_suite.py --outdir results_smoke --runs 20 --jobs 4 --zstar-x 0.55 --zstar-y 0.25The script creates:
results/data/all_runs.csvresults/data/scenario_manifest.csvresults/data/summary.csvresults/data/paired_comparisons.csvresults/data/manuscript_table.csvresults/data/manuscript_notes.texresults/figures/*.png
The data/ directory contains a precomputed benchmark dataset for the severe regime with 500 independent runs per scenario. These files can be used directly for manuscript tables, statistical checks, and reproducibility audits without rerunning the full simulation.
- Random seeds are fixed internally by run index.
- Bootstrap confidence intervals and paired permutation tests are generated reproducibly from a fixed seed.
- The shifted benchmark is implemented intrinsically in the Poincare disk through Mobius operations.
- The Euclidean working ball is a benchmark modelling choice for the computational study.
- Deterministic baselines are matched to the genetic algorithm by the common budget unit "number of evaluations of T".
MIT License. See LICENSE for details.
If you use this code, please cite:
@article{ArizaRuiz2026RMGA,
author = {Ariza-Ruiz, David},
title = {A Refreshed Metric Genetic Algorithm for $(E_\mu)$~Mappings in CAT(0) Spaces},
journal = {Soft Computing},
year = {2026},
note = {Submitted}
}