Sciweavers

Share
CORR
2000
Springer
116views Education» more  CORR 2000»
8 years 4 months ago
Algorithmic Statistics
While Kolmogorov complexity is the accepted absolute measure of information content of an individual finite object, a similarly absolute notion is needed for the relation between a...
Péter Gács, John Tromp, Paul M. B. V...
CORR
2004
Springer
110views Education» more  CORR 2004»
8 years 4 months ago
Shannon Information and Kolmogorov Complexity
The elementary theories of Shannon information and Kolmogorov complexity are cmpared, the extent to which they have a common purpose, and where they are fundamentally different. T...
Peter Grünwald, Paul M. B. Vitányi
ECCC
2010
107views more  ECCC 2010»
8 years 4 months ago
{Algorithmic Minimal Sufficient Statistics: a New Definition
We express some criticism about the definition of an algorithmic sufficient statistic and, in particular, of an algorithmic minimal sufficient statistic. We propose another defini...
Nikolay K. Vereshchagin
CIE
2009
Springer
8 years 8 months ago
Algorithmic Minimal Sufficient Statistic Revisited
Abstract. We express some criticism about the definition of an algorithmic sufficient statistic and, in particular, of an algorithmic minimal sufficient statistic. We propose anoth...
Nikolay K. Vereshchagin
ATAL
2007
Springer
8 years 8 months ago
On discovery and learning of models with predictive representations of state for agents with continuous actions and observations
Models of agent-environment interaction that use predictive state representations (PSRs) have mainly focused on the case of discrete observations and actions. The theory of discre...
David Wingate, Satinder P. Singh
books