共 50 条
- [31] Robust and Private Learning of Halfspaces [J]. 24TH INTERNATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE AND STATISTICS (AISTATS), 2021, 130
- [32] Hardness of Learning DNFs using Halfspaces [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 [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 [J]. Combinatorica, 2013, 33 : 73 - 96
- [36] Active Learning of Convex Halfspaces on Graphs [J]. ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 34 (NEURIPS 2021), 2021, 34
- [37] AGNOSTIC LEARNING OF MONOMIALS BY HALFSPACES IS HARD [J]. SIAM JOURNAL ON COMPUTING, 2012, 41 (06) : 1558 - 1590
- [40] An improved deterministic algorithm for generalized random sampling [J]. ALGORITHMS AND COMPLEXITY, 1997, 1203 : 159 - 170