A complete characterization of statistical query learning with applications to evolvability (Q439989): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 5 users not shown)
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q32 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68T05 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6067740 / rank
 
Normal rank
Property / zbMATH Keywords
 
statistical query
Property / zbMATH Keywords: statistical query / rank
 
Normal rank
Property / zbMATH Keywords
 
complexity of learning
Property / zbMATH Keywords: complexity of learning / rank
 
Normal rank
Property / zbMATH Keywords
 
agnostic learning
Property / zbMATH Keywords: agnostic learning / rank
 
Normal rank
Property / zbMATH Keywords
 
evolvability
Property / zbMATH Keywords: evolvability / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: SuLQ / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.jcss.2011.12.024 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2546502841 / rank
 
Normal rank
Property / cites work
 
Property / cites work: General bounds on statistical query learning and PAC learning with noise via hypothesis boosting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Specification and simulation of statistical query algorithms for efficiency and noise tolerance / rank
 
Normal rank
Property / cites work
 
Property / cites work: A general dimension for query learning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Correlation clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4633934 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial-time algorithm for learning noisy linear threshold functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weakly learning DNF and characterizing statistical query learning using Fourier analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Noise-tolerant learning, the parity problem, and the statistical query model / rank
 
Normal rank
Property / cites work
 
Property / cites work: 10.1162/153244302760200669 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Fourier spectrum of monotone functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple polynomial-time rescaling algorithm for solving linear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5302086 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Complete Characterization of Statistical Query Learning with Applications to Evolvability / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Agnostic Learning of Parities, Monomials, and Halfspaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decision theoretic generalizations of the PAC model for neural net and other learning applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252738 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Agnostically Learning Halfspaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: What Can We Learn Privately? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient noise-tolerant learning from statistical queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning Boolean formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Toward efficient agnostic learning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cryptographic limitations on learning Boolean formulae and finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Boosting and hard-core set construction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unconditional lower bounds for learning intersections of halfspaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Characterization of Strong Learnability in the Statistical Query Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizing Statistical Query Learning: Simplified Notions and Proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theory of the learnable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Evolvability / rank
 
Normal rank
Property / cites work
 
Property / cites work: New lower bounds for statistical query learning / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 14:22, 5 July 2024

scientific article
Language Label Description Also known as
English
A complete characterization of statistical query learning with applications to evolvability
scientific article

    Statements

    A complete characterization of statistical query learning with applications to evolvability (English)
    0 references
    0 references
    17 August 2012
    0 references
    0 references
    statistical query
    0 references
    complexity of learning
    0 references
    agnostic learning
    0 references
    evolvability
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references