Halfspace learning, linear programming, and nonmalicious distributions
type: Item
instance of: scholarly article
title: Halfspace learning, linear programming, and nonmalicious distributions
zbMATH Open document ID: 0821.68103
DOI: 10.1016/0020-0190(94)90003-5
author: Philip M. Long
published in: Information Processing Letters
publication date: 1994-11-03T00:00:00Z
Mathematics Subject Classification ID: 68T05
Mathematics Subject Classification ID: 90C05
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 681777
zbMATH Keywords: computational learning theory
zbMATH Keywords: perceptron algorithm
MaRDI profile type: Publication
full work available at URL: 0020-0190(94)90003-5
OpenAlex ID: W2045715425
cites work: Queries and concept learning
cites work: Learnability and the Vapnik-Chervonenkis dimension
cites work: Matrix multiplication via arithmetic progressions
cites work: Q4403756
cites work: Q5538132
cites work: Equivalence of models for polynomial learnability
cites work: Q4013545
cites work: Q5519782
cites work: On the density of families of sets
cites work: Q3707420
cites work: A theory of the learnable
Recommended article: On Exact Learning Halfspaces with Random Consistent Hypothesis Oracle
Recommended article: A Uniform Lower Error Bound for Half-Space Learning
Recommended article: Learning an intersection of a constant number of halfspaces over a uniform distribution
Recommended article: The regularized least squares algorithm and the problem of learning halfspaces
Recommended article: Hardness of Learning Halfspaces with Noise
Recommended article: Learning general halfspaces with general Massart noise under the Gaussian distribution
Recommended article: Q4839059
Recommended article: Agnostically Learning Halfspaces
Recommended article: Large-width bounds for learning half-spaces on distance spaces
Recommended article: On learning a union of half spaces
description: scientific article; zbMATH DE number 681777