Sample Complexity Bounds for Learning High-dimensional Simplices in Noisy Regimes

Amir Hossein Saberi, Amir Najafi, Seyed Abolfazl Motahari +1

In this paper, we find a sample complexity bound for learning a simplex from noisy samples. Assume a dataset of size $n$ is given which includes i.i.d. samples drawn from a uniform…