paper-with-me

홈 › Papers

Goal-Driven Adaptive Sampling Strategies for Machine Learning Models Predicting Fields

2026-01-29 · Jigar Parekh, Philipp Bekemeyer arxiv

Machine learning models are widely regarded as a way forward to tackle multi-query challenges that arise once expensive black-box simulations such as computational fluid dynamics are investigated. However, ensuring the desired level of accuracy for a certain task at minimal computational cost, e.g. as few black-box samples as possible, remains a challenges. Active learning strategies are used for scalar quantities to overcome this challenges and different so-called infill criteria exists and are commonly employed in several scenarios. Even though needed in various field an extension of active learning strategies towards field predictions is still lacking or limited to very specific scenarios and/or model types. In this paper we propose an active learning strategy for machine learning models that are capable if predicting field which is agnostic to the model architecture itself. For doing so, we combine a well-established Gaussian process model for a scalar reference value and simultaneously aim at reducing the epistemic model error and the difference between scalar and field predictions. Different specific forms of the above-mentioned approach are introduced and compared to each other as well as only scalar-valued based infill. Results are presented for the NASA common research model for an uncertainty propagation task showcasing high level of accuracy at significantly smaller cost compared to an approach without active learning.

📄 PDF Abstract BibTeX arXiv:2601.21832

Code (0)

등록된 구현이 없습니다.

Tasks

Active Learning

Similar Papers 제목 키워드 기반

Adaptive Graph Signal Processing: Algorithms and Optimal Sampling Strategies

2017-09-12 · Paolo Di Lorenzo, Paolo Banelli, Elvin Isufi, Sergio Barbarossa 외

The goal of this paper is to propose novel strategies for adaptive learning of signals defined over graphs, which are observed over a (randomly time-varying) subset of vertices. We recast two classical adaptive algorithm…

Graph Sampling

Active Learning and Bayesian Optimization: a Unified Perspective to Learn with a Goal

2023-03-02 · Francesco Di Fiore, Michela Nardelli, Laura Mainini

Science and Engineering applications are typically associated with expensive optimization problems to identify optimal design solutions and states of the system of interest. Bayesian optimization and active learning comp…

Active LearningBayesian OptimizationGeneral Classification

GO-GenZip: Goal-Oriented Generative Sampling and Hybrid Compression

2026-03-20 · Pietro Talli, Qi Liao, Alessandro Lieto, Parijat Bhattacharjee 외 arxiv

Current network data telemetry pipelines consist of massive streams of fine-grained Key Performance Indicators (KPIs) from multiple distributed sources towards central aggregators, making data storage, transmission, and …

RAMS: Residual-based adversarial-gradient moving sample method for scientific machine learning in solving partial differential equations

2025-09-01 · Weihang Ouyang, Min Zhu, Wei Xiong, Si-Wei Liu 외 arxiv

Physics-informed neural networks (PINNs) and neural operators, two leading scientific machine learning (SciML) paradigms, have emerged as powerful tools for solving partial differential equations (PDEs). Although increas…

Whom to Test? Active Sampling Strategies for Managing COVID-19

2020-12-25 · Yingfei Wang, Inbal Yahav, Balaji Padmanabhan

This paper presents methods to choose individuals to test for infection during a pandemic such as COVID-19, characterized by high contagion and presence of asymptomatic carriers. The smart-testing ideas presented here ar…

Active Learning