We seek to determine a real algebraic variety from a fixed finite subset of
points. Existing methods are studied and new methods are developed. Our focus
lies on aspects of topology and algebraic geometry, such as dimension and
defining polynomials. All algorithms are tested on a range of datasets and made
available in a Julia package.

研究如何从一个有限数据集合中确定一个真实的代数变换，通过算法测试和 Julia 包的提供来探究拓扑和代数几何方面，包括维度，定义多项式等。

从样本中学习代数流形

Learning Algebraic Varieties from Samples

The nearest point map of a real algebraic variety with respect to Euclidean
distance is an algebraic function. For instance, for varieties of low rank
matrices, the Eckart-Young Theorem states that this map is given by the
singular value decomposition. This article develops a theory of such nearest
point maps from the perspective of computational algebraic geometry. The
Euclidean distance degree of a variety is the number of critical points of the
squared distance to a generic point outside the variety. Focusing on varieties
seen in applications, we present numerous tools for exact computations.

本文从计算代数几何的角度，通过研究实代数簇相对于欧几里得距离的最近点映射，开发出了一套理论框架，并提出了多种工具来准确计算欧几里得距离在应用中的关键点。