Capacity lower bound for the Ising perceptron
© 2019 Association for Computing Machinery. We consider the Ising perceptron with gaussian disorder, which is equivalent to the discrete cube t´1, `1uN intersected by M random half-spaces. The perceptron’s capacity is the largest integer MN for which the intersection is nonempty. It is conjectured b...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | English |
| Published: |
Association for Computing Machinery (ACM)
2021
|
| Online Access: | https://hdl.handle.net/1721.1/137021 |