AI Paper Atlas

Research map / Learning theory and algorithms / Sample complexity

Bounds and Complexity Results for Learning Coalition-Based Interaction Functions in Networked Social Systems

Abhijin Adiga, Chris Kuhlman, Madhav Marathe, S. Ravi, Daniel Rosenkranz, Richard Stearns, Anil Vullikanti

AAAI 2020 · Learning theory and algorithms › Sample complexity · approach: PAC learnability theory · 0 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
increase number of blocks b from 2 to 50 (ablation)active query algorithm · mined and synthetic networksnumber of queriesHurt
scale-free/skewed-degree networks versus random regular networksactive query algorithm · normalized #queries vs Theorem 3 boundnormalized number of queriesImproved
increase edge density / network sizeactive query algorithm · NRV vs CoAstronormalized number of queriesNo clear effect
b exceeds maximum degree (ablation)active query algorithm · mined and synthetic networksnumber of queriesNo clear effect
increase number of inputs q from 10 to 20 (ablation)ILP PAC algorithm · uniform distribution, p = 0.5Rand index vs examplesHurt
increase number of true blocks (ablation)ILP PAC algorithm · uniform distributionexamples neededImproved
increase p from 0.25/0.5 to 0.75 (ablation)ILP PAC algorithm · Rand indexRand indexMixed
increase number of examples (ablation)ILP PAC algorithm · Rand indexRand indexImproved
increase number of examples (ablation)ILP PAC algorithm · running timerunning timeHurt

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