A Random Sampling Algorithm for Learning an Intersection of Halfspaces

被引:0
|
作者
Vempala, Santosh S. [1 ]
机构
[1] Georgia Tech, Sch Comp Sci, Atlanta, GA 30318 USA
关键词
D O I
10.1109/FOCS.2010.18
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
We correct a claim from [Vem97] and provide a status update.
引用
收藏
页码:123 / 123
页数:1
相关论文
共 50 条
  • [31] Robust and Private Learning of Halfspaces
    Ghazi, Badih
    Kumar, Ravi
    Manurangsi, Pasin
    Thao Nguyen
    [J]. 24TH INTERNATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE AND STATISTICS (AISTATS), 2021, 130
  • [32] Hardness of Learning DNFs using Halfspaces
    Ghoshal, Suprovat
    Saket, Rishi
    [J]. STOC '21: PROCEEDINGS OF THE 53RD ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING, 2021, : 467 - 480
  • [33] Optimal Bounds for Sign-Representing the Intersection of Two Halfspaces by Polynomials
    Sherstov, Alexander A.
    [J]. STOC 2010: PROCEEDINGS OF THE 2010 ACM SYMPOSIUM ON THEORY OF COMPUTING, 2010, : 523 - 531
  • [34] Optimal bounds for sign-representing the intersection of two halfspaces by polynomials
    Alexander A. Sherstov
    [J]. Combinatorica, 2013, 33 : 73 - 96
  • [35] Optimal bounds for sign-representing the intersection of two halfspaces by polynomials
    Sherstov, Alexander A.
    [J]. COMBINATORICA, 2013, 33 (01) : 73 - 96
  • [36] Active Learning of Convex Halfspaces on Graphs
    Thiessen, Maximilian
    Gaertner, Thomas
    [J]. ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 34 (NEURIPS 2021), 2021, 34
  • [37] AGNOSTIC LEARNING OF MONOMIALS BY HALFSPACES IS HARD
    Feldman, Vitaly
    Guruswami, Venkatesan
    Raghavendra, Prasad
    Wu, Yi
    [J]. SIAM JOURNAL ON COMPUTING, 2012, 41 (06) : 1558 - 1590
  • [38] AN EFFICIENT ALGORITHM FOR RANDOM SAMPLING WITHOUT REPLACEMENT
    GUPTA, P
    BHATTACHARJEE, GP
    [J]. INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 1984, 16 (3-4) : 201 - 209
  • [39] ALTERNATIVE SAMPLING STRATEGY FOR A RANDOM OPTIMIZATION ALGORITHM
    DOREA, CCY
    GONCALVES, CR
    [J]. JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 1993, 78 (02) : 401 - 407
  • [40] An improved deterministic algorithm for generalized random sampling
    Amir, A
    Dar, E
    [J]. ALGORITHMS AND COMPLEXITY, 1997, 1203 : 159 - 170