Scenario reduction revisited: fundamental limits and guarantees

Mathematical Programming(2018)

引用 41|浏览27
暂无评分
摘要
The goal of scenario reduction is to approximate a given discrete distribution with another discrete distribution that has fewer atoms. We distinguish continuous scenario reduction, where the new atoms may be chosen freely, and discrete scenario reduction, where the new atoms must be chosen from among the existing ones. Using the Wasserstein distance as measure of proximity between distributions, we identify those n -point distributions on the unit ball that are least susceptible to scenario reduction, i.e., that have maximum Wasserstein distance to their closest m -point distributions for some prescribed m更多
查看译文
关键词
Scenario reduction,Wasserstein distance,Constant-factor approximation algorithm,k-median clustering,k-means clustering
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要