AI Paper Atlas

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

A Bandit Framework for Strategic Regression

NeurIPS 2016 · Bandits and online learning › Online convex optimization and games · approach: Online decision-making with feedback structure · 6 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 SR-UCB (UCB-style index with Brier scoring rule, per-round base payment) to select workers instead of a static payment ruledynamic data acquisition for linear regression · theoretical analysis (linear regression)approximate BNE gapHelped
Add randomized task assignment (probability p_s when multiple workers selected) to remove the all-shirk equilibriumSR-UCB for linear regression · theoretical analysis (linear regression)equilibrium existence of all-shirkingHelped
Use online updates for the regression estimator and scores (OSR1/OSR2-UCB) instead of recomputing estimators each roundSR-UCB · theoretical analysis (ridge / online updates)BNE gap: O(sqrt(logT/T)) to O(logT/sqrt(T)) for OSR2-UCBHurt
Add differential privacy noise (PSR-UCB) to model and indexesSR-UCB · theoretical analysis (linear regression)BNE gap and privacy level: BNE gap O(sqrt(logT/T)) to O(log^6 T/sqrt(T)); achieves (O(log^-1 T), O(log^-1 T))-DPHurt

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