|
16
|
Universal compression of memoryless sources over unknown alphabets
– Alon Orlitsky, Narayana P. Santhanam, Junan Zhang
- 2004
|
|
1
|
Universal compression of Markov and related sources over arbitrary alphabets
– K. Dhulipala, Student Member, Alon Orlitsky
- 2006
|
|
2
|
Average Redundancy for Known Sources: Ubiquitous Trees in Source Coding
– Wojciech Szpankowski
- 2008
|
|
|
A Universal Compression Perspective of Smoothing
– Nikola Jevtić, Alon Orlitsky
|
|
99
|
Universal Prediction
– Neri Merhav, Meir Feder
- 1998
|
|
|
Minimax Redundancy for Large Alphabets
– Wojciech Szpankowski, Marcelo J. Weinberger
|
|
6
|
Minimax Regret under Log Loss for General Classes of Experts
– Nicolò Cesa-Bianchi, Gábor Lugosi, Polo Didattico E Di Ricerca, G Abor Lugosi
- 1999
|
|
|
Lectures on Prediction of Individual Sequences
– Gábor Lugosi
- 2001
|
|
9
|
Worst-case Bounds for the Logarithmic Loss of Predictors
– Nicoló Cesa-Bianchi, Gábor Lugosi
- 1999
|
|
39
|
Competitive on-line statistics
– Volodya Vovk
- 1999
|
|
35
|
Predicting a Binary Sequence Almost as Well as the Optimal Biased Coin
– Yoav Freund
- 1996
|
|
11
|
Markov Types and Minimax Redundancy for Markov Sources
– Philippe Jacquet, Wojciech Szpankowski I
- 2003
|
|
19
|
Precise Minimax Redundancy and Regret
– Michael Drmota, Wojciech Szpankowski
- 2004
|
|
7
|
The Minimax Strategy for Gaussian Density Estimation
– Eiji Takimoto, Manfred Warmuth
- 2000
|
|
|
Monte Carlo Estimation of Minimax Regret with an Application to MDL Model Selection
– Teemu Roos
- 2008
|
|
7
|
The Last-Step Minimax Algorithm
– Eiji Takimoto, Manfred Warmuth
- 2000
|
|
106
|
Adaptive Game Playing Using Multiplicative Weights
– Yoav Freund, Robert E. Schapire
|
|
2
|
Superior Guarantees for Sequential Prediction and Lossless Compression via Alphabet Decomposition
– Ron Begleiter, Ran El-yaniv, Dana Ron
|
|
83
|
Relative Loss Bounds for On-line Density Estimation with the Exponential Family of Distributions
– Katy S. Azoury, M. K. Warmuth
- 2000
|
