Learning parities in the mistake-bound model
From MaRDI portal
Recommendations
- Optimal mistake bound learning is hard
- On the robustness of learning parity with noise
- Error learning behaviour and stability revisited
- Convergence in models of misspecified learning
- ESTIMATING THE APPROXIMATION ERROR IN LEARNING THEORY
- Noise-tolerant learning, the parity problem, and the statistical query model
- Noise-tolerant learning, the parity problem, and the statistical query model
- Learning in mis-specified models and the possibility of cycles
- Refined error bounds for several learning algorithms
Cites work
Cited in
(9)- Optimal mistake bound learning is hard
- Toward attribute efficient learning of decision lists and parities
- Erratum (“Fast and Robust Learning by Reinforcement Signals: Explorations in the Insect Brain” by Ramón Huerta and Thomas Nowotny, Neural Computation, August 2009, Vol. 21, No. 8: 2123–2151)
- Detecting and preventing error propagation via competitive learning
- Fast learning requires good memory: a time-space lower bound for parity learning
- Learning Theory
- Learning Theory
- Improved learning of \(k\)-parities
- Approximating the number of relevant variables in a parity implies proper learning
This page was built for publication: Learning parities in the mistake-bound model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1944027)
