AI Paper Atlas

Research map / Learning theory and algorithms / Sample complexity

Sharp Impossibility Results for Hyper-graph Testing

Jiashun Jin, Tracy Ke, Jiajun Liang

NeurIPS 2021 · Learning theory and algorithms › Sample complexity · approach: Computational thresholds in graphs and structure · 4 citations (OpenAlex)

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 asymmetric community sizes (375 vs 125 nodes) instead of symmetric (250 vs 250) in the SBM alternativedegree-based chi-square statistic psi_n · Simulated 3-uniform SBM, n=500, K=2separation of psi_n from N(0,1) nullImproved
apply degree matching (theta* from tensor scaling) when building the DCBM alternativedegree-based chi-square statistic psi_n · Simulated DCBM, n=500, K=2, Pareto theta, c_n=n^-1separation of null and alternative histograms of psi_nHurt
use the proposed scan statistic phi_n (with spectral-clustering proxy partition) instead of the degree-based psi_n, with signal raised to c_n=n^-1/2least-favorable DCBM pair · Simulated DCBM, n=500, K=2, m=3separation of null and alternative histogramsImproved
replace exact maximization over partitions with a spectral-clustering proxy partition in phi_n (ablation)phi_n test statistic · Simulated DCBM, n=500testing performanceNo 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