Pages that link to "Item:Q1271479"
From MaRDI portal
The following pages link to Optimal mistake bound learning is hard (Q1271479):
Displaying 7 items.
- Detecting and preventing error propagation via competitive learning (Q461108) (← links)
- Learning parities in the mistake-bound model (Q1944027) (← links)
- Estimation of the hardness of the learning with errors problem with a restricted number of samples (Q2415419) (← links)
- 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) (Q3182498) (← links)
- (Q4018074) (← links)
- From undecidability of non-triviality and finiteness to undecidability of learnability (Q6064265) (← links)
- A note on hardness of computing recursive teaching dimension (Q6072213) (← links)