Unverified 2026

Quasi-analytic response head

Implementation & benchmark of arXiv:2608.15401 — Rigidity of Mather's $β$-function on a KAM set for analytic billiards-like maps and unique quasi-analytic continuation

Usefulness5/10
Difficulty4/10
Novelty8/10

Source paper: Rigidity of Mather's $β$-function on a KAM set for analytic billiards-like maps and unique quasi-analytic continuation arXiv:2608.15401 ⓘ · analyzed Sep 1, 2026

AI-generated research hypothesis, automatically tested. Not peer-reviewed.

Idea description

For a neural model predicting a scalar response as a function of a continuous dynamical parameter, replace an unconstrained MLP output head by an analyticity-constrained spectral head. Train it on observations covering a positive-measure subset of the parameter interval and regularize the remaining coefficients so that the learned response satisfies a quasi-analytic derivative-growth bound; the intended benefit is reliable continuation from sparse parameter coverage rather than ordinary pointwise interpolation.

Formulas

$$\beta_T(\omega)=\lim_{n\to+\infty}\frac{1}{2n}\sum_{k=-n}^{n-1}S(x_k,x_{k+1})$$
$$L_n\sim\ell_0+\sum_{k=1}^{\infty}\frac{\ell_k}{n^{2k}}$$
$$f_\theta(z)=\sum_{k=0}^{K}a_kT_k(\tilde z),\qquad \mathcal{R}_{\mathrm{an}}=\sum_{k=1}^{K}\max\!\left(0,\log|a_k|+\rho k-\log A\right)^2$$
$$\sup_{z\in I}|g^{(n)}(z)|\leq CR^nM_n\ \text{and}\ \sum_{n=1}^{\infty}M_n^{-1/n}=\infty\quad\Longrightarrow\quad g=0\ \text{on a positive-measure set}\ \Rightarrow\ g\equiv0$$

Mathematical statement

For an exact-symplectic twist map with generating function S, the paper defines the minimal action function by \(\beta_T(\omega)=\lim_{n\to\infty}(2n)^{-1}\sum_{k=-n}^{n-1}S(x_k,x_{k+1})\), where \((x_k)\) is a minimal configuration of rotation number \(\omega\). The rigidity mechanism is that sufficiently regular, quasi-analytic functions cannot vanish on a positive-measure set without vanishing identically. Implement this with a response \(f_\theta(z)=\sum_{k=0}^{K}a_kT_k(\tilde z)\), where \(T_k\) are Chebyshev polynomials and \(\tilde z\in[-1,1]\) is the normalized parameter. A practical analytic-class constraint is \(|a_k|\leq A\exp(-\rho k)\), corresponding to analyticity in a Bernstein ellipse; a more general Denjoy–Carleman constraint is \(\sup_z|f_\theta^{(n)}(z)|\leq CR^nM_n\) with \(\sum_{n\geq1}M_n^{-1/n}=\infty\). Under the exact quasi-analytic assumptions, if the difference of two responses vanishes on a positive-measure set, it must vanish throughout the connected interval. The neural analogue predicts that anchor residuals and held-out residuals should become coupled as the spectral or derivative constraint is strengthened.

Implementation notes

Use this as the final scalar or low-dimensional conditioning head of a neural operator, world model, or MLP that predicts a response y from an input context c and a continuous parameter z, such as time horizon, physical coefficient, control frequency, or data-corruption level. Encode c with the usual backbone, map it to Chebyshev coefficients a_0,...,a_K, and evaluate the output with Clenshaw's recurrence rather than a second unconstrained MLP. Normalize z to [-1,1]. Pseudocode: compute h=backbone(c); a=head(h); y=sum_k a[k]*T_k(z); loss=L_data(y,y_true)+lambda*R_an, where R_an penalizes coefficients above A exp(-rho k). Estimate A and rho from the training split or cross-validation; they are not supplied by the theorem. For a stronger test, use automatic differentiation at random z values to estimate derivative bounds and add penalties for violations of |f^(n)| <= C R^n M_n for n=1,...,N. The paper contributes the positive-measure-to-global-identification mechanism and the beta-function motivation; coefficient decay and finite-order penalties are engineering relaxations. First experiment: fit beta-like synthetic curves generated from analytic functions, and compare an unconstrained MLP, Fourier head, and Chebyshev head on one-dimensional parameter continuation. Train only on several disjoint intervals whose union has positive measure and evaluate dense held-out points. The falsifiable prediction is a sharp regularization transition: once rho is large enough that high-order coefficients decay exponentially, held-out error should fall together with anchor error; below this threshold an unconstrained model can interpolate anchors while retaining large off-anchor error. In a noiseless experiment, two constrained heads trained to agree on the same positive-measure anchor set should have sup-norm disagreement outside that set decreasing approximately exponentially with K, whereas unconstrained heads need not agree. With noisy labels, the exact rigidity claim should fail and the experiment should reveal an optimal finite rho rather than monotonic improvement.

Verification

This idea has not been verified yet.

Verification happens in two stages: Stage 1 — a mechanism check on a toy system confirms the claimed mathematical phenomenon reproduces; Stage 2 — a benchmark implements the idea on a real (small) neural network task and compares it against a tuned baseline over 8 paired seeds with a permutation test.

Artifacts

Artifacts unavailable.