Research map / Learning theory and algorithms / Combinatorial and search optimization
StratLearner: Learning a Strategy for Misinformation Prevention in Social Networks
Guangmo Tong
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 changed | Where | Measured | Effect |
|---|---|---|---|
| increase the number of random subgraph features (ablation) | StratLearner · Kronecker | performance ratio: 0.699 { (8E-3)} -> 0.810 { (9E-3)} | Improved |
| increase the number of random subgraph features (ablation) | StratLearner · Power-law | performance ratio: 0.707 { (1E-2)} -> 0.902 { (8E-3)} | Improved |
| increase the number of random subgraph features (ablation) | StratLearner · Erdős-Rényi | performance ratio: 0.661 { (2E-2)} -> 0.892{ (3E-3)} | Improved |
| increase training examples from 270 to 2160 (ablation) | StratLearner · Kronecker | performance ratio: 0.699 { (8E-3)} -> 0.701 { (1E-2)} | No clear effect |
| increase sampled-edge probability from 0.01 to 0.1 (ablation) | StratLearner · Power-law | performance ratio: 0.725 -> 0.931 | Improved |
| increase sampled-edge probability from 0.01 to 0.1 (ablation) | StratLearner · Erdős-Rényi | performance ratio: 0.714 -> 0.866 | Improved |
| increase sampled-edge probability from 0.01 to 0.1 (ablation) | StratLearner · Kronecker | performance ratio: 0.708 -> 0.806 | Improved |
| use the full graph as the sole feature (ablation) | StratLearner · Kronecker | performance ratio: 0.708 -> 0.775 | Hurt |
| sample subgraphs using prior knowledge of the diffusion model (ablation) | StratLearner · Kronecker | performance ratio: 0.708 -> 0.961 | Improved |
| use 400 StratLearner features instead of the strongest baseline | StratLearner · Kronecker | performance ratio: 0.670 -> 0.759 | Improved |
Closest papers by meaning
- Enhancing Robustness of Graph Neural Networks on Social Media with Explainable Inverse Reinforcement Learning (NeurIPS 2024 · similarity 0.86)
- On Misinformation Containment in Online Social Networks (NeurIPS 2018 · similarity 0.85)
- Majority Opinion Diffusion in Social Networks: An Adversarial Approach (AAAI 2021 · similarity 0.84)
- Towards Reasonable Budget Allocation in Untargeted Graph Structure Attacks via Gradient Debias (NeurIPS 2022 · similarity 0.84)
- Practical Bayes-Optimal Membership Inference Attacks (NeurIPS 2025 · similarity 0.83)
- Towards Effective Planning Strategies for Dynamic Opinion Networks (NeurIPS 2024 · similarity 0.82)
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.
