Calculation of the log-normalizer is a major computational obstacle in applications of log-linear models with large output spaces. The problem of fast normalizer computation has therefore attracted significant attention in the theoretical and applied machine learning literature. In this paper, we analyze a recently proposed technique known as "self-normalization", which introduces a regularization term in training to penalize log normalizers for deviating from zero. This makes it possible to use unnormalized model scores as approximate probabilities. Empirical evidence suggests that self-normalization is extremely effective, but a theoretical understanding of why it should work, and how generally it can be applied, is largely lacking. We prove generalization bounds on the estimated variance of normalizers and upper bounds on the loss in accuracy due to self-normalization, describe classes of input distributions that self-normalize easily, and construct explicit examples of high-variance input distributions. Our theoretical results make predictions about the difficulty of fitting self-normalized models to several classes of distributions, and we conclude with empirical validation of these predictions.
Centre de Mathématiques appliquées(应用数学中心);Ecole polytechnique(巴黎综合理工学院);HSE University(高等经济大学);AgroParisTech(巴黎高等农业与食品工业学院);KTH Royal Institute of Technology(KTH皇家理工学院)
Self-Supervised Transformers for Unsupervised Object Discovery using Normalized Cut
Univ. Grenoble Alpes(格勒诺布尔阿尔卑斯大学);CNRS(法国国家科学研究中心);Grenoble INP(格勒诺布尔理工学院);Tencent AI Lab(腾讯人工智能实验室);LIGM(加斯帕尔·蒙日信息学实验室);Ecole des Ponts(巴黎桥路学院);Samsung AI Center, Cambridge(三星剑桥人工智能中心);MIT(麻省理工学院)
TokenCut: Segmenting Objects in Images and Videos with Self-supervised Transformer and Normalized Cut
MIT CSAIL(麻省理工学院计算机科学与人工智能实验室);LIGM (UMR 8049) - Ecole des Ponts, UPE(巴黎东部大学马恩拉瓦莱计算机实验室(巴黎桥路学校));Tencent AI Lab(腾讯人工智能实验室);Samsung AI Center, Cambridge(三星剑桥人工智能中心);Univ. Grenoble Alpes, CNRS, Grenoble INP, LIG(格勒诺布尔阿尔卑斯大学、法国国家科学研究中心、格勒诺布尔国立理工学院、格勒诺布尔信息学实验室)