AI & ML






A note on the learning coefficient of exceptional singularities
arXiv stat.TH0 views
arXiv:2611.25863v1 Announce Type: cross Abstract: We compute the learning coefficient of a polynomial neural network at a point of its neurovariety all of whose real parameters are good, and show that it equals $d/2$, with multiplicity one, where $d$ is the difference between the dimension of the parameter space and the dimension of the group of symmetries of the architecture. This is the value attained at a generic point of the neurovariety; consequently, exceptional singularities are invisible to the pair $(\lambda,\theta)$ whenever all real parameters in their fibre are good. By contrast, at a full parameter in the interior of the parameter domain whose differential has non-maximal rank we show that $\lambdaSource:https://arxiv.org/abs/2611.25863
PreviousAdaptive Tests of Pricing Restrictions with Observed and Latent FactorsNextCausal Effect Estimation Under Uncertain Statistical Surrogacy
Related posts
Hydra · Coeziune OM–IA — the complete DOI registry (2026-11-20): 8 published works
0dev.to OpenSource
Stop Renting Cloud GPUs & VPS: 4 Legitimate Free Compute Tiers in 2026 (Plus Billing Pitfalls)
0dev.to OpenSource
How to Decode a Wall of Wingdings Without a Key
0dev.to Programming
Beyond the Hype: How Modern Businesses Can Actually Benefit from AI Today
0dev.to Programming
How to Free Up Space on Android Without Deleting Anything
0dev.to Programming

All my git repos in one file: manage them day to day, rebuild them on a new machine
0dev.to Git
show = false, 2600)"
x-show="show" x-cloak x-transition.opacity.duration.200ms
class="fixed bottom-8 left-1/2 z-[80] -translate-x-1/2 rounded-lg border border-line bg-card px-4 py-2.5 text-sm text-heading shadow-card-hover"
role="status" aria-live="polite">