Reproduce “On Rounding on the Hypersimplex” on OpenResearch
Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.
Universal app for Apple silicon and Intel. Requires macOS 11 or later.
About this paper
Nima Anari, Alireza Haqi, Eric Ma
The authors present a shared-randomness method for rounding fractional inputs into exactly k-item sets while preserving each item’s inclusion probability. The sampler reuses one random ordering and the same thresholds across inputs. For exact-k inputs, it bounds expected symmetric difference by 6 times their ℓ1 distance, provided a covariance-spectrum conjecture holds for every conditional distribution it reaches.
Summary by alphaXiv.
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.