Efficient learning with virtual threshold gates
type: Item
instance of: scholarly article
title: Efficient learning with virtual threshold gates
zbMATH Open document ID: 0893.68127
author: Wolfgang Maass
author: Manfred K. Warmuth
published in: Information and Computation
publication date: 1998-04-26T00:00:00Z
Mathematics Subject Classification ID: 68T05
zbMATH DE Number: 1145791
zbMATH Keywords: efficient learning
zbMATH Keywords: learning algorithms
MaRDI profile type: Publication
OpenAlex ID: W2031979166
cites work: Q4091421
cites work: Queries and concept learning
cites work: Simulating access to hidden information while learning
cites work: Q4252716
cites work: Learnability and the Vapnik-Chervonenkis dimension
cites work: The bounded injury priority method and the learnability of unions of rectangles
cites work: Universal Portfolios
cites work: Learning from a consistently ignorant teacher
cites work: Sequential prediction of individual sequences under general loss functions
cites work: Exponentiated gradient versus gradient descent for linear predictors
cites work: The Perceptron algorithm versus Winnow: linear versus logarithmic mistake bounds when few input variables are relevant
cites work: Q4013545
cites work: The weighted majority algorithm
cites work: Algorithms and lower bounds for on-line learning of geometrical concepts
cites work: Lower bound methods and separation results for on-line learning models
cites work: A theory of the learnable
cites work: On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
DOI: 10.1006/INCO.1997.2686
description: scientific article; zbMATH DE number 1145791