Asmaa Eldesoukey
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Asmaa Eldesoukey has a total of 9 co-authors. Here are the top co-authors by number of shared publications:
- Tryphon T. Georgiou
Department of Mechanical and Aerospace Engineering, University of California, Irvine, Irvine, CA, USA
5 shared publications - Mahmoud Abdelgalil
University at Buffalo, State University of New York
3 shared publications - Olga Movilla Miangolarra
Universidad de La Laguna
3 shared publications - Abhishek Halder
Iowa State University
1 shared publication - Ander Movilla Miangolarra
John Innes Centre
1 shared publication Haitham E. Taha
University of California Irvine
1 shared publication
Latest Publications
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Control Systems Letters
- Vol. 10, 1
On the Isospectral Nature of Minimum-Shear Covariance Control
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Control Systems Letters
- Vol. 10, 1
On the Isospectral Nature of Minimum-Shear Covariance Control
- 16 May 2025
- Published by AIP Publishing in The Journal of Chemical Physics
- Vol. 162 (19)
Maximum entropy inference of reaction–diffusion models
Reaction–diffusion equations are commonly used to model a diverse array of complex systems, including biological, chemical, and physical processes. Typically, these models are phenomenological, requiring the fitting of parameters to experimental data. In the present work, we introduce a novel formalism to construct reaction–diffusion models that is grounded in the principle of maximum entropy. This new formalism aims to incorporate various types of experimental data, including ensemble currents, distributions at different points in time, or moments of such. To this end, we expand the framework of Schrödinger bridges and maximum caliber problems to nonlinear interacting systems. We illustrate the usefulness of the proposed approach by modeling the evolution of (i) a morphogen across the fin of a zebrafish and (ii) the population of two varieties of toads in Poland, so as to match the experimental data.
- 16 May 2025
- Published by AIP Publishing in The Journal of Chemical Physics
- Vol. 162 (19)
Maximum entropy inference of reaction–diffusion models
Reaction–diffusion equations are commonly used to model a diverse array of complex systems, including biological, chemical, and physical processes. Typically, these models are phenomenological, requiring the fitting of parameters to experimental data. In the present work, we introduce a novel formalism to construct reaction–diffusion models that is grounded in the principle of maximum entropy. This new formalism aims to incorporate various types of experimental data, including ensemble currents, distributions at different points in time, or moments of such. To this end, we expand the framework of Schrödinger bridges and maximum caliber problems to nonlinear interacting systems. We illustrate the usefulness of the proposed approach by modeling the evolution of (i) a morphogen across the fin of a zebrafish and (ii) the population of two varieties of toads in Poland, so as to match the experimental data.
- 23 October 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 70 (4) , 2466-2478
Schrödinger's Control and Estimation Paradigm With Spatio-Temporal Distributions on Graphs
The problem of reconciling a prior probability law on paths with data was introduced by Schrödinger in 1931 and 1932. It represents an early formulation of a maximum likelihood problem. This specific formulation can also be seen as the control problem to modify the law of a diffusion process so as to match specifications on marginal distributions at given times. Thereby, in recent years, this so-called Schrödinger's bridge problem has been at the center of the uncertainty control development. However, an understudied facet of this program has been to address uncertainty in space (state) and time, modeling the effect of tasks being completed contingent on meeting a certain condition at some random time instead of imposing specifications at fixed times. The present work is a study to extend Schrödinger's paradigm on such an issue, and herein, it is tackled in the context of random walks on directed graphs. Specifically, we study the case where one marginal is the initial probability distribution on a Markov chain, while others are marginals of stopping (first-arrival) times at absorbing states, signifying completion of tasks. We show when the prior law on paths is Markov, a Markov policy is once again optimal to satisfy those marginal constraints with respect to a likelihood cost following Schrödinger's dictum. Based on this, we present the mathematical formulation involving a Sinkhorn-type iteration to construct the optimal probability law on paths matching the spatio-temporal marginals.
- 23 October 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 70 (4) , 2466-2478
Schrödinger's Control and Estimation Paradigm With Spatio-Temporal Distributions on Graphs
The problem of reconciling a prior probability law on paths with data was introduced by Schrödinger in 1931 and 1932. It represents an early formulation of a maximum likelihood problem. This specific formulation can also be seen as the control problem to modify the law of a diffusion process so as to match specifications on marginal distributions at given times. Thereby, in recent years, this so-called Schrödinger's bridge problem has been at the center of the uncertainty control development. However, an understudied facet of this program has been to address uncertainty in space (state) and time, modeling the effect of tasks being completed contingent on meeting a certain condition at some random time instead of imposing specifications at fixed times. The present work is a study to extend Schrödinger's paradigm on such an issue, and herein, it is tackled in the context of random walks on directed graphs. Specifically, we study the case where one marginal is the initial probability distribution on a Markov chain, while others are marginals of stopping (first-arrival) times at absorbing states, signifying completion of tasks. We show when the prior law on paths is Markov, a Markov policy is once again optimal to satisfy those marginal constraints with respect to a likelihood cost following Schrödinger's dictum. Based on this, we present the mathematical formulation involving a Sinkhorn-type iteration to construct the optimal probability law on paths matching the spatio-temporal marginals.
- Open Access
- 15 July 2024
- Published by American Physical Society (APS) in Physical Review Research
- Vol. 6 (3) , 033070
Inferring potential landscapes: A Schrödinger bridge approach to maximum caliber
Schrödinger bridges have emerged as an enabling framework for unveiling the stochastic dynamics of systems based on marginal observations at different points in time. The terminology “bridge” refers to a probability law that suitably interpolates such marginals. The theory plays a pivotal role in a variety of contemporary developments in machine learning, stochastic control, thermodynamics, and biology, to name a few, impacting disciplines such as single-cell genomics, meteorology, and robotics. In this work, we extend Schrödinger's paradigm of bridges to account for integral constraints along paths, in a way akin to maximum caliber—a maximum entropy principle applied in a dynamic context. The maximum caliber principle has proven useful to infer the dynamics of complex systems, e.g., model gene circuits and protein folding. We unify these two problems via a maximum likelihood formulation to reconcile stochastic dynamics with ensemble-path data. A variety of data types can be encompassed, ranging from distribution moments to average currents along paths. The framework enables inference of time-varying potential landscapes that drive the process. The resulting forces can be interpreted as the optimal control that drives the system in a way that abides by specified integral constraints. This, in turn, relates to a similarly constrained optimal mass transport problem in the zero-noise limit. Analogous results are presented in a discrete-time, discrete-space setting and specialized to steady-state dynamics. We finish by illustrating the practical applicability of the framework through paradigmatic examples, such as that of bit erasure or protein folding. In doing so, we highlight the strengths of the proposed framework, namely, the generality of the theory, its elegant analytical structure, the ease of computation, and the ability to interpret results in terms of system dynamics. This is in contrast to maximum caliber problems where the focus is typically on updating a probability law on paths. Published by the American Physical Society 2024
- 15 July 2024
- Published by American Physical Society (APS) in Physical Review Research
- Vol. 6 (3) , 033070
Open AccessInferring potential landscapes: A Schrödinger bridge approach to maximum caliber
Schrödinger bridges have emerged as an enabling framework for unveiling the stochastic dynamics of systems based on marginal observations at different points in time. The terminology “bridge” refers to a probability law that suitably interpolates such marginals. The theory plays a pivotal role in a variety of contemporary developments in machine learning, stochastic control, thermodynamics, and biology, to name a few, impacting disciplines such as single-cell genomics, meteorology, and robotics. In this work, we extend Schrödinger's paradigm of bridges to account for integral constraints along paths, in a way akin to maximum caliber—a maximum entropy principle applied in a dynamic context. The maximum caliber principle has proven useful to infer the dynamics of complex systems, e.g., model gene circuits and protein folding. We unify these two problems via a maximum likelihood formulation to reconcile stochastic dynamics with ensemble-path data. A variety of data types can be encompassed, ranging from distribution moments to average currents along paths. The framework enables inference of time-varying potential landscapes that drive the process. The resulting forces can be interpreted as the optimal control that drives the system in a way that abides by specified integral constraints. This, in turn, relates to a similarly constrained optimal mass transport problem in the zero-noise limit. Analogous results are presented in a discrete-time, discrete-space setting and specialized to steady-state dynamics. We finish by illustrating the practical applicability of the framework through paradigmatic examples, such as that of bit erasure or protein folding. In doing so, we highlight the strengths of the proposed framework, namely, the generality of the theory, its elegant analytical structure, the ease of computation, and the ability to interpret results in terms of system dynamics. This is in contrast to maximum caliber problems where the focus is typically on updating a probability law on paths. Published by the American Physical Society 2024
- 3 June 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Control Systems Letters
- Vol. 8, 1138-1143
An Excursion Onto Schrödinger’s Bridges: Stochastic Flows With Spatio-Temporal Marginals
In a gedanken experiment, in 1931/32, Erwin Schrödinger sought to understand how unlikely events can be reconciled with prior laws dictated by the underlying physics. In the process, he posed and solved a celebrated problem that is now named after him – the Schrödinger’s bridge problem (SBP). In this, one seeks to find the “most likely” paths, out of all incompatible paths with the prior, that stochastic particles took while transitioning. The SBP proved to have yet another interpretation, that of the stochastic optimal control problem to steer diffusive particles so as to match specified marginals – soft probabilistic constraints. Interestingly, the SBP is convex and can be solved by an efficient iterative algorithm known as the Fortet-Sinkhorn algorithm. The dual interpretation of the SBP, as an estimation and a control problem, as well as its computational tractability, are at the heart of an ever-expanding range of applications. The purpose of the present work is to expand substantially the type of control and estimation problems that can be addressed following Schrödinger’s dictum, by incorporating termination (killing) of stochastic flows. Specifically, in the context of estimation, we seek the most likely evolution realizing measured spatio-temporal marginals of killed particles. In the context of control, we seek a suitable control action directing the killed process toward spatio-temporal probabilistic constraints. To this end, we derive a new Schrödinger system of coupled, in space and time, partial differential equations to construct the solution of the proposed problem. Further, we show that a Fortet-Sinkhorn type of algorithm is, once again, available to attain the associated bridge. A key feature of our framework is that the obtained bridge retains the Markovian structure in the prior process, and thereby, the corresponding controller takes the form of state feedback.
- 3 June 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Control Systems Letters
- Vol. 8, 1138-1143
An Excursion Onto Schrödinger’s Bridges: Stochastic Flows With Spatio-Temporal Marginals
In a gedanken experiment, in 1931/32, Erwin Schrödinger sought to understand how unlikely events can be reconciled with prior laws dictated by the underlying physics. In the process, he posed and solved a celebrated problem that is now named after him – the Schrödinger’s bridge problem (SBP). In this, one seeks to find the “most likely” paths, out of all incompatible paths with the prior, that stochastic particles took while transitioning. The SBP proved to have yet another interpretation, that of the stochastic optimal control problem to steer diffusive particles so as to match specified marginals – soft probabilistic constraints. Interestingly, the SBP is convex and can be solved by an efficient iterative algorithm known as the Fortet-Sinkhorn algorithm. The dual interpretation of the SBP, as an estimation and a control problem, as well as its computational tractability, are at the heart of an ever-expanding range of applications. The purpose of the present work is to expand substantially the type of control and estimation problems that can be addressed following Schrödinger’s dictum, by incorporating termination (killing) of stochastic flows. Specifically, in the context of estimation, we seek the most likely evolution realizing measured spatio-temporal marginals of killed particles. In the context of control, we seek a suitable control action directing the killed process toward spatio-temporal probabilistic constraints. To this end, we derive a new Schrödinger system of coupled, in space and time, partial differential equations to construct the solution of the proposed problem. Further, we show that a Fortet-Sinkhorn type of algorithm is, once again, available to attain the associated bridge. A key feature of our framework is that the obtained bridge retains the Markovian structure in the prior process, and thereby, the corresponding controller takes the form of state feedback.
- Open Access
Singularly Perturbed Averaging with Application to Bio-Inspired 3D Source Seeking
We analyze a class of singularly perturbed high-amplitude, high-frequency oscillatory systems that arises in extremum seeking applications. We provide explicit formulas for averaging and establish the convergence of the trajectories of this class of systems to the trajectories of a suitably averaged reduced order system by combining the higher order averaging theorem with singular perturbation techniques. Finally, we propose a novel bio-inspired 3D source seeking algorithm and establish its singular practical stability.
Open AccessSingularly Perturbed Averaging with Application to Bio-Inspired 3D Source Seeking
We analyze a class of singularly perturbed high-amplitude, high-frequency oscillatory systems that arises in extremum seeking applications. We provide explicit formulas for averaging and establish the convergence of the trajectories of this class of systems to the trajectories of a suitably averaged reduced order system by combining the higher order averaging theorem with singular perturbation techniques. Finally, we propose a novel bio-inspired 3D source seeking algorithm and establish its singular practical stability.
- 3 January 2022
- Published by American Institute of Aeronautics and Astronautics (AIAA)
Observations On the Use of Gap Metric in Model Reduction
View Video Presentation: https://doi.org/10.2514/6.2022-1593.vid We review the use of the gap metric to synthesize a reduced-order plant whose closed-loop behavior is similar to that of an original (typically higher-order) plant. That is, our aim is to look into the use of the gap metric as a cost function for optimal estimation of a reduced model parameters such that a control law, designed based on the reduced-order model, would result in a satisfactory closed-loop response of the original. To this end, the minimization of the gap metric is reviewed with different cases of LTI and nonlinear systems. Moreover, the use of the data-driven gap distance as a cost function is examined; by employing the data-driven gap metric, we explore the possibility of obtaining a reduced-order model only from a single input-output trajectory of the original plant. Constructive examples are given with following practical observations on the validity and effectiveness of each model reduction method.
- 3 January 2022
- Published by American Institute of Aeronautics and Astronautics (AIAA)
Observations On the Use of Gap Metric in Model Reduction
View Video Presentation: https://doi.org/10.2514/6.2022-1593.vid We review the use of the gap metric to synthesize a reduced-order plant whose closed-loop behavior is similar to that of an original (typically higher-order) plant. That is, our aim is to look into the use of the gap metric as a cost function for optimal estimation of a reduced model parameters such that a control law, designed based on the reduced-order model, would result in a satisfactory closed-loop response of the original. To this end, the minimization of the gap metric is reviewed with different cases of LTI and nonlinear systems. Moreover, the use of the data-driven gap distance as a cost function is examined; by employing the data-driven gap metric, we explore the possibility of obtaining a reduced-order model only from a single input-output trajectory of the original plant. Constructive examples are given with following practical observations on the validity and effectiveness of each model reduction method.