DISCRETE STATE SYSTEM IDENTIFICATION: EXAMPLES AND BOUNDS
We consider data-driven methods for modeling discrete-valued dynamical systems evolving over networks. The spread of viruses and diseases, the propagation of ideas and misinformation, the fluctuation of stock prices, and correlations of financial risk between banking and economic institutions are all examples of such systems. In many of these systems, data may be widely available, but approaches to identify relevant mathematical models, including the underlying network topology, are not widely established or agreed upon. Classic system identification methods focus on identifying continuous-valued dynamical systems from data, where the main analysis of such approaches largely focuses on asymptotic properties, i.e., consistency. More recent identification approaches have focused on sample complexity, i.e., how much data is needed to achieve an acceptable model approximation. In this talk, we will discuss the problem of identifying a mathematical model from data for a discrete-valued, discrete-time dynamical system evolving over a network. Specifically, under maximum likelihood estimation approaches, we will demonstrate guaranteed consistency conditions and sample complexity bounds. Applications to the aforementioned examples will be further discussed as time allows.
Date and Time
Location
Hosts
Registration
- Date: 05 Jun 2025
- Time: 11:00 PM UTC to 12:00 AM UTC
-
Add Event to Calendar
Speakers
Dr. Beck
DISCRETE STATE SYSTEM IDENTIFICATION: EXAMPLES AND BOUNDS
We consider data-driven methods for modeling discrete-valued dynamical systems evolving over networks. The spread of viruses and diseases, the propagation of ideas and misinformation, the fluctuation of stock prices, and correlations of financial risk between banking and economic institutions are all examples of such systems. In many of these systems, data may be widely available, but approaches to identify relevant mathematical models, including the underlying network topology, are not widely established or agreed upon. Classic system identification methods focus on identifying continuous-valued dynamical systems from data, where the main analysis of such approaches largely focuses on asymptotic properties, i.e., consistency. More recent identification approaches have focused on sample complexity, i.e., how much data is needed to achieve an acceptable model approximation. In this talk, we will discuss the problem of identifying a mathematical model from data for a discrete-valued, discrete-time dynamical system evolving over a network. Specifically, under maximum likelihood estimation approaches, we will demonstrate guaranteed consistency conditions and sample complexity bounds. Applications to the aforementioned examples will be further discussed as time allows.
Biography:
Carolyn received her PhD from Caltech, her MS from Carnegie Mellon, and her BS from California State Polytechnic University, all in Electrical Engineering. Prior to her PhD studies, she worked as a Research and Development Engineer for Hewlett-Packard in Silicon Valley. She is currently a Professor at the University of Illinois at Urbana-Champaign in Industrial and Systems Engineering, and has held visiting positions at KTH (Stockholm, Sweden), Stanford University and Lund University (Sweden). She has served as an Associate Editor for the IEEE Transactions on Control of Network Systems and the IEEE Transactions on Automatic Control, on the IEEE Board of Governors for the Control Systems Society (CSS), on the Executive Committee for CSS, and is currently the President of CSS and the General Chair for the 2025 ACC. Carolyn is an IEEE Fellow, and was the recipient of a NSF CAREER Award, an ONR Young Investigator Award, and local teaching honors. Her research interests lie in the development of model approximation methods, network inference and aggregation, and distributed optimization and control, with applications to epidemic processes and energy networks.
Email:
Address:THE GRAINGER COLLEGE OF ENGINEERING, INDUSTRIAL & ENTERPRISE SYSTEMS ENGINEERING, UNIVERSITY OF ILLINOIS URBANA-CHAMPAIGN, Urbana, Illinois, United States, 61801