Unverified 2026

Osgood-Calibrated Residual Step Size

Implementation & benchmark of arXiv:2608.08337 — Quantitative Osgood regularity for DiPerna--Lions flows

Usefulness6/10
Difficulty5/10
Novelty7/10

Source paper: Quantitative Osgood regularity for DiPerna--Lions flows arXiv:2608.08337 ⓘ · analyzed Sep 1, 2026

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

Idea description

Use the Osgood transform as a controller for adaptive residual-layer step sizes. Instead of choosing a fixed residual scale or requiring every block to have a small operator norm, reduce the step only when the predicted transformed pairwise distance consumes too much regularity budget.

Formulas

$$G\bigl(|\boldsymbol X(t,x)-\boldsymbol X(t,y)|\bigr)\leq G\bigl(|\boldsymbol X(s,x)-\boldsymbol X(s,y)|\bigr)+\int_s^t\bigl(k(\tau,x)+k(\tau,y)\bigr)\,\mathrm d\tau.$$
$$z^{\ell+1}=z^\ell+\eta_\ell f_{\theta_\ell}(z^\ell),\qquad r_\ell=\|z_i^\ell-z_j^\ell\|_2.$$
$$\eta_\ell=\min\left(\eta_{\max},\ \frac{G_\omega(r_\ell)+\delta-G_\omega(r_\ell^{\mathrm{trial}})}{a_{ij,\ell}+\epsilon}\right),\qquad r_\ell^{\mathrm{trial}}=\|z_i^\ell+\eta_{\max}f(z_i^\ell)-z_j^\ell-\eta_{\max}f(z_j^\ell)\|_2.$$
$$G_\omega(r)=\int_{r_0}^{r}\frac{du}{\omega(u)},\quad \omega(r)=r\left[1+\alpha\log\left(\frac{R}{r+\epsilon}\right)\right].$$

Mathematical statement

For two trajectories of the paper's flow, the quantity $G(r)$ converts a nonlinear distance-growth law into an additive bound: $G(r_t)\le G(r_s)+\int_s^t(k_x+k_y)\,d\tau$. The function $G$ is increasing and diverges to $-\infty$ at zero, so small separations remain controlled whenever accumulated distortion is finite. For a discrete residual update $z^+=z+\eta f_\theta(z)$, define $r^+=\|z_i^+-z_j^+\|_2$, estimate $a_{ij}=\|J_f(z_i)v\|/\|v\|+\|J_f(z_j)w\|/\|w\|$, and impose the discrete analogue $G_\omega(r^+)-G_\omega(r)\le\eta a_{ij}$. The controller chooses the largest safe $\eta$ satisfying this inequality up to tolerance $\delta$.

Implementation notes

Modify the residual scaling parameter, layer-drop controller, or continuous-depth solver rather than the optimizer update. Maintain a small calibration set of pairwise hidden states from each minibatch. Before applying block $\ell$, run a cheap trial with the current maximum step $\eta_{\max}$, compute $r_\ell$ and $r_\ell^{\mathrm{trial}}$ for each selected pair, and estimate $a_{ij,\ell}$ using one Hutchinson probe per endpoint. Use $\eta_\ell=\min(\eta_{\max},[G_\omega(r_\ell)+\delta-G_\omega(r_\ell^{\mathrm{trial}})]/(a_{ij,\ell}+\epsilon))$, clipped to $[\eta_{\min},\eta_{\max}]$. If the numerator is negative, halve $\eta$ and recompute the trial; if the budget is comfortably unused for several blocks, increase the next step by a factor such as $1.1$. Use a lookup table for $G_\omega$ and stop gradients through the controller initially, so it acts as a deterministic runtime policy. The mathematical component is the additive transformed-distance budget; empirical components are pair selection, probe-based Jacobian estimates, and safety margins. Start with a 32-layer residual MLP or small CIFAR ResNet, comparing fixed $\eta$, standard adaptive gradient clipping, and spectral normalization. Record accepted step sizes, number of trial evaluations, training loss at equal wall-clock time, gradient-norm spikes, and test accuracy under input perturbations. The hypothesis is that the controller permits larger average residual steps in smooth regions while preventing rare unstable expansions, producing faster loss descent and fewer divergence events.

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.