# Distributional Gradient-Flow Memory

- ID: 638
- Canonical URL: https://synthcore.org/idea/638/distributional-gradient-flow-memory
- API JSON: https://synthcore.org/api/idea/638.json
- API Markdown: https://synthcore.org/api/idea/638.md
- Verification status: mech_ok_no_baseline
- Source: [arXiv:2607.09416](https://arxiv.org/abs/2607.09416)
- Category: dynamics
- Solves: stability, generalization, accuracy
- ML areas: optimizer, training-dynamics, regularization
- Math tags: dynamical-systems, optimization, statistical-mechanics, probability
- Ratings: usefulness 7/10; difficulty 6/10; novelty 8/10

## Idea description

Replace a single scalar optimizer memory per parameter block with a small occupancy distribution whose bins represent distinct relaxation or gradient-history regimes. Train this state using a conservative redistribution operator and an energy-decreasing correction, allowing the optimizer to represent non-equilibrium lag and hysteresis that cannot be captured by one momentum variable.

## Mathematical statement

The paper treats \(g(r,\mathbf{x},t)\in[0,1]\) as the irreducible state outside the quasi-static limit and writes its evolution as a balance between transport, redistribution, and source terms. Its kinetic dynamics are an Onsager gradient flow, \(\partial_t g=-\mathcal{M}(g)\delta\mathcal{F}/\delta g\), with nonnegative mobility \(\mathcal{M}\) and \(d\mathcal{F}/dt\le0\) in the unforced case. Transfer this by storing occupancies \(g_{k,j}\) over \(J\) bins for parameter block \(k\), with bin coordinate \(r_j\) representing gradient magnitude or optimizer relaxation scale. A conservative Markov redistribution matrix \(C\) preserves total occupancy, while the free-energy-like functional \(F=\sum_{k,j}g_{k,j}(\log g_{k,j}-1)+\lambda\sum_{k,j}g_{k,j}E_{k,j}\) penalizes diffuse and high-cost states. The correction must satisfy \(\Delta F\le0\) when gradients are held fixed.

## Key formulas

- $$\frac{\partial g}{\partial t}=\mathcal{C}[g]-\mathcal{E}[g]-\mathcal{T}[g],\qquad \frac{\partial g}{\partial t}=-\mathcal{M}(g)\frac{\delta \mathcal{F}}{\delta g}$$
- $$\mathcal{F}[g]=\sum_{k,j}g_{k,j}\left(\log(g_{k,j}+\varepsilon)-1\right)+\lambda\sum_{k,j}g_{k,j}E_{k,j},\qquad \frac{d\mathcal{F}}{dt}=-\sum_{k,j}M_{k,j}\left(\frac{\partial\mathcal{F}}{\partial g_{k,j}}\right)^2\le0$$
- $$g_{t+1}=\Pi_{\Delta}\left[g_t+\rho(C_t-I)g_t-\rho M_t\nabla_g\mathcal{F}(g_t)\right],\qquad \sum_jg_{k,j}=1$$

## Implementation notes

Use this as a plug-in optimizer state for a small number of parameter blocks rather than every scalar weight initially. For each block \(k\), create \(J=8\) or 16 nonnegative bins \(g_k\), with logarithmically spaced coordinates \(r_j\) representing gradient magnitude or estimated relaxation time. At each minibatch, compute the block gradient norm \(u_k\) and softly deposit unit mass into nearby bins using a Gaussian kernel; this is the forcing/source term. Apply a nearest-neighbor redistribution matrix \(C_k\) with nonnegative off-diagonal entries and columns summing to one, then apply the entropy-plus-energy gradient in the displayed formula. Project onto the probability simplex after every state update. Construct the parameter update as a bin-weighted sum of step sizes: \(d_k=-\sum_jg_{k,j}\eta_j\widehat g_k\), where \(\eta_j\) is larger for fast bins and smaller for slow bins. During a gradient-hold diagnostic, disable source deposition and verify that the free-energy functional decreases; damp or reject any state update violating this condition. The paper supplies the distribution-valued state, conservative kinetic balance, and Onsager Lyapunov condition; the matrix, energy values, and deposition kernel are empirical design choices. First test on a 2-layer MLP and CIFAR-10 against SGD with momentum, AdamW, and an 8-bin version without energy correction. Alternate large- and small-noise training phases. The predicted signature is hysteresis: after returning to the original forcing, effective step size depends on the preceding phase, and the small-cycle loop area should scale as \(H\propto I^2\), where \(I\) is forcing amplitude.

## Verification

- Status: mech_ok_no_baseline
- Mechanism evidence: yes
- Mechanism confirmed: yes
- Practical verdict: inconclusive
- Verdict: Built an 8-bin distributional-memory optimizer with conservative nearest-neighbor redistribution, Gaussian gradient deposition, entropy-plus-energy correction, simplex projection, and energy-decrease rejection. Three toy predictions were confirmed: the local stability boundary rho*=2/J=0.25 matched the observed transition, equilibria matched softmax(-lambda E) with L1 error <=1.2e-5, and all 300 source-free correction trials decreased free energy. The optimizer did not produce a learning win on seeded digits: it reached 80.44% versus SGD 95.11% and AdamW 94.00%, so the mechanism is validated but the chosen training design is not competitive.

### Mechanism check

- Verdict: Built an 8-bin distributional-memory optimizer with conservative nearest-neighbor redistribution, Gaussian gradient deposition, entropy-plus-energy correction, simplex projection, and energy-decrease rejection. Three toy predictions were confirmed: the local stability boundary rho*=2/J=0.25 matched the observed transition, equilibria matched softmax(-lambda E) with L1 error <=1.2e-5, and all 300 source-free correction trials decreased free energy. The optimizer did not produce a learning win on seeded digits: it reached 80.44% versus SGD 95.11% and AdamW 94.00%, so the mechanism is validated but the chosen training design is not competitive.
- Confidence: 8/10
- Limitations: Only a small 2-layer MLP on sklearn digits was tested, not CIFAR-10 or multiple seeds. Hysteresis and the proposed loop-area scaling H proportional to forcing amplitude squared were not tested. The stability sweep tests the local source-free Euler correction, while the full optimizer includes forcing and empirical hyperparameters; no FLOP-normalized or wall-clock comparison was performed.

### Practical benchmark

- Paired seeds: 8
- Baseline mean: 0
- Idea mean: 0
- p-value: 0.2047
- Paired wins: 3/8
- Benchmark verdict: no significant win

## Artifacts

- [bench_experiment.py](https://synthcore.org/code/286/bench_experiment.py)
- [bench_report.json](https://synthcore.org/code/286/bench_report.json)
- [experiment.py](https://synthcore.org/code/286/experiment.py)
- [report.md](https://synthcore.org/code/286/report.md)
- [report_bench_2026-08-31T001540.md](https://synthcore.org/code/286/report_bench_2026-08-31T001540.md)
- [results.json](https://synthcore.org/code/286/results.json)
- [Download all files as ZIP](https://synthcore.org/download/286)

## Disclaimer

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