grid order 2, 4 stages, cycle bucket 2
This page is the full archive record for this cell's elite. Every number here was produced by the pinned scoring code, and verifier_hash pins which version of it; see the explicit archive for where this cell sits in the grids. The tier and phase label are assigned mechanically.
| A[.][0] | A[.][1] | A[.][2] | A[.][3] | |
|---|---|---|---|---|
| c[0] = 0/1 | 0/1 | 0/1 | 0/1 | 0/1 |
| c[1] = 15/16 | 15/16 | 0/1 | 0/1 | 0/1 |
| c[2] = 31/32 | 1/8 | 27/32 | 0/1 | 0/1 |
| c[3] = 17/16 | 9/16 | 5/32 | 11/32 | 0/1 |
| b | 7/15 | 8/15 | 0/1 | 0/1 |
All values are exact fractions; the Q15 integrator applies each one as a dyadic m/2^s pair, listed below. The tableau layout is defined in the glossary.
The Q15 integrator applies each nonzero A and b entry to a state value v as (v * m) >> s, an arithmetic right shift that floors. Zero entries are skipped. When exact is no, m/2^s only approximates the fraction and the largest such gap is the record's coeff_quant_error. CSD weight is the length of the shift-add chain the cost model may charge for the multiply by m.
| entry | exact value | m | s | m/2^s | exact | csd weight |
|---|---|---|---|---|---|---|
| A[1][0] | 15/16 | 15 | 4 | 15/2^4 | yes | 2 |
| A[2][0] | 1/8 | 1 | 3 | 1/2^3 | yes | 1 |
| A[2][1] | 27/32 | 27 | 5 | 27/2^5 | yes | 3 |
| A[3][0] | 9/16 | 9 | 4 | 9/2^4 | yes | 2 |
| A[3][1] | 5/32 | 5 | 5 | 5/2^5 | yes | 2 |
| A[3][2] | 11/32 | 11 | 5 | 11/2^5 | yes | 3 |
| b[0] | 7/15 | 30583 | 16 | 30583/2^16 | no | 5 |
| b[1] | 8/15 | 4369 | 13 | 4369/2^13 | no | 4 |
| problem | set | final-state error | share of its set, percent |
|---|---|---|---|
| dahlquist | search | 4.53999e-05 | 0.0013 |
| damped_osc | search | 0.00434663 | 12.02 |
| dc_motor | held-out | 0.0313048 | 7.12 |
| pendulum | held-out | 0.00341495 | 0.085 |
| quaternion | held-out | 0.0273807 | 5.45 |
| rc_thermal | held-out | 0.109635 | 87.35 |
| vanderpol_mild | search | 0.0117599 | 87.98 |
| model | cycles | note |
|---|---|---|
| m0plus_fast | 39 | |
| m0plus_slow | 60 | |
| avr_approx | 182 | avr_approx is an approximate model, shown for context only. |
| metric | value |
|---|---|
| measured_order | 2.01094 |
| order_fit_points | 8 |
| error_constant | 0.214745 |
| stability_real | -2 |
| stability_imag (bisection floor) | 0.00168185 |
| csd_weight_total | 22 |
| coeff_quant_error | 8.13802e-06 |
| search_error | 0.00723854 |
| heldout_error | 0.0586541 |
| overflow_margin | 1.98234 |
stability_imag is the smallest imaginary-axis interval the scorer's search can resolve, from 4000 samples and 200 bisection steps, so it is a floor rather than a measured extent: a method whose stability region meets the imaginary axis only at the origin reports that floor and not 0. Read a value at the floor as no resolvable interval. stability_real carries no such floor, because the real-axis interval of these methods is well inside the sampled range.
measured_order is the slope of a log-log fit of float64 final-state error against step size on the dahlquist problem, over the longest usable run of points (order_fit_points of them); it is measured evidence, distinct from the algebraic order that keys the grid. error_constant is the L2 norm of the order-condition residuals one order past the achieved one, a size estimate for the leading truncation term. stability_real and stability_imag are read off the stability region by the bisection described under the table above, along the negative real axis and along the imaginary axis.
csd_weight_total sums CSD weights over the non-trivial coefficients, a proxy for coefficient-arithmetic cost. coeff_quant_error is the largest gap between an exact coefficient and its m/2^s form. search_error and heldout_error are root-mean-square errors over the two problem sets at the fixed cycle budget; heldout_error is the archive fitness. overflow_margin is 1 / max|state| observed at twice the nominal amplitude and must exceed 1.0, meaning a doubled signal still fits in Q15 range.
| problem | set | m0plus_fast | m0plus_fast share, percent | m0plus_slow | m0plus_slow share, percent | avr_approx | avr_approx share, percent |
|---|---|---|---|---|---|---|---|
| dahlquist | search | 4.53999e-05 | 0.0013 | 4.53999e-05 | 0.0022 | 4.53999e-05 | 0.00012 |
| damped_osc | search | 0.00434663 | 12.02 | 0.00366048 | 14.21 | 0.00772541 | 3.56 |
| vanderpol_mild | search | 0.0117599 | 87.98 | 0.00899504 | 85.79 | 0.0401969 | 96.44 |
| pendulum | held-out | 0.00341495 | 0.085 | 0.0129889 | 2.82 | 0.472778 | 99.73 |
| dc_motor | held-out | 0.0313048 | 7.12 | 0.0199235 | 6.64 | 0.00657753 | 0.019 |
| rc_thermal | held-out | 0.109635 | 87.35 | 0.0712837 | 85.04 | 0.0233027 | 0.24 |
| quaternion | held-out | 0.0273807 | 5.45 | 0.018116 | 5.49 | 0.00427132 | 0.0081 |
| search_error | search | 0.00723854 | set total | 0.0056069 | set total | 0.0236324 | set total |
| heldout_error | held-out | 0.0586541 | set total | 0.0386498 | set total | 0.236708 | set total |
Each cost model is scored by its own integration, so it has its own per-problem errors and its own two sums, and one share column would describe one of these three while mislabeling the other two. The set column says which total a row belongs to: within one cost model the search rows divide one sum of squares and the held-out rows divide another, and a share is the row's error squared over the sum for its own set. Each set adds to 100 before rounding, so a set printed to two decimals can read 99.99 or 100.01, and a share below a tenth of a percent prints to two significant figures instead so that a small contribution does not read as none. The two rows in bold are those sets' own root mean square values rather than members of a set, which is why they carry the words set total in place of a share; under m0plus_fast they are the record's own search_error and heldout_error, and the other two models store theirs under their own prefix. A row whose error is 0 carries none of its set's total and reads 0. A set holding an overflowed run has an infinite error and so has no usable total, and a set whose errors are all zero has nothing to divide by, so in both cases every share reads n/a rather than being spread over the rows that finished.