Publication
New Perspectives on Regularization and Computation in Optimal Transport-Based Distributionally Robust Optimization
Related publications (32)
Beyond Time-Average Convergence: Near-Optimal Uncoupled Online Learning via Clairvoyant Multiplicative Weights Update
Efstratios Panteleimon Skoulakis
In this paper we provide a novel and simple algorithm, Clairvoyant Multiplicative Weights Updates (CMWU), for convergence to \textit{Coarse Correlated Equilibria} (CCE) in general games. CMWU effectively corresponds to the standard MWU algorithm but where ...
2022Bandit Online Learning of Nash Equilibria in Monotone Games
We address online bandit learning of Nash equilibria in multi-agent convex games. We propose an algorithm whereby each agent uses only obtained values of her cost function at each joint played action, lacking any information of the functional form of her c ...
2021A Simulation-Based Heuristic to Find Approximate Equilibria with Disaggregate Demand Models
Michel Bierlaire, Virginie Janine Camille Lurkin, Stefano Bortolomiol
Oligopolistic competition occurs in various transportation markets. In this paper, we introduce a framework to find approximate equilibrium solutions of oligopolistic markets in which demand is modeled at the disaggregate level using discrete choice models ...
INFORMS2021Complexity analysis of stochastic gradient methods for PDE-constrained optimal control problems with uncertain parameters
Fabio Nobile, Sebastian Krumscheid, Matthieu Claude Martin
We consider the numerical approximation of an optimal control problem for an elliptic Partial Differential Equation (PDE) with random coefficients. Specifically, the control function is a deterministic, distributed forcing term that minimizes the expected ...
2021Multi-armed Bandits in Action
Making decisions is part and parcel of being human. Among a set of actions, we want to choose the one that has the highest reward. But the uncertainty of the outcome prevents us from always making the right decision. Making decisions under uncertainty can ...
EPFL2020Wasserstein Distributionally Robust Learning
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 ...
EPFL2020Regret Minimization and Separation in Multi-Bidder Multi-Item Auctions
Daniel Kuhn, Napat Rujeerapaiboon, Cagil Kocyigit
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 ...
2020Mixed Strategies for Robust Optimization of Unknown Objectives
Maryam Kamgarpour, Andreas Krause, Ilija Bogunovic
We consider robust optimization problems, where the goal is to optimize an unknown objective function against the worst-case realization of an uncertain parameter. For this setting, we design a novel sample-efficient algorithm GP-MRO, which sequentially le ...
PMLR2020MATHICSE 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 ...
MATHICSE2020Learning Nash Equilibria in Monotone Games
We consider multi-agent decision making where each agent's cost function depends on all agents' strategies. We propose a distributed algorithm to learn a Nash equilibrium, whereby each agent uses only obtained values of her cost function at each joint play ...
IEEE2019