Concept

Processus de décision markovien

Publications associées (30)

A first-order primal-dual method with adaptivity to local smoothness

We consider the problem of finding a saddle point for the convex-concave objective

\min_x \max_y f(x) + \langle Ax, y\rangle - g^*(y)

, where

f

is a convex function with locally Lipschitz gradient and

g

is convex and possibly non-smooth. We propose an ...

2021

Robust Generalization despite Distribution Shift via Minimum Discriminating Information

Daniel Kuhn, Andreas Krause, Tobias Sutter

Training models that perform well under distribution shifts is a central challenge in machine learning. In this paper, we introduce a modeling framework where, in addition to training data, we have partial structural knowledge of the shifted test distribut ...

2021

Wasserstein Distributionally Robust Learning

Soroosh Shafieezadeh Abadeh

Many decision problems in science, engineering, and economics are affected by uncertainty, which is typically modeled by a random variable governed by an unknown probability distribution. For many practical applications, the probability distribution is onl ...

EPFL2020

A Computational Framework For Two-Dimensional Random Walks With Restarts

Stefano Massei

The treatment of two-dimensional random walks in the quarter plane leads to Markov processes which involve semi-infinite matrices having Toeplitz or block Toeplitz structure plus a low-rank correction. We propose an extension of the framework introduced in ...

SIAM PUBLICATIONS2020

The Decision Rule Approach to Optimisation under Uncertainty: Methodology and Applications

Daniel Kuhn, Wolfram Wiesemann

Dynamic decision-making under uncertainty has a long and distinguished history in operations research. Due to the curse of dimensionality, solution schemes that naively partition or discretize the support of the random problem parameters are limited to sma ...

2019

The time-dependent expected reward and deviation matrix of a finite QBD process

Sophie Myriam Hautphenne

Deriving the time-dependent expected reward function associated with a continuous-time Markov chain involves the computation of its transient deviation matrix. In this paper we focus on the special case of a finite quasi-birth-and-death (QBD) process, moti ...

ELSEVIER SCIENCE INC2019

Essays on adaptation to rare disasters

Takafumi Usui

This thesis aims to further investigate rare natural disasters and studies adaptation decisions under uncertainty by solving several computational economic models. The modeling of rare natural disasters depends on the treatment of catastrophic outcomes wit ...

EPFL2019

Wasserstein Distributionally Robust Optimization: Theory and Applications in Machine Learning

Daniel Kuhn, Viet Anh Nguyen, Peyman Mohajerin Esfahani, Soroosh Shafieezadeh Abadeh

Many decision problems in science, engineering and economics are affected by uncertain parameters whose distribution is only indirectly observable through samples. The goal of data-driven decision-making is to learn a decision from finitely many training s ...

2019

Dynamic Credit-Collections Optimization

Thomas Alois Weber

Based on a dynamic model of the stochastic repayment behavior exhibited by delinquent credit-card accounts as a self-exciting point process, a bank can control the arrival intensity of repayments using costly account-treatment actions. A semi-analytic solu ...

2019

Constrained expectation-maximization algorithm for stochastic inertial error modeling: study of feasibility

Jan Skaloud, Stéphane Guerrier, Yannick Stebler

Stochastic modeling is a challenging task for low-cost sensors whose errors can have complex spectral structures. This makes the tuning process of the INS/GNSS Kalman filter often sensitive and difficult. For example, first-order Gauss–Markov processes are ...

IOP Publishing2011

Publications associées (30)

A first-order primal-dual method with adaptivity to local smoothness

Volkan Cevher, Maria-Luiza Vladarean

We consider the problem of finding a saddle point for the convex-concave objective

\min_x \max_y f(x) + \langle Ax, y\rangle - g^*(y)

, where

f

is a convex function with locally Lipschitz gradient and

g

is convex and possibly non-smooth. We propose an ...

2021