메뉴 건너뛰기




Volumn 17, Issue 2, 2008, Pages 149-178

Halfspace matrices

Author keywords

Communication complexity; Complexity measures of sign matrices; Complexity of learning; Linear threshold functions

Indexed keywords


EID: 44649175703     PISSN: 10163328     EISSN: 14208954     Source Type: Journal    
DOI: 10.1007/s00037-008-0242-4     Document Type: Conference Paper
Times cited : (63)

References (42)
  • 2
    • 33745467619 scopus 로고    scopus 로고
    • An algorithmic theory of learning: Robust concepts and random projection
    • R. I. ARRIAGA & S. VEMPALA (2006). An algorithmic theory of learning: Robust concepts and random projection. Mach. Learn. 63(2), 161-182.
    • (2006) Mach. Learn , vol.63 , Issue.2 , pp. 161-182
    • ARRIAGA, R.I.1    VEMPALA, S.2
  • 4
    • 0042967747 scopus 로고    scopus 로고
    • Limitations of learning via embeddings in Euclidean half spaces
    • S. BEN-DAVID, N. EIRON & H. U. SIMON (2003). Limitations of learning via embeddings in Euclidean half spaces. J. Mach. Learn. Res. 3, 441-461.
    • (2003) J. Mach. Learn. Res , vol.3 , pp. 441-461
    • BEN-DAVID, S.1    EIRON, N.2    SIMON, H.U.3
  • 5
    • 0001926474 scopus 로고    scopus 로고
    • A Polynomial-Time Algorithm for Learning Noisy Linear Threshold Functions
    • A. BLUM, A. M. FRIEZE, R. KANNAN & S. VEMPALA (1998). A Polynomial-Time Algorithm for Learning Noisy Linear Threshold Functions. Algorithmica 22(1/2), 35-52.
    • (1998) Algorithmica , vol.22 , Issue.1-2 , pp. 35-52
    • BLUM, A.1    FRIEZE, A.M.2    KANNAN, R.3    VEMPALA, S.4
  • 7
    • 24144453496 scopus 로고    scopus 로고
    • Noise-tolerant learning, the parity problem, and the statistical query model
    • A. BLUM, A. KALAI & H. WASSERMAN (2003). Noise-tolerant learning, the parity problem, and the statistical query model. J. ACM 50(4), 506-519.
    • (2003) J. ACM , vol.50 , Issue.4 , pp. 506-519
    • BLUM, A.1    KALAI, A.2    WASSERMAN, H.3
  • 9
    • 27144489164 scopus 로고    scopus 로고
    • A Tutorial on Support Vector Machines for Pattern Recognition
    • C. J. C. BURGES (1998). A Tutorial on Support Vector Machines for Pattern Recognition. Data Min. Knowl. Discov. 2(2), 121-167.
    • (1998) Data Min. Knowl. Discov , vol.2 , Issue.2 , pp. 121-167
    • BURGES, C.J.C.1
  • 11
    • 9444262655 scopus 로고    scopus 로고
    • A linear lower bound on the unbounded error probabilistic communication complexity
    • J. FÖRSTER (2002). A linear lower bound on the unbounded error probabilistic communication complexity. J. Comput. Syst. Sci. 65(4), 612-625.
    • (2002) J. Comput. Syst. Sci , vol.65 , Issue.4 , pp. 612-625
    • FÖRSTER, J.1
  • 13
    • 0038629051 scopus 로고    scopus 로고
    • Estimating the Optimal Margins of Embeddings in Euclidean Half Spaces
    • J. FORSTER, N. SCHMITT, H. U. SIMON & T. SUTTORP (2003). Estimating the Optimal Margins of Embeddings in Euclidean Half Spaces. Mach. Learn. 51(3), 263-281.
    • (2003) Mach. Learn , vol.51 , Issue.3 , pp. 263-281
    • FORSTER, J.1    SCHMITT, N.2    SIMON, H.U.3    SUTTORP, T.4
  • 14
    • 29144487028 scopus 로고    scopus 로고
    • On the smallest possible dimension and the largest possible margin of linear arrangements representing given concept classes
    • J. FORSTER & H. U. SIMON (2006). On the smallest possible dimension and the largest possible margin of linear arrangements representing given concept classes. Theor. Comput. Sci. 350(1), 40-48.
    • (2006) Theor. Comput. Sci , vol.350 , Issue.1 , pp. 40-48
    • FORSTER, J.1    SIMON, H.U.2
  • 15
    • 0000069809 scopus 로고    scopus 로고
    • M. GOLDMANN, J. HÅSTAD& A. A. RAZBOROV (1992). Majority Gates vs. General Weighted Threshold Gates. Computational Complexity 2, 277-300.
    • M. GOLDMANN, J. HÅSTAD& A. A. RAZBOROV (1992). Majority Gates vs. General Weighted Threshold Gates. Computational Complexity 2, 277-300.
  • 16
    • 0000420294 scopus 로고
    • On the Size of Weights for Threshold Gates
    • J. HÅSTAD (1994). On the Size of Weights for Threshold Gates. SIAM J. Discret. Math. 7(3), 484-492.
    • (1994) SIAM J. Discret. Math , vol.7 , Issue.3 , pp. 484-492
    • HÅSTAD, J.1
  • 17
    • 0001190474 scopus 로고
    • The Probabilistic Communication Complexity of Set Intersection
    • B. KALYANASUNDARAM & G. SCHNITGER (1992). The Probabilistic Communication Complexity of Set Intersection. SIAM J. Discrete Math. 5(4), 545-557.
    • (1992) SIAM J. Discrete Math , vol.5 , Issue.4 , pp. 545-557
    • KALYANASUNDARAM, B.1    SCHNITGER, G.2
  • 20
    • 3042612212 scopus 로고    scopus 로고
    • Learning intersections and thresholds of halfspaces
    • A. R. KLIVANS, R. O'DONNELL & R. A. SERVEDIO (2004). Learning intersections and thresholds of halfspaces. J. Comput. Syst. Sci. 68(4), 808-840.
    • (2004) J. Comput. Syst. Sci , vol.68 , Issue.4 , pp. 808-840
    • KLIVANS, A.R.1    O'DONNELL, R.2    SERVEDIO, R.A.3
  • 23
    • 35348904454 scopus 로고    scopus 로고
    • Unconditional lower bounds for learning intersections of halfspaces
    • A. R. KLIVANS & A. A. SHERSTOV (2007). Unconditional lower bounds for learning intersections of halfspaces. Machine Learning 69(2-3), 97-114.
    • (2007) Machine Learning , vol.69 , Issue.2-3 , pp. 97-114
    • KLIVANS, A.R.1    SHERSTOV, A.A.2
  • 24
    • 0033434847 scopus 로고    scopus 로고
    • On Randomized One-Round Communication Complexity
    • I. KREMER, N. NISAN & D. RON (1999). On Randomized One-Round Communication Complexity. Computational Complexity 8(1), 21-49.
    • (1999) Computational Complexity , vol.8 , Issue.1 , pp. 21-49
    • KREMER, I.1    NISAN, N.2    RON, D.3
  • 26
    • 0003023990 scopus 로고    scopus 로고
    • PAC Learning Intersections of Halfspaces with Membership Queries
    • S. KWEK & L. PITT (1998). PAC Learning Intersections of Halfspaces with Membership Queries. Algorithmica 22(1/2), 53-75.
    • (1998) Algorithmica , vol.22 , Issue.1-2 , pp. 53-75
    • KWEK, S.1    PITT, L.2
  • 27
    • 44449089397 scopus 로고    scopus 로고
    • Complexity Measures of Sign Matrices
    • To appear. Manuscript at
    • N. LINIAL, S. MENDELSON, G. SCHECHTMAN & A. SHRAIBMAN (2006). Complexity Measures of Sign Matrices. Combinatories To appear. Manuscript at http://www.cs.huji.ac.il/~nati/ PAPERS/complexity_matrices.ps.gz.
    • (2006) Combinatories
    • LINIAL, N.1    MENDELSON, S.2    SCHECHTMAN, G.3    SHRAIBMAN, A.4
  • 29
    • 0035521408 scopus 로고    scopus 로고
    • Spectral Methods for Matrix Rigidity with Applications to Size-Depth Trade-offs and Communication Complexity
    • S. V. LOKAM (2001). Spectral Methods for Matrix Rigidity with Applications to Size-Depth Trade-offs and Communication Complexity. J. Comput. Syst. Sci. 63(3), 449-473.
    • (2001) J. Comput. Syst. Sci , vol.63 , Issue.3 , pp. 449-473
    • LOKAM, S.V.1
  • 30
    • 0021469714 scopus 로고
    • Probabilistic communication complexity
    • R. PATURI & J. SIMON (1986). Probabilistic communication complexity. J. Comput. Syst. Sci. 33(1), 106-123.
    • (1986) J. Comput. Syst. Sci , vol.33 , Issue.1 , pp. 106-123
    • PATURI, R.1    SIMON, J.2
  • 31
    • 0034563764 scopus 로고    scopus 로고
    • The BNS-Chung criterion for multi-party communication complexity
    • R. RAZ (2000). The BNS-Chung criterion for multi-party communication complexity. Comput. Complex. 9(2), 113-122.
    • (2000) Comput. Complex , vol.9 , Issue.2 , pp. 113-122
    • RAZ, R.1
  • 32
    • 44649138688 scopus 로고    scopus 로고
    • A. A. RAZBOROV (1989). Ob ustoichivyh matritsah. Research report, Steklov Mathematical Institute, Moscow, Russia. In Russian. Engl, title: On rigid matrices.
    • A. A. RAZBOROV (1989). Ob ustoichivyh matritsah. Research report, Steklov Mathematical Institute, Moscow, Russia. In Russian. Engl, title: "On rigid matrices".
  • 33
    • 0026990361 scopus 로고
    • On the distributional complexity of disjointness
    • A. A. RAZBOROV (1992). On the distributional complexity of disjointness. Theor. Comput. Sci. 106(2), 385-390.
    • (1992) Theor. Comput. Sci , vol.106 , Issue.2 , pp. 385-390
    • RAZBOROV, A.A.1
  • 35
    • 44649097653 scopus 로고    scopus 로고
    • A. A. SHERSTOV (2007). Communication Complexity under Product and Nonproduct Distributions. In Electronic Colloquium on Computational Complexity (ECCC). Report TR07-072.
    • A. A. SHERSTOV (2007). Communication Complexity under Product and Nonproduct Distributions. In Electronic Colloquium on Computational Complexity (ECCC). Report TR07-072.
  • 37
    • 0000568992 scopus 로고
    • On the Power of Threshold Circuits with Small Weights
    • K.-Y. SIU & J. BRUCK (1991). On the Power of Threshold Circuits with Small Weights. SIAM J. Discrete Math. 4(3), 423-435.
    • (1991) SIAM J. Discrete Math , vol.4 , Issue.3 , pp. 423-435
    • SIU, K.-Y.1    BRUCK, J.2
  • 39
    • 0021518106 scopus 로고
    • A theory of the learnable
    • L. G. VALIANT (1984). A theory of the learnable. Commun. ACM 27(11), 1134-1142.
    • (1984) Commun. ACM , vol.27 , Issue.11 , pp. 1134-1142
    • VALIANT, L.G.1
  • 42
    • 17444425308 scopus 로고    scopus 로고
    • New lower bounds for statistical query learning
    • KE YANG (2005). New lower bounds for statistical query learning. J. Comput. Syst. Sci. 70(4), 485-509.
    • (2005) J. Comput. Syst. Sci , vol.70 , Issue.4 , pp. 485-509
    • KE, Y.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.