Navigating Uncertainties in Machine Learning for Structural Dynamics: A Comprehensive Survey of Probabilistic and Non-Probabilistic Approaches in Forward and Inverse Problems
University of Macau(澳门大学);University of Thessaly(色萨利大学);Leibniz Universität Hannover(汉诺威莱布尼茨大学);University of Liverpool(利物浦大学);Tongji University(同济大学)
Yan, WJ., Mei, LF., Mo, J. et al. Navigating Uncertainties in Machine Learning for Structural Dynamics: A Comprehensive Survey of Probabilistic and Non-Probabilistic Approaches. Arch Computat Methods Eng (2026)
In the era of big data, machine learning (ML) has become a powerful tool in various fields, notably impacting structural dynamics. ML algorithms offer advantages by modeling physical phenomena based on data, even in the absence of underlying mechanisms. However, uncertainties such as measurement noise and modeling errors can compromise the reliability of ML predictions, highlighting the need for effective uncertainty awareness to enhance prediction robustness. This paper presents a comprehensive review on navigating uncertainties in ML, categorizing uncertainty-aware approaches into probabilistic methods (including Bayesian and frequentist perspectives) and non-probabilistic methods (such as interval learning and fuzzy learning). Bayesian neural networks, known for their uncertainty quantification and nonlinear mapping capabilities, are emphasized for their superior performance and potential. The review covers various techniques and methodologies for addressing uncertainties in ML, discussing fundamentals and implementation procedures of each method. While providing a concise overview of fundamental concepts, the paper refrains from in-depth critical explanations. Strengths and limitations of each approach are examined, along with their applications in structural dynamic forward problems like response prediction, sensitivity assessment, and reliability analysis, and inverse problems like system identification, model updating, and damage identification. Additionally, the review identifies research gaps and suggests future directions for investigations, aiming to provide comprehensive insights to the research community. By offering an extensive overview of both probabilistic and non-probabilistic approaches, this review aims to assist researchers and practitioners in making informed decisions when utilizing ML techniques to address uncertainties in structural dynamic problems.
Technical University of Munich(慕尼黑工业大学);Helmholtz Munich(亥姆霍兹慕尼黑中心);ELLIS Institute Finland(芬兰ELLIS研究所);Aalto University(阿尔托大学);Finnish Center for Artificial Intelligence(芬兰人工智能中心);Munich Center for Machine Learning(慕尼黑机器学习中心);Munich Data Science Institute(慕尼黑数据科学研究所);Ericsson Research(爱立信研究院);KTH Royal Institute of Technology(KTH皇家理工学院);Digital Futures(数字未来研究所)
Probabilistic Super-Resolution of Solar Magnetograms: Generating Many Explanations and Measuring Uncertainties
George Mason University(乔治梅森大学);Trinity College Dublin(都柏林圣三一学院);Dublin Institute for Advanced Studies(都柏林高等研究院);University of Oxford(牛津大学);Center for Mathematics and Computer Science (CWI)(数学与计算机科学中心(CWI));Stanford University(斯坦福大学);Element AI;Southwest Research Institute(西南研究院)
DiffSTG: Probabilistic Spatio-Temporal Graph Forecasting with Denoising Diffusion Models
School of Computer and Information Technology, Beijing Jiaotong University(北京交通大学计算机与信息技术学院);National University of Singapore(新加坡国立大学);DAMO Academy, Alibaba Group(阿里巴巴集团达摩院);Hong Kong University of Science and Technology (Guangzhou)(香港科技大学(广州))
Evaluating probabilistic and data-driven inference models for fiber-coupled NV-diamond temperature sensors
School of Mathematical and Statistical Sciences, Clemson University(克莱姆森大学数学与统计学院);Department of Mathematical Sciences, George Mason University(乔治梅森大学数学科学系)
Probabilistic Random Forest: A machine learning algorithm for noisy datasets
Tel-Aviv University(特拉维夫大学)
机器学习(ML)算法在天文数据分析中变得越来越重要。然而,由于大多数ML算法的设计没有考虑到数据的不确定性,基于ML的研究主要限于高信噪比的数据。如此高质量的天文数据集并不常见。在这项工作中,我们修改了长期建立的随机森林(RF)算法,以考虑测量中的不确定性(即,特征)以及在所分配的类中(即,标签)。为此,概率随机森林(Probably Random Forest,PRF)算法将特征和标签视为概率分布函数,而不是确定性数量。我们进行了各种实验,我们注入不同类型的噪声的数据集,并比较的准确性的PRF的RF。PRF在所有情况下都优于RF,运行时间适度增加。我们发现,在噪声特征的情况下,分类精度提高了10%,在噪声标签的情况下,提高了30%。与干净的数据集相比,对于具有多达45%错误分类对象的数据集,PRF准确度降低了不到5%。除了提高噪声数据集的预测精度外,PRF还能自然地处理数据中的缺失值,并且在应用于训练集和测试集中具有不同噪声特征的数据集时,其性能优于RF,这表明它可以用于迁移学习。