Research map / Optimization / Optimizers
DS*: Tighter Lifting-Free Convex Relaxations for Quadratic Matching Problems
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (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 changed | Where | Measured | Effect |
|---|---|---|---|
| Use DS* instead of DS++ for image arrangement | DS* · Random colours, 8×8 to 64×64 grids | mean objective: 0.211 -> 0.196; 0.242 -> 0.236; 0.245 -> 0.235; 0.249 -> 0.244 | Helped |
| Use DS* instead of DS++ for image arrangement | DS* · Face images, 8×8 to 42×42 grids | mean objective: 0.279 -> 0.266; 0.305 -> 0.300; 0.336 -> 0.324; 0.360 -> 0.344 | Helped |
| Use DS* instead of DS++ for image arrangement | DS* · COCO, 8×8 grid | mean objective: 0.256 -> 0.244 | Helped |
| Use DS* instead of DS++ for image arrangement | DS* · COCO, 16×16 and 32×32 grids | mean objective: 0.238 -> 0.238; 0.274 -> 0.274 | No clear effect |
| Use DS* instead of DS++ for image arrangement | DS* · COCO, 40×40 grid | mean objective: 0.291 -> 0.292 | Hurt |
| Use DS* rather than DS++ (ablation) | Lifting-free convex relaxation · Synthetic quadratic matching problems | lower bound | Helped |
| Use DS* rather than DS++ (ablation) | Lifting-free convex relaxation · Synthetic quadratic matching problems | upper bound | Helped |
Closest papers by meaning
- A Convex Relaxation for Multi-Graph Matching (CVPR 2019 · similarity 0.88)
- Graph Alignment via Birkhoff Relaxation (NeurIPS 2025 · similarity 0.87)
- Differentiable extensions with rounding guarantees for combinatorial optimization over permutations (NeurIPS 2025 · similarity 0.86)
- OT4P: Unlocking Effective Orthogonal Group Path for Permutation Relaxation (NeurIPS 2024 · similarity 0.85)
- FRAM: Frobenius-Regularized Assignment Matching with Mixed-Precision Computing (NeurIPS 2025 · similarity 0.85)
- Differentiable Quadratic Optimization For the Maximum Independent Set Problem (ICML 2025 · similarity 0.85)
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.