grid order 4, 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] = 1/3 | 1/3 | 0/1 | 0/1 | 0/1 |
| c[2] = 2/3 | -1/3 | 1/1 | 0/1 | 0/1 |
| c[3] = 1/1 | 1/1 | -1/1 | 1/1 | 0/1 |
| b | 1/8 | 3/8 | 3/8 | 1/8 |
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] | 1/3 | 21845 | 16 | 21845/2^16 | no | 8 |
| A[2][0] | -1/3 | -21845 | 16 | -21845/2^16 | no | 8 |
| A[2][1] | 1/1 | 1 | 0 | 1/2^0 | yes | 1 |
| A[3][0] | 1/1 | 1 | 0 | 1/2^0 | yes | 1 |
| A[3][1] | -1/1 | -1 | 0 | -1/2^0 | yes | 1 |
| A[3][2] | 1/1 | 1 | 0 | 1/2^0 | yes | 1 |
| b[0] | 1/8 | 1 | 3 | 1/2^3 | yes | 1 |
| b[1] | 3/8 | 3 | 3 | 3/2^3 | yes | 2 |
| b[2] | 3/8 | 3 | 3 | 3/2^3 | yes | 2 |
| b[3] | 1/8 | 1 | 3 | 1/2^3 | yes | 1 |
| problem | set | final-state error | share of its set, percent |
|---|---|---|---|
| dahlquist | search | 4.53999e-05 | 0.00014 |
| damped_osc | search | 0.00817434 | 4.63 |
| dc_motor | held-out | 0.051997 | 9.30 |
| pendulum | held-out | 0.00110048 | 0.0042 |
| quaternion | held-out | 0.0446625 | 6.86 |
| rc_thermal | held-out | 0.156116 | 83.83 |
| vanderpol_mild | search | 0.0371158 | 95.37 |
| model | cycles | note |
|---|---|---|
| m0plus_fast | 36 | |
| m0plus_slow | 64 | |
| avr_approx | 132 | avr_approx is an approximate model, shown for context only. |
| metric | value |
|---|---|
| measured_order | 4.07063 |
| order_fit_points | 3 |
| error_constant | 0.0151014 |
| stability_real | -2.78529 |
| stability_imag (bisection floor) | 2.82843 |
| csd_weight_total | 22 |
| coeff_quant_error | 5.08626e-06 |
| search_error | 0.0219424 |
| heldout_error | 0.0852522 |
| overflow_margin | 1.97445 |
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.00014 | 0.000289541 | 0.014 | 0.00016747 | 0.015 |
| damped_osc | search | 0.00817434 | 4.63 | 0.005846 | 5.76 | 0.00175713 | 1.64 |
| vanderpol_mild | search | 0.0371158 | 95.37 | 0.0236499 | 94.23 | 0.0136163 | 98.35 |
| pendulum | held-out | 0.00110048 | 0.0042 | 0.000438599 | 0.0011 | 0.00108757 | 0.045 |
| dc_motor | held-out | 0.051997 | 9.30 | 0.0288564 | 4.97 | 0.0130669 | 6.49 |
| rc_thermal | held-out | 0.156116 | 83.83 | 0.123703 | 91.42 | 0.0482813 | 88.55 |
| quaternion | held-out | 0.0446625 | 6.86 | 0.0245688 | 3.61 | 0.0113856 | 4.92 |
| search_error | search | 0.0219424 | set total | 0.0140662 | set total | 0.00792715 | set total |
| heldout_error | held-out | 0.0852522 | set total | 0.0646894 | set total | 0.0256547 | 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.