{"id":{"repo_id":"cornell","oai_identifier":"oai:ecommons.cornell.edu:1813/59693"},"canonical_url":"https://search.ndltd.org/etd/cornell/oai:ecommons.cornell.edu:1813/59693","repository":{"repo_id":"cornell","name":"Cornell University","base_url":"https://ecommons.cornell.edu/server/oai/request"},"display":{"title":"High-Dimensional Structured Regression Using Convex Optimization","abstract":"While the term \"Big Data\" can have multiple meanings, we consider the type of data in which the number of features can be much greater than the number of observations (also known as high-dimensional data). High-dimensional data is abundant in contemporary scientific research due to the rapid advances in new data-measurement technologies and computing power. Recent advances in statistics have witnessed great development in the field of high-dimensional data analysis. This dissertation proposes three methods that study three different components of a general framework of the high-dimensional structured regression problem. A general theme of the proposed methods is that they cast a certain structured regression as a convex optimization problem. In so doing, the theoretical properties of each method can be well studied, and efficient computation are facilitated. Each method is accompanied by thorough theoretical analysis of its performance, and also by an R package containing its practical implementation. We show that the proposed methods perform favorably (both theoretically and practically) compared with pre-existing methods.","abstract_html":"While the term &quot;Big Data&quot; can have multiple meanings, we consider the type of data in which the number of features can be much greater than the number of observations (also known as high-dimensional data). High-dimensional data is abundant in contemporary scientific research due to the rapid advances in new data-measurement technologies and computing power. Recent advances in statistics have witnessed great development in the field of high-dimensional data analysis. This dissertation proposes three methods that study three different components of a general framework of the high-dimensional structured regression problem. A general theme of the proposed methods is that they cast a certain structured regression as a convex optimization problem. In so doing, the theoretical properties of each method can be well studied, and efficient computation are facilitated. Each method is accompanied by thorough theoretical analysis of its performance, and also by an R package containing its practical implementation. We show that the proposed methods perform favorably (both theoretically and practically) compared with pre-existing methods.","abstract_has_math":false,"creators":["Yu, Guo"],"institution":"Cornell University","degree_name":"Ph. D., Statistics","degree_level":"Doctor of Philosophy","degree_discipline":"Statistics","degree_department":null,"school":null,"contributors":[],"advisors":[],"committee_chairs":["Bien, Jacob"],"committee_members":["Lewis, Adrian S.","Hooker, Giles J."],"year":2018,"date_issued":"2018-08-30","date_published":"2018-08-30","updated_at":"2026-11-19T03:20:35Z","subjects":["Statistics"],"languages":["en_US"],"rights":[],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier.doi","label":"DOI","values":["https://doi.org/10.7298/X4T151W1"],"render_values":[{"text":"https://doi.org/10.7298/X4T151W1","href":"https://doi.org/10.7298/X4T151W1","code":true}]},{"key":"dc:identifier.bibid","label":"Dc Identifier Bibid","values":["10489789"],"render_values":[{"text":"10489789","href":null,"code":true}]},{"key":"dc:identifier.other","label":"Dc Identifier Other","values":["ProQuest Submission ID: 11076","ProQuest Publication ID: 10928638"],"render_values":[{"text":"ProQuest Submission ID: 11076","href":null,"code":true},{"text":"ProQuest Publication ID: 10928638","href":null,"code":true}]}],"person_identifier_entries":[]},"links":{"outbound_url":"https://hdl.handle.net/1813/59693","outbound_label":"Handle","outbound_source":"dc:identifier.uri","record_url":"https://hdl.handle.net/1813/59693","record_label":"Repository record","record_kind":"handle","record_source":"dc:identifier.uri","download_url":null,"download_label":null,"download_source":null,"access_status":null,"embargo_until":null,"access_note":null},"source_record":{"url":"https://ecommons.cornell.edu/server/oai/request?verb=GetRecord&metadataPrefix=dim&identifier=oai%3Aecommons.cornell.edu%3A1813%2F59693","prefix":"dim"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.chair","label":"Chair","values":["Bien, Jacob"]},{"key":"dc:contributor.committeemember","label":"Committee Member","values":["Lewis, Adrian S.","Hooker, Giles J."]},{"key":"dc:creator","label":"Author","values":["Yu, Guo"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2018-10-23T13:35:00Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2018-10-23T13:35:00Z"]},{"key":"dc:date.issued","label":"Date","values":["2018-08-30"]},{"key":"dc:type","label":"Dc Type","values":["dissertation or thesis"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Statistics"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Doctor of Philosophy"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Ph. D., Statistics"]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["Cornell University"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Statistics"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.iso","label":"Language (ISO)","values":["en_US"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.bibid","label":"Dc Identifier Bibid","values":["10489789"]},{"key":"dc:identifier.doi","label":"DOI","values":["https://doi.org/10.7298/X4T151W1"]},{"key":"dc:identifier.other","label":"Dc Identifier Other","values":["ProQuest Submission ID: 11076","ProQuest Publication ID: 10928638"]},{"key":"dc:identifier.uri","label":"Identifier URI","values":["https://hdl.handle.net/1813/59693"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"cerif:openaire","label":"Cerif Openaire","values":["<Publication xmlns=\"https://www.openaire.eu/cerif-profile/1.1/\" id=\"4c60c7e0-afc3-44ff-bd79-cb4486ebc40e\"> <Type xmlns=\"https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types\">http://purl.org/coar/resource_type/c_1843</Type> <Language>en_US</Language> <Title>High-Dimensional Structured Regression Using Convex Optimization</Title> <PublishedIn> <Publication> </Publication> </PublishedIn> <PublicationDate>2018-08-30</PublicationDate> <DOI>https://doi.org/10.7298/X4T151W1</DOI> <Authors> <Author> <DisplayName>Yu, Guo</DisplayName> <Affiliation> <OrgUnit> </OrgUnit> </Affiliation> </Author> </Authors> <Editors> </Editors> <Publishers> <Publisher> <OrgUnit /> </Publisher> </Publishers> <Keyword>Statistics</Keyword> <Abstract>While the term \"Big Data\" can have multiple meanings, we consider the type of data in which the number of features can be much greater than the number of observations (also known as high-dimensional data). High-dimensional data is abundant in contemporary scientific research due to the rapid advances in new data-measurement technologies and computing power. Recent advances in statistics have witnessed great development in the field of high-dimensional data analysis. This dissertation proposes three methods that study three different components of a general framework of the high-dimensional structured regression problem. A general theme of the proposed methods is that they cast a certain structured regression as a convex optimization problem. In so doing, the theoretical properties of each method can be well studied, and efficient computation are facilitated. Each method is accompanied by thorough theoretical analysis of its performance, and also by an R package containing its practical implementation. We show that the proposed methods perform favorably (both theoretically and practically) compared with pre-existing methods.</Abstract> <Access xmlns=\"http://purl.org/coar/access_right\" > </Access> </Publication>"]},{"key":"cris:virtual.author","label":"Cris Virtual Author","values":["Yu, Guo"]},{"key":"cris:virtualsource.collection","label":"Cris Virtualsource Collection","values":["5893a6ea-7af3-41d7-abc6-04bcd26ab5df"]},{"key":"dc:description.abstract","label":"Abstract","values":["While the term \"Big Data\" can have multiple meanings, we consider the type of data in which the number of features can be much greater than the number of observations (also known as high-dimensional data). High-dimensional data is abundant in contemporary scientific research due to the rapid advances in new data-measurement technologies and computing power. Recent advances in statistics have witnessed great development in the field of high-dimensional data analysis. This dissertation proposes three methods that study three different components of a general framework of the high-dimensional structured regression problem. A general theme of the proposed methods is that they cast a certain structured regression as a convex optimization problem. In so doing, the theoretical properties of each method can be well studied, and efficient computation are facilitated. Each method is accompanied by thorough theoretical analysis of its performance, and also by an R package containing its practical implementation. We show that the proposed methods perform favorably (both theoretically and practically) compared with pre-existing methods."]},{"key":"dc:description.collection","label":"Dc Description Collection","values":["Cornell Theses and Dissertations"]},{"key":"dc:format.mimetype","label":"Dc Format Mimetype","values":["application/pdf"]},{"key":"dcterms:license","label":"Dcterms License","values":["https://hdl.handle.net/1813/59810"]},{"key":"dc:title","label":"Title","values":["High-Dimensional Structured Regression Using Convex Optimization"]},{"key":"dspace:entity.type","label":"Dspace Entity Type","values":["Publication"]},{"key":"others:access_status","label":"Others Access Status","values":["open.access"]}]}],"canonical_facts":{"cerif:openaire":["<Publication xmlns=\"https://www.openaire.eu/cerif-profile/1.1/\" id=\"4c60c7e0-afc3-44ff-bd79-cb4486ebc40e\"> <Type xmlns=\"https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types\">http://purl.org/coar/resource_type/c_1843</Type> <Language>en_US</Language> <Title>High-Dimensional Structured Regression Using Convex Optimization</Title> <PublishedIn> <Publication> </Publication> </PublishedIn> <PublicationDate>2018-08-30</PublicationDate> <DOI>https://doi.org/10.7298/X4T151W1</DOI> <Authors> <Author> <DisplayName>Yu, Guo</DisplayName> <Affiliation> <OrgUnit> </OrgUnit> </Affiliation> </Author> </Authors> <Editors> </Editors> <Publishers> <Publisher> <OrgUnit /> </Publisher> </Publishers> <Keyword>Statistics</Keyword> <Abstract>While the term \"Big Data\" can have multiple meanings, we consider the type of data in which the number of features can be much greater than the number of observations (also known as high-dimensional data). High-dimensional data is abundant in contemporary scientific research due to the rapid advances in new data-measurement technologies and computing power. Recent advances in statistics have witnessed great development in the field of high-dimensional data analysis. This dissertation proposes three methods that study three different components of a general framework of the high-dimensional structured regression problem. A general theme of the proposed methods is that they cast a certain structured regression as a convex optimization problem. In so doing, the theoretical properties of each method can be well studied, and efficient computation are facilitated. Each method is accompanied by thorough theoretical analysis of its performance, and also by an R package containing its practical implementation. We show that the proposed methods perform favorably (both theoretically and practically) compared with pre-existing methods.</Abstract> <Access xmlns=\"http://purl.org/coar/access_right\" > </Access> </Publication>"],"cris:virtual.author":["Yu, Guo"],"cris:virtualsource.collection":["5893a6ea-7af3-41d7-abc6-04bcd26ab5df"],"dc:contributor.chair":["Bien, Jacob"],"dc:contributor.committeemember":["Lewis, Adrian S.","Hooker, Giles J."],"dc:creator":["Yu, Guo"],"dc:date.accessioned":["2018-10-23T13:35:00Z"],"dc:date.available":["2018-10-23T13:35:00Z"],"dc:date.issued":["2018-08-30"],"dc:description.abstract":["While the term \"Big Data\" can have multiple meanings, we consider the type of data in which the number of features can be much greater than the number of observations (also known as high-dimensional data). High-dimensional data is abundant in contemporary scientific research due to the rapid advances in new data-measurement technologies and computing power. Recent advances in statistics have witnessed great development in the field of high-dimensional data analysis. This dissertation proposes three methods that study three different components of a general framework of the high-dimensional structured regression problem. A general theme of the proposed methods is that they cast a certain structured regression as a convex optimization problem. In so doing, the theoretical properties of each method can be well studied, and efficient computation are facilitated. Each method is accompanied by thorough theoretical analysis of its performance, and also by an R package containing its practical implementation. We show that the proposed methods perform favorably (both theoretically and practically) compared with pre-existing methods."],"dc:description.collection":["Cornell Theses and Dissertations"],"dc:format.mimetype":["application/pdf"],"dc:identifier.bibid":["10489789"],"dc:identifier.doi":["https://doi.org/10.7298/X4T151W1"],"dc:identifier.other":["ProQuest Submission ID: 11076","ProQuest Publication ID: 10928638"],"dc:identifier.uri":["https://hdl.handle.net/1813/59693"],"dc:language.iso":["en_US"],"dc:subject":["Statistics"],"dcterms:license":["https://hdl.handle.net/1813/59810"],"dc:title":["High-Dimensional Structured Regression Using Convex Optimization"],"dc:type":["dissertation or thesis"],"dspace:entity.type":["Publication"],"others:access_status":["open.access"],"thesis:degree_discipline":["Statistics"],"thesis:degree_level":["Doctor of Philosophy"],"thesis:degree_name":["Ph. D., Statistics"],"thesis:institution_name":["Cornell University"]},"updated_at":"2026-11-19T03:20:35Z"}