Quantifying and reducing uncertainties on sets under Gaussian Process priors

37 mins 36 secs,  68.79 MB,  MP3  44100 Hz,  249.79 kbits/sec
Share this media item:
Embed this media item:


About this item
Image inherited from collection
Description: Ginsbourger, D
Wednesday 11th April 2018 - 11:00 to 11:30
 
Created: 2018-04-11 14:52
Collection: Uncertainty quantification for complex systems: theory and methodologies
Publisher: Isaac Newton Institute
Copyright: Ginsbourger, D
Language: eng (English)
Distribution: World     (downloadable)
Explicit content: No
Aspect Ratio: 16:9
Screencast: No
Bumper: UCS Default
Trailer: UCS Default
 
Abstract: Gaussian Process models have been used in a number of problems where an objective function f needs to be studied based on a drastically limited number of evaluations. Global optimization algorithms based on Gaussian Process models have been investigated for several decades, and have become quite popular notably in design of computer experiments. Also, further classes of problems involving the estimation of sets implicitly defined by f, e.g. sets of excursion above a given threshold, have inspired multiple research developments. In this talk, we will give an overview of recent results and challenges pertaining to the estimation of sets under Gaussian Process priors, with a particular interest for to the quantification and the sequential reduction of associated uncertainties. Based on a series of joint works primarily with Dario Azzimonti, François Bachoc, Julien Bect, Mickaël Binois, Clément Chevalier, Ilya Molchanov, Victor Picheny, Yann Richet and Emmanuel Vazquez.
Available Formats
Format Quality Bitrate Size
MPEG-4 Video 640x360    1.94 Mbits/sec 547.26 MB View Download
WebM 640x360    535.07 kbits/sec 147.29 MB View Download
iPod Video 480x270    522.12 kbits/sec 143.66 MB View Download
MP3 * 44100 Hz 249.79 kbits/sec 68.79 MB Listen Download
Auto (Allows browser to choose a format it supports)