# Projections onto the canonical simplex with additional linear inequalities

arXiv: https://arxiv.org/abs/1905.03488 · HTML: https://mlsanity.com/paper/1905.03488/

## Key facts

- Cited by 3 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 9 May 2019.

## Built on by (most cited first, 3 of 3)

- [Robust Phi-Divergence MDPs](https://mlsanity.com/paper/2205.14202/) (2022)
- [Fairness-aware PageRank via Edge Reweighting](https://mlsanity.com/paper/2512.08055/) (2025)
- [Wasserstein Filtering: A Sample Selection Method for Robust Distribution Learning](https://mlsanity.com/paper/2608.13418/) (2026)

## Abstract (arXiv)

We consider the distributionally robust optimization and show that computing the distributional worst-case is equivalent to computing the projection onto the canonical simplex with additional linear inequality. We consider several distance functions to measure the distance of distributions. We write the projections as optimization problems and show that they are equivalent to finding a zero of real-valued functions. We prove that these functions possess nice properties such as monotonicity or convexity. We design optimization methods with guaranteed convergence and derive their theoretical complexity. We demonstrate that our methods have (almost) linear observed complexity.