Halfspace learning, linear programming, and nonmalicious distributions

DOI10.1016/0020-0190(94)90003-5zbMath0821.68103OpenAlexW2045715425MaRDI QIDQ1336756

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

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

Related Items (1)

The regularized least squares algorithm and the problem of learning halfspaces

Cites Work

• Matrix multiplication via arithmetic progressions
• Equivalence of models for polynomial learnability
• Queries and concept learning
• On the density of families of sets
• Learnability and the Vapnik-Chervonenkis dimension
• A theory of the learnable
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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