Alexey Ovchinnikov
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Alexey Ovchinnikov has a total of 68 co-authors. Here are the top co-authors by number of shared publications:
- Gleb Pogudin
LIX, CNRS, École Polytechnique, Institute Polytechnique de Paris
15 shared publications - Thomas Scanlon
University of California, Berkeley, USA
7 shared publications - Andrei Minchenko
Faculty of Mathematics, University of Vienna, Oskar-Morgenstern-Platz 1, 1019 Wein, Vienna, Austria
6 shared publications - Hoon Hong
Department of Mathematics, North Carolina State University, Raleigh, USA
5 shared publications - Chee Yap
New York University
4 shared publications Gleb Pogudin
3 shared publications
Latest Publications
- 3 September 2025
- Published by Elsevier in Systems & Control Letters
- Vol. 204
Identifiable specializations for ODE models
- 3 September 2025
- Published by Elsevier in Systems & Control Letters
- Vol. 204
Identifiable specializations for ODE models
- Open Access
- 2 September 2025
- Published by American Physical Society (APS) in Physical Review Research
- Vol. 7 (3)
Photonic interlacing architectures for learning discrete linear unitaries
Recent investigations suggest that the discrete linear unitary group U ( N ) can be represented by interlacing a finite sequence of diagonal phase operations with an intervening unitary operator. However, despite rigorous numerical justifications, no formal proof has been provided. Here, we show that elements of U ( N ) can be decomposed into a sequence of N -parameter phases alternating with one-parameter propagators of a lattice Hamiltonian. The proof is based on building a Lie group by alternating these two operators and showing its completeness to represent U ( N ) for a finite number of layers. This is numerically verified by using Haar random matrices as targets, showing a convergence for exactly N layers. As a specific application, we propose an integrated all-optical logic gate device that performs OR, NAND, XOR, and XAND tasks within a lossless and passive optical circuit design.
- 2 September 2025
- Published by American Physical Society (APS) in Physical Review Research
- Vol. 7 (3)
Open AccessPhotonic interlacing architectures for learning discrete linear unitaries
Recent investigations suggest that the discrete linear unitary group U ( N ) can be represented by interlacing a finite sequence of diagonal phase operations with an intervening unitary operator. However, despite rigorous numerical justifications, no formal proof has been provided. Here, we show that elements of U ( N ) can be decomposed into a sequence of N -parameter phases alternating with one-parameter propagators of a lattice Hamiltonian. The proof is based on building a Lie group by alternating these two operators and showing its completeness to represent U ( N ) for a finite number of layers. This is numerically verified by using Haar random matrices as targets, showing a convergence for exactly N layers. As a specific application, we propose an integrated all-optical logic gate device that performs OR, NAND, XOR, and XAND tasks within a lossless and passive optical circuit design.
- 28 July 2025
- Published by Elsevier in Applied Mathematics and Computation
- Vol. 509
Robust parameter estimation for rational ordinary differential equations
- 28 July 2025
- Published by Elsevier in Applied Mathematics and Computation
- Vol. 509
Robust parameter estimation for rational ordinary differential equations
- 28 April 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 70 (10) , 6688-6703
Algorithm to Find New Identifiable Reparameterizations of Parameteric Rational ODE Models
Structural identifiability concerns the question of which unknown parameters of a model can be recovered from (perfect) input–output (IO) data. If all of the parameters of a model can be recovered from data, then the model is said to be identifiable. However, in many models, there are parameters that can take on an infinite number of values but yield the same input–output data. In this case, those parameters and the model are called unidentifiable. The question is then what to do with an unidentifiable model. One can try to add more input–output data or decrease the number of unknown parameters, if experimentally feasible, or try to find a reparameterization to make the model identifiable. In this article, we take the latter approach. While existing approaches to find identifiable reparameterizations were limited to scaling reparameterizations or were not guaranteed to find a globally identifiable reparameterization even if it exists, we significantly broaden the class of models for which we can find a globally identifiable model with the same input–output behavior as the original one. We also prove that, for linear models, a globally identifiable reparameterization always exists and shows that, for a certain class of linear compartmental models, with and without inputs, an explicit reparameterization formula exists. We illustrate our method on several examples and provide detailed analysis in the Supplementary Material on github.
- 28 April 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 70 (10) , 6688-6703
Algorithm to Find New Identifiable Reparameterizations of Parameteric Rational ODE Models
Structural identifiability concerns the question of which unknown parameters of a model can be recovered from (perfect) input–output (IO) data. If all of the parameters of a model can be recovered from data, then the model is said to be identifiable. However, in many models, there are parameters that can take on an infinite number of values but yield the same input–output data. In this case, those parameters and the model are called unidentifiable. The question is then what to do with an unidentifiable model. One can try to add more input–output data or decrease the number of unknown parameters, if experimentally feasible, or try to find a reparameterization to make the model identifiable. In this article, we take the latter approach. While existing approaches to find identifiable reparameterizations were limited to scaling reparameterizations or were not guaranteed to find a globally identifiable reparameterization even if it exists, we significantly broaden the class of models for which we can find a globally identifiable model with the same input–output behavior as the original one. We also prove that, for linear models, a globally identifiable reparameterization always exists and shows that, for a certain class of linear compartmental models, with and without inputs, an explicit reparameterization formula exists. We illustrate our method on several examples and provide detailed analysis in the Supplementary Material on github.
- Open Access
Parameter Estimation in ODE Models with Certified Polynomial System Solving
We consider dynamical models given by rational ODE systems. Parameter estimation is an important and challenging task of recovering parameter values from observed data. Recently, a method based on differential algebra and rational interpolation was proposed to express parameter estimation in terms of polynomial system solving. Typically, polynomial system solving is a bottleneck, hence the choice of the polynomial solver is crucial. In this contribution, we compare two polynomial system solvers applied to parameter estimation: homotopy continuation solver from HomotopyContinuation.jl and our new implementation of a certified solver based on rational univariate representation (RUR) and real root isolation. We show how the new RUR solver can tackle examples that are out of reach for the homotopy methods and vice versa.
Open AccessParameter Estimation in ODE Models with Certified Polynomial System Solving
We consider dynamical models given by rational ODE systems. Parameter estimation is an important and challenging task of recovering parameter values from observed data. Recently, a method based on differential algebra and rational interpolation was proposed to express parameter estimation in terms of polynomial system solving. Typically, polynomial system solving is a bottleneck, hence the choice of the polynomial solver is crucial. In this contribution, we compare two polynomial system solvers applied to parameter estimation: homotopy continuation solver from HomotopyContinuation.jl and our new implementation of a certified solver based on rational univariate representation (RUR) and real root isolation. We show how the new RUR solver can tackle examples that are out of reach for the homotopy methods and vice versa.
- Open Access
- 30 January 2025
- Published by IOP Publishing in Nonlinearity
- Vol. 38 (2) , 025022
Algebraic identifiability of partial differential equation models
Differential equation models are crucial to scientific processes across many disciplines, and the values of model parameters are important for analyzing the behaviour of solutions. Identifying these values is known as a parameter estimation, a type of inverse problem, which has applications in areas that include industry, finance and biomedicine. A parameter is called globally identifiable if its value can be uniquely determined from the input and output functions. Checking the global identifiability of model parameters is a useful tool when exploring the well-posedness of a given model. This problem has been intensively studied for ordinary differential equation models, where theory, several efficient algorithms and software packages have been developed. A comprehensive theory for PDEs has hitherto not been developed due to the complexity of initial and boundary conditions. Here, we provide theory and algorithms, based on differential algebra, for testing identifiability of polynomial PDE models. We showcase this approach on PDE models arising in the sciences.
- 30 January 2025
- Published by IOP Publishing in Nonlinearity
- Vol. 38 (2) , 025022
Open AccessAlgebraic identifiability of partial differential equation models
Differential equation models are crucial to scientific processes across many disciplines, and the values of model parameters are important for analyzing the behaviour of solutions. Identifying these values is known as a parameter estimation, a type of inverse problem, which has applications in areas that include industry, finance and biomedicine. A parameter is called globally identifiable if its value can be uniquely determined from the input and output functions. Checking the global identifiability of model parameters is a useful tool when exploring the well-posedness of a given model. This problem has been intensively studied for ordinary differential equation models, where theory, several efficient algorithms and software packages have been developed. A comprehensive theory for PDEs has hitherto not been developed due to the complexity of initial and boundary conditions. Here, we provide theory and algorithms, based on differential algebra, for testing identifiability of polynomial PDE models. We showcase this approach on PDE models arising in the sciences.
- Open Access
- 16 July 2024
- Published by Association for Computing Machinery (ACM)
- p. 234-243
Faster Groebner bases for Lie derivatives of ODE systems via monomial orderings
Symbolic computation for systems of differential equations is often computationally expensive. Many practical differential models have a form of polynomial or rational ODE system with specified outputs. A basic symbolic approach to analyze these models is to compute and then symbolically process the polynomial system obtained by sufficiently many Lie derivatives of the output functions with respect to the vector field given by the ODE system. In this paper, we present a method for speeding up Gröbner basis computation for such a class of polynomial systems by using specific monomial ordering, including weights for the variables, coming from the structure of the ODE model. We provide empirical results that show improvement across different symbolic computing frameworks and apply the method to speed up structural identifiability analysis of ODE models.
- 16 July 2024
- Published by Association for Computing Machinery (ACM)
- p. 234-243
Open AccessFaster Groebner bases for Lie derivatives of ODE systems via monomial orderings
Symbolic computation for systems of differential equations is often computationally expensive. Many practical differential models have a form of polynomial or rational ODE system with specified outputs. A basic symbolic approach to analyze these models is to compute and then symbolically process the polynomial system obtained by sufficiently many Lie derivatives of the output functions with respect to the vector field given by the ODE system. In this paper, we present a method for speeding up Gröbner basis computation for such a class of polynomial systems by using specific monomial ordering, including weights for the variables, coming from the structure of the ODE model. We provide empirical results that show improvement across different symbolic computing frameworks and apply the method to speed up structural identifiability analysis of ODE models.
- Open Access
Algebraic identifiability of partial differential equation models
Differential equation models are crucial to scientific processes. The values of model parameters are important for analyzing the behaviour of solutions. A parameter is called globally identifiable if its value can be uniquely determined from the input and output functions. To determine if a parameter estimation problem is well-posed for a given model, one must check if the model parameters are globally identifiable. This problem has been intensively studied for ordinary differential equation models, with theory and several efficient algorithms and software packages developed. A comprehensive theory of algebraic identifiability for PDEs has hitherto not been developed due to the complexity of initial and boundary conditions. Here, we provide theory and algorithms, based on differential algebra, for testing identifiability of polynomial PDE models. We showcase this approach on PDE models arising in the sciences.
Open AccessAlgebraic identifiability of partial differential equation models
Differential equation models are crucial to scientific processes. The values of model parameters are important for analyzing the behaviour of solutions. A parameter is called globally identifiable if its value can be uniquely determined from the input and output functions. To determine if a parameter estimation problem is well-posed for a given model, one must check if the model parameters are globally identifiable. This problem has been intensively studied for ordinary differential equation models, with theory and several efficient algorithms and software packages developed. A comprehensive theory of algebraic identifiability for PDEs has hitherto not been developed due to the complexity of initial and boundary conditions. Here, we provide theory and algorithms, based on differential algebra, for testing identifiability of polynomial PDE models. We showcase this approach on PDE models arising in the sciences.
- Open Access
Robust Parameter Estimation for Rational Ordinary Differential Equations
We present a new approach for estimating parameters in rational ODE models from given (measured) time series data. In typical existing approaches, an initial guess for the parameter values is made from a given search interval. Then, in a loop, the corresponding outputs are computed by solving the ODE numerically, followed by computing the error from the given time series data. If the error is small, the loop terminates and the parameter values are returned. Otherwise, heuristics/theories are used to possibly improve the guess and continue the loop. These approaches tend to be non-robust in the sense that their accuracy depend on the search interval and the true parameter values; furthermore, they cannot handle the case where the parameters are locally identifiable. In this paper, we propose a new approach, which does not suffer from the above non-robustness. In particular, it does not require making good initial guesses for the parameter values or specifying search intervals. Instead, it uses differential algebra, interpolation of the data using rational functions, and multivariate polynomial system solving. We also compare the performance of the resulting software with several other estimation software packages.
Open AccessRobust Parameter Estimation for Rational Ordinary Differential Equations
We present a new approach for estimating parameters in rational ODE models from given (measured) time series data. In typical existing approaches, an initial guess for the parameter values is made from a given search interval. Then, in a loop, the corresponding outputs are computed by solving the ODE numerically, followed by computing the error from the given time series data. If the error is small, the loop terminates and the parameter values are returned. Otherwise, heuristics/theories are used to possibly improve the guess and continue the loop. These approaches tend to be non-robust in the sense that their accuracy depend on the search interval and the true parameter values; furthermore, they cannot handle the case where the parameters are locally identifiable. In this paper, we propose a new approach, which does not suffer from the above non-robustness. In particular, it does not require making good initial guesses for the parameter values or specifying search intervals. Instead, it uses differential algebra, interpolation of the data using rational functions, and multivariate polynomial system solving. We also compare the performance of the resulting software with several other estimation software packages.
- 22 September 2023
- Published by Wiley in Communications on Pure and Applied Mathematics
- Vol. 77 (3) , 2177-2179
Erratum for “Global Identifiability of Differential Models”
- 22 September 2023
- Published by Wiley in Communications on Pure and Applied Mathematics
- Vol. 77 (3) , 2177-2179
Erratum for “Global Identifiability of Differential Models”