Fractal Uncertainty and Quantitative Uniqueness for the Fourier Bessel Transform
arXiv:2608.15126
2026
Regularization
1 ideas extracted · analyzed Sep 1, 2026
What the math gives to ML
The paper proves a quantitative uncertainty principle for the Fourier–Bessel transform: a function cannot have most of its energy concentrated on a spatial set and simultaneously have its transform concentrated on a sufficiently separated regular frequency set. The transferable asset is the explicit scale-dependent suppression factor h^beta, not the specific Bessel transform. A practical neural-network adaptation is a multiscale spectral regularizer that penalizes hidden states or attention outputs when they are simultaneously localized on irregular token subsets and narrow frequency bands. This is an empirical discrete analogue of the theorem and should be tested primarily for robustness and prevention of representation collapse.
Ideas from this paper
Unverified
2026
Add a multiscale penalty to transformer token-mixing activations when they are simultaneously concentrated on a spatial or token subset and on a separated, irregular frequency subset. The penalty uses the fractal uncertainty scaling law to discourage hidden states from collapsing onto narrow token patterns and narrow spectral bands, potentially improving robustness to token masking and frequency-corrupted inputs.
Useful6/10
Difficulty5/10
Novelty7/10