Low-weight halfspaces for sparse Boolean vectors

ITCS 2013 - Proceedings of the 2013 ACM Conference on Innovations in Theoretical Computer Science

Volumn , Issue , 2013, Pages 21-35

  Long, Philip M ^a   Servedio, Rocco A ^b  

^a NEC LABORATORIES AMERICA   (United States)

^b Columbia University ^*  (United States)

Author keywords

halfspace; hamming ball; hyperplane; linear separator; linear threshold function

Indexed keywords

HALF-SPACE; HAMMING BALL; HYPERPLANE; LINEAR SEPARATORS; LINEAR THRESHOLD FUNCTIONS;

BOOLEAN FUNCTIONS; COMPUTER SCIENCE; LEARNING ALGORITHMS;

GEOMETRY;

EID: 84873402389     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2422436.2422440     Document Type: Conference Paper

References (17)

1. N. Alon and V. H. Vu. Anti-Hadamard Matrices, Coin Weighing, Threshold Gates, and Indecomposable Hypergraphs. Journal of Combinatorial Theory, Series A, 79(1):133-160, 1997.
2. A. De, I. Diakonikolas, V. Feldman, and R. Servedio. Near-optimal solutions for the Chow Parameters Problem and low-weight approximation of halfspaces. STOC, 2012.
3. I. Diakonikolas and R. Servedio. Improved approximation of linear threshold functions. In Proc. 24th Annual IEEE Conference on Computational Complexity (CCC), pages 161-172, 2009.
4. M. Goldmann, J. Håstad, and A. Razborov. Majority gates vs. general weighted threshold gates. Computational Complexity, 2:277-300, 1992.
5. S. Hampson and D. Volper. Linear function neurons: structure and training. Biological Cybernetics, 53:203-217, 1986.
6. J. Håstad. On the size of weights for threshold gates. SIAM Journal on Discrete Mathematics, 7(3):484-492, 1994.
7. J. Hong. On connectionist models. Technical Report Technical Report 87-012, Dept. of Computer Science, University of Chicago, 1987.
8. W. Maass and G. Turan. How fast can a threshold gate learn? In Computational Learning Theory and Natural Learning Systems: Volume I: Constraints and Prospects, pages 381-414. MIT Press, 1994.
9. M. Minsky and S. Papert. Perceptrons: an introduction to computational geometry. MIT Press, Cambridge, MA, 1968.
10. S. Muroga, I. Toda, and S. Takasu. Theory of majority switching elements. J. Franklin Institute, 271:376-418, 1961.
11. P. Orponen. Neural networks and complexity theory. In Proceedings of the 17th International Symposium on Mathematical Foundations of Computer Science, pages 50-61, 1992.
12. P. Raghavan. Learning in threshold networks. In First Workshop on Computational Learning Theory, pages 19-27, 1988.
13. A. Razborov. On small depth threshold circuits. In Proceedings of the Third Scandinavian Workshop on Algorithm Theory (SWAT), pages 42-52, 1992.
14. M. Saks. Slicing the hypercube. In Keith Walker, editor, Surveys in Combinatorics 1993, pages 211-257. London Mathematical Society Lecture Note Series 187, 1993.
15. N. Sauer. On the density of families of sets. Journal of Combinatorial Theory (Series A), 13:145-147, 1972.
16. R. Servedio. Every linear threshold function has a low-weight approximator. Comput. Complexity, 16(2):180-209, 2007.
17. S. Shelah. A combinatorial problem; stability and order for models and theories in infinitary languages. Pacific J. Math., 41:247-261, 1972.