On learning a union of half spaces
type: Item
instance of: scholarly article
title: On learning a union of half spaces
zbMATH Open document ID: 0702.68089
DOI: 10.1016/0885-064X(90)90012-3
author: Eric B. Baum
published in: Journal of Complexity
publication date: 1990-01-01T00:00:00Z
Mathematics Subject Classification ID: 68T05
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 4151852
zbMATH Keywords: polynomial time
zbMATH Keywords: learnability
zbMATH Keywords: learning from examples
zbMATH Keywords: credit assignment problem
zbMATH Keywords: lower bounds on the number of examples
MaRDI profile type: Publication
cites work: Fast probabilistic algorithms for Hamiltonian circuits and matchings
cites work: Learnability and the Vapnik-Chervonenkis dimension
cites work: Q5556250
cites work: Q4403756
cites work: Q3729902
cites work: On the complexity of loading shallow neural networks
cites work: A new polynomial-time algorithm for linear programming
cites work: On the complexity of polyhedral separability
cites work: Q5595902
cites work: Convergence of stochastic processes
cites work: Q5519782
cites work: A theory of the learnable
description: scientific article; zbMATH DE number 4151852