Universal Prediction of Selected Bits
Many learning tasks can be viewed as sequence prediction problems. For example, online classification can be converted to sequence prediction with the sequence being pairs of input/target data and where the goal is to correctly predict the target data given input data and previous input/target pairs. Solomonoff induction is known to solve the general sequence prediction problem, but only if the entire sequence is sampled from a computable distribution. In the case of classification and...[Show more]
|Collections||ANU Research Publications|
|Source:||Lecture Notes in Artificial Intelligence 6925|
|01_Lattimore_Universal_Prediction_of_2011.pdf||96.25 kB||Adobe PDF|
|02_Lattimore_Universal_Prediction_of_2011.pdf||259.7 kB||Adobe PDF|
|03_Lattimore_Universal_Prediction_of_2011.pdf||313.18 kB||Adobe PDF|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.