Publications de Daniel Kuhn | EPFL Graph Search

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.

The growth-optimal portfolio is designed to have maximum expected log-return over the next rebalancing period. Thus, it can be computed with relative ease by solving a static optimization problem. The growth-optimal portfolio has sparked fascination among ...

In distributionally robust optimization the probability distribution of the uncertain problem parameters is itself uncertain, and a fictitious adversary, e.g., nature, chooses the worst distribution from within a known ambiguity set. A common shortcoming o ...

Stochastic programming provides a versatile framework for decision-making under uncertainty, but the resulting optimization problems can be computationally demanding. It has recently been shown that, primal and dual linear decision rule approximations can ...

Wasserstein balls, which contain all probability measures within a pre-specified Wasserstein distance to a reference measure, have recently enjoyed wide popularity in the distributionally robust optimization and machine learning communities to formulate an ...

We present a risk-averse multi-dimensional newsvendor model for a class of products whose demands are strongly correlated and subject to fashion trends that are not fully understood at the time when orders are placed. The demand distribution is known to be ...

We study a robust monopoly pricing problem with a minimax regret objective, where a seller endeavors to sell multiple goods to a single buyer, only knowing that the buyer's values for the goods range over a rectangular uncertainty set. We interpret this pr ...

Distributionally robust chance constrained programs minimize a deterministic cost function subject to the satisfaction of one or more safety conditions with high probability, given that the probability distribution of the uncertain problem parameters affec ...

In stochastic optimal control the distribution of the exogenous noise is typically unknown and must be inferred from limited data before dynamic programming (DP)-based solution schemes can be applied. If the conditional expectations in the DP recursions ar ...

Over the last two decades, robust optimization has emerged as a computationally attractive approach to formulate and solve single-stage decision problems affected by uncertainty. More recently, robust optimization has been successfully applied to multi-sta ...

Ensuring reliable operation in power grids given the complexity of modern electricity networks with increasing demands, varying generation and flows present significant computational challenges. Addressing these challenges, we develop efficient methods for ...

We study a distributionally robust mean square error estimation problem over a nonconvex Wasserstein ambiguity set containing only normal distributions. We show that the optimal estimator and the least favorable distribution form a Nash equilibrium. Despit ...

We study a robust auction design problem with a minimax regret objective, where a seller seeks a mechanism for selling multiple items to multiple anonymous bidders with additive values. The seller knows that the bidders' values range over a box uncertainty ...

This paper proposes a distributionally robust approach to logistic regression. We use the Wasserstein distance to construct a ball in the space of probability distributions centered at the uniform distribution on the training samples. If the radius of this ...

Motivated by policy gradient methods in the context of reinforcement learning, we derive the first large deviation rate function for the iterates generated by stochastic gradient descent for possibly non-convex objectives satisfying a Polyak-Łojasiewicz co ...

Robust and distributionally robust optimization are modeling paradigms for decision-making under uncertainty where the uncertain parameters are only known to reside in an uncertainty set or are governed by any probability distribution from within an ambigu ...

We propose a framework for the stability verification of Mixed-Integer Linear Programming (MILP) representable control policies. This framework compares a fixed candidate policy, which admits an efficient parameterization and can be evaluated at a low comp ...

We investigate the control of constrained stochastic linear systems when faced with only limited information regarding the disturbance process, i.e. when only the first two moments of the disturbance distribution are known. We consider two types of distrib ...

We consider the mechanism design problem of a principal allocating a single good to one of several agents without monetary transfers. Each agent desires the good and uses it to create value for the principal. We designate this value as the agent's private ...

Distributionally robust optimization (DRO) studies decision problems under uncertainty where the probability distribution governing the uncertain problem parameters is itself uncertain. A key component of any DRO model is its ambiguity set, that is, a fami ...

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 ...

Daniel Kuhn

Chattez avec Graph Search

Robust Growth-Optimal Portfolios

Distributionally Robust Optimization with Polynomial Densities: Theory, Models and Algorithms

Generalized Decision Rule Approximations for Stochastic Programming via Liftings

On Linear Optimization over Wasserstein Balls

Distributionally Robust Multi-Item Newsvendor Problems with Multimodal Demand Distributions

Robust Multidimensional Pricing: Separation without Regret

On Approximations of Data-Driven Chance Constrained Programs over Wasserstein Balls

Robust Data-Driven Dynamic Programming

K-Adaptability in Two-Stage Robust Binary Programming

Multi-Period Optimal Power Flow: Convex Relaxations and Parallel Algorithms

Wasserstein Distributionally Robust Kalman Filtering

Regret Minimization and Separation in Multi-Bidder Multi-Item Auctions

Distributionally Robust Logistic Regression

A Large Deviations Perspective on Policy Gradient Algorithms

A Unified Theory of Robust and Distributionally Robust Optimization via the Primal-Worst-Equals-Dual-Best Principle

Stability Verification of Neural Network Controllers using Mixed-Integer Programming

Distributionally Robust Control of Constrained Stochastic Systems

Distributionally Robust Optimal Allocation with Costly Verification

Distributionally Robust Optimization

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