AI Paper Atlas

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

Community Exploration: From Offline Optimization to Online Learning

Xiaowei Chen, Weiran Huang, Wei Chen, John C. S. Lui

NeurIPS 2018 · Bandits and online learning › Online convex optimization and games · approach: Online allocation with constraints · 4 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
Use greedy marginal-gain allocationOffline non-adaptive community exploration · Community exploration with known sizesexpected rewardImproved
Use the greedy policy that selects the community with the most unseen members in expectationOffline adaptive community exploration · Community exploration with known sizesexpected rewardImproved
Use CLCB with non-adaptive explorationOnline non-adaptive community exploration · Repeated community explorationcumulative regret: O\left( \sum_{i=1}^{m} \frac{K'^3\log T}{\Delta^{i}_{\min}} \right)Improved
Use CLCB with adaptive explorationOnline adaptive community exploration · Repeated community explorationcumulative regret: \ln TImproved

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