activity
20092023
most citedConic Programming Reformulations of Two-Stage Distributionally Robust Linear Programs over Wasserstein Balls

220 citations · 724 across the 45 of their papers we have counts for

collaborators
Showing 2021Show all

11 papers · 1 filter

q-fin.PM2021

Mean-Covariance Robust Risk Measurement

Viet Anh Nguyen, Soroosh Shafiee, Damir Filipović +1

We introduce a universal framework for mean-covariance robust risk measurement and portfolio optimization. We model uncertainty in terms of the Gelbrich distance on the mean-covari…

math.OC2021★ 2 cited

Distributionally Robust Optimization with Markovian Data

Mengmeng Li, Tobias Sutter, Daniel Kuhn

We study a stochastic program where the probability distribution of the uncertain problem parameters is unknown and only indirectly observed via finitely many correlated samples ge…

cs.LG2021★ 1 cited

Robust Generalization despite Distribution Shift via Minimum Discriminating Information

Tobias Sutter, Andreas Krause, Daniel Kuhn

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 train…

cs.LG2021★ 1 cited

Sequential Domain Adaptation by Synthesizing Distributionally Robust Experts

Bahar Taskesen, Man-Chung Yue, Jose Blanchet +2

Least squares estimators, when trained on a few target domain samples, may predict poorly. Supervised domain adaptation aims to improve the predictive accuracy by exploiting additi…

math.OC2021★ 7 cited

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

Jianzhe Zhen, Daniel Kuhn, Wolfram Wiesemann

Robust and distributionally robust optimization are modeling paradigms for decision-making under uncertainty where the uncertain parameters are only known to reside in an uncertain…

math.OC2021

Topological Linear System Identification via Moderate Deviations Theory

Wouter Jongeneel, Tobias Sutter, Daniel Kuhn

Two dynamical systems are topologically equivalent when their phase-portraits can be morphed into each other by a homeomorphic coordinate transformation on the state space. The ind…

cs.LG2021

Semi-Discrete Optimal Transport: Hardness, Regularization and Numerical Solution

Bahar Taskesen, Soroosh Shafieezadeh-Abadeh, Daniel Kuhn

Semi-discrete optimal transport problems, which evaluate the Wasserstein distance between a discrete and a generic (possibly non-discrete) probability measure, are believed to be c…

math.OC2021★ 1 cited

Small errors in random zeroth-order optimization are imaginary

Wouter Jongeneel, Man-Chung Yue, Daniel Kuhn

Most zeroth-order optimization algorithms mimic a first-order algorithm but replace the gradient of the objective function with some gradient estimator that can be computed from a…

math.OC2021★ 2 cited

A Planner-Trader Decomposition for Multi-Market Hydro Scheduling

Kilian Schindler, Napat Rujeerapaiboon, Daniel Kuhn +1

Peak/off-peak spreads on European electricity forward and spot markets are eroding due to the ongoing nuclear phaseout in Germany and the steady growth in photovoltaic capacity. Th…

math.OC2021★ 15 cited

Efficient Learning of a Linear Dynamical System with Stability Guarantees

Wouter Jongeneel, Tobias Sutter, Daniel Kuhn

We propose a principled method for projecting an arbitrary square matrix to the non-convex set of asymptotically stable matrices. Leveraging ideas from large deviations theory, we…

math.CO2021★ 2 cited

A proof of the Erdős-Faber-Lovász conjecture

Dong Yeap Kang, Tom Kelly, Daniela Kühn +2

The Erdős-Faber-Lovász conjecture (posed in 1972) states that the chromatic index of any linear hypergraph on vertices is at most . In this paper, we prove this conjecture f…