Sidestepping hardness in statistical problems
- Recent increases of the availability of data have led to more demand for solving large-scale, computationally intensive statistical problems. Unfortunately, many such problems are provably hard and can require excessive amounts of data or computational resources. I will start out by showing an example hardness result and the implications the result has for practitioners. Keeping that in mind, we will discuss several approaches to sidestepping such hardness results. We will examine applications to the robotics problem of navigation among obstacles with estimated shape and location, the nonparametric statistics problem of log-concave density estimation and synthetically enlarging datasets.
|Type of resource
|electronic resource; remote; computer; online resource
|1 online resource.
|Degree committee member
|Stanford University, Computer Science Department
|Statement of responsibility
|Submitted to the Computer Science Department.
|Thesis Ph.D. Stanford University 2022.
- © 2022 by Brian Axelrod
- This work is licensed under a Creative Commons Attribution Non Commercial 3.0 Unported license (CC BY-NC).
Also listed in
Loading usage metrics...