paper-with-me

홈 › Papers

Registration of algebraic varieties using Riemannian optimization

2024-01-16 · Florentin Goyens, Coralia Cartis, Stéphane Chrétien

We consider the point cloud registration problem, the task of finding a transformation between two point clouds that represent the same object but are expressed in different coordinate systems. Our approach is not based on a point-to-point correspondence, matching every point in the source point cloud to a point in the target point cloud. Instead, we assume and leverage a low-dimensional nonlinear geometric structure of the data. Firstly, we approximate each point cloud by an algebraic variety (a set defined by finitely many polynomial equations). This is done by solving an optimization problem on the Grassmann manifold, using a connection between algebraic varieties and polynomial bases. Secondly, we solve an optimization problem on the orthogonal group to find the transformation (rotation $+$ translation) which makes the two algebraic varieties overlap. We use second-order Riemannian optimization methods for the solution of both steps. Numerical experiments on real and synthetic data are provided, with encouraging results. Our approach is particularly useful when the two point clouds describe different parts of an objects (which may not even be overlapping), on the condition that the surface of the object may be well approximated by a set of polynomial equations. The first procedure -- the approximation -- is of independent interest, as it can be used for denoising data that belongs to an algebraic variety. We provide statistical guarantees for the estimation error of the denoising using Stein's unbiased estimator.

📄 PDF Abstract BibTeX arXiv:2401.08562

Code (1)

flgoyens/variety-registration 공식 구현

Tasks

DenoisingPoint Cloud RegistrationRiemannian optimization

Methods 이 논문이 사용한 방법론

SET Dynamic Sparse Training method where weight mask is updated randomly periodically

Similar Papers 제목 키워드 기반

Critical Points of Degenerate Metrics on Algebraic Varieties: A Tale of Overparametrization

2025-12-24 · Giovanni Luca Marchetti, Erin Connelly, Paul Breiding, Kathlén Kohn arxiv

We study the critical points over an algebraic variety of an optimization problem defined by a quadratic objective that is degenerate. This scenario arises in machine learning when the dataset size is small with respect …

Computing algebraic degrees of phylogenetic varieties

2022-10-05 · Luis David Garcia Puente, Marina Garrote-López, Elima Shehu

A phylogenetic variety is an algebraic variety parameterized by a statistical model of the evolution of biological sequences along a tree. Understanding this variety is an important problem in the area of algebraic stati…

Algebra Unveils Deep Learning -- An Invitation to Neuroalgebraic Geometry

2025-01-31 · Giovanni Luca Marchetti, Vahid Shahverdi, Stefano Mereta, Matthew Trager 외

In this position paper, we promote the study of function spaces parameterized by machine learning models through the lens of algebraic geometry. To this end, we focus on algebraic models, such as neural networks with pol…

Deep LearningPosition

Machine learning detects terminal singularities

2023-09-21 · NeurIPS 2023 11

Algebraic varieties are the geometric shapes defined by systems of polynomial equations; they are ubiquitous across mathematics and science. Amongst these algebraic varieties are Q-Fano varieties: positively curved shape…

Covering Number of Real Algebraic Varieties and Beyond: Improved Bounds and Applications

2023-11-09 · Yifan Zhang, Joe Kileel

Covering numbers are a powerful tool used in the development of approximation algorithms, randomized dimension reduction methods, smoothed complexity analysis, and others. In this paper we prove upper bounds on the cover…

Dimensionality Reduction