Short-term memory in neuronal networks through dynamical compressed sensing

Advances in Neural Information Processing Systems 23: 24th Annual Conference on Neural Information Processing Systems 2010, NIPS 2010

Volumn , Issue , 2010, Pages

  Ganguli, Surya ^a   Sompolinsky, Haim ^b,c  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b HEBREW UNIVERSITY OF JERUSALEM   (Israel)

^c HARVARD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DYNAMICAL SYSTEMS; NEURAL NETWORKS; NEURONS; STATISTICAL PHYSICS;

COMPRESSED-SENSING; FEED-FORWARD NETWORK; GAUSSIAN INPUTS; INPUT SEQUENCE; NETWORK SIZE; NEURONAL NETWORKS; RECURRENT NETWORKS; SHORT TERM MEMORY; SIGNALS STATISTICS; TIME-CONSTANTS;

COMPRESSED SENSING;

EID: 85162050505     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (20)

1. J.J. Hopfield. Neural networks and physical systems with emergent collective computational abilities. PNAS, 79(8):2554, 1982.
2. W. Maass, T. Natschlager, and H. Markram. Real-time computing without stable states: A new framework for neural computation based on perturbations. Neural computation, 14(11):2531-2560, 2002.
3. H. Jaeger and H. Haas. Harnessing nonlinearity: Predicting chaotic systems and saving energy in wireless communication. Science, 304(5667):78, 2004.
4. H. Jaeger. Short term memory in echo state networks. GMD Report 152 German National Research Center for Information Technology, 2001.
5. O.L. White, D.D. Lee, and H. Sompolinsky. Short-term memory in orthogonal neural networks. Phys. Rev. Lett., 92(14):148102, 2004.
6. S. Ganguli, D. Huh, and H. Sompolinsky. Memory traces in dynamical systems. Proc. Natl. Acad. Sci., 105(48):18970, 2008.
7. A.M. Bruckstein, D.L. Donoho, and M. Elad. From sparse solutions of systems of equations to sparse modeling of signals and images. Siam Review, 51(1):34-81, 2009.
8. E. Candes and M. Wakin. An introduction to compressive sampling. IEEE Sig. Proc. Mag., 25(2):21-30, 2008.
9. D.L. Donoho and M. Elad. Optimally sparse representation in general (non-orthogonal) dictionaries via l1 minimization. PNAS, 100:2197-2202, 2003.
10. E. Candes, J. Romberg, and T. Tao. Robust uncertainty principles: Exact signal reconstruction from highly incomplete frequency information. IEEE Trans. Inf. Theory, 52(2):489-509, 2006.
11. E. Candes and T. Tao. Decoding by linear programming. IEEE Trans. Inf. Theory, 51:4203-4215, 2005.
12. D.L. Donoho and J. Tanner. Sparse nonnegative solution of underdetermined linear equations by linear programming. PNAS, 102:9446-51, 2005.
13. D.L. Donoho and J. Tanner. Neighborliness of randomly projected simplices in high dimensions. PNAS, 102:9452-7, 2005.
14. Y. Kabashima, T. Wadayama, and T. Tanaka. A typical reconstruction limit for compressed sensing based on l p-norm minimization. J. Stat. Mech., page L09003, 2009.
15. S. Ganguli and H. Sompolinsky. Statistical mechanics of compressed sensing. Phys. Rev. Lett., 104(18):188701, 2010.
16. M. Mezard, G. Parisi, and M.A. Virasoro. Spin glass theory and beyond. World scientific Singapore, 1987.
17. S. Rangan, A.K. Fletcher, and Goyal V.K. Asymptotic analysis of map estimation via the replica method and applications to compressed sensing. CoRR, abs/0906.3234, 2009.
18. D.L. Donoho, A. Maleki, and A. Montanari. Message-passing algorithms for compressed sensing. Proc. Natl. Acad. Sci., 106(45):18914, 2009.
19. Y. Xia and M.S. Kamel. A cooperative recurrent neural network for solving l 1 estimation problems with general linear constraints. Neural computation, 20(3):844-872, 2008.
20. C.J. Rozell, D.H. Johnson, R.G. Baraniuk, and B.A. Olshausen. Sparse coding via thresholding and local competition in neural circuits. Neural computation, 20(10):2526-2563, 2008.