AI Paper Atlas

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

Learning to Crawl

Utkarsh Upadhyay, Robert Busa-Fekete, Wojciech Kotlowski, David Pal, Balazs Szorenyi

AAAI 2020 · Bandits and online learning › Online convex optimization and games · approach: Online decision-making with feedback structure · 10 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
Choose the exploration horizon to scale as O(√T)Explore-and-commit · MSMARCO, simulated web crawlingnormalized regret: 1/√TImproved
Use phased ε-greedy instead of ETCWeb-crawling policy · MSMARCO, simulated web crawlingregretMixed
Use the moment-matching estimator instead of the MLE estimatorPoisson change-rate estimation from partial observations · Simulated and real dataestimation errorNo clear effect
Use uniform-interval exploration instead of uniform-rate explorationETC exploration phase · Web crawling, exploration phaseregretImproved

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