The standard geometric derivation of neural scaling exponents takes the intrinsic dimension of a data manifold as its input. On modular addition in $\mathbb{Z}_p$ that derivation has no input. The exact algebraic solution is an orbit of $\mathbb{Z}_p$ acting by isometries. Transitivity alone makes the ratio statistic underlying the standard dimension estimator a point mass, so the estimator is undefined, and here the two nearest neighbour distances coincide exactly. Breaking the symmetry at scale $\epsilon$ returns a number, but one that tracks $1/\epsilon$ with no scale free plateau. We show that the failure is general, since on any finite orbit of a group acting by isometries the estimator reports the resolution at which the set is probed rather than a dimension. What replaces the power law is exponential in hidden width, $L(h)=L_\infty+A\exp(-c\,h^{\alpha})$, with $R^2$ between 0.982 and 0.995 against 0.857 to 0.906 for a power law admitting the same floor and fitted under the same protocol. Where the data supply is sufficient the rate belongs to the regulariser rather than to the group, since weight decay moves $c$ by a factor of 47 while group order moves it by 1.10, a residual below seed to seed resolution, for every fixed $\alpha$ between 0.75 and 2. The critical width falls with group order rather than rising, against capacity counting that assigns a fixed number of neurons to each irreducible representation.
We study one-dimensional Jacobi operators of divergence-gradient type on $\ell^2(\mathbb{Z}_{\geq 0})$, with coefficients generated by the doubling map, $a_n(x)=a(2^n x \mathrm{mod} 1)$. For continuous positive sampling functions, we show that the almost-sure essential spectrum is an interval containing the bottom of t...
A regular observed statistical model may converge to a limit in which a previously identifiable signed parameter becomes identifiable only modulo a reflection. We study the local information geometry of this transition. For a twice differentiable Hellinger embedding with an exact limiting reflection, the observed displ...
We study the equilibrium structure and long-time behavior of a nonlinear Fokker--Planck equation with diffusion and nonlocal interactions generated by squared simplex volumes. For $1\leq n<d$, the stationary states are isotropic Gaussian measures, and every solution converges to the equilibrium determined by its conser...
We establish the large-$n$ asymptotics of Hankel determinants for unitary random matrix ensembles possessing a higher-order edge singularity. We focus on ensembles where the equilibrium measure is supported on a single interval and the limiting eigenvalue density vanishes to order $2k+\frac{1}{2}$ for $k \in \mathbb{N}...
We study nearest-neighbour distances and strict best returns of cyclic orbits on $(V\times G)/\Lambda$, where $V$ is a finite-dimensional real normed space, $G$ has a bi-invariant ultrametric, and $\Lambda$ is an arbitrary closed subgroup. For the quotient of the maximum product metric, the number of distinct nearest-n...
We investigate the geometric fluctuations of principal subspaces for high-dimensional covariance matrices through the squared Frobenius $\sin\Theta$ distance between the sample and population eigenspaces associated with the $r_p$ largest eigenvalues. An explicit first-order expansion and a central limit theorem are est...
Yan-Ling Hu, Xiao Han, Qing Yang· 0 citations
Related blog posts
MIT News · Artificial Intelligence· news.mit.eduNov 6, 2026
A machine-learning approach called CheMeleon provides a practical way to develop new drugs or other molecules with much less detailed, expensive experimentation.
Learn how Google DeepMind and GovTech Singapore uses lightweight on-device Gemma models to intercept conversational scams in private chats with zero cloud data egress.