AI Paper Atlas

Research map / Graph learning / Graph algorithms and clustering

Determinant Regularization for Gradient-Efficient Graph Matching

Tianshu Yu, Junchi Yan, Baoxin Li

CVPR 2020 · Graph learning › Graph algorithms and clustering · approach: Deep learning for graph matching · 7 citations (OpenAlex)

Check your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Use determinant regularization in the continuous matching objectiveDetGM · Caltech-101 natural imagesaccuracy (%): 76.69 -> 77.44Improved
Use determinant regularization for gradient-based continuationDetGM · Synthetic graph matching: deformation, outliers, and edge densityaccuracyImproved
Use the spectral increment sub-gradient instead of the geometric sub-gradient (ablation)DetGM · CMU houseaccuracyNo clear effect
Use the geometric sub-gradient instead of the spectral increment sub-gradient (ablation)DetGM · Synthetic graph matchingaccuracyNo clear effect
Use determinant-based continuous optimization rather than BPFDetGM · Pascal datasetrunning time: over 2,000 seconds vs around 60 secondsImproved

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy