Kernel-based sparse regression with the correntropy-induced loss
From MaRDI portal
Publication:2409039
DOI10.1016/j.acha.2016.04.004zbMath1378.68133OpenAlexW2345904635MaRDI QIDQ2409039
Publication date: 10 October 2017
Published in: Applied and Computational Harmonic Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.acha.2016.04.004
General nonlinear regression (62J02) Learning and adaptive systems in artificial intelligence (68T05)
Related Items (5)
Fast rates of minimum error entropy with heavy-tailed noise ⋮ Modal additive models with data-driven structure identification ⋮ Error analysis for coefficient-based regularized regression in additive models ⋮ Regularized modal regression with data-dependent hypothesis spaces ⋮ New Insights Into Learning With Correntropy-Based Regression
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Consistency analysis of an empirical minimum error entropy algorithm
- Convergence rate of the semi-supervised greedy algorithm
- Learning by nonsymmetric kernels with data dependent spaces and \(\ell^1\)-regularizer
- Concentration estimates for learning with \(\ell ^{1}\)-regularizer and data dependent hypothesis spaces
- Least square regression with indefinite kernels and coefficient regularization
- Estimating conditional quantiles with the help of the pinball loss
- Multi-kernel regularized classifiers
- The C-loss function for pattern classification
- Least angle regression. (With discussion)
- Regularization networks with indefinite kernels
- Learning theory estimates for coefficient-based regularized regression
- Regularization networks and support vector machines
- Learning with sample dependent hypothesis spaces
- INDEFINITE KERNEL NETWORK WITH DEPENDENT SAMPLING
- Learning Theory
- Support Vector Machines
- Robust regression using iteratively reweighted least-squares
- Correntropy: Properties and Applications in Non-Gaussian Signal Processing
- Minimum Error Entropy Based Sparse Representation for Robust Subspace Clustering
- Generalized correlation function: definition, properties, and application to blind equalization
- Information Theoretic Learning
- A Regularized Correntropy Framework for Robust Pattern Recognition
- Regularization schemes for minimum error entropy principle
- Error Analysis of Coefficient-Based Regularized Algorithm for Density-Level Detection
- Analysis of Half-Quadratic Minimization Methods for Signal and Image Recovery
- Robust Statistics
This page was built for publication: Kernel-based sparse regression with the correntropy-induced loss
