atlas

Research map / Learning theory and algorithms / Sample complexity

Optimal Sample Complexity of M-wise Data for Top-K Ranking

NeurIPS 2017 · Learning theory and algorithms › Sample complexity · approach: Sample complexity of ranking and selection · 12 citations (OpenAlex)

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 changedWhereMeasuredEffect
Adding a spectral method (Rank Centrality) with M-wise-to-pairwise sample breaking in the dense regime p ~ sqrt(log n / n)Rank Centrality on pairwise data · Synthetic, n=500, K=10, Delta_K=0.1success rate / l-inf errorNo clear effect
Using a sparse regime (p=0.025) instead of dense regime for Rank Centrality (ablation)Rank Centrality · Synthetic, n=500, K=10, Delta_K=0.1success rate vs Spectral MLEHurt
Sample breaking to pairwise data plus Rank Centrality vs. counting and least square on M-wise dataM-wise comparison data (M=4) · Synthetic, n=100, K=5, Delta_K=0.3success rateHelped
Increasing M (size of hyper-edges) from 3 to 15M-wise sampling for Rank Centrality · Synthetic, n=100, K=5, Delta_K=0.3empirical minimal sample complexityHelped
Using real-world League of Legends data with sample breaking and Rank CentralityRank Centrality · League of Legends top-5 users, normalized overlapnormalized overlap vs fraction of samplesHelped

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