Set Estimation Under Biconvexity Restrictions
Alejandro Cholaquidis, Antonio Cuevas

TL;DR
This paper investigates the problem of estimating biconvex sets in the plane from random samples, proposing methods to approximate the set, its boundary, and the biconvexity angle, with theoretical guarantees of consistency.
Contribution
It introduces a formal approach to define and analyze the biconvex hull, providing consistency results and methods for estimating the biconvexity angle from data.
Findings
Proved the consistency of the biconvex hull estimator.
Established relations between biconvexity and other convexity notions.
Provided a method to estimate the biconvexity angle from samples.
Abstract
A set in the Euclidean plane is said to be biconvex if, for some angle , all its sections along straight lines with inclination angles and are convex sets (i.e, empty sets or segments). Biconvexity is a natural notion with some useful applications in optimization theory. It has also be independently used, under the name of "rectilinear convexity", in computational geometry. We are concerned here with the problem of asymptotically reconstructing (or estimating) a biconvex set from a random sample of points drawn on . By analogy with the classical convex case, one would like to define the "biconvex hull" of the sample points as a natural estimator for . However, as previously pointed out by several authors, the notion of "hull" for a given set (understood as the "minimal" set including and having the required property) has no…
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
TopicsPoint processes and geometric inequalities · Sparse and Compressive Sensing Techniques · Computational Geometry and Mesh Generation
