Testing the variety hypothesis

Lerario, A., Hoefgeest, P. Roos, Scolamiero, M., Tamai, A.

arXiv.org Machine Learning 

Given a probability measure on the unit disk, we study the problem of deciding whether, for some threshold probability, this measure is supported near a real algebraic variety of given dimension and bounded degree. We call this "testing the variety hypothesis". We prove an upper bound on the so-called "sample complexity" of this problem and show how it can be reduced to a semialgebraic decision problem. This is done by studying in a quantitative way the Hausdorff geometry of the space of real algebraic varieties of a given dimension and degree.

Duplicate Docs Excel Report

Title
None found

Similar Docs  Excel Report  more

TitleSimilaritySource
None found