Sciweavers

81 search results - page 2 / 17
» On the Foundations of Universal Sequence Prediction
Sort
View
TSP
2008
114views more  TSP 2008»
13 years 5 months ago
Universal Switching Linear Least Squares Prediction
We consider sequential regression of individual sequences under the square error loss. Using a competitive algorithm framework, we construct a sequential algorithm that can achieve...
Suleyman Serdar Kozat, Andrew C. Singer
RECOMB
2007
Springer
14 years 5 months ago
Design of Compact, Universal DNA Microarrays for Protein Binding Microarray Experiments
Our group has recently developed a compact, universal protein binding microarray (PBM) that can be used to determine the binding preferences of transcription factors (TFs) [1]. Thi...
Anthony A. Philippakis, Aaron M. Qureshi, Michael ...
ALT
2005
Springer
14 years 2 months ago
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 ...
Alexey V. Chernov, Marcus Hutter
ISCA
1998
IEEE
135views Hardware» more  ISCA 1998»
13 years 9 months ago
Branch Prediction Based on Universal Data Compression Algorithms
Data compression and prediction are closely related. Thus prediction methods based on data compression algorithms have been suggested for the branch prediction problem. In this wo...
Eitan Federovsky, Meir Feder, Shlomo Weiss
COLT
2004
Springer
13 years 11 months ago
Convergence of Discrete MDL for Sequential Prediction
We study the properties of the Minimum Description Length principle for sequence prediction, considering a two-part MDL estimator which is chosen from a countable class of models....
Jan Poland, Marcus Hutter