Research map / Learning theory and algorithms / Sample complexity
Minimax Rates in Permutation Estimation for Feature Matching
Olivier Collier, Arnak S. Dalalyan
Read the paperCheck 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 changed | Where | Measured | Effect |
|---|---|---|---|
| use LSL or LSNS (noise-adaptive max-likelihood style) estimators instead of greedy algorithm | permutation estimation, homoscedastic noise · synthetic n=d=200 | average error rate | Improved |
| use LSL instead of LSS under heteroscedastic noise | permutation estimation · synthetic n=d=200, theta = tau I_d | average error rate | Improved |
| use LSS, LSNS and LSL under homoscedastic noise | permutation estimation · synthetic n=d=200 | average error rate | No clear effect |
Closest papers by meaning
- Pairwise Matching Through Max-Weight Bipartite Belief Propagation (CVPR 2016 · similarity 0.86)
- Kissing to Find a Match: Efficient Low-Rank Permutation Representation (NeurIPS 2023 · similarity 0.86)
- MaxSketch: Robust Distinct Counting in Streams via Random Projections (NeurIPS 2026 · similarity 0.85)
- Sketchy Moment Matching: Toward Fast and Provable Data Selection for Finetuning (NeurIPS 2024 · similarity 0.85)
- Geometric Median (GM) Matching for Robust k-Subset Selection from Noisy Data (ICML 2025 · similarity 0.84)
- The Balanced-Pairwise-Affinities Feature Transform (ICML 2024 · similarity 0.83)
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.
