arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2104.04110cs.LG
收藏

LISTA及其他的设计空间研究

A Design Space Study for LISTA and Beyond

Google Research(谷歌研究院);The University of Texas at Austin(德克萨斯大学奥斯汀分校)

Tianjian Meng, Xiaohan Chen, Yifan Jiang, Zhangyang Wang

摘要:

近年来,在通过展开迭代算法构建特定于问题的深度网络方面取得了巨大成功,用于解决逆问题等。展开被认为是将基于模型的先验与深度学习的学习能力相结合。本文重新审视了展开作为深度网络设计方法的作用:其产生的特殊架构在多大程度上是优越的,我们能找到更好的吗?使用LISTA稀疏恢复作为一个代表性的例子,我们进行了第一次彻底的设计空间研究展开的模型。在所有可能的变化中,我们专注于广泛改变连接模式和神经元类型,从而导致LISTA产生巨大的设计空间。为了有效地探索这一领域并识别出表现最好的人,我们利用了新兴的神经架构搜索(NAS)工具。我们仔细检查了搜索到的顶级架构,并能够发现始终优于LISTA的网络。我们进一步提出了更多的可视化和分析,以“打开黑盒子”,并发现搜索的顶级架构表现出高度一致的和潜在的可转移的模式。我们希望我们的研究能引发更多关于如何更好地混合基于模型的优化先验和数据驱动学习的思考和探索。

英文摘要:

In recent years, great success has been witnessed in building problem-specific deep networks from unrolling iterative algorithms, for solving inverse problems and beyond. Unrolling is believed to incorporate the model-based prior with the learning capacity of deep learning. This paper revisits the role of unrolling as a design approach for deep networks: to what extent its resulting special architecture is superior, and can we find better? Using LISTA for sparse recovery as a representative example, we conduct the first thorough design space study for the unrolled models. Among all possible variations, we focus on extensively varying the connectivity patterns and neuron types, leading to a gigantic design space arising from LISTA. To efficiently explore this space and identify top performers, we leverage the emerging tool of neural architecture search (NAS). We carefully examine the searched top architectures in a number of settings, and are able to discover networks that are consistently better than LISTA. We further present more visualization and analysis to "open the black box", and find that the searched top architectures demonstrate highly consistent and potentially transferable patterns. We hope our study to spark more reflections and explorations on how to better mingle model-based optimization prior and data-driven learning.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑