Sciweavers

81 search results - page 4 / 17
» On the Foundations of Universal Sequence Prediction
Sort
View
ALT
2003
Springer
15 years 6 months ago
On the Existence and Convergence of Computable Universal Priors
Solomonoff unified Occam’s razor and Epicurus’ principle of multiple explanations to one elegant, formal, universal theory of inductive inference, which initiated the field...
Marcus Hutter
NIPS
2003
14 years 11 months ago
Online Learning of Non-stationary Sequences
We consider an online learning scenario in which the learner can make predictions on the basis of a fixed set of experts. We derive upper and lower relative loss bounds for a cla...
Claire Monteleoni, Tommi Jaakkola
CSMR
2011
IEEE
14 years 1 months ago
Software Maintenance Research in the PROGRESS Project for Predictable Embedded Software Systems
Abstract—PROGRESS is a project and strategic research centre at M¨alardalen University in Sweden that is funded for 2006– 2010 by the Swedish Foundation for Strategic Research...
Johan Kraft, Holger M. Kienle, Thomas Nolte, Ivica...
CJ
2008
97views more  CJ 2008»
14 years 9 months ago
Three Kinds of Probabilistic Induction: Universal Distributions and Convergence Theorems
We will describe three kinds of probabilistic induction problems, and give general solutions for each , with associated convergence theorems that show they tend to give good proba...
Ray J. Solomonoff
CORR
2006
Springer
96views Education» more  CORR 2006»
14 years 9 months ago
Metric entropy in competitive on-line prediction
Competitive on-line prediction (also known as universal prediction of individual sequences) is a strand of learning theory avoiding making any stochastic assumptions about the way...
Vladimir Vovk