General lower bounds on the query complexity within the exact learning model
type: Item
instance of: scholarly article
title: General lower bounds on the query complexity within the exact learning model
zbMATH Open document ID: 0967.68088
DOI: 10.1016/S0166-218X(99)00223-1
author: Norbert Klasner
author: Hans Ulrich Simon
published in: Discrete Applied Mathematics
publication date: 2001-03-20T00:00:00Z
Mathematics Subject Classification ID: 68Q32
Mathematics Subject Classification ID: 68Q15
zbMATH DE Number: 1565919
zbMATH Keywords: exact learning model
MaRDI profile type: Publication
cites work: Queries and concept learning
cites work: Simulating access to hidden information while learning
cites work: Q4013552
cites work: Learning from examples with unspecified attribute values.
cites work: Lower bound methods and separation results for on-line learning models
cites work: On the density of families of sets
cites work: A combinatorial problem; stability and order for models and theories in infinitary languages
cites work: On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
full work available at URL: s0166-218x(99)00223-1
OpenAlex ID: W2030064505
Recommended article: A new abstract combinatorial dimension for exact learning via queries
Recommended article: New Computational Paradigms
Recommended article: Complexity theoretic hardness results for query learning
Recommended article: Learning via finitely many queries
Recommended article: Oracles and queries that are sufficient for exact learning
Recommended article: Lower Bounds on Learning Random Structures with Statistical Queries
Recommended article: New lower bounds for statistical query learning
Recommended article: Q3046709
Recommended article: Q4247002
Recommended article: Q3148815
description: scientific article; zbMATH DE number 1565919