On the Evolution of Monotone Conjunctions: Drilling for Best Approximations
DOI10.1007/978-3-319-46379-7_7zbMath1478.68284OpenAlexW2523410433MaRDI QIDQ2830270
Publication date: 9 November 2016
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-46379-7_7
correlationoptimizationevolvabilitynoiselocal searchevolutionevolutionary algorithmsPAC learningbinomial distributionsBoolean lossdistribution-specific learning
Computational learning theory (68Q32) Evolutionary algorithms, genetic algorithms (computational aspects) (68W50) Learning and adaptive systems in artificial intelligence (68T05) Approximation methods and heuristics in mathematical programming (90C59) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- A complete characterization of statistical query learning with applications to evolvability
- Evolvability via the Fourier transform
- Specification and simulation of statistical query algorithms for efficiency and noise tolerance
- On the analysis of the \((1+1)\) evolutionary algorithm
- Can PAC learning algorithms tolerate random attribute noise?
- Distribution free evolvability of polynomial functions over all convex loss functions
- Evolvability of Real Functions
- Attribute-efficient evolvability of linear functions
- Sorting and Selection with Imprecise Comparisons
- On Evolvability: The Swapping Algorithm, Product Distributions, and Covariance
- Characterizing Statistical Query Learning: Simplified Notions and Proofs
- A theory of the learnable
- 10.1162/153244302760200669
- Efficient noise-tolerant learning from statistical queries
- Evolution with Recombination
- Evolvability
This page was built for publication: On the Evolution of Monotone Conjunctions: Drilling for Best Approximations
