A new robust fixed-point algorithm and its convergence analysis
From MaRDI portal
Publication:1684922
Recommendations
- Fast rates of minimum error entropy with heavy-tailed noise
- Comparison of the convergence rates of the new correntropy-based Levenberg-Marquardt (CLM) method and the fixed-point maximum correntropy (FP-MCC) algorithm
- Online minimum error entropy algorithm with unbounded sampling
- Kernel gradient descent algorithm for information theoretic learning
- Mixture quantized error entropy for recursive least squares adaptive filtering
Cites work
- A minimum-error entropy criterion with self-adjusting step-size (MEE-SAS)
- A new interpretation on the MMSE as a robust MEE criterion
- A simple proof of the Banach contraction principle
- Correntropy based feature selection using binary projection
- Correntropy: Properties and Applications in Non-Gaussian Signal Processing
- Finite mixture models
- Fixed point theory and applications
- scientific article; zbMATH DE number 3853749 (Why is no real title available?)
- scientific article; zbMATH DE number 42384 (Why is no real title available?)
- scientific article; zbMATH DE number 50447 (Why is no real title available?)
- Information theoretic learning. Renyi's entropy and kernel perspectives
- Robust Principal Component Analysis Based on Maximum Correntropy Criterion
- The exponential distribution in information theory
Cited in
(3)- Comparison of the convergence rates of the new correntropy-based Levenberg-Marquardt (CLM) method and the fixed-point maximum correntropy (FP-MCC) algorithm
- Computational method for estimating the domain of attraction of discrete-time uncertain rational systems
- New robust state-estimation frameworks for angles-only underwater target tracking problems
This page was built for publication: A new robust fixed-point algorithm and its convergence analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1684922)