{"id":{"repo_id":"cornell","oai_identifier":"oai:ecommons.cornell.edu:1813/69989"},"canonical_url":"https://search.ndltd.org/etd/cornell/oai:ecommons.cornell.edu:1813/69989","repository":{"repo_id":"cornell","name":"Cornell University","base_url":"https://ecommons.cornell.edu/server/oai/request"},"display":{"title":"Tensor rank decompositions via the pseudo-moment method","abstract":"Over a series of four articles and an introduction, a \"method of pseudo-moments\" is developed which gives polynomial-time tensor rank decompositions for a variety of tensor component models. Algorithms given fall into two general classes: those falling back on convex optimization, which develop the theory of polynomial-time algorithms, as well as those constructed through spectral and matrix polynomial methods, which illustrate the possibility of realizing the aforementioned polynomial-time algorithm ideas in runtimes practical for real-life inputs. Tensor component models covered include those featuring random, worst-case, generic, or smoothed inputs, as well as cases featuring overcomplete and undercomplete rank. All models are capable of tolerating substantial noise in tensor inputs, measured in spectral norm.","abstract_html":"Over a series of four articles and an introduction, a &quot;method of pseudo-moments&quot; is developed which gives polynomial-time tensor rank decompositions for a variety of tensor component models. Algorithms given fall into two general classes: those falling back on convex optimization, which develop the theory of polynomial-time algorithms, as well as those constructed through spectral and matrix polynomial methods, which illustrate the possibility of realizing the aforementioned polynomial-time algorithm ideas in runtimes practical for real-life inputs. Tensor component models covered include those featuring random, worst-case, generic, or smoothed inputs, as well as cases featuring overcomplete and undercomplete rank. All models are capable of tolerating substantial noise in tensor inputs, measured in spectral norm.","abstract_has_math":false,"creators":["Shi, Jonathan"],"institution":null,"degree_name":"Ph. D., Computer Science","degree_level":"Doctor of Philosophy","degree_discipline":"Computer Science","degree_department":null,"school":null,"contributors":[],"advisors":[],"committee_chairs":["Steurer, David"],"committee_members":["Kleinberg, Robert David","Sridharan, Karthik"],"year":2019,"date_issued":"2019-12","date_published":"2019-12","updated_at":"2026-11-19T03:20:50Z","subjects":[],"languages":["en"],"rights":["Attribution-ShareAlike 4.0 International"],"rights_urls":["https://creativecommons.org/licenses/by-sa/4.0/"],"identifier_entries":[{"key":"dc:identifier.doi","label":"DOI","values":["https://doi.org/10.7298/9dvf-0c74"],"render_values":[{"text":"https://doi.org/10.7298/9dvf-0c74","href":"https://doi.org/10.7298/9dvf-0c74","code":true}]},{"key":"dc:identifier.bibid","label":"Dc Identifier Bibid","values":["13119655"],"render_values":[{"text":"13119655","href":null,"code":true}]},{"key":"dc:identifier.other","label":"Dc Identifier Other","values":["ProQuest Submission ID: 11675","ProQuest Publication ID: 22615444"],"render_values":[{"text":"ProQuest Submission ID: 11675","href":null,"code":true},{"text":"ProQuest Publication ID: 22615444","href":null,"code":true}]}],"person_identifier_entries":[]},"links":{"outbound_url":"https://hdl.handle.net/1813/69989","outbound_label":"Handle","outbound_source":"dc:identifier.uri","record_url":"https://hdl.handle.net/1813/69989","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%2F69989","prefix":"dim"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.chair","label":"Chair","values":["Steurer, David"]},{"key":"dc:contributor.committeemember","label":"Committee Member","values":["Kleinberg, Robert David","Sridharan, Karthik"]},{"key":"dc:creator","label":"Author","values":["Shi, Jonathan"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2020-06-23T17:58:31Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2020-06-23T17:58:31Z"]},{"key":"dc:date.issued","label":"Date","values":["2019-12"]},{"key":"dc:relation.uri","label":"Dc Relation URI","values":["https://newcatalog.library.cornell.edu/catalog/13119655"]},{"key":"dc:type","label":"Dc Type","values":["dissertation or thesis"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Computer Science"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Doctor of Philosophy"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Ph. D., Computer Science"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.iso","label":"Language (ISO)","values":["en"]},{"key":"dc:rights","label":"Dc Rights","values":["Attribution-ShareAlike 4.0 International"]},{"key":"dc:rights.uri","label":"Rights URI","values":["https://creativecommons.org/licenses/by-sa/4.0/"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.bibid","label":"Dc Identifier Bibid","values":["13119655"]},{"key":"dc:identifier.doi","label":"DOI","values":["https://doi.org/10.7298/9dvf-0c74"]},{"key":"dc:identifier.other","label":"Dc Identifier Other","values":["ProQuest Submission ID: 11675","ProQuest Publication ID: 22615444"]},{"key":"dc:identifier.uri","label":"Identifier URI","values":["https://hdl.handle.net/1813/69989"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"cerif:openaire","label":"Cerif Openaire","values":["<Publication xmlns=\"https://www.openaire.eu/cerif-profile/1.1/\" id=\"d696ab87-b488-467b-b22e-eed4f807a43b\"> <Type xmlns=\"https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types\">http://purl.org/coar/resource_type/c_1843</Type> <Language>en</Language> <Title>Tensor rank decompositions via the pseudo-moment method</Title> <PublishedIn> <Publication> </Publication> </PublishedIn> <PublicationDate>2019-12</PublicationDate> <DOI>https://doi.org/10.7298/9dvf-0c74</DOI> <Authors> <Author> <DisplayName>Shi, Jonathan</DisplayName> <Affiliation> <OrgUnit> </OrgUnit> </Affiliation> </Author> </Authors> <Editors> </Editors> <Publishers> <Publisher> <OrgUnit /> </Publisher> </Publishers> <License>https://creativecommons.org/licenses/by-sa/4.0/</License> <Abstract>Over a series of four articles and an introduction, a \"method of pseudo-moments\" is developed which gives polynomial-time tensor rank decompositions for a variety of tensor component models. Algorithms given fall into two general classes: those falling back on convex optimization, which develop the theory of polynomial-time algorithms, as well as those constructed through spectral and matrix polynomial methods, which illustrate the possibility of realizing the aforementioned polynomial-time algorithm ideas in runtimes practical for real-life inputs. Tensor component models covered include those featuring random, worst-case, generic, or smoothed inputs, as well as cases featuring overcomplete and undercomplete rank. All models are capable of tolerating substantial noise in tensor inputs, measured in spectral norm.</Abstract> <Access xmlns=\"http://purl.org/coar/access_right\" > </Access> </Publication>"]},{"key":"cris:virtual.author","label":"Cris Virtual Author","values":["Shi, Jonathan"]},{"key":"cris:virtualsource.collection","label":"Cris Virtualsource Collection","values":["5893a6ea-7af3-41d7-abc6-04bcd26ab5df"]},{"key":"dc:description","label":"Description","values":["350 pages"]},{"key":"dc:description.abstract","label":"Abstract","values":["Over a series of four articles and an introduction, a \"method of pseudo-moments\" is developed which gives polynomial-time tensor rank decompositions for a variety of tensor component models. Algorithms given fall into two general classes: those falling back on convex optimization, which develop the theory of polynomial-time algorithms, as well as those constructed through spectral and matrix polynomial methods, which illustrate the possibility of realizing the aforementioned polynomial-time algorithm ideas in runtimes practical for real-life inputs. Tensor component models covered include those featuring random, worst-case, generic, or smoothed inputs, as well as cases featuring overcomplete and undercomplete rank. All models are capable of tolerating substantial noise in tensor inputs, measured in spectral norm."]},{"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":["Tensor rank decompositions via the pseudo-moment method"]},{"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=\"d696ab87-b488-467b-b22e-eed4f807a43b\"> <Type xmlns=\"https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types\">http://purl.org/coar/resource_type/c_1843</Type> <Language>en</Language> <Title>Tensor rank decompositions via the pseudo-moment method</Title> <PublishedIn> <Publication> </Publication> </PublishedIn> <PublicationDate>2019-12</PublicationDate> <DOI>https://doi.org/10.7298/9dvf-0c74</DOI> <Authors> <Author> <DisplayName>Shi, Jonathan</DisplayName> <Affiliation> <OrgUnit> </OrgUnit> </Affiliation> </Author> </Authors> <Editors> </Editors> <Publishers> <Publisher> <OrgUnit /> </Publisher> </Publishers> <License>https://creativecommons.org/licenses/by-sa/4.0/</License> <Abstract>Over a series of four articles and an introduction, a \"method of pseudo-moments\" is developed which gives polynomial-time tensor rank decompositions for a variety of tensor component models. Algorithms given fall into two general classes: those falling back on convex optimization, which develop the theory of polynomial-time algorithms, as well as those constructed through spectral and matrix polynomial methods, which illustrate the possibility of realizing the aforementioned polynomial-time algorithm ideas in runtimes practical for real-life inputs. Tensor component models covered include those featuring random, worst-case, generic, or smoothed inputs, as well as cases featuring overcomplete and undercomplete rank. All models are capable of tolerating substantial noise in tensor inputs, measured in spectral norm.</Abstract> <Access xmlns=\"http://purl.org/coar/access_right\" > </Access> </Publication>"],"cris:virtual.author":["Shi, Jonathan"],"cris:virtualsource.collection":["5893a6ea-7af3-41d7-abc6-04bcd26ab5df"],"dc:contributor.chair":["Steurer, David"],"dc:contributor.committeemember":["Kleinberg, Robert David","Sridharan, Karthik"],"dc:creator":["Shi, Jonathan"],"dc:date.accessioned":["2020-06-23T17:58:31Z"],"dc:date.available":["2020-06-23T17:58:31Z"],"dc:date.issued":["2019-12"],"dc:description":["350 pages"],"dc:description.abstract":["Over a series of four articles and an introduction, a \"method of pseudo-moments\" is developed which gives polynomial-time tensor rank decompositions for a variety of tensor component models. Algorithms given fall into two general classes: those falling back on convex optimization, which develop the theory of polynomial-time algorithms, as well as those constructed through spectral and matrix polynomial methods, which illustrate the possibility of realizing the aforementioned polynomial-time algorithm ideas in runtimes practical for real-life inputs. Tensor component models covered include those featuring random, worst-case, generic, or smoothed inputs, as well as cases featuring overcomplete and undercomplete rank. All models are capable of tolerating substantial noise in tensor inputs, measured in spectral norm."],"dc:description.collection":["Cornell Theses and Dissertations"],"dc:format.mimetype":["application/pdf"],"dc:identifier.bibid":["13119655"],"dc:identifier.doi":["https://doi.org/10.7298/9dvf-0c74"],"dc:identifier.other":["ProQuest Submission ID: 11675","ProQuest Publication ID: 22615444"],"dc:identifier.uri":["https://hdl.handle.net/1813/69989"],"dc:language.iso":["en"],"dc:relation.uri":["https://newcatalog.library.cornell.edu/catalog/13119655"],"dc:rights":["Attribution-ShareAlike 4.0 International"],"dc:rights.uri":["https://creativecommons.org/licenses/by-sa/4.0/"],"dcterms:license":["https://hdl.handle.net/1813/59810"],"dc:title":["Tensor rank decompositions via the pseudo-moment method"],"dc:type":["dissertation or thesis"],"dspace:entity.type":["Publication"],"others:access_status":["open.access"],"thesis:degree_discipline":["Computer Science"],"thesis:degree_level":["Doctor of Philosophy"],"thesis:degree_name":["Ph. D., Computer Science"]},"updated_at":"2026-11-19T03:20:50Z"}