Pages that link to "Item:Q5434065"
From MaRDI portal
The following pages link to A Lower Bound for Agnostically Learning Disjunctions (Q5434065):
Displaying 9 items.
- Lower bounds for agnostic learning via approximate rank (Q626689) (← links)
- The unbounded-error communication complexity of symmetric functions (Q2428632) (← links)
- Dimension-free bounds and structural results in communication complexity (Q2698435) (← links)
- Agnostic learning of disjunctions on symmetric distributions (Q2788415) (← links)
- Learning hurdles for sleeping experts (Q2828218) (← links)
- Agnostic Learning from Tolerant Natural Proofs (Q5002638) (← links)
- Approximate Degree in Classical and Quantum Computing (Q5060675) (← links)
- Agnostically Learning Boolean Functions with Finite Polynomial Representation (Q5136248) (← links)
- Learning Disjunctions: Near-Optimal Trade-off between Mistakes and “I Don't Knows” (Q5741808) (← links)