Research map / Learning theory and algorithms / Sample complexity
A Faster Maximum Cardinality Matching Algorithm with Applications in Machine Learning
Nathaniel Lahn, Sharath Raghvendra, Jiacheng Ye
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 changed | Where | Measured | Effect |
|---|---|---|---|
| Use the simplified dual-free LR algorithm instead of Hopcroft-Karp for bottleneck matching | LR algorithm · Bottleneck matching, uniform random points in unit square | running time | Improved |
| Use LR algorithm instead of HK algorithm | LR algorithm · Bottleneck matching, uniform random points | total edge visits | Improved |
| Reuse edges of affected pieces within a phase (non-vertex-disjoint augmenting paths) | LR algorithm · Bottleneck matching, last guess | number of phases | Improved |
| Replace 0/1 BFS, edge weights and per-piece preprocessing with plain HK counterparts (ablation) | LR algorithm · Bottleneck matching | running time | No clear effect |
Closest papers by meaning
- A Robust Exact Algorithm for the Euclidean Bipartite Matching Problem (NeurIPS 2023 · similarity 0.87)
- Efficient algorithms for Incremental Metric Bipartite Matching (ICLR 2026 · similarity 0.87)
- Bipartite Matching in Massive Graphs: A Tight Analysis of EDCS (ICML 2024 · similarity 0.86)
- Fully Dynamic Euclidean Bi-Chromatic Matching in Sublinear Update Time (ICML 2025 · similarity 0.83)
- Sort Before You Prune: Improved Worst-Case Guarantees of the DiskANN Family of Graphs (ICML 2025 · similarity 0.82)
- FRAM: Frobenius-Regularized Assignment Matching with Mixed-Precision Computing (NeurIPS 2025 · similarity 0.82)
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.
