{"id":{"repo_id":"mit","oai_identifier":"oai:dspace.mit.edu:1721.1/153861"},"canonical_url":"https://search.dev.ndltd.org/etd/mit/oai:dspace.mit.edu:1721.1/153861","repository":{"repo_id":"mit","name":"MIT","base_url":"https://dspace.mit.edu/oai/request"},"display":{"title":"Simulating Dynamical Systems from Data","abstract":"The ever-increasing availability of data from dynamical systems offers an opportunity for automated data-driven decision-making in various domains. However, a significant barrier to realizing this potential is the issues inherent to these datasets: high-dimensionality, noise, sparsity, and confounding. In this thesis, we propose methods to exploit the richness in the structure of such datasets to overcome the above-mentioned problems while undertaking various inference tasks. Central to these methods is a key factorization characterizing the function governing the dynamics. Specifically, we harness trajectories from different, yet related, dynamical systems. We posit that the function governing the dynamics of each individual system can be factorized into a linear combination of latent separable functions of the state and action. Crucially, these latent functions are shared across the different dynamical systems. This principled factorization structure provides guidance on how to devise theoretically sound methods that perform well empirically across a variety of tasks. These tasks include time series imputation and forecasting, change point detection, reinforcement learning, and trace-driven simulation in networked systems. Exploiting the principled factorization structure has paved the way for the contributions we make in different tasks. First, we propose and analyze algorithms for mean and variance estimation and forecasting of time series with varying noise models, data missingness patterns, and assumptions on the factorization structure. These algorithms employ variants of the classical multivariate singular spectrum analysis (mSSA) algorithm and establish a link between time series analysis and Matrix/Tensor Completion. Second, we develop and analyze an algorithm for change point detection inspired by the factorization structure and based on the cumulative sum (CUSUM) statistic. This work extends the analysis of CUSUM statistics traditionally done for the setting of independent observations. Finally, we explore the potential gains of considering the factorization structure in simulating Markov Decision Processes (MDPs). We then build upon this approach to accommodate MDPs with time varying parameters with the specific application of trace-driven simulation in networked systems.","abstract_html":"The ever-increasing availability of data from dynamical systems offers an opportunity for automated data-driven decision-making in various domains. However, a significant barrier to realizing this potential is the issues inherent to these datasets: high-dimensionality, noise, sparsity, and confounding. In this thesis, we propose methods to exploit the richness in the structure of such datasets to overcome the above-mentioned problems while undertaking various inference tasks. Central to these methods is a key factorization characterizing the function governing the dynamics. Specifically, we harness trajectories from different, yet related, dynamical systems. We posit that the function governing the dynamics of each individual system can be factorized into a linear combination of latent separable functions of the state and action. Crucially, these latent functions are shared across the different dynamical systems. This principled factorization structure provides guidance on how to devise theoretically sound methods that perform well empirically across a variety of tasks. These tasks include time series imputation and forecasting, change point detection, reinforcement learning, and trace-driven simulation in networked systems. Exploiting the principled factorization structure has paved the way for the contributions we make in different tasks. First, we propose and analyze algorithms for mean and variance estimation and forecasting of time series with varying noise models, data missingness patterns, and assumptions on the factorization structure. These algorithms employ variants of the classical multivariate singular spectrum analysis (mSSA) algorithm and establish a link between time series analysis and Matrix/Tensor Completion. Second, we develop and analyze an algorithm for change point detection inspired by the factorization structure and based on the cumulative sum (CUSUM) statistic. This work extends the analysis of CUSUM statistics traditionally done for the setting of independent observations. Finally, we explore the potential gains of considering the factorization structure in simulating Markov Decision Processes (MDPs). We then build upon this approach to accommodate MDPs with time varying parameters with the specific application of trace-driven simulation in networked systems.","abstract_has_math":false,"creators":["Alomar, Abdullah"],"institution":"Massachusetts Institute of Technology","degree_name":"Doctoral","degree_level":null,"degree_discipline":null,"degree_department":"Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science","school":null,"contributors":[],"advisors":["Shah, Devavrat"],"committee_chairs":[],"committee_members":[],"year":2024,"date_issued":"2024-02","date_published":"2024-02","updated_at":"2026-07-22T22:20:47Z","subjects":[],"languages":[],"rights":["In Copyright - Educational Use Permitted","Copyright retained by author(s)"],"rights_urls":["https://rightsstatements.org/page/InC-EDU/1.0/"],"identifier_entries":[]},"links":{"outbound_url":"https://hdl.handle.net/1721.1/153861","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["Shah, Devavrat"]},{"key":"dc:contributor.department","label":"Department","values":["Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science"]},{"key":"dc:creator","label":"Author","values":["Alomar, Abdullah"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2024-03-21T19:11:19Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2024-03-21T19:11:19Z"]},{"key":"dc:date.issued","label":"Date","values":["2024-02"]},{"key":"dc:publisher","label":"Institution","values":["Massachusetts Institute of Technology"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Doctoral","Doctor of Philosophy"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:rights","label":"Dc Rights","values":["In Copyright - Educational Use Permitted","Copyright retained by author(s)"]},{"key":"dc:rights.uri","label":"Rights URI","values":["https://rightsstatements.org/page/InC-EDU/1.0/"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["https://hdl.handle.net/1721.1/153861"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["The ever-increasing availability of data from dynamical systems offers an opportunity for automated data-driven decision-making in various domains. However, a significant barrier to realizing this potential is the issues inherent to these datasets: high-dimensionality, noise, sparsity, and confounding. In this thesis, we propose methods to exploit the richness in the structure of such datasets to overcome the above-mentioned problems while undertaking various inference tasks. Central to these methods is a key factorization characterizing the function governing the dynamics. Specifically, we harness trajectories from different, yet related, dynamical systems. We posit that the function governing the dynamics of each individual system can be factorized into a linear combination of latent separable functions of the state and action. Crucially, these latent functions are shared across the different dynamical systems. This principled factorization structure provides guidance on how to devise theoretically sound methods that perform well empirically across a variety of tasks. These tasks include time series imputation and forecasting, change point detection, reinforcement learning, and trace-driven simulation in networked systems. Exploiting the principled factorization structure has paved the way for the contributions we make in different tasks. First, we propose and analyze algorithms for mean and variance estimation and forecasting of time series with varying noise models, data missingness patterns, and assumptions on the factorization structure. These algorithms employ variants of the classical multivariate singular spectrum analysis (mSSA) algorithm and establish a link between time series analysis and Matrix/Tensor Completion. Second, we develop and analyze an algorithm for change point detection inspired by the factorization structure and based on the cumulative sum (CUSUM) statistic. This work extends the analysis of CUSUM statistics traditionally done for the setting of independent observations. Finally, we explore the potential gains of considering the factorization structure in simulating Markov Decision Processes (MDPs). We then build upon this approach to accommodate MDPs with time varying parameters with the specific application of trace-driven simulation in networked systems."]},{"key":"dc:description.degree","label":"Dc Description Degree","values":["Ph.D."]},{"key":"dc:title","label":"Title","values":["Simulating Dynamical Systems from Data"]}]}],"canonical_facts":{"dc:contributor.advisor":["Shah, Devavrat"],"dc:contributor.department":["Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science"],"dc:creator":["Alomar, Abdullah"],"dc:date.accessioned":["2024-03-21T19:11:19Z"],"dc:date.available":["2024-03-21T19:11:19Z"],"dc:date.issued":["2024-02"],"dc:description.abstract":["The ever-increasing availability of data from dynamical systems offers an opportunity for automated data-driven decision-making in various domains. However, a significant barrier to realizing this potential is the issues inherent to these datasets: high-dimensionality, noise, sparsity, and confounding. In this thesis, we propose methods to exploit the richness in the structure of such datasets to overcome the above-mentioned problems while undertaking various inference tasks. Central to these methods is a key factorization characterizing the function governing the dynamics. Specifically, we harness trajectories from different, yet related, dynamical systems. We posit that the function governing the dynamics of each individual system can be factorized into a linear combination of latent separable functions of the state and action. Crucially, these latent functions are shared across the different dynamical systems. This principled factorization structure provides guidance on how to devise theoretically sound methods that perform well empirically across a variety of tasks. These tasks include time series imputation and forecasting, change point detection, reinforcement learning, and trace-driven simulation in networked systems. Exploiting the principled factorization structure has paved the way for the contributions we make in different tasks. First, we propose and analyze algorithms for mean and variance estimation and forecasting of time series with varying noise models, data missingness patterns, and assumptions on the factorization structure. These algorithms employ variants of the classical multivariate singular spectrum analysis (mSSA) algorithm and establish a link between time series analysis and Matrix/Tensor Completion. Second, we develop and analyze an algorithm for change point detection inspired by the factorization structure and based on the cumulative sum (CUSUM) statistic. This work extends the analysis of CUSUM statistics traditionally done for the setting of independent observations. Finally, we explore the potential gains of considering the factorization structure in simulating Markov Decision Processes (MDPs). We then build upon this approach to accommodate MDPs with time varying parameters with the specific application of trace-driven simulation in networked systems."],"dc:description.degree":["Ph.D."],"dc:identifier.uri":["https://hdl.handle.net/1721.1/153861"],"dc:publisher":["Massachusetts Institute of Technology"],"dc:rights":["In Copyright - Educational Use Permitted","Copyright retained by author(s)"],"dc:rights.uri":["https://rightsstatements.org/page/InC-EDU/1.0/"],"dc:title":["Simulating Dynamical Systems from Data"],"dc:type":["Thesis"],"thesis:degree_name":["Doctoral","Doctor of Philosophy"]},"updated_at":"2026-07-22T22:20:47Z"}