• 文献检索
  • 文档翻译
  • 深度研究
  • 学术资讯
  • Suppr Zotero 插件Zotero 插件
  • 邀请有礼
  • 套餐&价格
  • 历史记录
应用&插件
Suppr Zotero 插件Zotero 插件浏览器插件Mac 客户端Windows 客户端微信小程序
定价
高级版会员购买积分包购买API积分包
服务
文献检索文档翻译深度研究API 文档MCP 服务
关于我们
关于 Suppr公司介绍联系我们用户协议隐私条款
关注我们

Suppr 超能文献

核心技术专利:CN118964589B侵权必究
粤ICP备2023148730 号-1Suppr @ 2026

文献检索

告别复杂PubMed语法,用中文像聊天一样搜索,搜遍4000万医学文献。AI智能推荐,让科研检索更轻松。

立即免费搜索

文件翻译

保留排版,准确专业,支持PDF/Word/PPT等文件格式,支持 12+语言互译。

免费翻译文档

深度研究

AI帮你快速写综述,25分钟生成高质量综述,智能提取关键信息,辅助科研写作。

立即免费体验

用于正则化最优传输和模式重心的信息几何

Information Geometry for Regularized Optimal Transport and Barycenters of Patterns.

作者信息

Amari Shun-Ichi, Karakida Ryo, Oizumi Masafumi, Cuturi Marco

机构信息

RIKEN, Wako-shi, Saitama 351-0198, Japan

National Institute of Advanced Industrial Science and Technology, Koto-ku, Tokyo 135-0064, Japan

出版信息

Neural Comput. 2019 May;31(5):827-848. doi: 10.1162/neco_a_01178. Epub 2019 Mar 18.

DOI:10.1162/neco_a_01178
PMID:30883281
Abstract

We propose a new divergence on the manifold of probability distributions, building on the entropic regularization of optimal transportation problems. As Cuturi ( 2013 ) showed, regularizing the optimal transport problem with an entropic term is known to bring several computational benefits. However, because of that regularization, the resulting approximation of the optimal transport cost does not define a proper distance or divergence between probability distributions. We recently tried to introduce a family of divergences connecting the Wasserstein distance and the Kullback-Leibler divergence from an information geometry point of view (see Amari, Karakida, & Oizumi, 2018 ). However, that proposal was not able to retain key intuitive aspects of the Wasserstein geometry, such as translation invariance, which plays a key role when used in the more general problem of computing optimal transport barycenters. The divergence we propose in this work is able to retain such properties and admits an intuitive interpretation.

摘要

我们基于最优传输问题的熵正则化,在概率分布流形上提出了一种新的散度。正如Cuturi(2013年)所表明的,用熵项对最优传输问题进行正则化已知会带来若干计算上的好处。然而,由于这种正则化,最优传输成本的所得近似并没有定义概率分布之间的恰当距离或散度。我们最近试图从信息几何的角度引入一族连接瓦瑟斯坦距离和库尔贝克 - 莱布勒散度的散度(见Amari、Karakida和Oizumi,2018年)。然而,该提议无法保留瓦瑟斯坦几何的关键直观方面,比如平移不变性,而平移不变性在用于计算最优传输重心的更一般问题时起着关键作用。我们在这项工作中提出的散度能够保留此类性质并允许一种直观的解释。

相似文献

1
Information Geometry for Regularized Optimal Transport and Barycenters of Patterns.用于正则化最优传输和模式重心的信息几何
Neural Comput. 2019 May;31(5):827-848. doi: 10.1162/neco_a_01178. Epub 2019 Mar 18.
2
Entropy-Regularized Optimal Transport on Multivariate Normal and -normal Distributions.多元正态分布和次正态分布上的熵正则化最优传输
Entropy (Basel). 2021 Mar 3;23(3):302. doi: 10.3390/e23030302.
3
Aggregated Wasserstein Distance and State Registration for Hidden Markov Models.隐马尔可夫模型的聚合瓦瑟斯坦距离与状态配准
IEEE Trans Pattern Anal Mach Intell. 2020 Sep;42(9):2133-2147. doi: 10.1109/TPAMI.2019.2908635. Epub 2019 Apr 1.
4
A novel kernel Wasserstein distance on Gaussian measures: An application of identifying dental artifacts in head and neck computed tomography.高斯测度上的一种新型核瓦瑟斯坦距离:在头颈部计算机断层扫描中识别牙科伪影的应用
Comput Biol Med. 2020 May;120:103731. doi: 10.1016/j.compbiomed.2020.103731. Epub 2020 Mar 26.
5
Pseudo-Riemannian geometry encodes information geometry in optimal transport.伪黎曼几何在最优传输中对信息几何进行编码。
Inf Geom. 2022;5(1):131-159. doi: 10.1007/s41884-021-00053-7. Epub 2021 Jul 30.
6
Probability Forecast Combination via Entropy Regularized Wasserstein Distance.基于熵正则化 Wasserstein 距离的概率预测组合
Entropy (Basel). 2020 Aug 25;22(9):929. doi: 10.3390/e22090929.
7
Variational Characterizations of Local Entropy and Heat Regularization in Deep Learning.深度学习中局部熵和热正则化的变分表征
Entropy (Basel). 2019 May 20;21(5):511. doi: 10.3390/e21050511.
8
Soft Quantization Using Entropic Regularization.使用熵正则化的软量化
Entropy (Basel). 2023 Oct 10;25(10):1435. doi: 10.3390/e25101435.
9
On Voronoi Diagrams on the Information-Geometric Cauchy Manifolds.关于信息几何柯西流形上的沃罗诺伊图。
Entropy (Basel). 2020 Jun 28;22(7):713. doi: 10.3390/e22070713.
10
On a Generalization of the Jensen-Shannon Divergence and the Jensen-Shannon Centroid.关于詹森 - 香农散度与詹森 - 香农质心的一种推广
Entropy (Basel). 2020 Feb 16;22(2):221. doi: 10.3390/e22020221.

引用本文的文献

1
Pseudo-Riemannian geometry encodes information geometry in optimal transport.伪黎曼几何在最优传输中对信息几何进行编码。
Inf Geom. 2022;5(1):131-159. doi: 10.1007/s41884-021-00053-7. Epub 2021 Jul 30.
2
Physarum Powered Differentiable Linear Programming Layers and Applications.黏菌驱动的可微线性规划层及其应用
Proc AAAI Conf Artif Intell. 2021 Feb;35(10):8939-8949. Epub 2021 May 18.
3
Entropy-Regularized Optimal Transport on Multivariate Normal and -normal Distributions.多元正态分布和次正态分布上的熵正则化最优传输
Entropy (Basel). 2021 Mar 3;23(3):302. doi: 10.3390/e23030302.
4
Clustering Patterns Connecting COVID-19 Dynamics and Human Mobility Using Optimal Transport.利用最优传输连接新冠疫情动态与人员流动的聚类模式
Sankhya B (2008). 2021;83(Suppl 1):167-184. doi: 10.1007/s13571-021-00255-0. Epub 2021 Mar 16.