paper-with-me

홈 › Papers

Toward bilipshiz geometric models

2025-11-13 · Yonatan Sverdlov, Eitan Rosen, Nadav Dym arxiv

Many neural networks for point clouds are, by design, invariant to the symmetries of this datatype: permutations and rigid motions. The purpose of this paper is to examine whether such networks preserve natural symmetry aware distances on the point cloud spaces, through the notion of bi-Lipschitz equivalence. This inquiry is motivated by recent work in the Equivariant learning literature which highlights the advantages of bi-Lipschitz models in other scenarios. We consider two symmetry aware metrics on point clouds: (a) The Procrustes Matching (PM) metric and (b) Hard Gromov Wasserstien distances. We show that these two distances themselves are not bi-Lipschitz equivalent, and as a corollary deduce that popular invariant networks for point clouds are not bi-Lipschitz with respect to the PM metric. We then show how these networks can be modified so that they do obtain bi-Lipschitz guarantees. Finally, we provide initial experiments showing the advantage of the proposed bi-Lipschitz model over standard invariant models, for the tasks of finding correspondences between 3D point clouds.

📄 PDF Abstract BibTeX arXiv:2511.11735

Code (0)

등록된 구현이 없습니다.

Tasks

Point Clouds

Similar Papers 제목 키워드 기반

Geometric operations implemented by conformal geometric algebra neural nodes

2013-06-06 · Eckhard Hitzer

Geometric algebra is an optimal frame work for calculating with vectors. The geometric algebra of a space includes elements that represent all the its subspaces (lines, planes, volumes, ...). Conformal geometric algebra …

Adaptive Surface Normal Constraint for Geometric Estimation from Monocular Images

2024-02-08 · Xiaoxiao Long, Yuhang Zheng, Yupeng Zheng, Beiwen Tian 외

We introduce a novel approach to learn geometries such as depth and surface normal from images while incorporating geometric context. The difficulty of reliably capturing geometric context in existing methods impedes the…

3D geometryDepth Estimation

On the Expressive Power of Geometric Graph Neural Networks

2023-01-23 · Chaitanya K. Joshi, Cristian Bodnar, Simon V. Mathis, Taco Cohen 외

The expressive power of Graph Neural Networks (GNNs) has been studied extensively through the Weisfeiler-Leman (WL) graph isomorphism test. However, standard GNNs and the WL framework are inapplicable for geometric graph…

Fully Geometric Multi-Hop Reasoning on Knowledge Graphs with Transitive Relations

2025-05-18 · Fernando Zhapa-Camacho, Robert Hoehndorf

Geometric embedding methods have shown to be useful for multi-hop reasoning on knowledge graphs by mapping entities and logical operations to geometric regions and geometric transformations, respectively. Geometric embed…

Knowledge Graphs

City Scene Super-Resolution via Geometric Error Minimization

2024-01-14 · Zhengyang Lu, Feng Wang

Super-resolution techniques are crucial in improving image granularity, particularly in complex urban scenes, where preserving geometric structures is vital for data-informed cultural heritage applications. In this paper…

Super-Resolution