AI Paper Atlas

Research map / Learning theory and algorithms / Prediction and decision losses

A Distribution Optimization Framework for Confidence Bounds of Risk Measures

ICML 2023 · Learning theory and algorithms › Prediction and decision losses · approach: Distributionally robust optimization · 0 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Use the local Lipschitz constant (supremum distance) instead of the global constant for the CVaR confidence boundDistribution optimization framework · CVaR, supremum distanceconfidence bound tightness: (b-a)/alpha -> (b-F^{-1}((1-alpha-c)^+))/alphaHelped
Use the exact optimization-based bound instead of the LLC-based bound for CVaR under a uniform distributionDistribution optimization framework · CVaR, uniform distribution, supremum distanceconfidence bound tightnessHelped
Use local instead of global Lipschitz constant for CVaR with Wasserstein distance (p=1)Distribution optimization framework · CVaR, Wasserstein distanceLipschitz constantNo clear effect

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy