首页> 外文期刊>IEEE Transactions on Information Theory >Information Constrained Optimal Transport: From Talagrand, to Marton, to Cover
【24h】

Information Constrained Optimal Transport: From Talagrand, to Marton, to Cover

机译:Information Constrained Optimal Transport: From Talagrand, to Marton, to Cover

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

摘要

The optimal transport problem studies how to transport one measure to another in the most cost-effective way and has wide range of applications from economics to machine learning. In this paper, we introduce and study an information constrained variation of this problem. Our study yields a strengthening and generalization of Talagrand’s celebrated transportation cost inequality. Following Marton’s approach, we show that the new transportation cost inequality can be used to recover old and new concentration of measure results. Finally, we provide an application of this new inequality to network information theory. We show that it can be used to recover almost immediately a recent solution to a long-standing open problem posed by Cover regarding the capacity of the relay channel.

著录项

获取原文

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号