Hardy-Szegő Point Processes: Large Deviations and Strong Szegő Asymptotics

arXiv:2608.17509 2026 Architecture 1 ideas extracted · analyzed Sep 1, 2026

What the math gives to ML

The paper provides an explicit conformally invariant determinantal point process whose kernel produces strong repulsion while remaining translation-invariant in the horizontal coordinate. The transferable asset is not the Hardy–Szegő zero process itself, but the positive-definite complex kernel and its determinant-based diversity geometry, which can turn token selection or attention routing into a repulsive subset-selection problem. A practical first transfer is a quality-weighted determinantal router that favors useful tokens while suppressing redundant tokens, with greedy Schur-complement selection or Nyström approximations controlling the determinant cost.

Ideas from this paper

Unverified 2026

Hardy–Szegő Repulsive Token Router

Replace independent top-k token selection by a quality-weighted determinantal subset objective based on the Hardy–Szegő kernel. Tokens with high learned quality are preferred, but geometrically redundant tokens have a small determinant contribution, encouraging diverse sets of routed experts, retrieved items, or attended context tokens.

Useful6/10
Difficulty6/10
Novelty5/10
Paper: Hardy-Szegő Point Processes: Large Deviations and Strong Szegő Asymptotics arXiv:2608.17509