The support vector machine (SVM) is a popular classification method which enjoys good performance in many real applications. The SVM can be viewed as a penalized minimization problem in which the objective function is the expectation of hinge loss function with respect to the standard non-smooth empirical measure corresponding to the true underlying measure. We further extend this viewpoint and propose a smoothed SVM by substituting a kernel density estimator for the measure in the expectation calculation. The resulting method is called density convoluted support vector machine (DCSVM). We argue that the DCSVM is particularly more interesting than the standard SVM in the context of high-dimensional classification. We systematically study the rate of convergence of the elastic-net penalized DCSVM under general random design setting. We further develop novel efficient algorithm for computing elastic-net penalized DCSVM. Simulation studies and ten benchmark datasets are used to demonstrate the superior classification performance of elastic-net DCSVM over other competitors, and it is demonstrated in these numerical studies that the computation of DCSVM can be more than 100 times faster than that of the SVM.
Huber regression serves as a prominent robust alternative to ordinary least squares (OLS), particularly in the presence of heavy-tailed error distributions. While the asymptotic relative efficiency (ARE) of Huber regression is well documented for the standard normal distribution, its worst-case efficiency across the class of all continuous and symmetric error distributions remains an important theoretical question. In this paper, we establish positive lower bounds for the ARE of Huber regression relative to OLS. By strategically selecting the robustification parameter based on the moments or quantiles of the error distribution, we first prove that the ARE is uniformly bounded away from zero across all continuous and symmetric error distributions. This result guarantees a baseline level of efficiency for Huber regression, sharing a similar theoretical spirit with the celebrated lower bound of the Wilcoxon rank estimator. Utilizing the empirical process theory, we further establish that the relative efficiency of Huber regression remains unchanged if the theoretical tuning parameter is replaced by an estimator with a suitable convergence rate. Simulation studies are conducted to examine the performance of Huber regression under the proposed tuning strategies.