A uniform lower bound on weights of perceptrons

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5010 LNCS, Issue , 2008, Pages 261-272

  Podolskii, Vladimir V ^a  

^a MOSCOW STATE UNIVERSITY   (Russian Federation)

Author keywords

[No Author keywords available]

Indexed keywords

ABSOLUTE VALUES; THRESHOLD GATE; TOTAL WEIGHT; UNIFORM LOWER BOUND;

COMPUTATIONAL METHODS; FUNCTIONS; GATE DIELECTRICS;

NEURAL NETWORKS;

EID: 44649199945     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-79709-8_27     Document Type: Conference Paper

References (15)

1. Allender, E.: Circuit complexity before the dawn of the new Millennium. In: Chandra, V., Vinay, V. (eds.) FSTTCS 1996. LNCS, vol. 1180, pp. 1-18. Springer, Heidelberg (1996)
2. Beigel, R.: Perceptrons, PP and the polynomial hierarchy. Computational Complexity 4, 339-349 (1994)
3. Beigel, R., Reingold, N., Spielman, D.A.: The perceptron strikes back. In: Proceedings of Structure in Complexity Theory Conference, pp. 286-291 (1991)
4. Chandra, A., Stockmeyer, L., Vishkin, U.: Constant depth reducibility. SIAM Journal on Computing 13, 423-439 (1984)
5. Goldmann, M., Håstad, J., Razborov, A.A.: Majority gates vs. general weighted threshold gates. Computational Complexity 2, 277-300 (1992)
6. Hajnal, A., Maass, W., Pudlák, P., Szegedy, M., Turán, G.: Threshold circuits of bounded depth. Journal on Computer and System Science 46, 129-154 (1993)
7. Håstad, J.: Almost optimal, lower bounds for small depth circuits. In: Micali, S. (ed.) Randomness and Computation, Advances in Computing Research, vol. 5, pp. 143-170. JAI Press Inc. (1989)
8. Håstad, J.: On the size of weights for threshold gates. SIAM Journal on Discrete Mathematics 7(3), 484-492 (1994)
9. Minsky, M.L., Papert, S.A.: Perceptrons. MIT Press, Cambridge (1968)
10. Muroga, S.: Threshold logic and its applications. Wiley-Interscience, Chichester (1971)
11. Nisan, N.: The communication complexity of threshold gates. In: Miklós, D., Sós, V.T., Szönyi, T. (eds.) Combinatorics, Paul Erdös is Eighty, vol. 1, pp. 301-315. Jason Bolyai Math. Society, Budapest, Hungary (1993)
12. Podolskii, V.V.: Perceptrons of large weight. In: Proceedings, Second International Symposium on Computer Science in Russia, pp. 328-336 (2007)
13. Razborov, A.: Lower bounds on the size of bounded-depth networks over a complete basis with logical addition. Matematicheskie Zametki 41(4), 598-607 (1987); English translation in Mathematical Notes of the Academy of Sei. of the USSR 41(4), 333-338 (1987)
14. Smolensky, R.: Algebraic methods in the theory of lower bounds for Boolean circuit complexity. In: Proceedings, 19th ACM Symposium of Theory of Computing, pp. 77-82 (1987)
15. Yao, A.: Separating the polynomial-time hierarchy by oracles. In: IEEE Symposium on Foundations of Computer Science (FOCS), pp. 1-10 (1985)