On the sample complexity of weak learning
type: Item
instance of: scholarly article
title: On the sample complexity of weak learning
zbMATH Open document ID: 0826.68102
author: Sally A. Goldman
author: Michael Kearns
author: Robert E. Schapire
published in: Information and Computation
publication date: 1995-07-10T00:00:00Z
Mathematics Subject Classification ID: 68T05
zbMATH DE Number: 767829
zbMATH Keywords: weak learning
MaRDI profile type: Publication
OpenAlex ID: W2029599246
DOI: 10.1006/INCO.1995.1045
Recommended article: Computing and Combinatorics
Recommended article: Improved bounds on the sample complexity of learning
Recommended article: Q4952633
Recommended article: On weak learning
Recommended article: Q4202912
Recommended article: Sample size lower bounds in PAC learning by Algorithmic Complexity Theory
Recommended article: Q4013554
Recommended article: The optimal sample complexity of PAC learning
Recommended article: Characterizing the sample complexity of private learners
description: scientific article; zbMATH DE number 767829