Optimization and Sampling using Iterative Algorithms
2022-07
Loading...
View/Download File
Persistent link to this item
Statistics
View StatisticsJournal Title
Journal ISSN
Volume Title
Title
Optimization and Sampling using Iterative Algorithms
Authors
Published Date
2022-07
Publisher
Type
Thesis or Dissertation
Abstract
Sampling and optimization are considered as the two key pillars in statistics with applications in many other fields like machine learning, physics, chemistry just to name a few. Although there has been a recent boom in literature for both optimization and sampling algorithms, some key questions on the properties of the aforementioned topics still remain unanswered. In this thesis we study some of these algorithms in detail and address some of the key questions. The common aspect that connects all the algorithms considered by us is that they are iterative in nature. We study the Langevin Monte Carlo (LMC) algorithm with incorrect gradient and establish asymptotic results. We also consider the Multiplicative Stochastic Gradient Descent Algorithm (M-SGD) and establish that the error term is asymptotically Gaussian. Also, we exhibit that the M-SGD algorithm is close to a certain diffusion, irrespective of the weights used, in order of the step size under suitable assumptions. Next, we establish the convergence of the algorithm and a CLT around the optimum in the regime of strong convexity. Lastly, we consider the preconditioned LMC algorithm and exhibit non-asymptotic bounds in the regime of strong convexity.
Keywords
Description
University of Minnesota Ph.D. dissertation. July 2022. Major: Statistics. Advisor: Tiefeng Jiang. 1 computer file (PDF); xii, 160 pages.
Related to
Replaces
License
Collections
Series/Report Number
Funding information
Isbn identifier
Doi identifier
Previously Published Citation
Suggested citation
Bhattacharya, Riddhiman. (2022). Optimization and Sampling using Iterative Algorithms. Retrieved from the University Digital Conservancy, https://hdl.handle.net/11299/243076.
Content distributed via the University Digital Conservancy may be subject to additional license and use restrictions applied by the depositor. By using these files, users agree to the Terms of Use. Materials in the UDC may contain content that is disturbing and/or harmful. For more information, please see our statement on harmful content in digital repositories.