Greedy Criterion in Orthogonal Greedy Learning.

Lin Xu,Shaobo Lin,Jinshan Zeng,Xia Liu,Zongben Xu

IEEE Transactions on Cybernetics（2018）

引用 8|浏览74

暂无评分

摘要

Orthogonal greedy learning (OGL) is a stepwise learning scheme that starts with selecting a new atom from a specified dictionary via the steepest gradient descent (SGD) and then builds the estimator through orthogonal projection. In this paper, we found that SGD is not the unique greedy criterion and introduced a new greedy criterion, called as “δ-greedy threshold” for learning. Based on this new ...

查看译文

关键词

Dictionaries,Greedy algorithms,Signal processing algorithms,Learning systems,Optimization,Inference algorithms,Computers

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要