AI Paper Atlas

Research map / Learning theory and algorithms / Sample complexity

Minimax Rates in Permutation Estimation for Feature Matching

Olivier Collier, Arnak S. Dalalyan

JMLR 2016 · Learning theory and algorithms › Sample complexity · approach: Density and property estimation

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 changedWhereMeasuredEffect
use LSL or LSNS (noise-adaptive max-likelihood style) estimators instead of greedy algorithmpermutation estimation, homoscedastic noise · synthetic n=d=200average error rateImproved
use LSL instead of LSS under heteroscedastic noisepermutation estimation · synthetic n=d=200, theta = tau I_daverage error rateImproved
use LSS, LSNS and LSL under homoscedastic noisepermutation estimation · synthetic n=d=200average error rateNo 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