An upper bound on the sample complexity of PAC-learning halfspaces with respect to the uniform distribution
type: Item
instance of: scholarly article
title: An upper bound on the sample complexity of PAC-learning halfspaces with respect to the uniform distribution
zbMATH Open document ID: 1161.68499
DOI: 10.1016/S0020-0190(03)00311-9
author: Philip M. Long
published in: Information Processing Letters
publication date: 2009-04-28T00:00:00Z
Mathematics Subject Classification ID: 68Q32
zbMATH DE Number: 5547805
zbMATH Keywords: machine learning
zbMATH Keywords: sample complexity
zbMATH Keywords: PAC-learning
zbMATH Keywords: halfspaces
zbMATH Keywords: computational complexity
MaRDI profile type: Publication
cites work: Approximating hyper-rectangles: Learning and pseudorandom sets
cites work: Learnability with respect to fixed distributions
cites work: Learnability and the Vapnik-Chervonenkis dimension
cites work: Q3682518
cites work: Enumeration of Seven-Argument Threshold Functions
cites work: Predicting \(\{ 0,1\}\)-functions on randomly drawn points
cites work: Q4013545
cites work: Convergence of stochastic processes
cites work: A Remark on Stirling's Formula
cites work: A theory of the learnable
cites work: Estimation of dependences based on empirical data. Transl. from the Russian by Samuel Kotz
description: scientific article; zbMATH DE number 5547805