Skip to content
DraconiticResearch
Search Sources API
197,768 studies31 sourcesUpdated 30 min ago
PreprintarXiv licencearXiv

Shortcomings and capacities of real-constrained neural networks in complex spaces

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. We use weights drawn from the complex Gaussian, which converge asymptotically in norm to the square root of dimension almost surely. Our methods depend on Gardner volume-type 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.

Related

  1. On Associative Neural Networks for Sparse Patterns with Large Capacities
    Matthias Löwe, Franck Vermet
    Journal of Statistical PhysicsPeer-reviewedLicence not statedGeneral mathematicsHAL
  2. Error bounds in Sobolev norms for approximations with norm constrained ReLU neural networks
    Xianjun Li, Yunfei Yang
    arXivPreprintarXiv licenceFull textStatisticsarXiv
  3. Monotone Physics-Constrained Graph Neural Networks for Image-Based Structural Damage Assessment: Theory and Leakage-Free Evaluation
    Tao Zhang
    MathematicsPeer-reviewedCC BY 4.0General mathematicsCrossref
  4. Constrained modularity maximization in complex networks via branch-and-price
    Jaewoo Kim, Seungyeop Lee, Jaemyung Ahn +2
    arXivPreprintCC BY-NC-ND 4.0Full textOptimisation & controlStatistical & nonlinear physicsarXiv
  5. PDE-constrained inverse problems at the √n rate via debiased physics-informed neural networks
    Yves Atchade, Debarghya Mukherjee
    arXivPreprintCC BY 4.0Full textStatisticsarXiv
BibTeX
@misc{gracyk2026shortcomings,
  title = {{Shortcomings and capacities of real-constrained neural networks in complex spaces}},
  author = {Andrew Gracyk},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2606.04390},
  eprint = {2606.04390},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2606.04390},
}
RIS
TY  - UNPB
TI  - Shortcomings and capacities of real-constrained neural networks in complex spaces
AU  - Andrew Gracyk
PY  - 2026
DA  - 2026/09/02
PB  - arXiv
DO  - 10.48550/arxiv.2606.04390
UR  - https://arxiv.org/abs/2606.04390
AB  - 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. We use weights drawn from the complex Gaussian, which converge asymptotically in norm to the square root of dimension almost surely. Our methods depend on Gardner volume-type 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.
ER  -