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

SVMax: A Feature Embedding Regularizer

University of Maryland, College Park(马里兰大学帕克分校)

Ahmed Taha, Alex Hanson, Abhinav Shrivastava, Larry Davis

英文摘要:

A neural network regularizer (e.g., weight decay) boosts performance by explicitly penalizing the complexity of a network. In this paper, we penalize inferior network activations -- feature embeddings -- which in turn regularize the network's weights implicitly. We propose singular value maximization (SVMax) to learn a more uniform feature embedding. The SVMax regularizer supports both supervised and unsupervised learning. Our formulation mitigates model collapse and enables larger learning rates. We evaluate the SVMax regularizer using both retrieval and generative adversarial networks. We leverage a synthetic mixture of Gaussians dataset to evaluate SVMax in an unsupervised setting. For retrieval networks, SVMax achieves significant improvement margins across various ranking losses. Code available at https://bit.ly/3jNkgDt

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

↑