Efficient learning of simplices

  title={Efficient learning of simplices},
  author={Navin Goyal and Luis Rademacher},
We show an efficient algorithm for the following problem: Given uniformly random points from an arbitrary n-dimensional simplex, estimate the simplex. The size of the sample and the number of arithmetic operations of our algorithm are polynomial in n. This answers a question of Frieze, Jerrum and Kannan Frieze et al. (1996). Our result can also be interpreted as efficiently learning the intersection of n + 1 half-spaces in R in the model where the intersection is bounded and we are given… CONTINUE READING
This paper has been referenced on Twitter 3 times. VIEW TWEETS


Publications referenced by this paper.
Showing 1-10 of 39 references

Lp-norm spherical distribution

  • A. K. Gupta, D. Song
  • J. Statist. Plann. Inference,
  • 1997
Highly Influential
5 Excerpts