Approximations of the cumulative distribution function using transport maps learning.

IF 3.2 2区 数学 Q1 MATHEMATICS, APPLIED
Chaos Pub Date : 2025-09-01 DOI:10.1063/5.0276348
Dawen Wu, Ludovic Chamoin
{"title":"Approximations of the cumulative distribution function using transport maps learning.","authors":"Dawen Wu, Ludovic Chamoin","doi":"10.1063/5.0276348","DOIUrl":null,"url":null,"abstract":"<p><p>This paper considers approximating the cumulative distribution function (CDF). For many important probability distributions, such as the normal distribution, their CDFs lack closed-form expressions representable by elementary functions. Although approximation methods exist, common techniques such as the empirical CDF typically rely on large amounts of sample data to construct sufficiently accurate approximations. The aim of this paper is to provide accurate and data-efficient closed-form approximations for CDFs. Our methodology is inspired by the theory of transport maps. We leverage the fundamental property that in the specific one-dimensional case, the transport map transforming a target random variable to the standard uniform distribution U(0,1) is identical to the target variable's CDF. Building upon this key insight, we propose Transport Map Learning (TML). We utilize TML to train a neural network whose output is subsequently processed by a sigmoid function. This composite architecture serves as our closed-form CDF approximation, inherently constraining the output to the [0,1] range appropriate for a CDF. The effectiveness of the proposed method is validated on three benchmark probability distributions: the standard normal distribution, the beta distribution, and the gamma distribution. The results demonstrate that, given the same amount of training data, the proposed TML method generates highly accurate closed-form approximations for the CDFs. These approximations achieve superior accuracy compared to established methods based on the empirical CDF combined with various interpolation strategies.</p>","PeriodicalId":9974,"journal":{"name":"Chaos","volume":"35 9","pages":""},"PeriodicalIF":3.2000,"publicationDate":"2025-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Chaos","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1063/5.0276348","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
引用次数: 0

Abstract

This paper considers approximating the cumulative distribution function (CDF). For many important probability distributions, such as the normal distribution, their CDFs lack closed-form expressions representable by elementary functions. Although approximation methods exist, common techniques such as the empirical CDF typically rely on large amounts of sample data to construct sufficiently accurate approximations. The aim of this paper is to provide accurate and data-efficient closed-form approximations for CDFs. Our methodology is inspired by the theory of transport maps. We leverage the fundamental property that in the specific one-dimensional case, the transport map transforming a target random variable to the standard uniform distribution U(0,1) is identical to the target variable's CDF. Building upon this key insight, we propose Transport Map Learning (TML). We utilize TML to train a neural network whose output is subsequently processed by a sigmoid function. This composite architecture serves as our closed-form CDF approximation, inherently constraining the output to the [0,1] range appropriate for a CDF. The effectiveness of the proposed method is validated on three benchmark probability distributions: the standard normal distribution, the beta distribution, and the gamma distribution. The results demonstrate that, given the same amount of training data, the proposed TML method generates highly accurate closed-form approximations for the CDFs. These approximations achieve superior accuracy compared to established methods based on the empirical CDF combined with various interpolation strategies.

使用运输地图学习的累积分布函数的近似。
本文研究了累积分布函数(CDF)的近似问题。对于许多重要的概率分布,如正态分布,它们的cdf缺乏可以用初等函数表示的封闭形式表达式。虽然存在近似方法,但常用的技术,如经验CDF,通常依赖于大量的样本数据来构建足够精确的近似。本文的目的是为CDFs提供准确且数据高效的封闭形式近似。我们的方法受到交通地图理论的启发。我们利用在特定一维情况下的基本属性,将目标随机变量转换为标准均匀分布U(0,1)的传输映射与目标变量的CDF相同。基于这一关键见解,我们提出了交通地图学习(TML)。我们利用TML来训练一个神经网络,其输出随后由s型函数处理。这个复合体系结构充当我们的封闭式CDF近似值,固有地将输出限制在适合于CDF的[0,1]范围内。在三种基准概率分布(标准正态分布、beta分布和gamma分布)上验证了该方法的有效性。结果表明,在给定相同数量的训练数据的情况下,所提出的TML方法可以为cdf生成高度精确的封闭形式近似值。与基于经验CDF结合各种插值策略的现有方法相比,这些近似方法具有更高的精度。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Chaos
Chaos 物理-物理:数学物理
CiteScore
5.20
自引率
13.80%
发文量
448
审稿时长
2.3 months
期刊介绍: Chaos: An Interdisciplinary Journal of Nonlinear Science is a peer-reviewed journal devoted to increasing the understanding of nonlinear phenomena and describing the manifestations in a manner comprehensible to researchers from a broad spectrum of disciplines.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信