281 citations
- University of AmsterdamNL22 papers
- Eindhoven University of TechnologyNL17 papers
- College of Western IdahoUS5 papers
- Universidad Pública de Navarra (UPNA)ES4 papers
- University of WaterlooCA4 papers
- Vrije Universiteit AmsterdamNL4 papers
- Berkeley CollegeUS2 papers
- National University of SingaporeSG2 papers
- Radboud University NijmegenNL2 papers
- University of BristolGB2 papers
- University of California, BerkeleyUS2 papers
- University of CambridgeGB2 papers
7 papers · 1 filter
Testing Goodness-of-Fit via Rate Distortion
Peter Harremoes
A framework is developed using techniques from rate distortion theory in statistical testing. The idea is first to do optimal compression according to a certain distortion function…
Regret and Jeffreys Integrals in Exp. Families
Peter Grunwald, Peter Harremoes
The problem of whether minimax redundancy, minimax regret and Jeffreys integrals are finite or infinite are discussed.
Algorithmic information theory
Peter D. Grunwald, Paul M. B. Vitanyi
We introduce algorithmic information theory, also known as the theory of Kolmogorov complexity. We explain the main concepts of this quantitative approach to defining `information'…
Entropy Concentration and the Empirical Coding Game
Peter Grunwald
We give a characterization of Maximum Entropy/Minimum Relative Entropy inference by providing two `strong entropy concentration' theorems. These theorems unify and generalize Jayne…
Noise threshold for universality of 2-input gates
Falk Unger
Evans and Pippenger showed in 1998 that noisy gates with 2 inputs are universal for arbitrary computation (i.e. can compute any function with bounded error), if all gates fail inde…
Lower bounds on the minimum average distance of binary codes
Beniamin Mounits
New lower bounds on the minimum average Hamming distance of binary codes are derived. The bounds are obtained using linear programming approach.