{
 "artifacts": null,
 "category": "regularization",
 "description": "Replace ordinary dropout or soft sparsity penalties on a nonnegative spatial or token activation field with sublinear multiplicative stochastic dynamics. The field receives local diffusion or graph smoothing, while noise amplitude u^gamma vanishes at zero but is relatively strong near zero; this creates an absorbing zero state and may produce exact contiguous inactive regions. The module is suitable for feature maps, graph-node fields, token routing scores, or continuous neural operators.",
 "formulas_latex": [
  "$$\\partial_t u(t,x)=Lu(t,x)+\\sigma(u(t,x))\\xi(t,x),\\qquad u(0,\\cdot)=u_0,$$",
  "$$Lu(t,x)=a(t,x)\\partial_x^2u(t,x)+b(t,x)\\partial_xu(t,x)+c(t,x)u(t,x),$$",
  "$$\\sigma(u)=u^\\gamma\\mathbf{1}_{\\{u\\geq0\\}},\\qquad 0\u003c\\gamma\u003c1,$$",
  "$$u_i^{k+1}=\\Pi_{\\geq0}\\left[u_i^k+\\Delta t\\left(\\kappa(L_Gu^k)_i-\\lambda u_i^k\\right)+\\rho\\,(u_i^k+\\varepsilon)^\\gamma\\sqrt{\\Delta t}\\,\\eta_i^k\\right],\\qquad \\eta_i^k\\sim\\mathcal N(0,1).$$"
 ],
 "id": 3031,
 "implementation": "Integrate the module after a CNN, graph neural network, or transformer routing block whose activations are interpreted as a nonnegative field u in R_+^n. Use a 2D grid Laplacian for image feature maps, a fixed chain or token-neighbor graph for sequences, or the task graph for graph data. First create nonnegative initial values with u^0 = softplus(z), where z is the original learned activation or routing logit. Run K stochastic relaxation steps during training. Let L_G be the symmetric graph Laplacian, kappa be the diffusion strength, lambda be optional decay, rho be the noise scale, gamma be in (0,1), epsilon be a small numerical floor, and Delta t be the step size. At each step sample independent standard Gaussian eta_i^k, calculate the displayed Euler-Maruyama update, and project negative values to zero. To obtain actual computational sparsity, form a mask m_i = 1[u_i^K \u003e tau] after relaxation and either use it in the next layer or use a straight-through estimator during training. Add a mild support cost alpha times the number of active sites, but do not use such a large alpha that the stochastic mechanism is replaced by ordinary L0 regularization. Backpropagate through sampled noise using reparameterization. Measure exact-zero fraction, active support size, connected-component count, gradient variance, and sensitivity to gamma, rho, and initial mass sum_i u_i^0. Start with a small CIFAR-10 CNN and compare against Bernoulli dropout, deterministic graph diffusion, hard-concrete gates, and L1 regularization at matched accuracy. Sweep gamma in {0.25, 0.5, 0.75}. A positive result is at least twice the exact-zero fraction of dropout at equal validation accuracy, or equal accuracy with substantially fewer active sites and lower measured inference FLOPs. A negative result is instability, accuracy collapse, or merely producing small nonzero values without a useful reduction in active computation.",
 "math_summary": "The paper studies the nonnegative stochastic PDE partial_t u(t,x) = L u(t,x) + sigma(u(t,x)) xi(t,x), where u is a scalar field, L = a(t,x) partial_x^2 + b(t,x) partial_x + c(t,x) is a parabolic second-order operator, and xi is space-time white noise. The model coefficient is sigma(u) = u^gamma 1_{u \u003e= 0} for 0 \u003c gamma \u003c 1, with sigma equal to zero at the absorbing boundary. The key boundary property is sigma(u) / u = u^(gamma-1), which diverges as u approaches zero from above, so the stochastic term is large relative to the linear signal scale near zero. The abstract states that sufficiently light-tailed initial data can yield compact support at every positive time even when the initial support is noncompact; finite initial mass suffices for 0 \u003c gamma \u003c= 1/2, while gamma \u003e 1/2 requires a polynomial moment condition whose order grows as gamma approaches 1. In the neural adaptation, u_i is a nonnegative activation on a grid or graph, L_G is a graph Laplacian, eta_i^k is standard Gaussian noise, gamma controls sublinearity, and the Euler-Maruyama discretization is the implementable approximation. Exact compact-support guarantees are not automatic for a finite discretization, so support creation must be tested empirically.",
 "math_tags": [
  "stochastic-processes",
  "pde",
  "probability",
  "dynamical-systems"
 ],
 "ml_areas": [
  "regularization",
  "cnn",
  "graph-nn",
  "moe-routing"
 ],
 "paper": {
  "arxiv_id": "2609.01984",
  "arxiv_url": "https://arxiv.org/abs/2609.01984",
  "summary_what_math_gives_to_ml": "The paper identifies a sparsification mechanism in which sublinear multiplicative noise that vanishes at zero can create compact support instantly, despite diffusion and initially noncompact positive data. The transferable asset is an absorbing-boundary dynamic: near zero, the ratio of noise amplitude to signal amplitude diverges, potentially producing exact zeros rather than merely small values. A practical neural analogue is a nonnegative spatial, graph, or token activation field evolved by short stochastic diffusion steps, then used as a sparse representation or routing mask. The key experiment should compare it against dropout, deterministic diffusion, hard-concrete gates, and L1 sparsity at matched accuracy.",
  "title": "Instantaneous shrinking of supports for stochastic PDEs",
  "year": "2026"
 },
 "ratings": {
  "difficulty": 6,
  "novelty": 8,
  "usefulness": 6
 },
 "solves": [
  "generalization",
  "memory",
  "accuracy"
 ],
 "title": "Noise-Induced Compact-Support Neural Field",
 "url": "https://synthcore.org/idea/3031/noise-induced-compact-support-neural-field",
 "verification": {
  "peer_reviewed": false,
  "status": "unverified",
  "status_label": "Unverified",
  "verdict_source": "deterministic test code (paired-seed permutation statistics)",
  "verification_axes": {
   "benchmark_mechanism": {
    "confirmed": null,
    "tested": false
   },
   "practical_benchmark": {
    "beats_baseline": null,
    "tested": false
   },
   "toy_mechanism_gate": {
    "confirmed": null,
    "tested": false
   }
  }
 }
}