Skip to search formSkip to main contentSkip to account menu

Krichevsky–Trofimov estimator

Known as: Krichevsky-Trofimov estimator 
In information theory, given an unknown stationary source π with alphabet A and a sample w from π, the Krichevsky–Trofimov (KT) estimator produces an… 
Wikipedia (opens in a new tab)

Related topics

Related topics

4 relations

Broader (1)

Data compression
Information theoryRegret (decision theory)Stationary process

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2020
2020
Sequential Universal Modeling for Non-Binary Sequences with Constrained Distributions
Sequential probability assignment and universal compression go hand in hand. We propose sequential probability assignment for non… 
2018
2018
Universal Compression of Piecewise i.i.d. Sources
We study the problem of compressing piecewise i.i.d. sources, which models the practical application of jointly compressing… 
2017
2017
Detector optimization based on studies of charge migration in the high purity germanium crystals of the EDELWEISS dark matter experiment
Kosmologische Beobachtungen auf allen Grosenskalen des Universums haben gezeigt, dass 86 % der gesamten Masse im Universum aus… 
2013
2013
Nonparametric Decentralized Sequential Detection via Universal Source Coding
We consider nonparametric or universal sequential hypothesis testing problem when the distribution under the null hypothesis is… 
2012
2012
Spectrum sensing via universal source coding
We consider nonparametric sequential hypothesis testing when the distribution under null hypothesis is fully known and the… 
2006
2006
Consistency of the Unlimited BIC Context Tree Estimator
The Bayesian information criterion (BIC) and Krichevsky- Trofimov (KT) version of minimum description length (MDL) principle are… 
2005
2005
Theoretical analysis of a zero-redundancy estimator with a finite window for memoryless source
A zero-redundancy estimator is defined by a weighted sum of Krichevsky-Trofimov (KT) sequential probability estimators i.e., the… 
2005
2005
Analysis of Zero-Redundancy Estimator with a Finite Window for Markovian Source
Prediction of actual symbol probability is crucial for statistical data compression that uses arithmetic coder. Krichevsky… 
2005
2005
Redundancy of symbol decomposition algorithms for memoryless source
The symbol decomposition algorithm is proposed by Willems et. al. as an efficient and practical symbol predictor applicable for… 
2003
2003
TROFIMOV G.Yu. Regimes of Growth and Economic Integration. Why Poor Countries Cannot Join the "Club" of Rich? — Moscow:
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)