BriefGPT.xyz
May, 2019
学习展开稀疏编码的步长
Learning step sizes for unfolded sparse coding
HTML
PDF
Pierre Ablin, Thomas Moreau, Mathurin Massias, Alexandre Gramfort
TL;DR
本文研究了ISTA算法中的选适应性步长的方法,提出了学习ISTA步长的网络结构,实验证明该方法与现有最先进的网络相比是具有竞争力的。
Abstract
sparse coding
is typically solved by iterative optimization techniques, such as the Iterative Shrinkage-Thresholding Algorithm (ISTA). Unfolding and learning weights of ISTA using
neural networks
is a practical w
→