Construction shows n-neuron asymmetric Hopfield networks support exp(Ω(n/(log n)^2)) limit-cycle attractors of length exp(Ω(√n/log n)) each, robust to 1/2-o(1) noise.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Beyond Fixed Points: Superpolynomial Capacity of Asymmetric Hopfield Networks
Construction shows n-neuron asymmetric Hopfield networks support exp(Ω(n/(log n)^2)) limit-cycle attractors of length exp(Ω(√n/log n)) each, robust to 1/2-o(1) noise.