analiza aiqbench
This research investigates the asymptotic storage capacity limits of neural networks when pre-activations are constrained to be real versus complex within a hypothesis class. By leveraging advanced mathematical tools like the Harish-Chandra-Itzykson-Zuber formula, the study provides a robust approximation for these capacity ratios in complex spaces. The findings offer theoretical insights into the fundamental constraints and capabilities of neural architectures operating under specific algebraic conditions.
Shortcomings and capacities of real-constrained neural networks in complex spaces
arXiv:2606.04390v2 Announce Type: replace Abstract: We find the asymptotic ratio between the storage capacities when enforcing real pre-activations in a complex hypothesis class as opposed to complex ones in the same class. Our methods depend on Gardner volume comparisons at critical capacity. Our proof relies on an application of the Harish-Chandra-Itzykson-Zuber (HCIZ) formula, nonstandard in literature. With the HCIZ formula, we may obtain a more robust approximation for the final asymptotic ratio. This strategy is applicable to our work specifically since we integrate over the unitary and orthogonal compact manifolds, facilitated via the Weyl integration formula and the Haar measure.
Abstract:We find the asymptotic ratio between the storage capacities when enforcing real pre-activations in a complex hypothesis class as opposed to complex ones in the same class. Our methods depend on Gardner volume comparisons at critical capacity. Our proof relies on an application of the Harish-Chandra-Itzykson-Zuber (HCIZ) formula, nonstandard in literature. With the HCIZ formula, we may obtain a more robust approximation for the final asymptotic ratio. This strategy is applicable to our work specifically since we integrate over the unitary and orthogonal compact manifolds, facilitated via the Weyl integration formula and the Haar measure.
Machine Learning (cs.LG); Disordered Systems and Neural Networks (cond-mat.dis-nn); Probability (math.PR)
arXiv:2606.04390 [cs.LG]
(or arXiv:2606.04390v2 [cs.LG] for this version)
https://doi.org/10.48550/arXiv.2606.04390 Focus to learn more arXiv-issued DOI via DataCite
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Text integral sub licența deschisă a publicației · 195 cuvinte
Subiecte conexe
Shortcomings and capacities of real-constrained neural networks in complex spaces
arXiv · 5 iun. 2026
[AINews] High Taste Testers Ep. 1
Latent Space · 17 oct. 2026
The J-Space Debate, Agent Swarms, and Pacing Frontier AI - Digital Minds Newsletter #4
LessWrong · 18 sept. 2026
Synthesis Superintelligence: from Semiconductors to Superconductors — Periodic Labs’ Liam Fedus and Ekin Dogus Cubuk
Latent Space · 8 oct. 2026