A Distributionally Robust Perspective on Uncertainty Quantification and Chance Constrained Programming

À propos
Confidentialité
Mentions légales

Graph Chatbot

Publications associées (29)

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

Daniel Kuhn, Wolfram Wiesemann, Zhi Chen

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

2023

Feature distribution learning by passive exposure

Gizay Ceylan, David Pascucci

Humans can rapidly estimate the statistical properties of groups of stimuli, including their average and variability. But recent studies of so-called Feature Distribution Learning (FDL) have shown that observers can quickly learn even more complex aspects ...

2022

A Functional Perspective on Information Measures

Amedeo Roberto Esposito

Since the birth of Information Theory, researchers have defined and exploited various information measures, as well as endowed them with operational meanings. Some were born as a "solution to a problem", like Shannon's Entropy and Mutual Information. Other ...

EPFL2022

Limiting the impact of supply chain disruptions in the face of distributional uncertainty in demand

Ralf Seifert, Anna Timonina-Farkas, René Yves Glogg

Service-level requirements play a crucial role in eliminating stock-outs in a production pipeline. However, delivering a specific service level can become an unattainable goal given the various uncertainties influencing both the production pipeline and cus ...

WILEY2022

VL4Pose: Active Learning Through Out-Of-Distribution Detection For Pose Estimation

Alexandre Massoud Alahi, Megh Hiren Shukla

Advances in computing have enabled widespread access to pose estimation, creating new sources of data streams. Unlike mock set-ups for data collection, tapping into these data streams through on-device active learning allows us to directly sample from the ...

BMVA Press2022

Discrete Optimal Transport with Independent Marginals is #P-Hard

Daniel Kuhn, Soroosh Shafieezadeh Abadeh, Bahar Taskesen

We study the computational complexity of the optimal transport problem that evaluates the Wasser- stein distance between the distributions of two K-dimensional discrete random vectors. The best known algorithms for this problem run in polynomial time in th ...

2023

Capturing trade-offs between daily scheduling choices

Michel Bierlaire, Janody Pougala, Timothy Michael Hillel

We propose a new modelling approach for daily activity scheduling which integrates the different daily scheduling choice dimensions (activity participation, location, schedule, duration and transportation mode) into a single optimisation problem. The funda ...

ELSEVIER SCI LTD2022

Removing Algorithmic Discrimination (With Minimal Individual Error)

Rachid Guerraoui, El Mahdi El Mhamdi, Le Nguyen Hoang, Alexandre David Olivier Maurer

We address for the first time the problem of correcting group discriminations within a score function, while minimizing the individual error. Each group is described by a probability density function on the set of profiles. We first solve the problem analy ...

2022

From Trees to Barcodes and Back Again: A Combinatorial, Probabilistic and Geometric Study of a Topological Inverse Problem

Adélie Eliane Garin

In this thesis, we investigate the inverse problem of trees and barcodes from a combinatorial, geometric, probabilistic and statistical point of view. Computing the persistent homology of a merge tree yields a barcode B. Reconstructing a tree from B invol ...

EPFL2022

Page 2 sur 2