Bernstein Functions at Work: Coalescents, Copulas, and Subordination

arXiv:2607.04467 2026 Architecture 1 ideas extracted · analyzed Aug 29, 2026

What the math gives to ML

The paper supplies constructive Laplace-transform certificates for positivity and monotonicity: Bernstein functions are positive mixtures of exponential increments, while special Bernstein functions have reciprocal transforms whose potential density is nonincreasing. This suggests replacing unconstrained distance- or lag-dependent neural kernels with finite completely monotone mixtures, giving a learnable multiscale component with guaranteed nonnegative weights and monotone decay. The most practical first transfer is a stable attention or state-space decay kernel whose parameters are learned in log-space and whose positivity and monotonicity are guaranteed by construction rather than encouraged by a penalty.

Ideas from this paper

Unverified 2026

Completely Monotone Multiscale Attention Decay

Parameterize a relative-position or lag-decay function as a finite positive mixture of exponentials instead of learning arbitrary attention bias values. The resulting kernel is completely monotone on positive distances, so it is nonnegative, decreasing, and has alternating derivative signs; the mixture provides several learned memory scales without allowing oscillatory or unstable long-range biases.

Useful6/10
Difficulty4/10
Novelty7/10
Paper: Bernstein Functions at Work: Coalescents, Copulas, and Subordination arXiv:2607.04467