Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
halfspace learning
Description:
A machine-learning problem of finding a linear classifier that separates examples into classes using a hyperplane.
Primary topic:
Machine Learning and Algorithms (57%)
Related topics:
Machine Learning and Algorithms (57%),
Complexity and Algorithms in Graphs (10%),
Stochastic Gradient Optimization Techniques (8%)
OpenAlex ID:
keywords/halfspace-learning
New Results for Learning Noisy Parities and Halfspaces
2006
·
Vitaly Feldman
, Parikshit Gopalan
, et al.
·
Annual Symposium on Foundations of Computer Science
·
204
Robust Trainability of Single Neurons
1995
·
K.U. Hoffgen
, H.U. Simon
, et al.
·
Journal of Computer and System Sciences
·
163
Hardness of Learning Halfspaces with Noise
2009
·
Venkatesan Guruswami
, Prasad Raghavendra
·
SIAM Journal on Computing
·
114
The Geometry of Generalized Binary Search
2011
·
Robert D. Nowak
·
IEEE Transactions on Information Theory
·
108
PDF
Reproducibility in learning
2022
·
Russell Impagliazzo
, Rex Lei
, et al.
·
ACM Symposium on Theory of Computing (STOC)
·
98
PDF
Hardness of Learning Halfspaces with Noise
2006
·
Venkatesan Guruswami
, Prasad Raghavendra
·
Annual Symposium on Foundations of Computer Science
·
87
Learning models for object recognition
2005
·
P.F. Felzenszwalb
·
IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings
·
70
Learning Halfspaces with Massart Noise Under Structured Distributions
2020
·
Diakonikolas, Ilias
, Kontonis, Vasilis
, et al.
·
arXiv (Cornell University)
·
58
PDF
Reliable agnostic learning
2012
·
Adam Tauman Kalai
, Varun Kanade
, et al.
·
Journal of Computer and System Sciences
·
55
Revisiting Perceptron: Efficient and Label-Optimal Learning of Halfspaces
2017
·
Yan, Songbai
, Zhang, Chicheng
·
neural information processing systems
·
51
A tamper-proof and lightweight authentication scheme
2008
·
Ghaith Hammouri
, Erdinç Öztürk
, et al.
·
Pervasive and Mobile Computing
·
50
Non-Convex SGD Learns Halfspaces with Adversarial Label Noise
2020
·
Diakonikolas, Ilias
, Kontonis, Vasilis
, et al.
·
neural information processing systems
·
37
Polynomial-Time Approximation Schemes for Knapsack and Related Counting Problems using Branching Programs
2010
·
Gopalan, Parikshit
, Klivans, Adam
, et al.
·
arXiv (Cornell University)
·
36
PDF
A Moment-Matching Approach to Testable Learning and a New Characterization of Rademacher Complexity
2023
·
Aravind Gollakota
, Adam R. Klivans
, et al.
·
ACM Symposium on Theory of Computing (STOC)
·
35
PDF
Learning Halfspaces and Neural Networks with Random Initialization
2015
·
Zhang, Yuchen
, Lee, Jason D.
, et al.
·
arXiv (Cornell University)
·
35
PDF
Baum’s Algorithm Learns Intersections of Halfspaces with Respect to Log-Concave Distributions
2009
·
Adam R. Klivans
, Philip M. Long
, et al.
·
Lecture notes in computer science
·
35
Private Center Points and Learning of Halfspaces
2019
·
Beimel, Amos
, Moran, Shay
, et al.
·
arXiv (Cornell University)
·
34
PDF
Near-Optimal Statistical Query Hardness of Learning Halfspaces with Massart Noise
2020
·
Diakonikolas, Ilias
, Kane, Daniel M.
·
arXiv (Cornell University)
·
32
PDF
Statistical Query Algorithms for Mean Vector Estimation and Stochastic Convex Optimization
2021
·
Vitaly Feldman
, Cristóbal Guzmán
, et al.
·
Mathematics of Operations Research
·
29
PDF
Learning large-margin halfspaces with more malicious noise
2011
·
Phil Long
, Rocco A. Servedio
·
neural information processing systems
·
28
Binary Iterative Hard Thresholding Converges with Optimal Number of Measurements for 1-Bit Compressed Sensing
2024
·
Namiko Matsumoto
, Arya Mazumdar
·
Journal of the ACM
·
23
PDF
Efficient active learning of sparse halfspaces with arbitrary bounded noise
2020
·
Zhang, Chicheng
, Shen, Jie
, et al.
·
neural information processing systems
·
22
Learning Halfspaces with Tsybakov Noise
2020
·
Diakonikolas, Ilias
, Kontonis, Vasilis
, et al.
·
arXiv (Cornell University)
·
21
PDF
A Strongly Polynomial Algorithm for Approximate Forster Transforms and Its Application to Halfspace Learning
2023
·
Ilias Diakonikolas
, Christos Tzamos
, et al.
·
ACM Symposium on Theory of Computing (STOC)
·
20
PDF
Efficiently learning halfspaces with Tsybakov noise
2021
·
Ilias Diakonikolas
, Daniel M. Kane
, et al.
·
ACM Symposium on Theory of Computing (STOC)
·
19
PDF
Show more works
View as search
Works count:
81
Citation count:
1,737
Year
Topic
Type