• 文献检索
  • 文档翻译
  • 深度研究
  • 学术资讯
  • 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分钟生成高质量综述,智能提取关键信息,辅助科研写作。

立即免费体验

相似文献

1
Making transport more robust and interpretable by moving data through a small number of anchor points.通过少量锚点移动数据,使传输更稳健且可解释。
Proc Mach Learn Res. 2021 Jul;139:6631-6641.
2
Robust Latent Regression with discriminative regularization by leveraging auxiliary knowledge.利用辅助知识进行判别正则化的稳健潜在回归。
Neural Netw. 2018 May;101:79-93. doi: 10.1016/j.neunet.2018.02.004. Epub 2018 Feb 15.
3
Anchor Space Optimal Transport as a Fast Solution to Multiple Optimal Transport Problems.作为多种最优传输问题快速解决方案的锚定空间最优传输
IEEE Trans Neural Netw Learn Syst. 2024 Oct 3;PP. doi: 10.1109/TNNLS.2024.3462504.
4
Identification of sampling patterns for high-resolution compressed sensing MRI of porous materials: 'learning' from X-ray microcomputed tomography data.多孔材料高分辨率压缩感知 MRI 采样模式的识别:从 X 射线微计算机断层扫描数据中“学习”。
J Microsc. 2019 Nov;276(2):63-81. doi: 10.1111/jmi.12837. Epub 2019 Nov 6.
5
Interpretable Decision Sets: A Joint Framework for Description and Prediction.可解释决策集:用于描述与预测的联合框架
KDD. 2016 Aug;2016:1675-1684. doi: 10.1145/2939672.2939874.
6
Scalable Optimal Transport Methods in Machine Learning: A Contemporary Survey.机器学习中的可扩展最优传输方法:当代综述
IEEE Trans Pattern Anal Mach Intell. 2024 Mar 20;PP. doi: 10.1109/TPAMI.2024.3379571.
7
Optimal transport at finite temperature.有限温度下的最优输运。
Phys Rev E. 2019 Jul;100(1-1):013310. doi: 10.1103/PhysRevE.100.013310.
8
Learning Robust and Discriminative Subspace With Low-Rank Constraints.学习具有低秩约束的鲁棒和判别子空间。
IEEE Trans Neural Netw Learn Syst. 2016 Nov;27(11):2160-2173. doi: 10.1109/TNNLS.2015.2464090. Epub 2015 Aug 31.
9
DeST-OT: Alignment of Spatiotemporal Transcriptomics Data.DeST-OT:时空转录组学数据的比对
bioRxiv. 2024 Mar 10:2024.03.05.583575. doi: 10.1101/2024.03.05.583575.
10
Multi-projection of unequal dimension optimal transport theory for Generative Adversary Networks.多投影不等维最优传输理论在生成对抗网络中的应用。
Neural Netw. 2020 Aug;128:107-125. doi: 10.1016/j.neunet.2020.04.029. Epub 2020 May 4.

引用本文的文献

1
Connectome-constrained ligand-receptor interaction analysis for understanding brain network communication.用于理解脑网络通信的连接体约束配体-受体相互作用分析
Nat Commun. 2025 Sep 2;16(1):8179. doi: 10.1038/s41467-025-63204-9.
2
Learning Latent Trajectories in Developmental Time Series with Hidden-Markov Optimal Transport.使用隐马尔可夫最优传输学习发育时间序列中的潜在轨迹。
bioRxiv. 2025 Feb 19:2025.02.14.638351. doi: 10.1101/2025.02.14.638351.
3
Aligning latent representations of neural activity.对齐神经活动的潜在表征。
Nat Biomed Eng. 2023 Apr;7(4):337-343. doi: 10.1038/s41551-022-00962-7.

本文引用的文献

1
Optimal transport for Gaussian mixture models.高斯混合模型的最优传输
IEEE Access. 2018;7:6269-6278. doi: 10.1109/ACCESS.2018.2889838. Epub 2018 Dec 27.
2
Optimal Transport for Domain Adaptation.最优传输在域适应中的应用。
IEEE Trans Pattern Anal Mach Intell. 2017 Sep;39(9):1853-1865. doi: 10.1109/TPAMI.2016.2615921. Epub 2016 Oct 7.
3
Fast Optimal Transport Averaging of Neuroimaging Data.神经影像数据的快速最优传输平均法
Inf Process Med Imaging. 2015;24:261-72. doi: 10.1007/978-3-319-19992-4_20.
4
Real-time computerized annotation of pictures.图片的实时计算机化标注。
IEEE Trans Pattern Anal Mach Intell. 2008 Jun;30(6):985-1002. doi: 10.1109/TPAMI.2007.70847.
5
Integral invariants for shape matching.用于形状匹配的积分不变量。
IEEE Trans Pattern Anal Mach Intell. 2006 Oct;28(10):1602-18. doi: 10.1109/TPAMI.2006.208.

通过少量锚点移动数据,使传输更稳健且可解释。

Making transport more robust and interpretable by moving data through a small number of anchor points.

作者信息

Lin Chi-Heng, Azabou Mehdi, Dyer Eva L

机构信息

Department of Electrical and Computer Engineering, Georgia Tech, Atlanta, Georgia, USA.

Machine Learning Program, Georgia Tech, Atlanta, Georgia, USA.

出版信息

Proc Mach Learn Res. 2021 Jul;139:6631-6641.

PMID:34545353
原文链接:https://pmc.ncbi.nlm.nih.gov/articles/PMC8449854/
Abstract

Optimal transport (OT) is a widely used technique for distribution alignment, with applications throughout the machine learning, graphics, and vision communities. Without any additional structural assumptions on transport, however, OT can be fragile to outliers or noise, especially in high dimensions. Here, we introduce Latent Optimal Transport (LOT), a new approach for OT that simultaneously learns low-dimensional structure in data while leveraging this structure to solve the alignment task. The idea behind our approach is to learn two sets of "anchors" that constrain the flow of transport between a source and target distribution. In both theoretical and empirical studies, we show that LOT regularizes the rank of transport and makes it more robust to outliers and the sampling density. We show that by allowing the source and target to have different anchors, and using LOT to align the latent spaces between anchors, the resulting transport plan has better structural interpretability and highlights connections between both the individual data points and the local geometry of the datasets.

摘要

最优传输(OT)是一种广泛用于分布对齐的技术,在机器学习、图形学和视觉领域都有应用。然而,在没有对传输进行任何额外结构假设的情况下,OT可能对异常值或噪声很敏感,尤其是在高维空间中。在此,我们引入潜在最优传输(LOT),这是一种新的OT方法,它在学习数据中的低维结构的同时,利用这种结构来解决对齐任务。我们方法背后的想法是学习两组“锚点”,它们约束源分布和目标分布之间的传输流。在理论和实证研究中,我们表明LOT规范了传输的秩,并使其对异常值和采样密度更具鲁棒性。我们表明,通过允许源和目标具有不同的锚点,并使用LOT来对齐锚点之间的潜在空间,所得的传输计划具有更好的结构可解释性,并突出了各个数据点之间以及数据集局部几何之间的联系。