arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1302.7083math.NAcs.NAstat.ME
收藏

基于多项式逼近的高维散乱数据不确定性量化

Quantification of uncertainty from high-dimensional scattered data via polynomial approximation

LIMSI-CNRS(法国国家科学研究中心计算实验室);Dpt. of Aeronautics and Astronautics, Massachusetts Institute of Technology(麻省理工学院航空航天系)

Lionel Mathelin

AI总结:

提出一种从有限高维散乱样本中构建随机过程函数表示的方法,通过高维模型表示格式与改进最小角回归选择基函数,结合交替最小二乘或加权总体最小二乘估计系数,在样本量极少(每维约3个)且含噪声时仍能获得准确逼近。

摘要:

本文讨论了一种从散乱点样本集合中确定随机过程函数表示的方法。本工作特别关注在信息有限的情况下,位于高维随机空间中的随机量。所提出的方法包括选择近似基和评估相关系数的过程。近似基的选择依赖于先验选择的高维模型表示格式,并结合改进的最小角回归技术。由此产生的基为实际近似基提供了结构,可能使用不同的函数,这些函数更简洁且系数非线性。为了评估系数,采用了交替最小二乘和交替加权总体最小二乘两种方法。提供了高维空间中随机变量近似以及随机场估计的示例。考虑了高达100的随机维度,信息量低至每维约3个样本,并且证明了近似对数据集中噪声的鲁棒性。求解方法的计算成本仅与先验基的基数呈线性关系,并且与数据集中的样本数N_q呈(N_q)^s依赖关系,其中2 ≤ s ≤ 3。提供的数值实验说明了本方法即使在存在噪声的情况下,也能从稀少的散乱数据中导出准确的近似。

英文摘要:

This paper discusses a methodology for determining a functional representation of a random process from a collection of scattered pointwise samples. The present work specifically focuses onto random quantities lying in a high dimensional stochastic space in the context of limited amount of information. The proposed approach involves a procedure for the selection of an approximation basis and the evaluation of the associated coefficients. The selection of the approximation basis relies on the a priori choice of the High-Dimensional Model Representation format combined with a modified Least Angle Regression technique. The resulting basis then provides the structure for the actual approximation basis, possibly using different functions, more parsimonious and nonlinear in its coefficients. To evaluate the coefficients, both an alternate least squares and an alternate weighted total least squares methods are employed. Examples are provided for the approximation of a random variable in a high-dimensional space as well as the estimation of a random field. Stochastic dimensions up to 100 are considered, with an amount of information as low as about 3 samples per dimension, and robustness of the approximation is demonstrated w.r.t. noise in the dataset. The computational cost of the solution method is shown to scale only linearly with the cardinality of the a priori basis and exhibits a (N_q)^s, 2 <= s <= 3, dependence with the number N_q of samples in the dataset. The provided numerical experiments illustrate the ability of the present approach to derive an accurate approximation from scarce scattered data even in the presence of noise.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑