Covering numbers and schlicht functions
Philippe Drouin, Thomas Ransford
TL;DR
This paper establishes bounds on the number of balls required to cover the space of schlicht functions, advancing understanding of their geometric complexity.
Contribution
It provides new upper and lower bounds for covering numbers of schlicht functions, a topic not previously fully explored.
Findings
Derived explicit bounds for covering numbers
Improved understanding of the geometric structure of schlicht functions
Quantitative measures of complexity for schlicht functions
Abstract
We determine upper and lower bounds for the minimal number of balls of a given radius needed to cover the space of schlicht functions.
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.