Concept

Spectral risk measure

Publications associées (10)

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

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

"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

Model Uncertainty And Scenario Aggregation

Damir Filipovic, Mathieu Jacques David Cambou

This paper provides a coherent method for scenario aggregation addressing model uncertainty. It is based on divergence minimization from a reference probability measure subject to scenario constraints. An example from regulatory practice motivates the defi ...

Wiley-Blackwell2017

Manitest: Are classifiers really invariant?

Pascal Frossard, Alhussein Fawzi

Invariance to geometric transformations is a highly desirable property of automatic classifiers in many image recognition tasks. Nevertheless, it is unclear to which extent state-of-the-art classifiers are invariant to basic transformations such as rotatio ...

2015

Risk-averse shortest path problems

Daniel Kuhn, Grani Adiwena Hanasusanto

We investigate routing policies for shortest path problems with uncertain arc lengths. The objective is to minimize a risk measure of the total travel time. We use the conditional value-at-risk (CVaR) for when the arc lengths (durations) have known distrib ...

IEEE2012

Deconvolution of 3D fluorescence micrographs with automatic risk minimization

Michaël Unser, Cédric René Jean Vonesch, Sathish Ramani

We investigate the problem of automatic tuning of a deconvolution algorithm for three-dimensional (3D) fluorescence microscopy; specifically, the selection of the regularization parameter lambda. For this, we consider a realistic noise model for data obtai ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2008

Deconvolution of 3D Fluorescence Micrographs with Automatic Risk Minimization

Michaël Unser, Cédric René Jean Vonesch, Sathish Ramani

We investigate the problem of automatic tuning of a deconvolution algorithm for three-dimensional (3D) fluorescence microscopy; specifically, the selection of the regularization parameter λ. For this, we consider a realistic noise model for data obtained ...

IEEE2008

A Stochastic Programming Approach for QoS-Aware Service Composition

Daniel Kuhn, Wolfram Wiesemann

We formulate the service composition problem as a multi-objective stochastic program which simultaneously optimizes the following quality of service (QoS) parameters: workflow duration, service invocation costs, availability, and reliability. All of these ...

IEEE2008

A Light Formulation of the E* Interpolated Path Replanner

Roland Philippsen

The E* algorithm is a path planning method capable of dynamic replanning and user-configurable path cost interpolation, it results in more appropriate paths during gradient descent. The underlying formulation is based on interpreting navigation functions a ...

2006

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