Defect-Regularized Particle Optimizer
Implementation & benchmark of arXiv:2608.11486 — Stability of Finite-Batch Particle Mean-Field Variational Inference Beyond Strong Convexity
Source paper: Stability of Finite-Batch Particle Mean-Field Variational Inference Beyond Strong Convexity arXiv:2608.11486 ⓘ · analyzed Sep 1, 2026
AI-generated research hypothesis, automatically tested. Not peer-reviewed.
Idea description
Train a small ensemble of parameter particles with stochastic gradients while penalizing excessive pairwise curvature defect. The ensemble acts as a low-cost variational or exploration population, and the defect penalty discourages particle pairs from entering strongly noncontractive regions without requiring the neural loss to be globally convex.
Formulas
Mathematical statement
The paper's defect d_alpha(x,y) measures how far the secant monotonicity of a smooth potential falls below nominal lower curvature alpha: d_alpha(x,y) = [alpha||x-y||^2 - <grad V(x)-grad V(y),x-y>]_+. For particles theta_i and theta_j, a small defect means their gradient dynamics have a contractive component; a large defect is the explicit additive error in the squared-distance recursion ||theta_i^+-theta_j^+||^2 <= (1-2h alpha+h^2 L^2)||theta_i-theta_j||^2 + 2h d_alpha(theta_i,theta_j). Here P is the number of particles, theta_i is the parameter vector of particle i, g_i is its stochastic gradient, alpha is a chosen nominal curvature, h is the particle learning rate, and L is a gradient-Lipschitz bound or estimate. The regularizer averages a normalized empirical version of this defect over randomly sampled pairs. It is a soft stability regularizer and does not assume that the neural loss is globally strongly convex.
Implementation notes
Use this as a particle-based optimizer or compact ensemble with P=4 to 16 independently initialized parameter copies. At every training step, draw one minibatch per particle, compute stochastic gradients g_i = grad_theta L_Bi(theta_i), and update theta_i <- theta_i - h g_i. Select K random particle pairs from the P(P-1)/2 possible pairs. For each pair compute delta_ij = theta_i-theta_j and q_ij = alpha||delta_ij||^2 - dot(g_i-g_j,delta_ij). Accumulate max(0,q_ij)/(alpha||delta_ij||^2+epsilon) as the empirical defect loss. The lowest-cost version treats g_i and g_j as detached tensors and uses the defect only to adapt h or trigger particle repulsion; a differentiable regularizer requires higher-order autodiff and should initially be applied to only one or two pairs per step. A practical alternative is a shared-direction estimator: evaluate gradients at theta_i and theta_i + rho u, then use those two points in the same formula. Initialize alpha from the median positive directional secant, alpha = median(dot(g(theta+rho u)-g(theta),rho u)/rho^2), clipped to [1e-6,1]. Set lambda so the defect term is initially 1-10% of the supervised loss, and optionally reduce h when the batch-average defect exceeds a threshold. The paper supplies the defect definition and its additive effect on pairwise Euler stability; pair sampling, detached gradients, and lambda selection are engineering approximations. First test on CIFAR-10 with a four-particle CNN, comparing independent SGD, SWA, and ordinary deep ensembles at equal total examples and parameter-update FLOPs. Measure mean accuracy, ensemble negative log-likelihood, calibration error, pairwise parameter distance, loss-spike frequency, and wall-clock cost. Success means lower validation NLL or better calibration at matched accuracy with no more than 10% extra overhead. Failure is particle collapse, excessive higher-order autodiff cost, or no improvement over independent training.
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.