Comparing Distributions: Invariance Principles & Mismatched Guesswork
Name
Mariona_amariona_sm-EECS-2024_thesis.pdf
Description
Thesis PDF
Size
301.27 KB
Format
Adobe PDF
Checksum (MD5)
f9bf7df3a077f615c6274b8e6cfe297d
Author(s)
Mariona, Alexander
Advisor(s)
Médard, Muriel
Date Issued
February 2024
Publisher
Massachusetts Institute of Technology
Abstract
We study two different ways of measuring the similarity between distributions over a finite alphabet. The first is an invariance principle which gives a quantitative bound on the expected difference between general functions of two finite sequences of random variables. This result is one way to generalize the foundational basic invariance principle to a particular multivariate setting. The second framework is based on guesswork, which is one way to measure the randomness of a distribution, similar to but notably distinct from the Shannon entropy. Given a bound on the total variation distance between two finite distributions, we give a bound on the difference in guesswork between those distributions and study the geometrical properties of the problem in the non-asymptotic setting.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
In Copyright - Educational Use Permitted
Copyright retained by author(s)
Persistent DSpace Link
