Learning nested differences in the presence of malicious noise
From MaRDI portal
Recommendations
Cites work
- A result of Vapnik with applications
- A theory of the learnable
- Efficient noise-tolerant learning from statistical queries
- scientific article; zbMATH DE number 607286 (Why is no real title available?)
- scientific article; zbMATH DE number 2077162 (Why is no real title available?)
- Learning in the Presence of Malicious Errors
- Learning Integer Lattices
- On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
- Predicting \(\{ 0,1\}\)-functions on randomly drawn points
- Probably Approximate Learning of Sets and Functions
- Queries and concept learning
Cited in
(7)- On-line learning with malicious noise and the closure algorithm
- PAC learning with nasty noise.
- A new PAC bound for intersection-closed concept classes
- Learning Halfspaces with Malicious Noise
- scientific article; zbMATH DE number 67609 (Why is no real title available?)
- Node perturbation learning without noiseless baseline
- Learning nested differences in the presence of malicious noise
This page was built for publication: Learning nested differences in the presence of malicious noise
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1390947)
