Understanding simultaneous train and test robustness
From MaRDI portal
Cites work
- A general decision theory for Huber's \(\epsilon\)-contamination model
- A polynomial-time algorithm for learning noisy linear threshold functions
- Agnostic estimation of mean and covariance
- Agnostically Learning Halfspaces
- Distributionally Robust Convex Optimization
- Efficient noise-tolerant learning from statistical queries
- High-dimensional probability. An introduction with applications in data science
- High-dimensional statistics. A non-asymptotic viewpoint
- Inference and missing data
- Learning geometric concepts with nasty noise
- Learning halfspaces with malicious noise
- Robust covariance and scatter matrix estimation under Huber's contamination model
- Robust estimators in high-dimensions without the computational intractability
- Robust optimization
- Strategic classification
- Support-vector networks
- The power of localization for efficiently learning linear separators with noise
- Toward efficient agnostic learning
This page was built for publication: Understanding simultaneous train and test robustness
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7028788)