Precise Minimax Redundancy and Regret

DOI10.1109/TIT.2004.836702MaRDI QIDQ3546819zbMATH OpenFDO

Authors Michael Drmota, Wojciech Szpankowski

Publication date 21 December 2008

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TIT.2004.836702

zbMATH Keywords

Analytic information theoryaverage minimax redundancygeneralized Shannon codemaximum-likelihood distributionminimax and maxmin regretssequences mod 1universal modelinguniversal noiseless codingworst case minimax redundancy

Mathematics Subject Classification ID

Information theory (general) (94A15) Source coding (94A29)

Recommendations

• scientific article; zbMATH DE number 1944045
• On the complexity of minmax regret linear programming
• A Probabilistic Model for Minmax Regret in Combinatorial Optimization
• Minimax Rényi Redundancy
• A representation theorem for minmax regret policies
• A representation theorem for minmax regret policies
• Minimax regret priors for efficiency estimation
• Minimax regret and strategic uncertainty
• Min max min robust (relative) regret combinatorial optimization
• Minmax regret combinatorial optimization problems: an algorithmic perspective

Cited in

(9)

• Minimax trees in linear time with applications
• A lower bound on compression of unknown alphabets
• Online binary minimax trees
• scientific article; zbMATH DE number 2086237 (Why is no real title available?)
• Markov Types and Minimax Redundancy for Markov Sources
• Minimax redundancy for the class of memoryless sources
• Analytic variations on redundancy rates of renewal processes
• scientific article; zbMATH DE number 7625180 (Why is no real title available?)
• Precise minimax regret for logistic regression with categorical feature values

This page was built for publication: Precise Minimax Redundancy and Regret

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3546819)