Co-occurring keywords · papers mentioning both
Papers
An Online Algorithm for Maximizing Submodular Functions
NeurIPS 2008
From External to Internal Regret
JMLR 2007
Optimistic Linear Programming gives Logarithmic Regret for Irreducible MDPs
NeurIPS 2007
Randomized PCA Algorithms with Regret Bounds that are Logarithmic in the Dimension
NeurIPS 2006
Path Kernels and Multiplicative Updates
JMLR 2003
Efficient Algorithms for Universal Portfolios
JMLR 2002