Research map / Bandits and online learning / Online convex optimization and games
Stochastic Online Learning with Probabilistic Graph Feedback
Shuai Li, Wei Chen, Zheng Wen, Kwong-Sak Leung
Read the paperCheck your idea against 137,217 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.
Closest papers by meaning
- Learning on the Edge: Online Learning with Stochastic Feedback Graphs (NeurIPS 2022 · similarity 0.93)
- A Near-Optimal Best-of-Both-Worlds Algorithm for Online Learning with Feedback Graphs (NeurIPS 2022 · similarity 0.93)
- Stochastic contextual bandits with graph feedback: from independence number to MAS number (NeurIPS 2024 · similarity 0.88)
- Adversarial Combinatorial Semi-bandits with Graph Feedback (ICML 2025 · similarity 0.88)
- Online Learning in the Random-Order Model (ICML 2025 · similarity 0.86)
- Efficient Contextual Bandits with Uninformed Feedback Graphs (ICML 2024 · similarity 0.86)
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.
