AI Paper Atlas

Research map / Graph learning / Graph algorithms and clustering

The Statistical Performance of Collaborative Inference

Gérard Biau, Kevin Bleakley, Benoît Cadre

JMLR 2016 · Graph learning › Graph algorithms and clustering · approach: Graph comparison and random features · 2 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 3-regular Ramanujan graph instead of sparser non-Ramanujan graphscollaborative inference · simulation, N up to 1000performance ratio tau_tImproved
use 5-regular Ramanujan graph instead of 3-regularcollaborative inference · simulation, N=1000performance ratio tau_tImproved
increase degree d of Ramanujan graph (ablation)collaborative inference · N=200statistical coefficient S(A_d)Improved
increase penalty beta on connections (ablation)penalized objective S+beta*C · N=200, beta in {1/2,1,2,4}optimal degree d*Hurt
increase number of nodes N beyond 710 for fixed T=100 million (ablation)3-regular Ramanujan network · streaming, tau >= 0.99cost (degree d* needed): d* 3 -> 4, 5Hurt

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