On robustness properties of convex risk minimization methods for pattern recognition
From MaRDI portal
Recommendations
- On properties of support vector machines for pattern recognition in finite samples
- Consistency and robustness of kernel-based regression in convex risk minimization
- Statistical behavior and consistency of classification methods based on convex risk minimization.
- Robust support vector machines for classification and computational issues
- Convexity, Classification, and Risk Bounds
Cited in
(33)- Robust learning from bites for data mining
- Risk-sensitive loss functions for sparse multi-category classification problems
- Identifying outliers using multiple kernel canonical correlation analysis with application to imaging genetics
- Robustness of reweighted least squares kernel based regression
- Asymmetric least squares support vector machine classifiers
- Robust relevance vector machine for classification with variational inference
- The security of machine learning
- Robust pairwise learning with Huber loss
- Assessing robustness of classification using an angular breakdown point
- Asymptotic linear expansion of regularized M-estimators
- Robustness by reweighting for kernel estimators: an overview
- Influence diagnostics in support vector machines
- Learning rates of kernel-based robust classification
- Frameworks and results in distributionally robust optimization
- Quantitative robustness of localized support vector machines
- Learning rates for the kernel regularized regression with a differentiable strongly convex loss
- Robustness of learning algorithms using hinge loss with outlier indicators
- A review on consistency and robustness properties of support vector machines for heavy-tailed distributions
- Detecting influential observations in kernel PCA
- Consistency and robustness of kernel-based regression in convex risk minimization
- On a strategy to develop robust and simple tariffs from motor vehicle insurance data
- Robust -support vector machine based on worst-case conditional value-at-risk minimization
- Separability of reproducing kernel spaces
- Bouligand derivatives and robustness of support vector machines for regression
- On the robustness of regularized pairwise learning methods based on kernels
- Error analysis of the kernel regularized regression based on refined convex losses and RKBSs
- Visually Communicating and Teaching Intuition for Influence Functions
- Support vector machines based on convex risk functions and general norms
- On properties of support vector machines for pattern recognition in finite samples
- Robust support vector machines for classification with nonconvex and smooth losses
- Total stability of outcome weighted learning
- Asymptotic normality of support vector machine variants and other regularized kernel methods
- An outlier map for support vector machine classification
This page was built for publication: On robustness properties of convex risk minimization methods for pattern recognition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3093211)