A Separable Maximum Correntropy Adaptive Algorithm
Wanlu Shi, Yingsong Li, Badong Chen
Abstract
In this brief, a separable maximum correntropy criterion (SMCC) algorithm is developed by exploiting the typical separability property of tensors. Utilizing the separability property, a great number savings are obtained along with accelerated learning rate and improved estimate accuracy. In the proposed SMCC, a correntropy scheme is used to construct a adaptive algorithm to combat the impulsive noise and outliers in non-Gaussian environment. The complexity and convergence analysis of the SMCC are presented and discussed. Examples with two-way matrix and three-way tensor are carried out to verify the performance of the proposed SMCC algorithm under mixture Gaussian and Student's t noises.
Topics & Concepts
OutlierSeparable spaceConvergence (economics)AlgorithmProperty (philosophy)GaussianRate of convergenceScheme (mathematics)MathematicsComputer scienceMathematical optimizationArtificial intelligenceChannel (broadcasting)PhysicsQuantum mechanicsPhilosophyMathematical analysisEconomicsEpistemologyComputer networkEconomic growthAdvanced Adaptive Filtering TechniquesBlind Source Separation TechniquesSpeech and Audio Processing