Efficient algorithms for combinatorial online prediction

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

We study online linear optimization problems over concept classes which are defined in some combinatorial ways. Typically, those concept classes contain finite but exponentially many concepts and hence the complexity issue arises. In this paper, we survey some recent results on universal and efficient implementations of low-regret algorithmic frameworks such as Follow the Regularized Leader (FTRL) and Follow the Perturbed Leader (FPL).

Original languageEnglish
Title of host publicationAlgorithmic Learning Theory - 24th International Conference, ALT 2013, Proceedings
Pages22-32
Number of pages11
DOIs
Publication statusPublished - Nov 18 2013
Event24th International Conference on Algorithmic Learning Theory, ALT 2013 - Singapore, Singapore
Duration: Oct 6 2013Oct 9 2013

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume8139 LNAI
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other24th International Conference on Algorithmic Learning Theory, ALT 2013
CountrySingapore
CitySingapore
Period10/6/1310/9/13

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Efficient algorithms for combinatorial online prediction'. Together they form a unique fingerprint.

Cite this