mlsanityData to 7 Oct 2026

Adaptive sparseness for correntropy-based robust regression via automatic relevance determination

arXiv 2302.00082 ↗First posted 31 Jan 2023cs.LG stat.MLcited by 3

Not on the map. Why?

Abstract (arXiv)

Sparseness and robustness are two important properties for many machine learning scenarios. In the present study, regarding the maximum correntropy criterion (MCC) based robust regression algorithm, we investigate to integrate the MCC method with the automatic relevance determination (ARD) technique in a Bayesian framework, so that MCC-based robust regression could be implemented with adaptive sparseness. To be specific, we use an inherent noise assumption from the MCC to derive an explicit likelihood function, and realize the maximum a posteriori (MAP) estimation with the ARD prior by variational Bayesian inference. Compared to the existing robust and sparse L1-regularized MCC regression, the proposed MCC-ARD regression can eradicate the troublesome tuning for the regularization hyper-parameter which controls the regularization strength. Further, MCC-ARD achieves superior prediction performance and feature selection capability than L1-regularized MCC, as demonstrated by a noisy and high-dimensional simulation study.

Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 4 of its 30 references that are in the map. First posted on arXiv 31 Jan 2023.

Builds on

4 of 30 references.

References · 4

  1. 2013Variational Relevance Vector Machinescited by 21
  2. 2015Generalized Correntropy for Robust Adaptive Filteringcited by 9
  3. 2022Correntropy-Based Logistic Regression with Automatic Relevance Determination for Robust Sparse Brain Activity Decodingcited by 4
  4. 2017Bias-Compensated Normalized Maximum Correntropy Criterion Algorithm for System Identification with Noisy Inputcited by 3

Built on by

Cited by year

Citing papers per year: 2024: 2; 2025: 1.

3 papers.