AI Paper Atlas

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

NeurIPS 2021 · Learning theory and algorithms › Sample complexity · approach: Private and query-efficient algorithms · 2 citations (OpenAlex)

Read the paper

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 the simplified dual-free LR algorithm instead of Hopcroft-Karp for bottleneck matchingLR algorithm · Bottleneck matching, uniform random points in unit squarerunning timeImproved
Use LR algorithm instead of HK algorithmLR algorithm · Bottleneck matching, uniform random pointstotal edge visitsImproved
Reuse edges of affected pieces within a phase (non-vertex-disjoint augmenting paths)LR algorithm · Bottleneck matching, last guessnumber of phasesImproved
Replace 0/1 BFS, edge weights and per-piece preprocessing with plain HK counterparts (ablation)LR algorithm · Bottleneck matchingrunning timeNo clear effect

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