arXiv subjects

Ilia Ilmer

Publications and source records attributed to Ilia Ilmer.

7 recordsLinked to original sources

arXiv2024

Faster Gröbner 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.

cs.SC↗

arXiv2023

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.

cs.MS↗

arXiv2023

BASS: Boolean Automorphisms Signature Scheme

We offer a digital signature scheme using Boolean automorphisms of a multivariate polynomial algebra over integers. Verification part of this scheme is based on the approximation of the number of zeros of a multivariate Boolean function.

cs.CR↗

arXiv2022

Lightweight Projective Derivative Codes for Compressed Asynchronous Gradient Descent

Coded distributed computation has become common practice for performing gradient descent on large datasets to mitigate stragglers and other faults. This paper proposes a novel algorithm that encodes the partial derivatives themselves and furthermore optimizes the codes by performing lossy compression on the derivative codewords by maximizing the information contained in the codewords while minimizing the information between the codewords. The utility of this application of coding theory is a geometrical consequence of the observed fact in optimization research that noise is tolerable, sometimes even helpful, in gradient descent based learning algorithms since it helps avoid overfitting and local minima. This stands in contrast with much current conventional work on distributed coded computation which focuses on recovering all of the data from the workers. A second further contribution is that the low-weight nature of the coding scheme allows for asynchronous gradient updates since the code can be iteratively decoded; i.e., a worker's task can immediately be updated into the larger gradient. The directional derivative is always a linear function of the direction vectors; thus, our framework is robust since it can apply linear coding techniques to general machine learning frameworks such as deep neural networks.

cs.LG↗

arXiv2022

More Efficient Identifiability Verification in ODE Models by Reducing Non-Identifiability

Structural global parameter identifiability indicates whether one can determine a parameter's value from given inputs and outputs in the absence of noise. If a given model has parameters for which there may be infinitely many values, such parameters are called non-identifiable. We present a procedure for accelerating a global identifiability query by eliminating algebraically independent non-identifiable parameters. Our proposed approach significantly improves performance across different computer algebra frameworks.

cs.SC↗

arXiv2021

Web-based Structural Identifiability Analyzer

Parameter identifiability describes whether, for a given differential model, one can determine parameter values from model equations. Knowing global or local identifiability properties allows construction of better practical experiments to identify parameters from experimental data. In this work, we present a web-based software tool that allows to answer specific identifiability queries. Concretely, our toolbox can determine identifiability of individual parameters of the model and also provide all functions of parameters that are identifiable (also called identifiable combinations) from single or multiple experiments. The program is freely available at https://maple.cloud/app/6509768948056064.

cs.MS↗

arXiv2019

On the interplay of harvesting and various diffusion strategies for spatially heterogeneous populations

The paper explores the influence of harvesting (or culling) on the outcome of the competition of two species in a spatially heterogeneous environment. The harvesting effort is assumed to be proportional to the space-dependent intrinsic growth rate. The differences between the two populations are the diffusion strategy and the harvesting intensity. In the absence of harvesting, competing populations may either coexist, or one of them may bring the other to extinction. If the latter is the case, introduction of any level of harvesting to the successful species guarantees survival to its non-harvested competitor. In the former case, there is a strip of "close enough" to each other harvesting rates leading to preservation of the original coexistence. Some estimates are obtained for the relation of the harvesting levels providing either coexistence or competitive exclusion.

math.DS↗