Upper and Lower Bounds for Sampling
This thesis studies the problem of drawing samples from a probability distribution. Despite the prevalence of sampling problems in applications, the quantitative behavior of sampling algorithms remains poorly understood. This thesis contributes to the theoretical understanding of sampling by giving...
Main Author: | Lu, Chen |
---|---|
Other Authors: | Rigollet, Philippe |
Format: | Thesis |
Published: |
Massachusetts Institute of Technology
2023
|
Online Access: | https://hdl.handle.net/1721.1/152686 |
Similar Items
-
Lower and upper bounds for linkage discovery
by: Choi, Sung-Soon, et al.
Published: (2010) -
Query lower bounds for log-concave sampling
by: Chewi, Sinho, et al.
Published: (2024) -
Quantum randomness expansion : upper and lower bounds
by: Yuen, Henry, Ph. D. Massachusetts Institute of Technology
Published: (2014) -
Tensor rank : some lower and upper bounds
by: Forbes, Michael Andrew
Published: (2011) -
Computing Upper and Lower Bounds on Likelihoods in Intractable Networks
by: Jaakkola, Tommi S., et al.
Published: (2004)