Halfspace learning, linear programming, and nonmalicious distributions

DOI10.1016/0020-0190(94)90003-5MaRDI QIDQ1336756zbMATH OpenOpenAlexFDO

Authors Philip M. Long

Publication date 3 November 1994

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0020-0190(94)90003-5

zbMATH Keywords

computational learning theoryperceptron algorithm

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Linear programming (90C05) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• On Exact Learning Halfspaces with Random Consistent Hypothesis Oracle
• A Uniform Lower Error Bound for Half-Space Learning
• Learning an intersection of a constant number of halfspaces over a uniform distribution
• The regularized least squares algorithm and the problem of learning halfspaces
• Hardness of learning halfspaces with noise
• Learning general halfspaces with general Massart noise under the Gaussian distribution
• scientific article; zbMATH DE number 774005
• Agnostically Learning Halfspaces
• Large-width bounds for learning half-spaces on distance spaces
• On learning a union of half spaces

Cites work

• scientific article; zbMATH DE number 3936534 (Why is no real title available?)
• scientific article; zbMATH DE number 67625 (Why is no real title available?)
• scientific article; zbMATH DE number 3436645 (Why is no real title available?)
• scientific article; zbMATH DE number 3231758 (Why is no real title available?)
• scientific article; zbMATH DE number 3249395 (Why is no real title available?)
• A theory of the learnable
• Equivalence of models for polynomial learnability
• Learnability and the Vapnik-Chervonenkis dimension
• Matrix multiplication via arithmetic progressions
• On the density of families of sets
• Queries and concept learning

Cited in

(7)

• Learning Halfspaces with Malicious Noise
• On learning a union of half spaces
• Baum’s Algorithm Learns Intersections of Halfspaces with Respect to Log-Concave Distributions
• Agnostically Learning Halfspaces
• Efficiently learning halfspaces with Tsybakov noise
• Learning finite binary sequences from half-space data
• The regularized least squares algorithm and the problem of learning halfspaces

This page was built for publication: Halfspace learning, linear programming, and nonmalicious distributions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1336756)