Valeri's decisions (1) competitors from the library, (2) variant a. (1) Chandrupatla is scipy.optimize.elementwise.find_root, Brent is brentq, no more per-problem best_of. Our Chandrupatla stopped on a bracket twice as wide as every other method (the factor the protocol corrects for ITP); fixed (+0.5*xtol) in baselines.py and in the two copies found by grep (stage16_blend, stage19_modern) and the traced mirror, and pinned: ours == library on every problem. Regenerating sweep_full.json changed exactly three rows - chandrupatla APS 2785->2787, CHA 2423->2441, brent CHA 4099->4115 - and nothing else (diff_sweeps.py: 0 unexpected).
(2) The proposed method is again the scheduled projection (2806/3220/6026), its budget multiplier DECLARED as the one free constant: the canonical total is the same for every multiplier 1.25-4, the wide-bracket one is not. The earned projection is the constant-free variant (3568/3020/6588). What the old tables hid: problem by problem the proposed rule beats Chandrupatla on the canonical set 87/24/42, exact sign test p = 9e-5, while trailing him by 0.7% in total; on the wide-bracket set he is genuinely stronger (26 to 9, p = 0.006). Gap decomposition recomputed with the library: 244 (was 262), 160 of it on the flat families (two thirds), fun1 58 (a quarter, not a third as the abstract said). Also corrected on the way: the 'subsumed by Chandrupatla' pin claimed he is better on the worst single problem - true only with the looser tolerance (84 against the credit rule's 83 once fixed); §8.3 still called zero slack degenerate, which Table 1a refutes; §5.2's Brent figure is our pure-Python implementation and now says so. verify_article.py 286/286, 802 tests pass twice. Co-Authored-By: Claude Opus 5 <noreply@anthropic.com>
This commit is contained in:
+10
-5
@@ -19,12 +19,17 @@ BASE = {"bisection", "regula_falsi", "illinois", "pegasus", "anderson_bjorck",
|
||||
# ranking is looked at:
|
||||
# similarity a nonzero slope of (1 - S) at 0 -> the ratio form 1 - |z|
|
||||
# scale the finest data-derived one -> the three-point difference
|
||||
# safeguard the one that carries a bound without destroying the order
|
||||
# AND without a free constant -> the credit projection, whose
|
||||
# endowment is a licence of one unconstrained step rather than
|
||||
# a number (see simroot.pure.project_credit)
|
||||
# safeguard the one that carries a bound without destroying the order ->
|
||||
# the scheduled projection, twice the bisection budget
|
||||
# Valeri's decision, 2026-09-21 (variant a): the projection is proposed with its
|
||||
# multiplier DECLARED as the method's one free constant - on the canonical set the
|
||||
# total is the same for every multiplier from 1.25 to 4, on the wide-bracket set it
|
||||
# is not (measure_budget_factor.py). The earned projection (credit) is kept as the
|
||||
# constant-free variant; it was PROPOSED here for a while, a choice recorded in code
|
||||
# but never taken by Valeri.
|
||||
# The grid is evidence for the theory, not the method's selection procedure.
|
||||
PROPOSED = "pure.ratio.derived3.credit"
|
||||
PROPOSED = "pure.ratio.derived3.project"
|
||||
CREDIT = "pure.ratio.derived3.credit" # the constant-free variant
|
||||
TUNED = {"illinois", "pegasus", "anderson_bjorck", "brent", "toms748",
|
||||
"itp", "itp_oracle"}
|
||||
|
||||
|
||||
Reference in New Issue
Block a user