Publication

Multi-Level Monte Carlo Methods for Uncertainty Quantification and Risk-Averse Optimisation

Publications associées (89)

A New Lighting on Analytical Discrete Sensitivities in the Context of IsoGeometric Shape Optimization

Isogeometric shape optimization has been now studied for over a decade. This contribution aims at compiling the key ingredients within this promising framework, with a particular attention to sensitivity analysis. Based on all the researches related to iso ...

2020

MATHICSE Technical Report : A Multilevel Stochastic Gradient method for PDE-constrained Optimal Control Problems with uncertain parameters

Fabio Nobile, Matthieu Claude Martin, Panagiotis Tsilifis

In this paper, we present a multilevel Monte Carlo (MLMC) version of the Stochastic Gradient (SG) method for optimization under uncertainty, in order to tackle Optimal Control Problems (OCP) where the constraints are described in the form of PDEs with rand ...

MATHICSE2020

A note on efficient computation of privileged directions in modifier adaptation

Dominique Bonvin, Timm Faulwasser, Alejandro Gabriel Marchetti, Martand Singhal

In the presence of plant-model mismatch, the estimation of plant gradients is key to the performance of measurement-based iterative optimization schemes. However, gradient estimation requires time-consuming experiments, wherein the plant is sequentially pe ...

PERGAMON-ELSEVIER SCIENCE LTD2020

On Convergence-Diagnostic based Step Sizes for Stochastic Gradient Descent

Nicolas Henri Bernard Flammarion, Scott William Pesme, Aymeric Daphnis Kévin Dieuleveut

Constant step-size Stochastic Gradient Descent exhibits two phases: a transient phase during which iterates make fast progress towards the optimum, followed by a stationary phase during which iterates oscillate around the optimal point. In this paper, we s ...

2020

Stochastic approximation methods for PDE constrained optimal control problems with uncertain parameters

Matthieu Claude Martin

This thesis work focuses on optimal control of partial differential equations (PDEs) with uncertain parameters, treated as a random variables. In particular, we assume that the random parameters are not observable and look for a deterministic control which ...

EPFL2019

Adversarial Analytics

Viet Anh Nguyen

Adversarial learning is an emergent technique that provides better security to machine learning systems by deliberately protecting them against specific vulnerabilities of the learning algorithms. Many adversarial learning problems can be cast equivalently ...

EPFL2019

"Dice"-sion Making under Uncertainty: When Can a Random Decision Reduce Risk?

Daniel Kuhn, Wolfram Wiesemann

Stochastic programming and distributionally robust optimization seek deterministic decisions that optimize a risk measure, possibly in view of the most adverse distribution in an ambiguity set. We investigate under which circumstances such deterministic de ...

2019

Spatial Risk Measures and Rate of Spatial Diversification

Erwan Fabrice Koch

An accurate assessment of the risk of extreme environmental events is of great importance for populations, authorities and the banking/insurance/reinsurance industry. Koch (2017) introduced a notion of spatial risk measure and a corresponding set of axioms ...

2019

Distributed Inference Over Networks Under Subspace Constraints

Ali H. Sayed, Stefan Vlaski, Roula Nassif

This paper considers optimization problems over networks where agents have individual objectives to meet, or individual parameter vectors to estimate, subject to subspace constraints that enforce the objectives across the network to lie in a low-dimensiona ...

IEEE2019

Energy and Reserve Dispatch with Distributionally Robust Joint Chance Constraints

Daniel Kuhn, Viet Anh Nguyen, Christos Ordoudis

We develop a two-stage stochastic program for energy and reserve dispatch, which ensures the safe operation of a power system with a high penetration of renewables and a strong interdependence with the natural gas system. Distributionally robust joint chan ...

2018

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search