Hölder regularity and Harnack inequality for the logarithmic Laplacian
arXiv:2608.07315
2026
Regularization
1 ideas extracted · analyzed Aug 31, 2026
What the math gives to ML
The paper introduces the logarithmic Laplacian, a nonlocal operator with a scale-free kernel proportional to |z|^{-n}, a local compensation term, and a dimension-dependent zeroth-order coefficient. This provides a principled multiscale regularizer for spatial feature maps or ordered token embeddings, potentially avoiding the strong local oversmoothing induced by an ordinary Laplacian. The most direct experiment is to penalize the squared logarithmic-Laplacian response of intermediate representations and compare it against standard nearest-neighbor smoothness penalties at matched computational and gradient budgets.
Ideas from this paper
Unverified
2026
Add a nonlocal logarithmic-Laplacian penalty to intermediate spatial feature maps or ordered token embeddings. Unlike a standard graph or image Laplacian, the kernel uses scale-free weights proportional to |z|^{-n} and includes a local compensation term, allowing multiscale feature smoothing without simply forcing nearby features to become identical.
Useful5/10
Difficulty5/10
Novelty7/10