Publications associées à Distributionally Robust Optimization with Polynomial Densities: Theory, Models and Algorithms

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.

Sublinear Bounds on the Distinguishing Advantage for Multiple Samples

Serge Vaudenay

The maximal achievable advantage of a (computationally unbounded) distinguisher to determine whether a source

Z

is distributed according to distribution

P_0

P_1

, when given access to one sample of

Z

, is characterized by the statistical distance ...

Springer, Cham2020

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

Graph Chatbot

Chattez avec Graph Search

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

Quantifying uncertain system outputs via the multi-level Monte Carlo method --- distribution and robustness measures

A Wasserstein-based measure of conditional dependence

Quantum conformance test

Mathematical Foundations of Robust and Distributionally Robust Optimization

Ergodic Exploration Using Tensor Train: Applications in Insertion Tasks

Wasserstein Distributionally Robust Learning

Sublinear Bounds on the Distinguishing Advantage for Multiple Samples

Erdos Goes Neural: an Unsupervised Learning Framework for Combinatorial Optimization on Graphs

On the probability distribution of the local times of diagonally operator-self-similar Gaussian fields with stationary increments

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

Erdos Goes Neural: an Unsupervised Learning Framework for Combinatorial Optimization on Graphs

Quantifying uncertain system outputs via the multi-level Monte Carlo method --- distribution and robustness measures

Mathematical Foundations of Robust and Distributionally Robust Optimization

Wasserstein Distributionally Robust Learning

Sublinear Bounds on the Distinguishing Advantage for Multiple Samples

On the probability distribution of the local times of diagonally operator-self-similar Gaussian fields with stationary increments

A Wasserstein-based measure of conditional dependence

Quantum conformance test

Ergodic Exploration Using Tensor Train: Applications in Insertion Tasks