Pages that link to "Item:Q626689"
From MaRDI portal
The following pages link to Lower bounds for agnostic learning via approximate rank (Q626689):
Displaying 7 items.
- Self-improved gaps almost everywhere for the agnostic approximation of monomials (Q884469) (← links)
- Dual lower bounds for approximate degree and Markov-Bernstein inequalities (Q2347795) (← links)
- Kolmogorov width and approximate rank (Q2423217) (← links)
- Agnostic learning of disjunctions on symmetric distributions (Q2788415) (← links)
- Agnostically Learning Boolean Functions with Finite Polynomial Representation (Q5136248) (← links)
- A Lower Bound for Agnostically Learning Disjunctions (Q5434065) (← links)
- Polynomial approximation on disjoint segments and amplification of approximation (Q6198118) (← links)