2020
DOI: 10.1007/s00526-020-01773-x
|View full text |Cite
|
Sign up to set email alerts
|

Relaxation analysis in a data driven problem with a single outlier

Abstract: We study a scalar elliptic problem in the data driven context. Our interest is to study the relaxation of a data set that consists of the union of a linear relation and single outlier. The data driven relaxation is given by the union of the linear relation and a truncated cone that connects the outlier with the linear subspace.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
7
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
5
2

Relationship

1
6

Authors

Journals

citations
Cited by 7 publications
(7 citation statements)
references
References 24 publications
0
7
0
Order By: Relevance
“…In a deterministic framework, solving the datadriven problem then entails minimizing an appropriate distance between the points z h = ( h , σ h ) and y h = ( h , σ h ). Appropriate notions of convergence of the data set D h → D ensuring convergence of solutions, as well as related notions of relaxation in the infinite-dimensional setting, have been set forth in [7,9,10]. We note that the paradigm is strictly data-driven and modelfree in the sense that solutions are obtained, or approximated, directly from the data set without recourse to any intervening modeling of the data.…”
Section: −→ Predictionmentioning
confidence: 99%
See 1 more Smart Citation
“…In a deterministic framework, solving the datadriven problem then entails minimizing an appropriate distance between the points z h = ( h , σ h ) and y h = ( h , σ h ). Appropriate notions of convergence of the data set D h → D ensuring convergence of solutions, as well as related notions of relaxation in the infinite-dimensional setting, have been set forth in [7,9,10]. We note that the paradigm is strictly data-driven and modelfree in the sense that solutions are obtained, or approximated, directly from the data set without recourse to any intervening modeling of the data.…”
Section: −→ Predictionmentioning
confidence: 99%
“…Data-Driven (DD) solvers seek to determine the material state y ∈ D that is closest to being admissible, in the sense of E, or, alternatively, the admissible state z ∈ E that is closest to being a possible state of the material, in the sense of D. Optimality is understood in the sense of a suitable norm, e. g., for the set-up in Example 2.2, we may choose i. e., we wish to determine the state z ∈ E of the system that is admissible and closest to the data set D, or, equivalently, the point y ∈ D in the material data set that is closest to being admissible. Evidently, if E is affine and D is compact, e. g., consisting of a finite collection of points, then the DD problem (10) has solutions by the Weierstrass extreme-value theorem. More generally, in [7, Cor.…”
Section: Materials Characterizationmentioning
confidence: 99%
“…In this case, the set of data converges in a weak sense to some distribution, see [CHO21]. See also [RS20] for the analysis of single outliers in measurements.…”
Section: Range Of Measurement Constant (Unbounded) Increasingmentioning
confidence: 99%
“…We first show that this property can be localized, in the sense that the limits can be assumed to be constant. A related question on localization has been raised in [RS19].…”
Section: Div-curl-closed Materials Data Setsmentioning
confidence: 99%
“…These difficulties notwithstanding, in [CMO18] conditions on the data set ensuring existence are set forth, and it is shown that classical solutions are recovered when the data set takes the form of a graph. The approach developed in [CMO18] has been used for the study of relaxation in a data-driven model with a single outlier, which was motivated by the study of porous media [RS19]. This latter connection shows that Data-Driven problems generalize classical problems and subsume them as special cases.…”
Section: Introductionmentioning
confidence: 99%