Robust joint sparse representation based on maximum correntropy criterion for hyperspectral image classification
Joint sparse representation (JSR) has been a popular technique for hyperspectral image
classification, where a testing pixel and its spatial neighbors are simultaneously …
classification, where a testing pixel and its spatial neighbors are simultaneously …
Sparse modal additive model
Sparse additive models have been successfully applied to high-dimensional data analysis
due to the flexibility and interpretability of their representation. However, the existing …
due to the flexibility and interpretability of their representation. However, the existing …
Inexact proximal gradient methods for non-convex and non-smooth optimization
In machine learning research, the proximal gradient methods are popular for solving various
optimization problems with non-smooth regularization. Inexact proximal gradient methods …
optimization problems with non-smooth regularization. Inexact proximal gradient methods …
Flexible discrete multi-view hashing with collective latent feature learning
Multi-view hashing has gained considerable research attention in efficient multimedia
studies due to its promising performance on heterogeneous data from various sources …
studies due to its promising performance on heterogeneous data from various sources …
From grayscale to color: Quaternion linear regression for color face recognition
Linear regression has shown an effective tool for face recognition in recent years. Most
existing linear regression based methods are devised for grayscale image based face …
existing linear regression based methods are devised for grayscale image based face …
Robust learning of Huber loss under weak conditional moment
S Huang - Neurocomputing, 2022 - Elsevier
In this paper, we study the performance of robust learning with Huber loss. As an alternative
to traditional empirical risk minimization schemes, Huber regression has been extensively …
to traditional empirical risk minimization schemes, Huber regression has been extensively …
Fast rates of Gaussian empirical gain maximization with heavy-tailed noise
In a regression setup, we study in this brief the performance of Gaussian empirical gain
maximization (EGM), which includes a broad variety of well-established robust estimation …
maximization (EGM), which includes a broad variety of well-established robust estimation …
Robust and optimal epsilon-insensitive Kernel-based regression for general noise models
O Karal - Engineering Applications of Artificial Intelligence, 2023 - Elsevier
Sparse representation of kernel based regression (KBR) has received considerable
attention in recent years. Studies on sparse KBR can be divided into two distinct groups …
attention in recent years. Studies on sparse KBR can be divided into two distinct groups …
Distributed robust support vector ordinal regression under label noise
H Liu, J Tu, A Gao, C Li - Neurocomputing, 2024 - Elsevier
Ordinal regression (OR) methods are designed for a type of classification problems where
data labels have natural orders. In practice, data may be corrupted by label noise, which …
data labels have natural orders. In practice, data may be corrupted by label noise, which …
Sparse Additive Machine With the Correntropy-Induced Loss
Sparse additive machines (SAMs) have shown competitive performance on variable
selection and classification in high-dimensional data due to their representation flexibility …
selection and classification in high-dimensional data due to their representation flexibility …