Robust learning of the modified Huber loss
From MaRDI portal
Cites work
- \(\ell^{1}\)-norm support vector machine for ranking with exponentially strongly mixing sequence
- A statistical learning assessment of Huber regression
- Are Loss Functions All the Same?
- Distance metric learning with eigenvalue optimization
- Distributed kernel gradient descent algorithm for minimum error entropy principle
- Distributed robust regression with correntropy losses and regularization kernel networks
- Fast rates of exponential cost function
- Fast rates of minimum error entropy with heavy-tailed noise
- Functional linear regression with Huber loss
- Generalization bounds for metric and similarity learning
- Learning rates for regularized least squares ranking algorithm
- Learning rates of least-square regularized regression
- Learning Theory
- Learning theory of minimum error entropy under weak moment conditions
- Learning under \((1 + \epsilon)\)-moment conditions
- Least squares after model selection in high-dimensional sparse models
- Model selection for regularized least-squares algorithm in learning theory
- Nonasymptotic analysis of robust regression with modified Huber's loss
- On the robustness of regularized pairwise learning methods based on kernels
- Optimal learning rates for least squares regularized regression with unbounded sampling
- Pairwise learning problems with regularization networks and Nyström subsampling approach
- Probability Inequalities for Sums of Bounded Random Variables
- Regularization schemes for minimum error entropy principle
- Robust Estimation Using Modified Huber’s Functions With New Tails
- Robust Variable Selection With Exponential Squared Loss
- Sparse Reduced Rank Huber Regression in High Dimensions
- Stochastic proximal AUC maximization
- Theory of Reproducing Kernels
This page was built for publication: Robust learning of the modified Huber loss
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6956457)
