Quantifying the value of information transfer in population-based SHM

• URL: http://arxiv.org/abs/2311.03083v1
• Date: Mon, 6 Nov 2023 13:10:38 GMT
• Title: Quantifying the value of information transfer in population-based SHM
• Authors: Aidan J. Hughes, Jack Poole, Nikolaos Dervilis, Paul Gardner, Keith Worden
• Abstract summary: Population-based structural health monitoring (PBSHM) seeks to address some of the limitations associated with data scarcity. The current paper aims to demonstrate a transfer-strategy decision process for a classification task for a population of simulated structures.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Population-based structural health monitoring (PBSHM), seeks to address some of the limitations associated with data scarcity that arise in traditional SHM. A tenet of the population-based approach to SHM is that information can be shared between sufficiently-similar structures in order to improve predictive models. Transfer learning techniques, such as domain adaptation, have been shown to be a highly-useful technology for sharing information between structures when developing statistical classifiers for PBSHM. Nonetheless, transfer-learning techniques are not without their pitfalls. In some circumstances, for example if the data distributions associated with the structures within a population are dissimilar, applying transfer-learning methods can be detrimental to classification performance -- this phenomenon is known as negative transfer. Given the potentially-severe consequences of negative transfer, it is prudent for engineers to ask the question `when, what, and how should one transfer between structures?'. The current paper aims to demonstrate a transfer-strategy decision process for a classification task for a population of simulated structures in the context of a representative SHM maintenance problem, supported by domain adaptation. The transfer decision framework is based upon the concept of expected value of information transfer. In order to compute the expected value of information transfer, predictions must be made regarding the classification (and decision performance) in the target domain following information transfer. In order to forecast the outcome of transfers, a probabilistic regression is used here to predict classification performance from a proxy for structural similarity based on the modal assurance criterion.

Related papers

• Quantifying Dataset Similarity to Guide Transfer Learning [1.6328866317851185]
  Cross-Learning Score ( CLS) measures dataset similarity through bidirectional performance between domains.<n> CLS can reliably predict whether transfer will improve or degrade performance.<n> CLS is efficient and fast to compute as it bypasses the problem of expensive distribution estimation for high-dimensional problems.
  arXiv  Detail & Related papers  (2025-10-13T00:18:35Z)
• Physics-informed transfer learning for SHM via feature selection [0.0]
  Transfer learning (TL) can be used to leverage information across related domains.<n>The selection of domains and features is reliant on domain expertise.<n>The modal assurance criterion (MAC) is used to quantify the correspondence between the modes of healthy structures.
  arXiv  Detail & Related papers  (2025-07-18T14:28:52Z)
• Wasserstein Transfer Learning [2.7641833515562135]
  We introduce a novel framework for transfer learning in regression models, where outputs are probability distributions residing in the Wasserstein space.<n>When the informative subset of transferable source domains is known, we propose an estimator with provable convergence rates, quantifying the impact of domain similarity on transfer efficiency.<n>For cases where the informative subset is unknown, we develop a data-driven transfer learning procedure designed to mitigate negative transfer.
  arXiv  Detail & Related papers  (2025-05-23T02:38:03Z)
• Transfer Learning Under High-Dimensional Network Convolutional Regression Model [20.18595334666282]
  We propose a high-dimensional transfer learning framework based on network convolutional regression ( NCR) Our methodology includes a two-step transfer learning algorithm that addresses domain shift between source and target networks. Empirical evaluations, including simulations and a real-world application using Sina Weibo data, demonstrate substantial improvements in prediction accuracy.
  arXiv  Detail & Related papers  (2025-04-28T16:52:28Z)
• Partial Transportability for Domain Generalization [56.37032680901525]
  Building on the theory of partial identification and transportability, this paper introduces new results for bounding the value of a functional of the target distribution. Our contribution is to provide the first general estimation technique for transportability problems. We propose a gradient-based optimization scheme for making scalable inferences in practice.
  arXiv  Detail & Related papers  (2025-03-30T22:06:37Z)
• Quantifying the value of positive transfer: An experimental case study [0.0]
  Population-based structural health monitoring seeks to overcome challenges by leveraging data/information from similar structures via technologies such as transfer learning. The current paper demonstrate a methodology for quantifying the value of information transfer in the context of operation and maintenance decision-making.
  arXiv  Detail & Related papers  (2024-07-19T14:23:20Z)
• Robust Transfer Learning with Unreliable Source Data [13.276850367115333]
  We introduce a novel quantity called the ''ambiguity level'' that measures the discrepancy between the target and source regression functions. We propose a simple transfer learning procedure, and establish a general theorem that shows how this new quantity is related to the transferability of learning.
  arXiv  Detail & Related papers  (2023-10-06T21:50:21Z)
• A decision framework for selecting information-transfer strategies in population-based SHM [0.0]
  Population-based structural health monitoring seeks to mitigate the impact of data scarcity. The paper proposes a decision framework for selecting transfer strategies based upon a novel concept.
  arXiv  Detail & Related papers  (2023-07-13T14:36:16Z)
• Transfer Learning on Heterogeneous Feature Spaces for Treatment Effects Estimation [103.55894890759376]
  This paper introduces several building blocks that use representation learning to handle the heterogeneous feature spaces. We show how these building blocks can be used to recover transfer learning equivalents of the standard CATE learners.
  arXiv  Detail & Related papers  (2022-10-08T16:41:02Z)
• Hierarchical Bayesian Modelling for Knowledge Transfer Across Engineering Fleets via Multitask Learning [0.0]
  A population-level analysis is proposed to address data sparsity when building predictive models for engineering infrastructure. Utilising an interpretable hierarchical Bayesian approach and operational fleet data, domain expertise is naturally encoded (and appropriately shared) between different sub-groups.
  arXiv  Detail & Related papers  (2022-04-26T16:02:25Z)
• Learning from Heterogeneous Data Based on Social Interactions over Graphs [58.34060409467834]
  This work proposes a decentralized architecture, where individual agents aim at solving a classification problem while observing streaming features of different dimensions. We show that the. strategy enables the agents to learn consistently under this highly-heterogeneous setting. We show that the. strategy enables the agents to learn consistently under this highly-heterogeneous setting.
  arXiv  Detail & Related papers  (2021-12-17T12:47:18Z)
• Transfer learning to improve streamflow forecasts in data sparse regions [0.0]
  We study the methodology behind Transfer Learning (TL) through fine-tuning and parameter transferring for better generalization performance of streamflow prediction in data-sparse regions. We propose a standard recurrent neural network in the form of Long Short-Term Memory (LSTM) to fit on a sufficiently large source domain dataset. We present a methodology to implement transfer learning approaches for hydrologic applications by separating the spatial and temporal components of the model and training the model to generalize.
  arXiv  Detail & Related papers  (2021-12-06T14:52:53Z)
• A Variational Bayesian Approach to Learning Latent Variables for Acoustic Knowledge Transfer [55.20627066525205]
  We propose a variational Bayesian (VB) approach to learning distributions of latent variables in deep neural network (DNN) models. Our proposed VB approach can obtain good improvements on target devices, and consistently outperforms 13 state-of-the-art knowledge transfer algorithms.
  arXiv  Detail & Related papers  (2021-10-16T15:54:01Z)
• Frustratingly Easy Transferability Estimation [64.42879325144439]
  We propose a simple, efficient, and effective transferability measure named TransRate. TransRate measures the transferability as the mutual information between the features of target examples extracted by a pre-trained model and labels of them. Despite its extraordinary simplicity in 10 lines of codes, TransRate performs remarkably well in extensive evaluations on 22 pre-trained models and 16 downstream tasks.
  arXiv  Detail & Related papers  (2021-06-17T10:27:52Z)
• Unlabelled Data Improves Bayesian Uncertainty Calibration under Covariate Shift [100.52588638477862]
  We develop an approximate Bayesian inference scheme based on posterior regularisation. We demonstrate the utility of our method in the context of transferring prognostic models of prostate cancer across globally diverse populations.
  arXiv  Detail & Related papers  (2020-06-26T13:50:19Z)
• Transferable Perturbations of Deep Feature Distributions [102.94094966908916]
  This work presents a new adversarial attack based on the modeling and exploitation of class-wise and layer-wise deep feature distributions. We achieve state-of-the-art targeted blackbox transfer-based attack results for undefended ImageNet models.
  arXiv  Detail & Related papers  (2020-04-27T00:32:25Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.