{"id":{"repo_id":"calpoly","oai_identifier":"oai:digitalcommons.calpoly.edu:theses-4967"},"canonical_url":"https://search.ndltd.org/etd/calpoly/oai:digitalcommons.calpoly.edu:theses-4967","repository":{"repo_id":"calpoly","name":"Cal Poly","base_url":"https://digitalcommons.calpoly.edu/do/oai/"},"display":{"title":"On M-Estimation: From Theory to Examples","abstract":"M-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.","abstract_html":"M-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.","abstract_has_math":false,"creators":["Yuan, Alexander"],"institution":null,"degree_name":"MS in Statistics","degree_level":null,"degree_discipline":"Statistics","degree_department":null,"school":null,"contributors":["Trevor Ruiz","Statistics","College of Science and Mathematics"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":null,"date_issued":"","date_published":null,"updated_at":"2026-11-19T07:12:51Z","subjects":["M-estimation","empirical processes","weak convergence","asymptotic statistics","high-dimensional statistics","mathematical statistics","Statistical Theory","Statistics and Probability"],"languages":[],"rights":[],"rights_urls":[],"identifier_entries":[],"person_identifier_entries":[]},"links":{"outbound_url":"https://digitalcommons.calpoly.edu/theses/3295","outbound_label":"Repository record","outbound_source":"dc:identifier","record_url":"https://digitalcommons.calpoly.edu/theses/3295","record_label":"Repository record","record_kind":"record","record_source":"dc:identifier","download_url":null,"download_label":null,"download_source":null,"access_status":null,"embargo_until":null,"access_note":null},"source_record":{"url":"https://digitalcommons.calpoly.edu/do/oai/?verb=GetRecord&metadataPrefix=oai_etdms&identifier=oai%3Adigitalcommons.calpoly.edu%3Atheses-4967","prefix":"oai_etdms"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Trevor Ruiz","Statistics","College of Science and Mathematics"]},{"key":"dc:creator","label":"Author","values":["Yuan, Alexander"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.available","label":"Dc Date Available","values":["2026-06-09T07:00:00Z"]},{"key":"dc:date.created","label":"Dc Date Created","values":["2026-06-01T07:00:00Z"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Statistics"]},{"key":"thesis:degree_name","label":"Degree Name","values":["MS in Statistics"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["M-estimation","empirical processes","weak convergence","asymptotic statistics","high-dimensional statistics","mathematical statistics","Statistical Theory","Statistics and Probability"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["https://digitalcommons.calpoly.edu/theses/3295"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["M-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."]},{"key":"dc:title","label":"Title","values":["On M-Estimation: From Theory to Examples"]}]}],"canonical_facts":{"dc:contributor":["Trevor Ruiz","Statistics","College of Science and Mathematics"],"dc:creator":["Yuan, Alexander"],"dc:date.available":["2026-06-09T07:00:00Z"],"dc:date.created":["2026-06-01T07:00:00Z"],"dc:description.abstract":["M-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."],"dc:identifier":["https://digitalcommons.calpoly.edu/theses/3295"],"dc:subject":["M-estimation","empirical processes","weak convergence","asymptotic statistics","high-dimensional statistics","mathematical statistics","Statistical Theory","Statistics and Probability"],"dc:title":["On M-Estimation: From Theory to Examples"],"thesis:degree_discipline":["Statistics"],"thesis:degree_name":["MS in Statistics"]},"updated_at":"2026-11-19T07:12:51Z"}