Large-scale robust regression with truncated loss via majorization-minimization algorithm
From MaRDI portal
Cites work
- Convex support vector regression
- DC programming and DCA: thirty years of developments
- scientific article; zbMATH DE number 5957364 (Why is no real title available?)
- Incremental majorization-minimization optimization with application to large-scale machine learning
- Kernel-based online regression with canal loss
- Large-scale regression with non-convex loss and penalty
- Learning with the maximum correntropy criterion induced losses for regression
- LIBLINEAR: a library for large linear classification
- Linex and double-linex regression for parameter estimation and forecasting
- Majorization-Minimization Algorithms in Signal Processing, Communications, and Machine Learning
- On convergence properties of implicit self-paced objective
- Risk-Based Robust Statistical Learning by Stochastic Difference-of-Convex Value-Function Optimization
- Robust regression under the general framework of bounded loss functions
- Robust Statistics
- Smooth -insensitive regression by loss symmetrization
- Solving a class of linearly constrained indefinite quadratic problems by DC algorithms
- Sparse regression for large data sets with outliers
- The Concave-Convex Procedure
- The Fitting of Power Series, Meaning Polynomials, Illustrated on Band-Spectroscopic Data
- Training robust support vector regression with smooth non-convex loss function
- Unified SVM algorithm based on LS-DC loss
This page was built for publication: Large-scale robust regression with truncated loss via majorization-minimization algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6982585)
