Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Online Learning: Sufficient Statistics and the Burkholder Method   We uncover a fairly general principle in online learning: If regret can be
(approximately) expressed as a function of certain "sufficient statistics" for
the data sequence, then there exists a special Burkholder function that 1) can
be used algorithmically to achieve the regret bound and 2) only depends on
these sufficient statistics, not the entire data sequence, so that the online
strategy is only required to keep the sufficient statistics in memory. This
characterization is achieved by bringing the full power of the Burkholder
Method --- originally developed for certifying probabilistic martingale
inequalities --- to bear on the online learning setting.
  To demonstrate the scope and effectiveness of the Burkholder method, we
develop a novel online strategy for matrix prediction that attains a regret
bound corresponding to the variance term in matrix concentration inequalities.
We also present a linear-time/space prediction strategy for parameter free
supervised learning with linear classes and general smooth norms.

36
The categories of this paper are: cmp-lg
20
The categories of this paper are: acc-phys
12
The categories of this paper are: nucl-th
8
The categories of this paper are: hep-ex
7
The categories of this paper are: hep-th
17
The categories of this paper are: q-fin
37
The categories of this paper are: supr-con
14
The categories of this paper are: math-ph
26
The categories of this paper are: bayes-an
11
The categories of this paper are: hep-lat
19
The categories of this paper are: eess
32
The categories of this paper are: atom-ph
34
The categories of this paper are: chem-ph
18
The categories of this paper are: econ
5
The categories of this paper are: gr-qc
4
The categories of this paper are: cond-mat