Stochastic Linear Optimization under Bandit Feedback 2: A Regret Lower Bound on the CircleResearch Paper
In stochastic linear optimization under bandit feedback a learner repeatedly chooses a point from a compact decision set and observes only the random cost of that point, whose mean is for an unknown vector . The problem models online routing, ad placement and other sequential decisions with linearly structured…