diff options
| author | YurenHao0426 <Blackhao0426@gmail.com> | 2026-08-01 17:59:32 -0500 |
|---|---|---|
| committer | YurenHao0426 <Blackhao0426@gmail.com> | 2026-08-01 17:59:32 -0500 |
| commit | 4f7ee05cc3b072478062e53645af016861c4b529 (patch) | |
| tree | e7dc4e428f3dbe199b40a23be49019846430128e /logs | |
| parent | f29c41e78da10d3c40afdd2deeb43c4d73f5eb43 (diff) | |
The failure is the optimiser, not the information: a 257x faster descent and a benchmark
The gate settles which failure mode each field is in, and refutes the
symmetry hypothesis I proposed. On the caption-omitted field the truth is
a STRICT local minimum -- descent started at the truth does not move at
all -- the anchor bound says the information is 99.7% intact, and our
solver stops 0.44 above it at 4.9% accuracy. That is a pure optimiser
failure. Natural data is the opposite: descent from the truth falls a
further 0.167, so the truth is not even locally optimal, which is the
information-deficit signature the 0.291 bound predicted.
Steepest descent was brute-forcing all 32,640 candidate permutations
through the full energy every step, including a batched cube trace with
the triangle term active -- 203 seconds per descent, which is why the
gates were hopeless. The pairwise term needs one matrix product for the
whole table: swapping p,q changes the alignment sum by
2(C_pq + C_qp - C_pp - C_qq + 2 A_pq B_pq) with C = A @ B. Verified
against brute force to 1e-9 before use, and the fast descent reaches the
same optimum. 203s -> 0.79s.
Adds a matching benchmark with known-reachable answers and the solver
families never tried on these fields: Gromov-Wasserstein, entropic GW
with an annealed regulariser, BAPG.
Co-Authored-By: Claude <noreply@anthropic.com>
Diffstat (limited to 'logs')
| -rw-r--r-- | logs/battery.log | 7 | ||||
| -rw-r--r-- | logs/degeneracy.log | 11 |
2 files changed, 18 insertions, 0 deletions
diff --git a/logs/battery.log b/logs/battery.log new file mode 100644 index 0000000..6030612 --- /dev/null +++ b/logs/battery.log @@ -0,0 +1,7 @@ + +=== omit-size-BOUND0.997 (N=256, chance=0.0039) + grampa (current) raw=0.0169 refined=0.0443 (0.0s) + umeyama raw=0.0052 refined=0.0143 (0.0s) + gromov-wasserstein raw=0.0182 refined=0.0221 (0.1s) +/home/yurenh2/.local/lib/python3.13/site-packages/ot/bregman/_sinkhorn.py:666: UserWarning: Sinkhorn did not converge. You might want to increase the number of iterations `numItermax` or the regularization parameter `reg`. + warnings.warn( diff --git a/logs/degeneracy.log b/logs/degeneracy.log new file mode 100644 index 0000000..ff31564 --- /dev/null +++ b/logs/degeneracy.log @@ -0,0 +1,11 @@ +omit-size gap(found-truth)=+0.4400 truth-descends=+0.0000 acc=0.049 + -> truth is DEEPER than what is found -- optimiser failure +noise035 gap(found-truth)=+0.0476 truth-descends=+0.0020 acc=0.887 + -> truth is DEEPER than what is found -- optimiser failure +rank8 gap(found-truth)=+0.3650 truth-descends=+0.0062 acc=0.065 + -> truth is DEEPER than what is found -- optimiser failure +synth-full gap(found-truth)=+0.0770 truth-descends=+0.0005 acc=0.883 + -> truth is DEEPER than what is found -- optimiser failure +natural-best gap(found-truth)=+0.0853 truth-descends=+0.1674 acc=0.027 + -> truth is DEEPER than what is found -- optimiser failure +{"done": true} |