.png){kind=icon}
Return
A Sparse Robust Adaptive Filtering Algorithm Based on the q-Renyi Kernel Function
.png){kind=icon}
PRE
AI
DOI：10.1109/LSP.2020.2978408.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this letter, a novel kernel function named q-Renyi kernel is proposed. Based on it, a new online adaptive learning algorithm is presented, which is derived based on the recursive adaptive filtering paradigm under the reproducing kernel Hilbert space. The proposed learning algorithm is different from the conventional kernel-based learning paradigm in two senses: first, the reproducing kernel so-called q-Renyi kernel is firstly derived and employed; and second, a sparsity constraint is utilized to generate a small size of neural networks while maintaining a high learning performance. The effectiveness of the proposed algorithm is demonstrated via numerical simulations.
Keywords:
Kernel adaptive filter
q-Renyi kernel mean p-power loss (qRKMPL)
sparsity constraint
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
9.6
Papers:
1.1W
Citations:
1.7W
Organization
No organization information available
Cited Papers
On the Possible Connection between Photospheric 5-Min Oscillation and Solar Flare Microwave Emission
.png){kind=icon}
PREAI
ShareSave
ShareSaveShareSaveShareSaveShareSave
ShareSaveShareSave
View more