{"id":{"repo_id":"wustl","oai_identifier":"oai:openscholarship.wustl.edu:etd-2303"},"canonical_url":"https://search.dev.ndltd.org/etd/wustl/oai:openscholarship.wustl.edu:etd-2303","repository":{"repo_id":"wustl","name":"Washington University in St. Louis","base_url":"https://openscholarship.wustl.edu/do/oai/"},"display":{"title":"Scaling Multidimensional Inference for Big Structured Data","abstract":"<p>\"In information technology, big data is a collection of data sets so large and complex that it becomes difficult to process using traditional data processing applications\" [151]. In a</p><p>world of increasing sensor modalities, cheaper storage, and more data oriented questions, we are quickly passing the limits of tractable computations using traditional statistical analysis</p><p>methods. Methods which often show great results on simple data have difficulties processing complicated multidimensional data. Accuracy alone can no longer justify unwarranted memory</p><p>use and computational complexity. Improving the scaling properties of these methods for multidimensional data is the only way to make these methods relevant. In this work we explore methods for improving the scaling properties of parametric and nonparametric</p><p>models. Namely, we focus on the structure of the data to lower the complexity of a specific family of problems. The two types of structures considered in this work are distributive</p><p>optimization with separable constraints (Chapters 2-3), and scaling Gaussian processes for multidimensional lattice input (Chapters 4-5). By improving the scaling of these methods, we can expand their use to a wide range of applications which were previously intractable</p><p>open the door to new research questions.</p>","abstract_html":"&lt;p&gt;&quot;In information technology, big data is a collection of data sets so large and complex that it becomes difficult to process using traditional data processing applications&quot; [151]. In a&lt;/p&gt;&lt;p&gt;world of increasing sensor modalities, cheaper storage, and more data oriented questions, we are quickly passing the limits of tractable computations using traditional statistical analysis&lt;/p&gt;&lt;p&gt;methods. Methods which often show great results on simple data have difficulties processing complicated multidimensional data. Accuracy alone can no longer justify unwarranted memory&lt;/p&gt;&lt;p&gt;use and computational complexity. Improving the scaling properties of these methods for multidimensional data is the only way to make these methods relevant. In this work we explore methods for improving the scaling properties of parametric and nonparametric&lt;/p&gt;&lt;p&gt;models. Namely, we focus on the structure of the data to lower the complexity of a specific family of problems. The two types of structures considered in this work are distributive&lt;/p&gt;&lt;p&gt;optimization with separable constraints (Chapters 2-3), and scaling Gaussian processes for multidimensional lattice input (Chapters 4-5). By improving the scaling of these methods, we can expand their use to a wide range of applications which were previously intractable&lt;/p&gt;&lt;p&gt;open the door to new research questions.&lt;/p&gt;","abstract_has_math":false,"creators":["Gilboa, Elad"],"institution":null,"degree_name":"Doctor of Philosophy (PhD)","degree_level":"Dissertation","degree_discipline":"Electrical and Systems Engineering","degree_department":null,"school":null,"contributors":["Arye Nehorai"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2014,"date_issued":"2014-09-01T07:00:00Z","date_published":"2014-09-01T07:00:00Z","updated_at":"2026-07-24T06:13:49Z","subjects":["Estimation","Gaussian Process"],"languages":["English (en)"],"rights":[],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier.doi","label":"DOI","values":["https://doi.org/10.7936/K7DV1GXV"],"render_values":[{"text":"https://doi.org/10.7936/K7DV1GXV","href":"https://doi.org/10.7936/K7DV1GXV","code":true}]}]},"links":{"outbound_url":"https://openscholarship.wustl.edu/etd/1303","outbound_label":"Repository record","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Arye Nehorai"]},{"key":"dc:creator","label":"Author","values":["Gilboa, Elad"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.available","label":"Dc Date Available","values":["2015-04-09T07:00:00Z"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Electrical and Systems Engineering"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Dissertation"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Doctor of Philosophy (PhD)"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Estimation","Gaussian Process"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["English (en)"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["https://openscholarship.wustl.edu/etd/1303"]},{"key":"dc:identifier.doi","label":"DOI","values":["https://doi.org/10.7936/K7DV1GXV"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["<p>\"In information technology, big data is a collection of data sets so large and complex that it becomes difficult to process using traditional data processing applications\" [151]. In a</p><p>world of increasing sensor modalities, cheaper storage, and more data oriented questions, we are quickly passing the limits of tractable computations using traditional statistical analysis</p><p>methods. Methods which often show great results on simple data have difficulties processing complicated multidimensional data. Accuracy alone can no longer justify unwarranted memory</p><p>use and computational complexity. Improving the scaling properties of these methods for multidimensional data is the only way to make these methods relevant. In this work we explore methods for improving the scaling properties of parametric and nonparametric</p><p>models. Namely, we focus on the structure of the data to lower the complexity of a specific family of problems. The two types of structures considered in this work are distributive</p><p>optimization with separable constraints (Chapters 2-3), and scaling Gaussian processes for multidimensional lattice input (Chapters 4-5). By improving the scaling of these methods, we can expand their use to a wide range of applications which were previously intractable</p><p>open the door to new research questions.</p>"]},{"key":"dc:title","label":"Title","values":["Scaling Multidimensional Inference for Big Structured Data"]}]}],"canonical_facts":{"dc:contributor":["Arye Nehorai"],"dc:creator":["Gilboa, Elad"],"dc:date.available":["2015-04-09T07:00:00Z"],"dc:description.abstract":["<p>\"In information technology, big data is a collection of data sets so large and complex that it becomes difficult to process using traditional data processing applications\" [151]. In a</p><p>world of increasing sensor modalities, cheaper storage, and more data oriented questions, we are quickly passing the limits of tractable computations using traditional statistical analysis</p><p>methods. Methods which often show great results on simple data have difficulties processing complicated multidimensional data. Accuracy alone can no longer justify unwarranted memory</p><p>use and computational complexity. Improving the scaling properties of these methods for multidimensional data is the only way to make these methods relevant. In this work we explore methods for improving the scaling properties of parametric and nonparametric</p><p>models. Namely, we focus on the structure of the data to lower the complexity of a specific family of problems. The two types of structures considered in this work are distributive</p><p>optimization with separable constraints (Chapters 2-3), and scaling Gaussian processes for multidimensional lattice input (Chapters 4-5). By improving the scaling of these methods, we can expand their use to a wide range of applications which were previously intractable</p><p>open the door to new research questions.</p>"],"dc:identifier":["https://openscholarship.wustl.edu/etd/1303"],"dc:identifier.doi":["https://doi.org/10.7936/K7DV1GXV"],"dc:language":["English (en)"],"dc:subject":["Estimation","Gaussian Process"],"dc:title":["Scaling Multidimensional Inference for Big Structured Data"],"thesis:degree_discipline":["Electrical and Systems Engineering"],"thesis:degree_level":["Dissertation"],"thesis:degree_name":["Doctor of Philosophy (PhD)"]},"updated_at":"2026-07-24T06:13:49Z"}