Repository logo
Log in(current)
Repository logoMIT Open ScholarshipDSpace@MIT
  1. Home
  2. MIT Libraries
  3. MIT Theses
  4. Graduate Theses
  5. Concentration Inequalities for Dependent Random
    Variables on Bayesian Networks

Concentration Inequalities for Dependent Random
Variables on Bayesian Networks

Thumbnail Image
Download
Name

yao-rayyao-meng-eecs-2023-thesis.pdf

Description
Thesis PDF
Size

475.13 KB

Format

Adobe PDF

Checksum (MD5)

7b2c137fc526bda247503c9a03a12b03

Author(s)
Yao, Rui
Advisor(s)
Daskalakis, Constantinos
Date Issued
June 2023
Publisher
Massachusetts Institute of Technology
Abstract
The thesis presents a theoretical study of the concentration results for the function defined on the random variables on a Bayesian Network. In this work, we provide several concentration inequality results under the assumption that the function is Lipshitz or bounded difference. In addition, we illustrate about the concentration of the maximum likelihood estimator of some learning models. We also show the optimality of certain results and the comparison to the results in other relevant literature.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
In Copyright - Educational Use Permitted
https://rightsstatements.org/page/InC-EDU/1.0/
Copyright retained by author(s)
Persistent DSpace Link
https://hdl.handle.net/1721.1/151669
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.