Improved lower bounds for learning from noisy examples: An information-theoretic approach (Q1854425): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Learning regular sets from queries and counterexamples / rank
 
Normal rank
Property / cites work
 
Property / cites work: Queries and concept learning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Malicious omissions and errors in answers to membership queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast probabilistic algorithms for Hamiltonian circuits and matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sample size lower bounds in PAC learning by Algorithmic Complexity Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of learning from drifting distributions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learnability with respect to fixed distributions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learnability and the Vapnik-Chervonenkis dimension / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4023085 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3268559 / rank
 
Normal rank
Property / cites work
 
Property / cites work: General formulation of Shannon’s main theorem in information theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3217346 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A general lower bound on the number of examples needed for learning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Predicting \(\{ 0,1\}\)-functions on randomly drawn points / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mutual information, metric entropy and cumulative relative entropy risk / rank
 
Normal rank
Property / cites work
 
Property / cites work: Apple tasting. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4003734 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning in the Presence of Malicious Errors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040311 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On learning from queries and counterexamples in the presence of noise / rank
 
Normal rank
Property / cites work
 
Property / cites work: General bounds on the number of examples needed for learning probabilistic concepts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Four types of noise in data for PAC learning / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theory of the learnable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Estimation of dependences based on empirical data. Transl. from the Russian by Samuel Kotz / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4935997 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds on expected redundancy for nonparametric classes / rank
 
Normal rank

Latest revision as of 11:11, 5 June 2024

scientific article
Language Label Description Also known as
English
Improved lower bounds for learning from noisy examples: An information-theoretic approach
scientific article

    Statements

    Improved lower bounds for learning from noisy examples: An information-theoretic approach (English)
    0 references
    0 references
    0 references
    14 January 2003
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references