Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Monotone Conditional Complexity Bounds on Future Prediction Errors   We bound the future loss when predicting any (computably) stochastic sequence
online. Solomonoff finitely bounded the total deviation of his universal
predictor M from the true distribution m by the algorithmic complexity of m.
Here we assume we are at a time t>1 and already observed x=x_1...x_t. We bound
the future prediction performance on x_{t+1}x_{t+2}... by a new variant of
algorithmic complexity of m given x, plus the complexity of the randomness
deficiency of x. The new complexity is monotone in its condition in the sense
that this complexity can only decrease if the condition is prolonged. We also
briefly discuss potential generalizations to Bayesian model classes and to
classification problems.

20
The categories of this paper are: acc-phys
25
The categories of this paper are: patt-sol
27
The categories of this paper are: comp-gas
31
The categories of this paper are: ao-sci
22
The categories of this paper are: chao-dyn
35
The categories of this paper are: mtrl-th
37
The categories of this paper are: supr-con
0
The categories of this paper are: hep-ph
18
The categories of this paper are: econ
7
The categories of this paper are: hep-th
15
The categories of this paper are: nucl-ex
21
The categories of this paper are: adap-org
10
The categories of this paper are: q-bio
29
The categories of this paper are: funct-an
24
The categories of this paper are: dg-ga
34
The categories of this paper are: chem-ph