Algorithmic complexity bounds on future prediction errors (Q865627): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(9 intermediate revisions by 8 users not shown)
Property / author
 
Property / author: Alexei Chernov / rank
Normal rank
 
Property / author
 
Property / author: Alexei Chernov / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q58012403 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2139750407 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: cs/0701120 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Learning Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: A formal theory of inductive inference. Part I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity-based induction systems: Comparisons and convergence theorems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3046708 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universal artificial intelligence. Sequential decisions based on algorithmic probability. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4337021 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clustering by Compression / rank
 
Normal rank
Property / cites work
 
Property / cites work: New error bounds for Solomonoff prediction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence and loss bounds for bayesian sequence prediction / rank
 
Normal rank
Property / cites work
 
Property / cites work: 10.1162/1532443041827952 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence and Error Bounds for Universal Prediction of Nonbinary Sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Learning Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: HIERARCHIES OF GENERALIZED KOLMOGOROV COMPLEXITIES AND NONENUMERABLE UNIVERSAL MEASURES COMPUTABLE IN THE LIMIT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning Theory and Kernel Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequential predictions based on algorithmic complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relations between varieties of kolmogorov complexities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning Theory / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 15:04, 25 June 2024

scientific article
Language Label Description Also known as
English
Algorithmic complexity bounds on future prediction errors
scientific article

    Statements

    Algorithmic complexity bounds on future prediction errors (English)
    0 references
    0 references
    0 references
    0 references
    20 February 2007
    0 references
    0 references
    Kolmogorov complexity
    0 references
    posterior bounds
    0 references
    online sequential prediction
    0 references
    Solomonoff prior
    0 references
    monotone conditional complexity
    0 references
    total error
    0 references
    future loss
    0 references
    randomness deficiency
    0 references
    0 references
    0 references
    0 references