- Library Home /
- Search Collections /
- Open Collections /
- Browse Collections /
- BIRS Workshop Lecture Videos /
- On the construction of minimax-distance (sub-)optimal...
Open Collections
BIRS Workshop Lecture Videos
BIRS Workshop Lecture Videos
On the construction of minimax-distance (sub-)optimal designs Pronzato, Luc
Description
A good experimental design in a non-parametric framework, such as Gaussian process modelling in computer experiments, should have satisfactory space-filling properties. Minimax-distance designs minimize the maximum distance between a point of the region of interest and its closest design point, and thus have attractive properties in this context. However, their construction is difficult, even in moderate dimension, and one should in general be satisfied with a design that is not too strongly suboptimal. Several methods based on a discretization of the experimental region will be considered, such as the determination of Chebyshev-centroidal Voronoi tessellations obtained from fixed-point iterations of Lloyds' method, and the construction of any-time (nested) suboptimal solutions by greedy algorithms applied to submodular surrogates of the minimax-distance criterion. The construction of design measures that minimize a regularized version of the criterion will also be investigated.
Item Metadata
| Title |
On the construction of minimax-distance (sub-)optimal designs
|
| Creator | |
| Publisher |
Banff International Research Station for Mathematical Innovation and Discovery
|
| Date Issued |
2017-08-11T08:47
|
| Description |
A good experimental design in a non-parametric framework, such as Gaussian process modelling in computer experiments, should have satisfactory space-filling properties. Minimax-distance designs minimize the maximum distance between a point of the region of interest and its closest design point, and thus have attractive properties in this context. However, their construction is difficult, even in moderate dimension, and one should in general be satisfied with a design that is not too strongly suboptimal. Several methods based on a discretization of the experimental region will be considered, such as the determination of Chebyshev-centroidal Voronoi tessellations obtained from fixed-point iterations of Lloyds' method, and the construction of any-time (nested) suboptimal solutions by greedy algorithms applied to submodular surrogates of the minimax-distance criterion. The construction of design measures that minimize a regularized version of the criterion will also be investigated.
|
| Extent |
48 minutes
|
| Subject | |
| Type | |
| File Format |
video/mp4
|
| Language |
eng
|
| Notes |
Author affiliation: CNRS/Université de Nice–Sophia Antipolis
|
| Series | |
| Date Available |
2018-02-08
|
| Provider |
Vancouver : University of British Columbia Library
|
| Rights |
Attribution-NonCommercial-NoDerivatives 4.0 International
|
| DOI |
10.14288/1.0363442
|
| URI | |
| Affiliation | |
| Peer Review Status |
Unreviewed
|
| Scholarly Level |
Other
|
| Rights URI | |
| Aggregated Source Repository |
DSpace
|
Item Media
Item Citations and Data
Rights
Attribution-NonCommercial-NoDerivatives 4.0 International