Assignment Tree Attention / report_bench_2026-08-31T222936.md

Mechanism confirmed, baseline not beaten

Raw ⬇ ZIP

Стенд-проверка (stage-2) · промт оператора:

(универсальный)

Ответ агента:

{ "worked": false, "confidence": 9, "verdict": "Built Assignment Tree Attention for the structurally matched sequence forecast track with dense and sparse systems sharing data, optimizer, architecture family, and training budget. Mean test MSE was 0.950891 for the idea versus 0.958047 for baseline; paired delta was -0.007156 but permutation p=0.70955, so there was no significant effect. The trained-model signature confirmed 63 observed tree edges versus 63 predicted for a 32-token support.", "metrics": { "baseline": "8-seed mean MSE 0.9580474123, std 0.0756922766; best lr=0.001, epochs=2; sweep means: lr=0.001 -> 0.9283310622, lr=0.003 -> 1.0033762753, lr=0.006 -> 1.0917343497.", "idea": "8-seed mean MSE 0.9508912265, std 0.0570249099; best lr=0.001, K=4, tau=0.7, alpha=0.5, epochs=2; paired delta=-0.0071561858, 3/8 wins, p=0.70955; 63 tree edges observed and predicted." }, "bench_report": { "bench_version": 1, "track": "sequence", "model": "transformer_tiny", "metric_direction": "lower is better", "n_seeds": 8, "baseline": { "best_cfg": { "lr": 0.001, "epochs": 2, "K": 4, "tau": 0.7, "alpha": 0.5 }, "sweep_means": [ { "lr": 0.001, "mean": 0.9283310621976852 }, { "lr": 0.003, "mean": 1.0033762753009796 }, { "lr": 0.006, "mean": 1.0917343497276306 } ], "full": { "mean": 0.9580474123358727, "std": 0.07569227656456869, "per_seed": [ 0.9577249884605408, 0.8674030900001526, 0.9789561033248901, 0.9092400670051575, 1.1384438276290894, 0.9376952052116394, 0.9597494006156921, 0.9151666164398193 ] } }, "idea": { "best_cfg": { "lr": 0.001, "epochs": 2, "K": 4, "tau": 0.7, "alpha": 0.5 }, "mean": 0.9508912265300751, "std": 0.05702490985176115, "per_seed": [ 0.9412082433700562, 0.8438071012496948, 0.9839955568313599, 0.9183895587921143, 1.0529438257217407, 0.9422717094421387, 0.9901344180107117, 0.9343793988227844 ] }, "comparison": { "delta_mean": -0.007156185805797577, "idea_wins": 3, "n_pairs": 8, "p_value": 0.70955, "verdict": "no measurable effect", "system_worked": false }, "mechanism_signature": { "prediction": "connected bipartite tree retains 2L-1 edges", "predicted_tree_edges": 63.0, "observed_tree_edges": 63.0, "confirmed": true, "measured_on_trained_model": true } }, "how_to_run": "/home/maxwelhelp/main/bin/python3 bench_assignment_tree.py", "files": [ "bench_assignment_tree.py", "bench_report.json" ], "limitations": "Only the sequence track was tested, with 400 training samples, 200 test samples, two epochs, K=4, and a cached batch-mean support for tractability. Wall-clock speed, activation memory, refresh interval R, and K/R sweeps were not measured; the implementation uses a practical greedy matching approximation rather than exact Hungarian assignments.", "system_verdict": "partial", "practical_verdict": "no_effect", "mechanism_ok": 1, "system_judged": true }