{
 "artifacts": null,
 "category": "regularization",
 "description": "Replace a fixed discrete augmentation distribution over a finite symmetry group by a continuous-time random walk driven by learnable symmetric Poisson jump rates. Use the resulting transformed-example distribution as a symmetry regularizer, with an even ℓ^{2m} distance to uniformity whose behavior is guaranteed to improve monotonically as the symmetric rates increase for the group families covered by the paper.",
 "formulas_latex": [
  "$$\\frac{dq_t^{\\boldsymbol{\\lambda}}(g)}{dt}=\\sum_{s\\in G}\\lambda_s\\left[q_t^{\\boldsymbol{\\lambda}}(gs^{-1})-q_t^{\\boldsymbol{\\lambda}}(g)\\right],\\qquad q_0^{\\boldsymbol{\\lambda}}(g)=\\mathbf{1}[g=e].$$",
  "$$\\left\\|q_t^{\\boldsymbol{\\lambda}}-u\\right\\|_{2m}=\\left(\\sum_{g\\in G}\\left|q_t^{\\boldsymbol{\\lambda}}(g)-\\frac{1}{|G|}\\right|^{2m}\\right)^{1/(2m)},\\qquad u(g)=\\frac{1}{|G|}.$$",
  "$$\\lambda_s=\\lambda_{s^{-1}},\\quad \\lambda'_s\\geq\\lambda_s\\ \\Longrightarrow\\ \\left\\|q_t^{\\boldsymbol{\\lambda}'}-u\\right\\|_{2m}\\leq\\left\\|q_t^{\\boldsymbol{\\lambda}}-u\\right\\|_{2m},$$",
  "$$\\mathcal{L}_{\\mathrm{inv}}=\\frac{1}{B|G|}\\sum_{b=1}^{B}\\sum_{g\\in G}\\left\\|h_\\theta(g\\cdot x_b)-\\frac{1}{|G|}\\sum_{r\\in G}h_\\theta(r\\cdot x_b)\\right\\|_2^2,\\qquad \\mathcal{L}=\\mathcal{L}_{\\mathrm{task}}+\\eta\\mathcal{L}_{\\mathrm{inv}}.$$"
 ],
 "id": 2768,
 "implementation": "Integrate the method at the data-augmentation and representation-regularization boundary, not inside the attention matrix. Choose a small finite transformation group with cheap exact actions, initially the dihedral group D4 of rotations and reflections of a square image patch. Store one nonnegative rate for each transformation and tie inverse elements by setting lambda[s]=lambda[inverse(s)]. For each training example x, sample a short continuous-time walk: draw N from Poisson(tau times sum_s lambda[s]), then draw each jump independently with probability lambda[s]/sum_r lambda[r], and apply the transformations in sequence to obtain the final transform g*x. Optionally retain all visited states as augmented views. Encode the transformed views h_theta(g*x), subtract their mean over g, and add L_inv to the task loss. Also compute the empirical endpoint histogram q_hat(g) over sampled group states and the diagnostic M_2m=sum_g abs(q_hat(g)-1/|G|)^(2m). Parameterize rates as lambda[s]=softplus(a[s])+epsilon and enforce inverse tying after every optimizer step. Use a schedule in which tau, or all symmetric rate pairs, only increases. The mathematical quantities taken directly from the paper are the Poisson generator, inverse-symmetric rate constraint, and even-norm monotonicity; the feature penalty and Monte Carlo estimator are neural-network adaptations. First test on CIFAR-10 with a small ResNet-18, comparing ordinary random D4 augmentation, fixed uniform D4 augmentation, and learned-rate group diffusion at equal augmentation calls. Measure clean accuracy, transformed-test accuracy, calibration, M_2m versus tau, and training variance. A successful result is improved D4 robustness or accuracy at equal compute, no optimization instability as tau increases, and a nonincreasing empirical M_2m curve.",
 "math_summary": "For a finite group G with identity e, each group element s has a nonnegative Poisson-clock rate λ_s, and independent clocks produce a right-multiplicative continuous-time walk X_t^λ: starting from e, every ring of clock s changes the state x to xs. The rate vector is λ=(λ_s)_{s∈G}; symmetry means λ_s=λ_{s^{-1}}. If q_t^λ(g)=P[X_t^λ=g], then q_t is a distribution on G and its distance to uniform u(g)=1/|G| is ||q_t-u||_{2m}=(Σ_{g∈G}|q_t(g)-1/|G||^{2m})^{1/(2m)}. The paper proves that for generalized dihedral, dicyclic, and generalized quaternion groups, including D_n, this distance is monotonically nonincreasing in every symmetric rate coordinate at fixed t. The implementable generator is dq_t(g)/dt=Σ_{s∈G}λ_s[q_t(gs^{-1})-q_t(g)], with q_0(g)=1[g=e]. We use the theorem's structural property by increasing rates only along inverse-paired transformations and monitoring an even-power uniformity penalty; the theorem directly guarantees monotonicity for the group-walk distribution, while the representation regularizer remains an empirical neural-network adaptation.",
 "math_tags": [
  "probability",
  "stochastic-processes",
  "algebra",
  "analysis"
 ],
 "ml_areas": [
  "data-augmentation",
  "regularization",
  "sampling"
 ],
 "paper": {
  "arxiv_id": "2608.27708",
  "arxiv_url": "https://arxiv.org/abs/2608.27708",
  "summary_what_math_gives_to_ml": "The paper gives a constructive continuous-time random walk on finite groups, driven by independent Poisson clocks for each group element, and proves a strong rate-monotonicity theorem: for generalized dihedral, dicyclic, and generalized quaternion groups, increasing symmetric jump rates monotonically decreases the distance to uniformity in every even ℓ^{2m} norm. This suggests a symmetry-aware augmentation or feature-mixing process whose strength can be increased without the non-monotone behavior possible for non-even norms. The most credible neural-network transfer is a learnable finite-group augmentation diffusion with an even-power mixing diagnostic and an invariance regularizer.",
  "title": "Proof of the Lyons--White Conjecture",
  "year": "2026"
 },
 "ratings": {
  "difficulty": 5,
  "novelty": 7,
  "usefulness": 5
 },
 "solves": [
  "generalization",
  "stability",
  "sample-efficiency"
 ],
 "title": "Even-Norm Group Diffusion Augmentation",
 "url": "https://synthcore.org/idea/2768/even-norm-group-diffusion-augmentation",
 "verification": {
  "peer_reviewed": false,
  "status": "unverified",
  "status_label": "Unverified",
  "verdict_source": "deterministic test code (paired-seed permutation statistics)"
 }
}