Abstract
dc:description.abstractM-estimation provides a unified framework for statistical procedures defined as optimizers of data-dependent criterion functions. This thesis gives an expository account of M-estimation in classical and high-dimensional settings. The classical part develops weak convergence, empirical process tools, and the argmax framework for studying consistency, rates of convergence, and weak limits. Examples including least squares, maximum likelihood, robust location estimation, change-point estimation, and empirical risk minimization illustrate regular and non-regular asymptotic behavior. The high-dimensional part studies regularized M-estimators, where the focus shifts to finite-sample error bounds and model selection guarantees. Topics include decomposable regularizers, restricted strong convexity, non-convex penalties, and sparsistency. Overall, the thesis emphasizes the common optimization-based structure underlying M-estimation across classical and high-dimensional regimes.
Degree
thesis:*- Name thesis:degree_name
- MS in Statistics
- Discipline thesis:degree_discipline
- Statistics
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Yuan, Alexander
- Contributors dc:contributor
-
- Trevor Ruiz
- Statistics
- College of Science and Mathematics
Subjects
dc:subject × 8Identifiers
dc:identifier.*- Repository record dc:identifier
- https://digitalcommons.calpoly.edu/theses/3295