atlas

Research map / Learning theory and algorithms / Sample complexity

Learning Opinions in Social Networks

ICML 2020 · Learning theory and algorithms › Sample complexity · approach: Sample complexity of ranking and selection · 2 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
Restrict the network to be deterministic (single realization) and use a VC-based ERM over the reachability hypothesis classDeterministic social networks · Theoretical (sample complexity)sample complexity m = O((VC(G) log(1/ε) + log(1/δ))/ε)Helped
Use a random live-edge graph with no stability assumption (poorly concentrated random chain network)Random social networks · Theoretical lower bound (random chain construction)samples needed to recover a fixed node's state with probability 9/10Hurt
Add stability assumption ((ε0,δ0)-stability) and run the multi-sample-graph ERM plus majority-vote algorithm instead of a single ERMRandom social networks · Theoretical (sample complexity bound)sample complexity m = O((E[VC(G)] log(1/ε) + log(1/δ))/ε)Helped

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