# Эксперимент: Variable-rate analytic array bottleneck (#970)

{
  "worked": true,
  "confidence": 8,
  "verdict": "Built and numerically verified the variable-rate analytic-array bottleneck primitives. The Taylor approximation followed the predicted O(delta^2) law (observed slope 1.994 vs 2.0 and coefficient 564.04 vs 564.05), exact K-path ridge recovery reached relative error 1.0e-8 at K=4, and near-duplicate atom conditioning scaled approximately as separation^-2 (observed slope -1.804 vs -2). The analytic greedy codec did not beat the sparse DCT baseline in this small coarse-grid test, so the mechanism is validated but an end-to-end accuracy/rate win was not demonstrated.",
  "metrics": {
    "baseline": "Sparse 2-D DCT: NMSE 0.606, 0.433, 0.275, 0.222 for 4, 8, 12, 16 retained coefficients.",
    "idea": "Analytic greedy atoms: NMSE 0.862, 0.802, 0.759, 0.748 for 1, 2, 3, 4 atoms; exact continuous-path transfer from 32x32 to 48x48 had relative error 0.0."
  },
  "how_to_run": "/home/maxwelhelp/main/bin/python3 experiment.py",
  "files": [
    "experiment.py",
    "results.json",
    "run_output.txt"
  ],
  "limitations": "No learned neural encoder, quantization, rate penalty, noise robustness, FLOP measurement, or true equal-bit comparison was tested. The atom encoder used a computationally expensive 17x17 coarse grid and greedy pursuit, and the transfer check reused known physical path parameters rather than testing a learned encoder on larger arrays."
}