Stable Border Bases for Ideals of Points
John Abbott, Claudia Fassino, Maria-Laura Torrente

TL;DR
This paper introduces a method to compute stable polynomial bases for the vanishing ideal of a set of points, ensuring robustness against small data perturbations in the points' coordinates.
Contribution
It presents a novel approach to obtain structurally stable border bases for ideals of points, independent of data uncertainty.
Findings
The method produces bases resilient to small data perturbations.
The approach maintains structural similarity of bases under data noise.
It enhances the robustness of polynomial ideal computations.
Abstract
Let be a set of points whose coordinates are known with limited accuracy; our aim is to give a characterization of the vanishing ideal independent of the data uncertainty. We present a method to compute a polynomial basis of which exhibits structural stability, that is, if is any set of points differing only slightly from , there exists a polynomial set structurally similar to , which is a basis of the perturbed ideal .
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
TopicsPolynomial and algebraic computation · Advanced Numerical Analysis Techniques · Commutative Algebra and Its Applications
