Consistency analysis for massively inconsistent datasets in bound-to-bound data collaboration
From MaRDI portal
Abstract: Bound-to-Bound Data Collaboration (B2BDC) provides a natural framework for addressing both forward and inverse uncertainty quantification problems. In this approach, QOI (quantity of interest) models are constrained by related experimental observations with interval uncertainty. A collection of such models and observations is termed a dataset and carves out a feasible region in the parameter space. If a dataset has a nonempty feasible set, it is said to be consistent. In real-world applications, it is often the case that collections of experiments and observations are inconsistent. Revealing the source of this inconsistency, i.e., identifying which models and/or observations are problematic, is essential before a dataset can be used for prediction. To address this issue, we introduce a constraint relaxation-based approach, entitled the vector consistency measure, for investigating datasets with numerous sources of inconsistency. The benefits of this vector consistency measure over a previous method of consistency analysis are demonstrated in two realistic gas combustion examples.
Recommendations
- Representing model discrepancy in bound-to-bound data collaboration
- Comparison of statistical and deterministic frameworks of uncertainty quantification
- Data-free inference of the joint distribution of uncertain model parameters
- Estimation of the parameter uncertainty resulting from bounded-error data
- Numerical approaches for collaborative data processing
Cites work
- A reformulation-linearization technique for solving discrete and continuous nonconvex problems
- Bayesian calibration of computer models. (With discussion)
- Comparison of statistical and deterministic frameworks of uncertainty quantification
- Computer model validation with functional output
- Decoding by Linear Programming
- Feasibility and infeasibility in optimization. Algorithms and computational methods.
- For most large underdetermined systems of linear equations the minimal 𝓁1‐norm solution is also the sparsest solution
- Galaxy formation: a Bayesian uncertainty analysis
- Galaxy formation: Bayesian history matching for the observable Universe
- Global optimization with polynomials and the problem of moments
- Graph implementations for nonsmooth convex programs
- Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization
- scientific article; zbMATH DE number 1140584 (Why is no real title available?)
- scientific article; zbMATH DE number 2172949 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- Model validation: a connection between robust control and identification
- Numerical approaches for collaborative data processing
- Robust optimization
- Semidefinite Programming
- Semidefinite programming relaxation for nonconvex quadratic programs
- Semidefinite programming relaxations for semialgebraic problems
- Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming
- Sparse Approximate Solutions to Linear Systems
- Systems biology. Constraint-based reconstruction and analysis
- Verification and validation in scientific computing.
This page was built for publication: Consistency analysis for massively inconsistent datasets in bound-to-bound data collaboration
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4636381)
