Unverified 2026

Følner Block-Replacement Curriculum

Implementation & benchmark of arXiv:2607.16994 — Entropy Density of Uniquely Ergodic Measures for Full Shifts over Amenable Residually Finite Groups

Usefulness5/10
Difficulty4/10
Novelty7/10

Source paper: Entropy Density of Uniquely Ergodic Measures for Full Shifts over Amenable Residually Finite Groups arXiv:2607.16994 ⓘ · analyzed Aug 30, 2026

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

Idea description

Construct augmented sequences by tiling long contexts with large finite blocks sampled from a library whose local-pattern frequencies match a target dataset, replacing only block interiors and leaving boundary zones untouched. This produces globally coherent synthetic contexts while controlling the distortion of short-range statistics through an explicit boundary-to-volume ratio.

Formulas

$$\operatorname{Int}_{D}(F_Lh)=\{g\in F_Lh:Dg\subset F_Lh\},\qquad q_{L,w}(c)=\frac{1}{|F_L|}\left|\left\{a\in F_L:D_wa\subset F_L,\ c_{da}=w_d\ \forall d\in D_w\right\}\right|.$$
$$\left|\widehat q_{n,w}(x;g)-\widehat q_{n,w}(x;g')\right|\le 2(\varepsilon+2\eta),\qquad n\ge N.$$
$$\eta_{\mathrm{aug}}(w)\lesssim \eta_{\mathrm{lib}}(w)+\frac{|\partial_{D_w}F_L|}{|F_L|}+\frac{|\partial_{F_KF_K^{-1}}F_n|}{|F_n|},\qquad \partial_D S=S\setminus\operatorname{Int}_D(S).$$

Mathematical statement

Let G be an index group, F_n a finite Følner tile, D_w the support of a local pattern w, and x a symbolic sequence. For a translated block S = F_L h, the D-interior is Int_D(S) = {g in S : Dg is contained in S}; patterns are evaluated only there so that they do not cross block boundaries. For a block c in A^(F_L), its interior frequency is q_(L,w)(c) = |F_L|^(-1) times the number of a in F_L such that D_w a is contained in F_L and c_(d a) = w_d for every d in D_w. If frequencies of fundamental blocks are pairwise epsilon-close and the large window is sufficiently invariant under L = F_K F_K^(-1), the paper bounds translated-window frequency differences by 2(epsilon + 2 eta). In the neural version, the total local-statistic error is predicted to be the library mismatch plus terms proportional to the fraction of sites near block boundaries.

Implementation notes

1. Integration point: use this as an offline augmentation and curriculum stage for causal Transformers, RNNs, or state-space models. Begin with sequences from a training corpus and choose a block length L. Extract length-L blocks and characterize them by empirical frequencies of short patterns w, such as token n-grams, discretized time-series windows, or vector-quantized symbol patterns. Build a library whose pattern frequencies are within epsilon of the target corpus statistics. 2. Pseudocode: sample a long context F_n g; partition its interior into F_L blocks; for every block, retrieve or sample a replacement block from the library conditioned on its coarse frequency class; copy replacement tokens only on Int_(D_w)(F_L h); preserve the original tokens on the boundary; concatenate the tiles; train on both original and augmented contexts. Increase L during the curriculum. 3. Estimate q_(L,w), library mismatch eta_lib, and boundary fractions directly from data. For ordinary sequences use G = Z, F_L = {0,...,L-1}; the boundary has width approximately equal to the pattern diameter. The paper supplies the tiling and error-propagation mechanism, while retrieval and conditioning are empirical choices. 4. First experiment: train a small two-layer causal Transformer on WikiText-2 and on binary Markov sequences, comparing contiguous minibatches, random token permutation, and this augmentation. Measure n-gram frequency error and validation loss versus L. The quantitative prediction is an approximately 1/L decrease in local-statistic distortion for one-dimensional sequences, with discrepancy bounded by eta_lib plus approximately 2 times the pattern diameter divided by L. Test whether the measured error follows this slope within 20 percent and whether training becomes unstable when the bound is violated.

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.