Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Scale-Free Online Learning   We design and analyze algorithms for online linear optimization that have
optimal regret and at the same time do not need to know any upper or lower
bounds on the norm of the loss vectors. Our algorithms are instances of the
Follow the Regularized Leader (FTRL) and Mirror Descent (MD) meta-algorithms.
We achieve adaptiveness to the norms of the loss vectors by scale invariance,
i.e., our algorithms make exactly the same decisions if the sequence of loss
vectors is multiplied by any positive constant. The algorithm based on FTRL
works for any decision set, bounded or unbounded. For unbounded decisions sets,
this is the first adaptive algorithm for online linear optimization with a
non-vacuous regret bound. In contrast, we show lower bounds on scale-free
algorithms based on MD on unbounded domains.

13
The categories of this paper are: quant-ph
32
The categories of this paper are: atom-ph
14
The categories of this paper are: math-ph
18
The categories of this paper are: econ
10
The categories of this paper are: q-bio
29
The categories of this paper are: funct-an
20
The categories of this paper are: acc-phys
16
The categories of this paper are: stat
17
The categories of this paper are: q-fin
19
The categories of this paper are: eess
21
The categories of this paper are: adap-org
8
The categories of this paper are: hep-ex
6
The categories of this paper are: astro-ph
3
The categories of this paper are: physics
37
The categories of this paper are: supr-con
5
The categories of this paper are: gr-qc