Existence of small ordered orthogonal arrays
Kai-Uwe Schmidt, Charlene Wei{\ss}
TL;DR
This paper proves the existence of small ordered orthogonal arrays that are nearly optimal in size, deviating from the Rao bound by a polynomial factor, using a probabilistic nonconstructive method.
Contribution
It establishes the existence of small ordered orthogonal arrays close to the Rao bound through a probabilistic approach, advancing theoretical understanding.
Findings
Existence of ordered orthogonal arrays close to the Rao bound
Deviation from Rao bound is polynomial in parameters
Proof is nonconstructive using probabilistic methods
Abstract
We show that there exist ordered orthogonal arrays, whose sizes deviate from the Rao bound by a factor that is polynomial in the parameters of the ordered orthogonal array. The proof is nonconstructive and based on a probabilistic method due to Kuperberg, Lovett and Peled.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsOptimal Experimental Design Methods · Bayesian Methods and Mixture Models · Optimization and Packing Problems