Corpus ID: 905175

Label optimal regret bounds for online local learning

@article{Awasthi2015LabelOR,
  title={Label optimal regret bounds for online local learning},
  author={Pranjal Awasthi and Moses Charikar and Kevin A. Lai and Andrej Risteski},
  journal={ArXiv},
  year={2015},
  volume={abs/1503.02193}
}
  • Pranjal Awasthi, Moses Charikar, +1 author Andrej Risteski
  • Published 2015
  • Computer Science, Mathematics
  • ArXiv
  • We resolve an open question from (Christiano, 2014b) posed in COLT'14 regarding the optimal dependency of the regret achievable for online local learning on the size of the label set. In this framework the algorithm is shown a pair of items at each step, chosen from a set of $n$ items. The learner then predicts a label for each item, from a label set of size $L$ and receives a real valued payoff. This is a natural framework which captures many interesting scenarios such as collaborative… CONTINUE READING

    Citations

    Publications citing this paper.
    SHOWING 1-10 OF 13 CITATIONS

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 41 REFERENCES