Search

The Lotka-Volterra model reflects real ecological interactions where species compete for limited resources, potentially leading to coexistence, dominance of one species, or extinction of another. Comprehending the mechanisms governing these systems can yield critical insights for developing strategies in ecological management and biodiversity conservation. In this work, we investigate the controllability of a Lotka-Volterra system modeling weak competition between two species. Through constrained controls acting on the boundary of the domain, we establish conditions under which the system can be steered towards various target states. More precisely, we show that the system is controllable in finite time towards a state of coexistence whenever it exists, and asymptotically controllable towards single-species states or total extinction, depending on domain size, diffusion, and competition rates. Additionally, we determine scenarios where controllability is not possible and, in these cases, we construct barrier solutions that prevent the system from reaching specific targets. Our results offer critical insights into how competition, diffusion, and spatial domain influence species dynamics under constrained controls. Several numerical experiments complement our analysis, confirming the theoretical findings.

We demonstrate that a ReLU deep neural network with a width of $2$ and a depth of $2N+4M-1$ layers can achieve finite sample memorization for any dataset comprising $N$ elements in $\mathbb{R}^d$, where $d\ge1,$ and $M$ classes, thereby ensuring accurate classification. By modeling the neural network as a time-discrete nonlinear dynamical system, we interpret the memorization property as a problem of simultaneous or ensemble controllability. This problem is addressed by constructing the network parameters inductively and explicitly, bypassing the need for training or solving any optimization problem. Additionally, we establish that such a network can achieve universal approximation in $L^p(\Omega;\mathbb{R}_+)$, where $\Omega$ is a bounded subset of $\mathbb{R}^d$ and $p\in[1,\infty)$, using a ReLU deep neural network with a width of $d+1$. We also provide depth estimates for approximating $W^{1,p}$ functions and width estimates for approximating $L^p(\Omega;\mathbb{R}^m)$ for $m\geq1$. Our proofs are constructive, offering explicit values for the biases and weights involved.

We introduce and analyze the concept of tracking controllability, where the objective is for the state of a control system, or some projection thereof, to follow a given trajectory within a specified time horizon. By leveraging duality, we characterize tracking controllability through a non-standard observability inequality for the adjoint system. This characterization facilitates the development of a systematic approach for constructing controls with minimal norm. However, achieving such an observability property is challenging. To address this, we utilize the classical Brunovsk\'y canonical form for control systems, specifically focusing on the case of scalar controls. Our findings reveal that tracking control inherently involves a loss of regularity in the controls. This phenomenon is highly sensitive to the system's structure and the interaction between the projection to be tracked and the system.

In this paper, we introduce semi-autonomous neural ordinary differential equations (SA-NODEs), a variation of the vanilla NODEs, employing fewer parameters. We investigate the universal approximation properties of SA-NODEs for dynamical systems from both a theoretical and a numerical perspective. Within the assumption of a finite-time horizon, under general hypotheses we establish an asymptotic approximation result, demonstrating that the error vanishes as the number of parameters goes to infinity. Under additional regularity assumptions, we further specify this convergence rate in relation to the number of parameters, utilizing quantitative approximation results in the Barron space. Based on the previous result, we prove an approximation rate for transport equations by their neural counterparts. Our numerical experiments validate the effectiveness of SA-NODEs in capturing the dynamics of various ODE systems and transport equations. Additionally, we compare SA-NODEs with vanilla NODEs, highlighting the superior performance and reduced complexity of our approach., Comment: 22 pages, 16 pages

We analyse a dynamic control problem for scalar reaction-diffusion equations, focusing on the emulation of pattern formation through the selection of appropriate active controls. While boundary controls alone prove inadequate for replicating the complex patterns seen in biological systems, particularly under natural point-wise constraints of the system state, their combination with the regulation of the diffusion coefficient enables the successful generation of such patterns. Our study demonstrates that the set of steady-states is path-connected, facilitating the use of the staircase method. This approach allows any admissible initial configuration to evolve into any stationary pattern over a sufficiently long time while maintaining the system's natural bilateral constraints. We provide also examples of complex patterns that steady-state configurations can adopt.

Transformers are extremely successful machine learning models whose mathematical properties remain poorly understood. Here, we rigorously characterize the behavior of transformers with hardmax self-attention and normalization sublayers as the number of layers tends to infinity. By viewing such transformers as discrete-time dynamical systems describing the evolution of points in a Euclidean space, and thanks to a geometric interpretation of the self-attention mechanism based on hyperplane separation, we show that the transformer inputs asymptotically converge to a clustered equilibrium determined by special points called leaders. We then leverage this theoretical understanding to solve sentiment analysis problems from language processing using a fully interpretable transformer model, which effectively captures `context' by clustering meaningless words around leader words carrying the most meaning. Finally, we outline remaining challenges to bridge the gap between the mathematical analysis of transformers and their real-life implementation., Comment: 23 pages, 10 figures, 1 table. Funded by the European Union (Horizon Europe MSCA project ModConFlex, grant number 101073558). Accompanying code available at: https://github.com/DCN-FAU-AvH/clustering-hardmax-transformers

These Notes originated from a course I delivered at the Institute of Mathematics of the Universidade Federal do Rio de Janeiro, Brazil (UFRJ) in July-September 1989, were initially published in 1989 in Spanish under the title "Controlabilidad Exacta y Estabilizaci\'on de la Ecuaci\'on de Ondas" in the Lecture Notes Series of the Institute. Despite the significant evolution of the topic over the last three decades, I believe that the text, with its synthetic presentation of fundamental tools in the field, remains valuable for researchers in the area, especially for younger generations. It is written from the perspective of the young mathematician I was when I authored the Notes, needing to learn many things in the process and, therefore, taking care to develop details often left to the reader or not readily available elsewhere. These Notes were written one year after completing my PhD at the Universit\'e Pierre et Marie Curie in Paris and drafting the lectures of Professor Jacques-Louis Lions at Coll\`ege de France in the academic year 1986-1987, later published as a book in 1988. Parts of these Notes offer a concise presentation of content developed in more detail in that book, supplemented by work on the decay of dissipative wave equations during my PhD under the supervision of Professor Alain Haraux in Paris.

Federated learning (FL) is a promising framework for learning from distributed data while maintaining privacy. The development of efficient FL algorithms encounters various challenges, including heterogeneous data and systems, limited communication capacities, and constrained local computational resources. Recently developed FedADMM methods show great resilience to both data and system heterogeneity. However, they still suffer from performance deterioration if the hyperparameters are not carefully tuned. To address this issue, we propose an inexact and self-adaptive FedADMM algorithm, termed FedADMM-InSa. First, we design an inexactness criterion for the clients' local updates to eliminate the need for empirically setting the local training accuracy. This inexactness criterion can be assessed by each client independently based on its unique condition, thereby reducing the local computational cost and mitigating the undesirable straggle effect. The convergence of the resulting inexact ADMM is proved under the assumption of strongly convex loss functions. Additionally, we present a self-adaptive scheme that dynamically adjusts each client's penalty parameter, enhancing algorithm robustness by mitigating the need for empirical penalty parameter choices for each client. Extensive numerical experiments on both synthetic and real-world datasets are conducted. As validated by some numerical tests, our proposed algorithm can reduce the clients' local computational load significantly and also accelerate the learning process compared to the vanilla FedADMM.

We consider the Boussinesq-Peregrine (BP) system as described by Lannes [Lannes, D. (2013). The water waves problem: mathematical analysis and asymptotics (Vol. 188). American Mathematical Soc.], within the shallow water regime, and study the inverse problem of determining the time and space variations of the channel bottom profile, from measurements of the wave profile and its velocity on the free surface. A well-posedness result within a Sobolev framework for (BP), considering a time dependent bottom, is presented. Then, the inverse problem is reformulated as a nonlinear PDEconstrained optimization one. An existence result of the minimum, under constraints on the admissible set of bottoms, is presented. Moreover, an implementation of the gradient descent approach, via the adjoint method, is considered. For solving numerically both, the forward (BP) and its adjoint system, we derive a universal and low-dissipation scheme, which contains non-conservative products. The scheme is based on the FORCE-{\alpha} method proposed in [Toro, E. F., Saggiorato, B., Tokareva, S., and Hidalgo, A. (2020). Low-dissipation centred schemes for hyperbolic equations in conservative and non-conservative form. Journal of Computational Physics, 416, 109545]. Finally, we implement this methodology to recover three different bottom profiles; a smooth bottom, a discontinuous one, and a continuous profile with a large gradient. We compare with two classical discretizations for (BP) and the adjoint system. These results corroborate the effectiveness of the proposed methodology to recover bottom profiles., Comment: 30 pages, 13 figures

Neural ordinary differential equations (neural ODEs) have emerged as a natural tool for supervised learning from a control perspective, yet a complete understanding of their optimal architecture remains elusive. In this work, we examine the interplay between their width $p$ and number of layer transitions $L$ (effectively the depth $L+1$). Specifically, we assess the model expressivity in terms of its capacity to interpolate either a finite dataset $D$ comprising $N$ pairs of points or two probability measures in $\mathbb{R}^d$ within a Wasserstein error margin $\varepsilon>0$. Our findings reveal a balancing trade-off between $p$ and $L$, with $L$ scaling as $O(1+N/p)$ for dataset interpolation, and $L=O\left(1+(p\varepsilon^d)^{-1}\right)$ for measure interpolation. In the autonomous case, where $L=0$, a separate study is required, which we undertake focusing on dataset interpolation. We address the relaxed problem of $\varepsilon$-approximate controllability and establish an error decay of $\varepsilon\sim O(\log(p)p^{-1/d})$. This decay rate is a consequence of applying a universal approximation theorem to a custom-built Lipschitz vector field that interpolates $D$. In the high-dimensional setting, we further demonstrate that $p=O(N)$ neurons are likely sufficient to achieve exact control., Comment: 16 pages, 10 figures, double column

Classification of $N$ points becomes a simultaneous control problem when viewed through the lens of neural ordinary differential equations (neural ODEs), which represent the time-continuous limit of residual networks. For the narrow model, with one neuron per hidden layer, it has been shown that the task can be achieved using $O(N)$ neurons. In this study, we focus on estimating the number of neurons required for efficient cluster-based classification, particularly in the worst-case scenario where points are independently and uniformly distributed in $[0,1]^d$. Our analysis provides a novel method for quantifying the probability of requiring fewer than $O(N)$ neurons, emphasizing the asymptotic behavior as both $d$ and $N$ increase. Additionally, under the sole assumption that the data are in general position, we propose a new constructive algorithm that simultaneously classifies clusters of $d$ points from any initial configuration, effectively reducing the maximal complexity to $O(N/d)$ neurons., Comment: 26 pages, 10 figures

We study the global well-posedness and asymptotic behavior for a semilinear damped wave equation with Neumann boundary conditions, modelling a one-dimensional linearly elastic body interacting with a rigid substrate through an adhesive material. The key feature of of the problem is that the interplay between the nonlinear force and the boundary conditions allows for a continuous set of equilibrium points. We prove an exponential rate of convergence for the solution towards a (uniquely determined) equilibrium point.

The wave equation on a bounded domain of $\R^{n}$ with non homogeneous boundary Dirichlet data or sources supported on a subset of the boundary is considered. We analyze the problem of observing the source out of boundary measurements done away from its support. We first show that observability inequalities may not hold unless an infinite number of derivatives are lost, due to the existence of solutions that are arbitrarily concentrated near the source. We then establish observability inequalities in Sobolev norms, under a suitable microlocal geometric condition on the support of the source and the measurement set, for sources fulfilling pseudo-differential conditions that exclude these concentration phenomena. The proof relies on microlocal arguments and is essentially based on the use of microlocal defect measures.

We study the tracking or sidewise controllability of the heat equation. More precisely, we seek for controls that, acting on part of the boundary of the domain where the heat process evolves, aim to assure that the normal trace or flux on the complementary set tracks a given trajectory. The dual equivalent observability problem is identified. It consists on estimating the boundary sources, localized on a given subset of the boundary, out of boundary measurements on the complementary subset. Classical unique continuation and smoothing properties of the heat equation allow us proving approximate tracking controllability properties and the smoothness of the class of trackable trajectories. We also develop a new transmutation method which allows to transfer known results on the sidewise controllability of the wave equation to the tracking controllability of the heat one. Using the flatness approach we also give explicit estimates on the cost of approximate tracking control. The analysis is complemented with a discussion of some possible variants of these results and a list of open problems.

Motivated by singular limits for long-time optimal control problems, we investigate a class of parameter-dependent parabolic equations. First, we prove a turnpike result, uniform with respect to the parameters within a suitable regularity class and under appropriate bounds. The main ingredient of our proof is the justification of the uniform exponential stabilization of the corresponding Riccati equations, which is derived from the uniform null control properties of the model. Then, we focus on a heat equation with rapidly oscillating coefficients. In the one-dimensional setting, we obtain a uniform turnpike property with respect to the highly oscillatory heterogeneous medium. Afterward, we establish the homogenization of the turnpike property. Finally, our results are validated by numerical experiments.

A new framework to obtain time-decay estimates for partially dissipative hyperbolic systems set on the real line is developed. Under the classical Shizuta-Kawashima (SK) stability condition, equivalent to the Kalman rank condition in control theory, the solutions of these systems decay exponentially in time for high frequencies and polynomially for low ones. This allows to derive a sharp description of the space-time decay of solutions for large time. However, such analysis relies heavily on the use of the Fourier transform that we avoid here, developing the "physical space version" of the hyperbolic hypocoercivity approach introduced by Beauchard and Zuazua, to prove new asymptotic results in the linear and nonlinear settings. The new physical space version of the hyperbolic hypocoercivity approach allows to recover the natural heat-like time-decay of solutions under sharp rank conditions, without employing Fourier analysis or $L^1$ assumptions on the initial data. Taking advantage of this Fourier-free framework, we establish new enhanced time-decay estimates for initial data belonging to weighted Sobolev spaces. These results are then applied to the nonlinear compressible Euler equations with linear damping. We also prove the logarithmic stability of the nonlinearly damped $p$-system.

Federated Learning (FL) is a distributed learning paradigm that enables multiple clients to collaborate on building a machine learning model without sharing their private data. Although FL is considered privacy-preserved by design, recent data reconstruction attacks demonstrate that an attacker can recover clients' training data based on the parameters shared in FL. However, most existing methods fail to attack the most widely used horizontal Federated Averaging (FedAvg) scenario, where clients share model parameters after multiple local training steps. To tackle this issue, we propose an interpolation-based approximation method, which makes attacking FedAvg scenarios feasible by generating the intermediate model updates of the clients' local training processes. Then, we design a layer-wise weighted loss function to improve the data quality of reconstruction. We assign different weights to model updates in different layers concerning the neural network structure, with the weights tuned by Bayesian optimization. Finally, experimental results validate the superiority of our proposed approximate and weighted attack (AWA) method over the other state-of-the-art methods, as demonstrated by the substantial improvement in different evaluation metrics for image data reconstructions.

We consider finite element approximations to the optimal constant for the Hardy inequality with exponent $p=2$ in bounded domains of dimension $n=1$ or $n \geq 3$. For finite element spaces of piecewise linear and continuous functions on a mesh of size $h$, we prove that the approximate Hardy constant converges to the optimal Hardy constant at a rate proportional to $1/| \log h |^2$. This result holds in dimension $n=1$, in any dimension $n \geq 3$ if the domain is the unit ball and the finite element discretization exploits the rotational symmetry of the problem, and in dimension $n=3$ for general finite element discretizations of the unit ball. In the first two cases, our estimates show excellent quantitative agreement with values of the discrete Hardy constant obtained computationally., Comment: Review: Significantly improved estimates compared to the original version (23 pages, 6 figures)

Inspired by normalizing flows, we analyze the bilinear control of neural transport equations by means of time-dependent velocity fields restricted to fulfill, at any time instance, a simple neural network ansatz. The L^1 approximate controllability property is proved, showing that any probability density can be driven arbitrarily close to any other one in any time horizon. The control vector fields are built explicitly and inductively and this provides quantitative estimates on their complexity and amplitude. This also leads to statistical error bounds when only random samples of the target probability density are available.

RBM-MPC is a computationally efficient variant of Model Predictive Control (MPC) in which the Random Batch Method (RBM) is used to speed up the finite-horizon optimal control problems at each iteration. In this paper, stability and convergence estimates are derived for RBMMPC of unconstrained linear systems. The obtained estimates are validated in a numerical example that also shows a clear computational advantage of RBM-MPC.

Inverse design of transport equations can be addressed by using a gradient-adjoint methodology. In this methodology numerical schemes used for the adjoint resolution determine the direction of descent in its iterative algorithm, and consequently the CPU time consumed by the inverse design. As the CPU time constitutes a known bottleneck, it is important to employ light and quick schemes to the adjoint problem. In this regard, we proposed to use the Modified Method of Characteristics (MMOC). Despite not preserving identity conservation, the MMOC is computationally competitive. In this work we investigated the advantage of using the MMOC in comparison with the Lax-Friedrichs and Lax-Wendro? schemes for the inverse design problem. By testing the Doswell frontogenesis equation, we observed that the MMOC can provide more efficient and accurate computation under some simulation conditions.

This work is concerned with the construction of Gaussian Beam (GB) solutions for the numerical approximation of wave equations, semi-discretized in space by finite difference schemes. GB are high-frequency solutions whose propagation can be described, both at the continuous and at the semi-discrete levels, by microlocal tools along the bi-characteristics of the corresponding Hamiltonian. Their dynamics differ in the continuous and the semi-discrete setting, because of the high-frequency gap between the Hamiltonians. In particular, numerical high-frequency solutions can exhibit spurious pathological behaviors, such as lack of propagation in space, contrary to the classical space-time propagation properties of continuous waves. This gap between the behavior of continuous and numerical waves introduces also significant analytical difficulties, since classical GB constructions cannot be immediately extrapolated to the finite difference setting, and need to be properly tailored to accurately detect the propagation properties in discrete media. Our main objective in this paper is to present a general and rigorous construction of the GB ansatz for finite difference wave equations, and corroborate this construction through accurate numerical simulations.

The local stability and convergence for Model Predictive Control (MPC) of unconstrained nonlinear dynamics based on a linear time-invariant plant model is studied. Based on the long-time behavior of the solution of the Riccati Differential Equation (RDE), explicit error estimates are derived that clearly demonstrate the influence of the two critical parameters in MPC: the prediction horizon $T$ and the control horizon $\tau$. In particular, if the MPC-controller has access to an exact (linear) plant model, the MPC-controls and the corresponding optimal state trajectories converge exponentially to the solution of an infinite-horizon optimal control problem when $T-\tau \rightarrow \infty$. When the difference between the linear model and the nonlinear plant is sufficiently small in a neighborhood of the origin, the MPC strategy is locally stabilizing and the influence of modeling errors can be reduced by choosing the control horizon $\tau$ smaller. The obtained convergence rates are validated in numerical simulations.

We study the time-asymptotic behavior of linear hyperbolic systems under partial dissipation which is localized in suitable subsets of the domain. More precisely, we recover the classical decay rates of partially dissipative systems satisfying the stability condition (SK) with a time-delay depending only on the velocity of each component and the size of the undamped region. To quantify this delay, we assume that the undamped region is a bounded space-interval and that the system without space-restriction on the dissipation satisfies the stability condition (SK). The former assumption ensures that the time spent by the characteristics of the system in the undamped region is finite and the latter that whenever the damping is active the solutions decay. Our approach consists in reformulating the system into n coupled transport equations and showing that the time-decay estimates are delayed by the sum of the times each characteristics spend in the undamped region.

We give a full characterization of the range of the operator which associates, to any initial condition, the viscosity solution at time $T$ of a Hamilton-Jacobi equation with convex Hamiltonian. Our main motivation is to be able to treat the case of convex Hamiltonians with no further regularity assumptions. We give special attention to the case $H(p) = |p|$, for which we provide a rather geometrical description of the range of the viscosity operator by means of an interior ball condition on the sublevel sets. From our characterization of the reachable set, we are able to deduce further results concerning, for instance, sharp regularity estimates for the reachable functions, as well as structural properties of the reachable set. The results are finally adapted to the case of scalar conservation laws in dimension one., Comment: 20 pages, 4 figures

The \emph{turnpike property} in contemporary macroeconomics asserts that if an economic planner seeks to move an economy from one level of capital to another, then the most efficient path, as long as the planner has enough time, is to rapidly move stock to a level close to the optimal stationary or constant path, then allow for capital to develop along that path until the desired term is nearly reached, at which point the stock ought to be moved to the final target. Motivated in part by its nature as a resource allocation strategy, over the past decade, the turnpike property has also been shown to hold for several classes of partial differential equations arising in mechanics. When formalized mathematically, the turnpike theory corroborates the insights from economics: for an optimal control problem set in a finite-time horizon, optimal controls and corresponding states, are close (often exponentially), during most of the time, except near the initial and final time, to the optimal control and corresponding state for the associated stationary optimal control problem. In particular, the former are mostly constant over time. This fact provides a rigorous meaning to the asymptotic simplification that some optimal control problems appear to enjoy over long time intervals, allowing the consideration of the corresponding stationary problem for computing and applications. We review a slice of the theory developed over the past decade --the controllability of the underlying system is an important ingredient, and can even be used to devise simple turnpike-like strategies which are nearly optimal--, and present several novel applications, including, among many others, the characterization of Hamilton-Jacobi-Bellman asymptotics, and stability estimates in deep learning via residual neural networks.

We consider the problem of identifying a sparse initial source condition to achieve a given state distribution of a diffusion-advection partial differential equation after a given final time. The initial condition is assumed to be a finite combination of Dirac measures. The locations and intensities of this initial condition are required to be identified. This problem is known to be exponentially ill-posed because of the strong diffusive and smoothing effects. We propose a two-stage numerical approach to treat this problem. At the first stage, to obtain a sparse initial condition with the desire of achieving the given state subject to a certain tolerance, we propose an optimal control problem involving sparsity-promoting and ill-posedness-avoiding terms in the cost functional, and introduce a generalized primal-dual algorithm for this optimal control problem. At the second stage, the initial condition obtained from the optimal control problem is further enhanced by identifying its locations and intensities in its representation of the combination of Dirac measures. This two-stage numerical approach is shown to be easily implementable and its efficiency in short time horizons is promisingly validated by the results of numerical experiments. Some discussions on long time horizons are also included.

In this paper we develop a procedure to deal with a family of parameter-dependent ill-posed problems, for which the exact solution in general does not exist. The original problems are relaxed by considering corresponding approximate ones, whose optimal solutions are well dfined, where the optimality is determined by the minimal norm requirement. The procedure is based upon greedy algorithms that preserve, at least asymptotically, Kolmogorov approximation rates. In order to provide a-priori estimates for the algorithm, a Tychonff-type regularization is applied, which adds an additional parameter to the model. The theory is developed in an abstract theoretical framework that allows its application to different kinds of problems. We present a specific example that considers a family of ill-posed elliptic problems. The required general assumptions in this case translate to rather natural uniform lower and upper bounds on coefficients of the considered operators.

We address the Selective Harmonic Modulation (SHM) problem in power electronic engineering, consisting in designing a multilevel staircase control signal with some prescribed frequencies to improve the performances of a converter. In this work, SHM is addressed through an optimal control methodology based on duality, in which the admissible controls are piece-wise constant functions, taking values only in a given finite set. To fulfill this constraint, the cornerstone of our approach is the introduction of a special penalization in the cost functional, in the form of a piece-wise affine approximation of a parabola. In this manner, we build optimal multilevel controls having the desired staircase structure., Comment: arXiv admin note: text overlap with arXiv:2103.10266

We prove that the viscosity solution to a Hamilton-Jacobi equation with a smooth convex Hamiltonian of the form $H(x,p)$ is differentiable with respect to the initial condition. Moreover, the directional G\^ateaux derivatives can be explicitly computed almost everywhere in $\mathbb{R}^N$ by means of the optimality system of the associated optimal control problem. We also prove that, in the one-dimensional case in space and in the quadratic case in any space dimension, these directional G\^ateaux derivatives actually correspond to the unique duality solution to the linear transport equation with discontinuous coefficient, resulting from the linearization of the Hamilton-Jacobi equation. The motivation behind these differentiability results arises from the following optimal inverse-design problem: given a time horizon $T>0$ and a target function $u_T$, construct an initial condition such that the corresponding viscosity solution at time $T$ minimizes the $L^2$-distance to $u_T$. Our differentiability results allow us to derive a necessary first-order optimality condition for this optimization problem, and the implementation of gradient-based methods to numerically approximate the optimal inverse design., Comment: 37 pages, 2 figures

In this article, we explore the effects of memory terms in continuous-layer Deep Residual Networks by studying Neural ODEs (NODEs). We investigate two types of models. On one side, we consider the case of Residual Neural Networks with dependence on multiple layers, more precisely Momentum ResNets. On the other side, we analyze a Neural ODE with auxiliary states playing the role of memory states. We examine the interpolation and universal approximation properties for both architectures through a simultaneous control perspective. We also prove the ability of the second model to represent sophisticated maps, such as parametrizations of time-dependent functions. Numerical simulations complement our study.

Inspired by the successes of stochastic algorithms in the training of deep neural networks and the simulation of interacting particle systems, we propose and analyze a framework for randomized time-splitting in linear-quadratic optimal control. In our proposed framework, the linear dynamics of the original problem is replaced by a randomized dynamics. To obtain the randomized dynamics, the system matrix is split into simpler submatrices and the time interval of interest is split into subintervals. The randomized dynamics is then found by selecting randomly one or more submatrices in each subinterval. We show that the dynamics, the minimal values of the cost functional, and the optimal control obtained with the proposed randomized time-splitting method converge in expectation to their analogues in the original problem when the time grid is refined. The derived convergence rates are validated in several numerical experiments. Our numerical results also indicate that the proposed method can lead to a reduction in computational cost for the simulation and optimal control of large-scale linear dynamical systems.

We discuss the multilevel control problem for linear dynamical systems, consisting in designing a piece-wise constant control function taking values in a finite-dimensional set. In particular, we provide a complete characterization of multilevel controls through a duality approach, based on the minimization of a suitable cost functional. In this manner we build optimal multi-level controls and characterize the time needed for a given ensemble of levels to assure the controllability of the system. Moreover, this method leads to efficient numerical algorithms for computing multilevel controls.

This paper is devoted to analysing the explicit slow decay rate and turnpike in the infinite-horizon linear quadratic optimal control problems for hyperbolic systems. Assume that some weak observability or controllability are satisfied, by which, the lower and upper bounds of the corresponding algebraic Riccati operator are estimated, respectively. Then based on these two bounds, the explicit slow decay rate of the closed-loop system with Riccati-based optimal feedback control is obtained. The averaged turnpike property for this problem is also further discussed. We then apply these results to the LQ optimal control problems constraint to networks of one-dimensional wave equations and also some multi-dimensional ones with local controls which lack of GCC(Geometric Control Condition).

In this paper, by using the Brunovsky normal form, we provide a reformulation of the problem consisting in finding the actuator design which minimizes the controllability cost for finite-dimensional linear systems with scalar controls. Such systems may be seen as spatially discretized linear partial differential equations with lumped controls. The change of coordinates induced by Brunovsky's normal form allows us to remove the restriction of having to work with diagonalizable system dynamics, and does not entail a randomization procedure as done in past literature on diffusion equations or waves. Instead, the optimization problem reduces to a minimization of the norm of the inverse of a change of basis matrix, and allows for an easy deduction of existence of solutions, and for a clearer picture of some of the problem's intrinsic symmetries. Numerical experiments help to visualize these artifacts, indicate further open problems, and also show a possible obstruction of using gradient-based algorithms - this is alleviated by using an evolutionary algorithm.

The aim of this work is to give a broad panorama of the control properties of fractional diffusive models from a numerical analysis and simulation perspective. We do this by surveying several research results we obtained in the last years, focusing in particular on the numerical computation of controls. Our reference model will be a non-local diffusive dynamics driven by the fractional Laplacian on a bounded domain $\Omega$. The starting point of our analysis will be a Finite Element approximation for the associated elliptic model in one and two space-dimensions, for which we also present error estimates and convergence rates in the $L^2$ and energy norm. Secondly, we will address two specific control scenarios: firstly, we consider the standard interior control problem, in which the control is acting from a small subset $\omega\subset\Omega$. Secondly, we move our attention to the exterior control problem, in which the control region $\mathcal O\subset\Omega^c$ is located outside $\Omega$. This exterior control notion extends boundary control to the fractional framework, in which the non-local nature of the models does not allow for controls supported on $\partial\Omega$. We will conclude by discussing the interesting problem of simultaneous control, in which we consider families of parameter-dependent fractional heat equations and we aim at designing a unique control function capable of steering all the different realizations of the model to the same target configuration. In this framework, we will see how the employment of stochastic optimization techniques may help in alleviating the computational burden for the approximation of simultaneous controls. Our discussion is complemented by several open problems related with fractional models which are currently unsolved and may be of interest for future investigation.

We analyze Neural Ordinary Differential Equations (NODEs) from a control theoretical perspective to address some of the main properties and paradigms of Deep Learning (DL), in particular, data classification and universal approximation. These objectives are tackled and achieved from the perspective of the simultaneous control of systems of NODEs. For instance, in the context of classification, each item to be classified corresponds to a different initial datum for the control problem of the NODE, to be classified, all of them by the same common control, to the location (a subdomain of the euclidean space) associated to each label. Our proofs are genuinely nonlinear and constructive, allowing us to estimate the complexity of the control strategies we develop. The nonlinear nature of the activation functions governing the dynamics of NODEs under consideration plays a key role in our proofs, since it allows deforming half of the phase space while the other half remains invariant, a property that classical models in mechanics do not fulfill. This very property allows to build elementary controls inducing specific dynamics and transformations whose concatenation, along with properly chosen hyperplanes, allows achieving our goals in finitely many steps. The nonlinearity of the dynamics is assumed to be Lipschitz. Therefore, our results apply also in the particular case of the ReLU activation function. We also present the counterparts in the context of the control of neural transport equations, establishing a link between optimal transport and deep neural networks.

This paper presents a complete analysis of the observability property of heat equations with time-dependent real analytic memory kernels. More precisely, we characterize the geometry of the space-time measurable observation sets ensuring sharp observability inequalities, which are relevant both for control and inverse problems purposes. Despite the abundant literature on the observation of heat-like equations, existing methods do not apply to models involving memory terms. We present a new methodology and observation strategy, relying on the decomposition of the flow, the time-analyticity of solutions and the propagation of singularities. This allows us to obtain a sufficient and necessary geometric condition on the measurable observation sets for sharp two-sided observability inequalities. In addition, some applications to control and relevant open problems are presented.