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
Why an Embedded Game Fails on Some Phones, and How to Debug It
0dev.to
Microsoft 365 vs Office 2024: The Break-Even Math
0dev.to
Master AI Evals: Build Reliable, Scalable Model Evaluation Pipelines
0dev.to
What to give someone who misses a place
0dev.to
Google is pushing OEMs against GrapheneOS and bootloader unlocking
0Hacker News
VESTA: Visual Exploration with Statistical Tool Agents
0arXiv stat.CO
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">