Before revision: We show that associative networks of threshold linear units endowed with Hebbian learning  can operate closer to the Gardner optimal storage capacity than their binary counterparts and even surpass this bound .
After revision: We derive the Gardner storage capacity for associative networks of threshold linear units endowed with Hebbian learning can operate closer to the Gardner optimal storage capacity than their binary counterparts and even surpass this bound .