The Koornwinder--Kostenko--Teschl Conjecture for Jacobi Polynomials and the Discrete Laguerre Phase Transition
arXiv:2608.30486
2026
Architecture
1 ideas extracted · analyzed Sep 1, 2026
What the math gives to ML
The paper proves a sharp, dimension-free sup-norm bound for a carefully normalized Jacobi-polynomial feature, together with decay guarantees for a related discrete Laguerre evolution. The transferable asset is the normalization that makes every feature uniformly bounded by an explicit degree- and parameter-dependent constant. This can support polynomial positional or spectral features whose amplitudes cannot grow with degree, reducing activation and gradient instability compared with raw polynomial expansions. The most direct test is a Jacobi-feature layer replacing unbounded learned polynomial embeddings or high-degree spectral filters.
Ideas from this paper
Unverified
2026
Replace raw powers or unconstrained polynomial spectral features with normalized Jacobi features whose amplitude is provably bounded on the entire input interval. Use trainable mixtures of these features in a positional encoding, graph spectral layer, or MLP front end, while preserving the theorem's normalization and optionally constraining the learned mixture norm.
Useful5/10
Difficulty4/10
Novelty7/10