AI Paper Atlas

Research map / Bandits and online learning / Online convex optimization and games

Online Influence Maximization under Independent Cascade Model with Semi-Bandit Feedback

NeurIPS 2017 · Bandits and online learning › Online convex optimization and games · approach: Online allocation with constraints · 52 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
Use linear generalization across edge activation probabilities instead of estimating edge weights independentlyIMLinUCB on a Facebook subgraph · Facebook subgraphcumulative regretHelped
Evaluate IMLinUCB as the number of nodes grows on star graphsIMLinUCB, star topology, ω=0.8 · Synthetic star graphsregret growth exponent in L: 2.040; expected Õ(L^2)Mixed
Evaluate IMLinUCB as the number of nodes grows on star graphsIMLinUCB, star topology, ω=0.7 · Synthetic star graphsregret growth exponent in L: 2.056; expected Õ(L^2)Mixed
Evaluate IMLinUCB as the number of nodes grows on ray graphsIMLinUCB, ray topology, ω=0.8 · Synthetic ray graphsregret growth exponent in L: 2.488; expected Õ(L^{9/4})Mixed
Evaluate IMLinUCB as the number of nodes grows on ray graphsIMLinUCB, ray topology, ω=0.7 · Synthetic ray graphsregret growth exponent in L: 2.467; expected Õ(L^{9/4})Mixed

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