Michael Herty

Shaoshuai Chu, Michael Herty

We develop high-order numerical schemes to solve random hyperbolic conservation laws using linear programming. The proposed schemes are high-order extensions of the existing first-order scheme introduced in [{\sc S. Chu, M. Herty, M. Lukáčová-Medvi{\softd}ová, and Y. Zhou}, SIAM J. Sci. Comput., 48 (2026)], where a novel structure-preserving numerical method using a concept of generalized, measure-valued solutions to solve random hyperbolic systems of conservation laws is proposed, yielding a linear partial differential equation concerning the Young measure and allowing the computation of approximations based on linear programming problems. The second-order extension is obtained using piecewise linear reconstructions of the one-sided point values of the unknowns. The fifth-order scheme is developed using the finite-difference alternative weighted essentially non-oscillatory (A-WENO) framework. These extensions significantly improve the resolution of discontinuities, as demonstrated by a series of numerical experiments on both random (Burgers equation, isentropic Euler equations) and deterministic (discontinuous flux, pressureless gas dynamics, Burgers equation with non-atomic support) hyperbolic conservation laws.

Michael Herty, Pierpaolo Porretta, Giuseppe Visconti

Ensemble Kalman Inversion (EKI) is a derivative-free, ensemble-based method for inverse and optimization problems. Its continuous-time formulation can be interpreted as an interacting particle system driven by a Kalman-type preconditioned descent direction. A well-known limitation of this dynamics is the possible premature collapse of the covariance of the ensemble, which makes the method sensitive to the initial ensemble. We introduce a second-order particle system in which the particles evolve according to an inertial dynamics. The model combines a Kalman-type relaxation force with damping, attraction towards the ensemble mean, and a short-range repulsive interaction designed to counteract ensemble collapse. The resulting dynamics can be interpreted as a heavy-ball reformulation of continuous-time EKI enriched by competing attractive and repulsive mechanisms. For linear inverse problems, we analyze the induced mean and fluctuation dynamics and identify a parameter regime in which fully collapsed configurations are linearly unstable. We further characterize asymptotic equilibria through a constrained optimality condition on the subspace retained by the limiting ensemble covariance and derive an exponential decay estimate. Numerical experiments illustrate the effect of inertia and repulsion on the ensemble dynamics and compare the proposed second-order method with first-order EKI-type

Michael Herty, Lorenzo Pareschi, Sonja Steffensen

Implicit-explicit (IMEX) Runge-Kutta methods play a major rule in the numerical treatment of differential systems governed by stiff and non-stiff terms. This paper discusses order conditions and symplecticity properties of a class of IMEX Runge-Kutta methods in the context of optimal control problems. The analysis of the schemes is based on the continuous optimality system. Using suitable transformations of the adjoint equation, order conditions up to order three are proven as well as the relation between adjoint schemes obtained through different transformations is investigated. Conditions for the IMEX Runge-Kutta methods to be symplectic are also derived. A numerical example illustrating the theoretical properties is presented.

Michael Herty, Giuseppe Visconti

The Ensemble Kalman Filter method can be used as an iterative numerical scheme for parameter identification or nonlinear filtering problems. We study the limit of infinitely large ensemble size and derive the corresponding mean-field limit of the ensemble method. The solution of the inverse problem is provided by the expected value of the distribution of the ensembles and the kinetic equation allows, in simple cases, to analyze stability of these solutions. Further, we present a slight but stable modification of the method which leads to a Fokker-Planck-type kinetic equation. The kinetic methods proposed here are able to solve the problem with a reduced computational complexity in the limit of a large ensemble size. We illustrate the properties and the ability of the kinetic model to provide solution to inverse problems by using examples from the literature.

Giacomo Albi, Michael Herty, Lorenzo Pareschi

We are interested in high-order linear multistep schemes for time discretization of adjoint equations arising within optimal control problems. First we consider optimal control problems for ordinary differential equations and show loss of accuracy for Adams-Moulton and Adams-Bashford methods, whereas BDF methods preserve high--order accuracy. Subsequently we extend these results to semi--lagrangian discretizations of hyperbolic relaxation systems. Computational results illustrate theoretical findings.

Antoine Tordeux, Guillaume Costeseque, Michael Herty et al.

In this work, we derive first order continuum traffic flow models from a microscopic delayed follow-the-leader model. Those are applicable in the context of vehicular traffic flow as well as pedestrian traffic flow. The microscopic model is based on an optimal velocity function and a reaction time parameter. The corresponding macroscopic formulations in Eulerian or Lagrangian coordinates result in first order convection-diffusion equations. More precisely, the convection is described by the optimal velocity while the diffusion term depends on the reaction time. A linear stability analysis for homogeneous solutions of both continuous and discrete models are provided. The conditions match the ones of the car-following model for specific values of the space discretization. The behavior of the novel model is illustrated thanks to numerical simulations. Transitions to collision-free self-sustained stop-and-go dynamics are obtained if the reaction time is sufficiently large. The results show that the dynamics of the microscopic model can be well captured by the macroscopic equations. For non--zero reaction times we observe a scattered fundamental diagram. The scattering width is compared to real pedestrian and road traffic data.

Michael Herty, Salissou Moutari, Giuseppe Visconti

Lane changing is one of the most common maneuvers on motorways. Although, macroscopic traffic models are well known for their suitability to describe fast moving crowded traffic, most of these models are generally developed in one dimensional framework, henceforth lane changing behavior is somehow neglected. In this paper, we propose a macroscopic model, which accounts for lane-changing behavior on motorway, based on a two-dimensional extension of the Aw and Rascle [Aw and Rascle, SIAM J.Appl.Math., 2000] and Zhang [Zhang, Transport.Res.B-Meth., 2002] macroscopic model for traffic flow. Under conditions, when lane changing maneuvers are no longer possible, the model "relaxes" to the one-dimensional Aw-Rascle-Zhang model. Following the same approach as in [Aw, Klar, Materne and Rascle, SIAM J.Appl.Math., 2002], we derive the two-dimensional macroscopic model through scaling of time discretization of a microscopic follow-the-leader model with driving direction. We provide a detailed analysis of the space-time discretization of the proposed macroscopic as well as an approximation of the solution to the associated Riemann problem. Furthermore, we illustrate some features of the proposed model through some numerical experiments.

Michael Herty, Adrian Fazekas, Giuseppe Visconti

Based on experimental traffic data obtained from German and US highways, we propose a novel two-dimensional first-order macroscopic traffic flow model. The goal is to reproduce a detailed description of traffic dynamics for the real road geometry. In our approach both the dynamic along the road and across the lanes is continuous. The closure relations, being necessary to complete the hydrodynamic equation, are obtained by regression on fundamental diagram data. Comparison with prediction of one-dimensional models shows the improvement in performance of the novel model.

Michael Herty, Andrea Tosin, Giuseppe Visconti et al.

In this work we present a two-dimensional kinetic traffic model which takes into account speed changes both when vehicles interact along the road lanes and when they change lane. Assuming that lane changes are less frequent than interactions along the same lane and considering that their mathematical description can be done up to some uncertainty in the model parameters, we derive a hybrid stochastic Fokker-Planck-Boltzmann equation in the quasi-invariant interaction limit. By means of suitable numerical methods, precisely structure preserving and direct Monte Carlo schemes, we use this equation to compute theoretical speed-density diagrams of traffic both along and across the lanes, including estimates of the data dispersion, and validate them against real data.

Richard Barnard, Martin Frank, Michael Herty

We study the problem of finding an optimal radiotherapy treatment plan. A time-dependent Boltzmann particle transport model is used to model the interaction between radiative particles with tissue. This model allows for the modeling of inhomogeneities in the body and allows for anisotropic sources modeling distributed radiation---as in brachytherapy---and external beam sources---as in teletherapy. We study two optimization problems: minimizing the deviation from a spatially-dependent prescribed dose through a quadratic tracking functional; and minimizing the survival of tumor cells through the use of the linear-quadratic model of radiobiological cell response. For each problem, we derive the optimality systems. In order to solve the state and adjoint equations, we use the minimum entropy approximation; the advantages of this method are discussed. Numerical results are then presented.

Christian Fiedler, Michael Herty, Michael Rom et al.

Kernel methods, being supported by a well-developed theory and coming with efficient algorithms, are among the most popular and successful machine learning techniques. From a mathematical point of view, these methods rest on the concept of kernels and function spaces generated by kernels, so called reproducing kernel Hilbert spaces. Motivated by recent developments of learning approaches in the context of interacting particle systems, we investigate kernel methods acting on data with many measurement variables. We show the rigorous mean field limit of kernels and provide a detailed analysis of the limiting reproducing kernel Hilbert space. Furthermore, several examples of kernels, that allow a rigorous mean field limit, are presented.

Christian Fiedler, Michael Herty, Sebastian Trimpe

In many applications of machine learning, a large number of variables are considered. Motivated by machine learning of interacting particle systems, we consider the situation when the number of input variables goes to infinity. First, we continue the recent investigation of the mean field limit of kernels and their reproducing kernel Hilbert spaces, completing the existing theory. Next, we provide results relevant for approximation with such kernels in the mean field limit, including a representer theorem. Finally, we use these kernels in the context of statistical learning in the mean field limit, focusing on Support Vector Machines. In particular, we show mean field convergence of empirical and infinite-sample solutions as well as the convergence of the corresponding risks. On the one hand, our results establish rigorous mean field limits in the context of kernel methods, providing new theoretical tools and insights for large-scale problems. On the other hand, our setting corresponds to a new form of limit of learning problems, which seems to have not been investigated yet in the statistical learning theory literature.

Shaoshuai Chu, Michael Herty, Alexander Kurganov

We introduce a new scheme adaption strategy for one- and two-dimensional hyperbolic systems of conservation laws. The proposed approach builds upon the adaptive framework introduced in [S. Chu, A. Kurganov, and I. Menshov, Appl. Numer. Math., 209 (2025), pp.155--170], where we first employed the smoothness indicator from [R. Lohner, Comput. Methods. Appl. Mech. Eng., 61 (1987), pp.323--338] to automatically detect ``rough'' and smooth parts of the computed solution, and then used different limiters in the detected regions. This adaptive strategy was based on a threshold needed to sharply separate ``rough'' and smooth regions. In this paper, we propose a different adaption strategy. We use SBM-type limiters and vary one of the limiting parameters continuously to allow a smooth transition between the ``rough'' and smooth areas. This way, compressive and overcompressive limiters are activated in the shock and contact wave vicinities only, while we gradually switch to dissipative limiters in the smooth regions. A series of one- and two-dimensional numerical tests for the Euler equations of gas dynamics demonstrates that the new scheme adaption strategy leads to a higher resolution and reduced numerical dissipation.

Giacomo Albi, Sara Bicego, Michael Herty et al.

Feedback control synthesis for large-scale particle systems is reviewed in the framework of model predictive control (MPC). The high-dimensional character of collective dynamics hampers the performance of traditional MPC algorithms based on fast online dynamic optimization at every time step. Two alternatives to MPC are proposed. First, the use of supervised learning techniques for the offline approximation of optimal feedback laws is discussed. Then, a procedure based on sequential linearization of the dynamics based on macroscopic quantities of the particle ensemble is reviewed. Both approaches circumvent the online solution of optimal control problems enabling fast, real-time, feedback synthesis for large-scale particle systems. Numerical experiments assess the performance of the proposed algorithms.

William De Deyn, Michael Herty, Giovanni Samaey

We study Consensus-Based Optimization (CBO) for two-layer neural network training. We compare the performance of CBO against Adam on two test cases and demonstrate how a hybrid approach, combining CBO with Adam, provides faster convergence than CBO. Additionally, in the context of multi-task learning, we recast CBO into a formulation that offers less memory overhead. The CBO method allows for a mean-field limit formulation, which we couple with the mean-field limit of the neural network. To this end, we first reformulate CBO within the optimal transport framework. In the limit of infinitely many particles, we define the corresponding dynamics on the Wasserstein-over-Wasserstein space and show that the variance decreases monotonically.

Alper Yegenoglu, Anand Subramoney, Thorsten Hater et al.

Neuroscience models commonly have a high number of degrees of freedom and only specific regions within the parameter space are able to produce dynamics of interest. This makes the development of tools and strategies to efficiently find these regions of high importance to advance brain research. Exploring the high dimensional parameter space using numerical simulations has been a frequently used technique in the last years in many areas of computational neuroscience. High performance computing (HPC) can provide today a powerful infrastructure to speed up explorations and increase our general understanding of the model's behavior in reasonable times.

Giuseppe Visconti, Michael Herty, Gabriella Puppo et al.

Starting from interaction rules based on two levels of stochasticity we study the influence of the microscopic dynamics on the macroscopic properties of vehicular flow. In particular, we study the qualitative structure of the resulting flux-density and speed-density diagrams for different choices of the desired speeds. We are able to recover multivalued diagrams as a result of the existence of a one-parameter family of stationary distributions, whose expression is analytically found by means of a Fokker-Planck approximation of the initial Boltzmann-type model.