Probability Distributions.- Linear Models for Regression.- Linear Models for Classification.- Neural Networks.- Kernel Methods.- Sparse Kernel Machines.- Graphical Models.- Mixture Models and EM.- Approximate Inference.- Sampling Methods.- Continuous Latent Variables.- Sequential Data.- Combining Models.

Pattern Recognition and Machine Learning

to be done in this area. Face recognition is a problem that scarcely clamoured for attention before the computer age but, having surfaced, has involved a wide range of techniques and has attracted the attention of some fine minds (David Mumford was a Fields Medallist in 1974). This singular application of mathematical modelling to a messy applied problem of obvious utility and importance but with no unique solution is a pretty one to share with students: perhaps, returning to the source of our opening quotation, we may invert Duncan's earlier observation, 'There is an art to find the mind's construction in the face!'.

Linear and nonlinear waves, by G. B. Whitham. Pp.636. £50. 1999. ISBN 0 471 35942 4 (Wiley).

Initial-value ordinary differential equation solution via variable order Adams method (SIVA/DIVA) package is collection of subroutines for solution of nonstiff ordinary differential equations. There are versions for single-precision and double-precision arithmetic. Requires fewer evaluations of derivatives than other variable-order Adams predictor/ corrector methods. Option for direct integration of second-order equations makes integration of trajectory problems significantly more efficient. Written in FORTRAN 77.

Solving Ordinary Differential Equations

Real and Complex Analysis

Monte Carlo is one of the most versatile and widely used numerical methods. Its convergence rate, O(N−1/2), is independent of dimension, which shows Monte Carlo to be very robust but also slow. This article presents an introduction to Monte Carlo methods for integration problems, including convergence theory, sampling methods and variance reduction techniques. Accelerated convergence for Monte Carlo quadrature is attained using quasi-random (also called low-discrepancy) sequences, which are a deterministic alternative to random or pseudo-random sequences. The points in a quasi-random sequence are correlated to provide greater uniformity. The resulting quadrature method, called quasi-Monte Carlo, has a convergence rate of approximately O((logN)kN−1). For quasi-Monte Carlo, both theoretical error estimates and practical limitations are presented. Although the emphasis in this article is on integration, Monte Carlo simulation of rarefied gas dynamics is also discussed. In the limit of small mean free path (that is, the fluid dynamic limit), Monte Carlo loses its effectiveness because the collisional distance is much less than the fluid dynamic length scale. Computational examples are presented throughout the text to illustrate the theory. A number of open problems are described.

http://dsec.pku.edu.cn/~tieli/notes/numer_anal/MCQMC_Caflisch.pdf

Monte Carlo and quasi-Monte Carlo methods

After an initial phase characterized by the introduction of timely and drastic containment measures aimed at stopping the epidemic contagion from SARS-CoV2, many governments are preparing to relax such measures in the face of a severe economic crisis caused by lockdowns. Assessing the impact of such openings in relation to the risk of a resumption of the spread of the disease is an extremely difficult problem due to the many unknowns concerning the actual number of people infected, the actual reproduction number and infection fatality rate of the disease. In this work, starting from a compartmental model with a social structure, we derive models with multiple feedback controls depending on the social activities that allow to assess the impact of a selective relaxation of the containment measures in the presence of uncertain data. Specific contact patterns in the home, work, school and other locations for all countries considered have been used. Results from different scenarios in some of the major countries where the epidemic is ongoing, including Germany, France, Italy, Spain, the United Kingdom and the United States, are presented and discussed.

/pdf/relaxing-lockdown-measures-in-epidemic-outbreaks-using-5eo0insa92.pdf

Relaxing lockdown measures in epidemic outbreaks using selective socio-economic containment with uncertainty

In this work we introduce a new class of gradient-free global optimization methods based on a binary interaction dynamics governed by a Boltzmann type equation. In each interaction the particles act taking into account both the best microscopic binary position and the best macroscopic collective position. In the mean-field limit we show that the resulting Fokker-Planck partial differential equations generalize the current class of consensus based optimization (CBO) methods. For the latter methods, convergence to the global minimizer can be shown for a large class of functions. Algorithmic implementations inspired by the well-known direct simulation Monte Carlo methods in kinetic theory are derived and discussed. Several examples on prototype test functions for global optimization are reported including applications to machine learning.

Binary interaction methods for high dimensional global optimization and machine learning

We consider the development of exponential methods for the robust time discretization of space inhomogeneous Boltzmann equations in stiff regimes. Compared to the space homogeneous case, or more in general to the case of splitting based methods, studied in Dimarco Pareschi (SIAM J. Num. Anal. 2011) a major difficulty is that the local Maxwellian equilibrium state is not constant in a time step and thus needs a proper numerical treatment. We show how to derive asymptotic preserving (AP) schemes of arbitrary order and in particular using the Shu-Osher representation of Runge-Kutta methods we explore the monotonicity properties of such schemes, like strong stability preserving (SSP) and positivity preserving. Several numerical results confirm our analysis.

Exponential Runge-Kutta schemes for inhomogeneous Boltzmann equations with high order of accuracy

In this work we are interested in the modelling and control of opinion dynamics spreading on a time evolving network with scale-free asymptotic degree distribution. The mathematical model is formulated as a coupling of an opinion alignment system with a probabilistic description of the network. The optimal control problem aims at forcing consensus over the network, to this goal a control strategy based on the degree of connection of each agent has been designed. A numerical method based on a model predictive strategy is then developed and different numerical tests are reported. The results show that in this way it is possible to drive the overall opinion toward a desired state even if we control only a suitable fraction of the nodes.

On the optimal control of opinion dynamics on evolving networks

https://hal.inria.fr/hal-01626888/document

Lorenzo Pareschi

Papers

Relaxing lockdown measures in epidemic outbreaks using selective socio-economic containment with uncertainty

Binary interaction methods for high dimensional global optimization and machine learning

Exponential Runge-Kutta schemes for inhomogeneous Boltzmann equations with high order of accuracy

On the optimal control of opinion dynamics on evolving networks

On the Optimal Control of Opinion Dynamics on Evolving Networks