Book contents
- Frontmatter
- Dedication
- Contents
- Preface
- Acknowledgments
- Part I Known Sources
- Part II Universal Codes
- 9 Minimax Redundancy and Regret
- 10 Redundancy of Universal Memoryless Sources
- 11 Markov Types and Redundancy for Markov Sources
- 12 Non-Markovian Sources: Redundancy of Renewal Processes
- A Probability
- B Generating Functions
- C Complex Asymptotics
- D Mellin Transforms and Tauberian Theorems
- E Exponential Sums and Uniform Distribution mod 1
- F Diophantine Approximation
- References
- Index
9 - Minimax Redundancy and Regret
from Part II - Universal Codes
Published online by Cambridge University Press: 24 August 2023
Book contents
- Frontmatter
- Dedication
- Contents
- Preface
- Acknowledgments
- Part I Known Sources
- Part II Universal Codes
- 9 Minimax Redundancy and Regret
- 10 Redundancy of Universal Memoryless Sources
- 11 Markov Types and Redundancy for Markov Sources
- 12 Non-Markovian Sources: Redundancy of Renewal Processes
- A Probability
- B Generating Functions
- C Complex Asymptotics
- D Mellin Transforms and Tauberian Theorems
- E Exponential Sums and Uniform Distribution mod 1
- F Diophantine Approximation
- References
- Index
Summary
A summary is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.
- Type
- Chapter
- Information
- Analytic Information TheoryFrom Compression to Learning, pp. 191 - 210Publisher: Cambridge University PressPrint publication year: 2023