首页> 外文期刊>IEEE Transactions on Information Theory >An Information-Theoretic View of Stochastic Localization
【24h】

An Information-Theoretic View of Stochastic Localization

机译:An Information-Theoretic View of Stochastic Localization

获取原文
获取原文并翻译 | 示例
           

摘要

Given a probability measure $mu $ over $mathbb {R}^{n}$ , it is often useful to approximate it by the convex combination of a small number of probability measures, such that each component is close to a product measure. Recently, Ronen Eldan used a stochastic localization argument to prove a general decomposition result of this type. In Eldan’s theorem, the ‘number of components’ is characterized by the entropy of the mixture, and ‘closeness to product’ is characterized by the covariance matrix of each component. We present an elementary proof of Eldan’s theorem which makes use of an information theory (or estimation theory) interpretation. The proof is analogous to the one of an earlier decomposition result known as the ‘pinning lemma.’

著录项

获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号