A Lower Bound for Agnostically Learning Disjunctions
From MaRDI portal
Publication:5434065
Recommendations
- Agnostic learning of disjunctions on symmetric distributions
- scientific article; zbMATH DE number 2089368
- Learning Disjunctions: Near-Optimal Trade-off between Mistakes and “I Don't Knows”
- Lower bounds for agnostic learning via approximate rank
- On exactly learning disjunctions and DNFs without equivalence queries
- Exact lower bounds for the agnostic probably-approximately-correct (PAC) machine learning model
- General lower bounds on the query complexity within the exact learning model
- On agnostic learning of parities, monomials, and halfspaces
- Disjunctions of negated counting functions are efficiently learnable with equivalence queries
- On learning, lower bounds and (un)keeping promises
Cited in
(11)- The unbounded-error communication complexity of symmetric functions
- Dimension-free bounds and structural results in communication complexity
- Agnostic learning of disjunctions on symmetric distributions
- Learning hurdles for sleeping experts
- scientific article; zbMATH DE number 2089368 (Why is no real title available?)
- Agnostic Learning from Tolerant Natural Proofs
- Approximate Degree in Classical and Quantum Computing
- Agnostically learning Boolean functions with finite polynomial representation
- Learning Disjunctions: Near-Optimal Trade-off between Mistakes and “I Don't Knows”
- Lower bounds for agnostic learning via approximate rank
- On the expressive power of kernel methods and the efficiency of kernel learning by association schemes
This page was built for publication: A Lower Bound for Agnostically Learning Disjunctions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5434065)
