mlsanityData to 14 Oct 2026

MDND: Unsupervised Learning Guided by Non-Differentiable Refinement for Shape Correspondence

arXiv 2607.15887 ↗First posted 17 Jul 2026cs.CVcited by 0

Not on the map. Why?

Abstract (arXiv)

Deep functional map frameworks (DFM) for shape correspondence are powerful, yet fundamentally limited by their reliance on end-to-end differentiability. This constraint prevents the integration of highly accurate, non-differentiable refinement techniques, capping their overall performance, especially on challenging non-isometric shapes. To overcome this, we introduce MDND, a novel DFM paradigm built on the principle of merging differentiable and non-differentiable components. Our framework facilitates unsupervised learning guided by an internal, non-differentiable refinement. Specifically, MDND employs a dual-branch architecture: a non-differentiable refinement branch leverages a novel, multiscale iterative solver to produce highly robust correspondences, acting as a refined target. Concurrently, a fully differentiable branch learns to predict correspondences from features. The entire system is trained end-to-end without supervision by enforcing a consistency loss that compels the differentiable branch to learn from the superior, refined results of the non-differentiable branch. Extensive experiments show that MDND sets a new state-of-the-art, demonstrating remarkable robustness on shapes with non-isometric deformations and topological noise.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 21 of its 46 references that are in the map. First posted on arXiv 17 Jul 2026.

Builds on

21 of 46 references.

References · 21

  1. 20163D Menagerie: Modeling the 3D shape and pose of animalscited by 312
  2. 2020DiffusionNet: Discretization Agnostic Learning on Surfacescited by 164
  3. 2017Deep Functional Maps: Structured Prediction for Dense Shape Correspondencecited by 134
  4. 2020Deep Geometric Functional Maps: Robust Feature Learning for Shape Correspondencecited by 125
  5. 2018Unsupervised Deep Learning for Structured Shape Matchingcited by 81
  6. 2018Continuous and Orientation-preserving Correspondences via Functional Mapscited by 77
  7. 2020Deep Shells: Unsupervised Shape Correspondence with Optimal Transportcited by 74
  8. 2019Smooth Shells: Multi-Scale Shape Registration with Functional Mapscited by 72
  9. 2022A Survey of Non-Rigid 3D Registrationcited by 59
  10. 2023Unsupervised Learning of Robust Spectral Shape Matchingcited by 57
  11. 2022Smooth Non-Rigid Shape Matching via Effective Dirichlet Energy Optimizationcited by 37
  12. 2022Deep Orientation-Aware Functional Maps: Tackling Symmetry Issues in Shape Matchingcited by 36
9 more
  1. 2022Learning Multi-resolution Functional Maps with Spectral Attention for Robust Shape Matchingcited by 35
  2. 2020Isometric Multi-Shape Matchingcited by 33
  3. 2023Spatially and Spectrally Consistent Deep Functional Mapscited by 30
  4. 2018Reversible Harmonic Maps between Discrete Surfacescited by 19
  5. 2023Hybrid Functional Maps for Crease-Aware Non-Isometric Shape Matchingcited by 18
  6. 2021Complex Functional Maps : a Conformal Link Between Tangent Bundlescited by 17
  7. 2024Memory-Scalable and Simplified Functional Map Learningcited by 14
  8. 2025Denoising Functional Maps: Diffusion Models for Shape Correspondencecited by 14
  9. 2023Revisiting Map Relations for Unsupervised Non-Rigid Shape Matchingcited by 8

Built on by

Not cited yet.