Sorry, you need to enable JavaScript to visit this website.
Share

Publications

Publications

CMAP Theses  are available by following this link:
Discover CMAP theses

Listed below, are sorted by year, the publications appearing in the HAL open archive.

2020

  • On the Turnpike Property and the Receding-Horizon Method for Linear-Quadratic Optimal Control Problems
    • Breiten Tobias
    • Pfeiffer Laurent
    SIAM Journal on Control and Optimization, Society for Industrial and Applied Mathematics, 2020, 58 (2), pp.26. Optimal control problems with a very large time horizon can be tackled with the Receding Horizon Control (RHC) method, which consists in solving a sequence of optimal control problems with small prediction horizon. The main result of this article is the proof of the exponential convergence (with respect to the prediction horizon) of the control generated by the RHC method towards the exact solution of the problem. The result is established for a class of infinite-dimensional linear-quadratic optimal control problems with time-independent dynamics and integral cost. Such problems satisfy the turnpike property: the optimal trajectory remains most of the time very close to the solution to the associated static optimization problem. Specific terminal cost functions, derived from the Lagrange multiplier associated with the static optimization problem, are employed in the implementation of the RHC method. (10.1137/18M1225811)
    DOI : 10.1137/18M1225811
  • Accuracy assessment of the Non-Ideal Computational Fluid Dynamics model for siloxane MDM from the open-source SU2 suite
    • Gori Giulio
    • Zocca Marta
    • Cammi Giorgia
    • Spinelli Andrea
    • Congedo Pietro Marco
    • Guardone Alberto
    European Journal of Mechanics - B/Fluids, Elsevier, 2020, 79, pp.109-120. The first-ever accuracy assessment of a computational model for Non-Ideal Compressible-Fluid Dynamics (NICFD) flows is presented. The assessment relies on a comparison between numerical predictions, from the open-source suite SU2, and pressure and Mach number measurements of compressible fluid flows in the non-ideal regime. Namely, measurements regard supersonic flows of siloxane MDM (Octamethyltrisiloxane, C 8 H 24 O 2 Si 3) vapor expanding along isentropes in the close proximity of the liquid-vapor saturation curve. The model accuracy assessment takes advantage of an Uncertainty Quantification (UQ) analysis, to compute the variability of the numerical solution with respect the uncertainties affecting the test-rig operating conditions. This allows for an uncertainty-based assessment of the accuracy of numerical predictions. The test set is representative of typical operating conditions of Organic Rankine Cycle systems and it includes compressible flows expanding through a converging-diverging nozzle in mildly-to-highly non-ideal conditions. All the considered flows are well represented by the computational model. Therefore, the reliability of the numerical implementation and the predictiveness of the NICFD model are confirmed. (10.1016/j.euromechflu.2019.08.014)
    DOI : 10.1016/j.euromechflu.2019.08.014
  • On Invariance and Linear Convergence of Evolution Strategies with Augmented Lagrangian Constraint Handling
    • Atamna Asma
    • Auger Anne
    • Hansen Nikolaus
    Theoretical Computer Science, Elsevier, 2020, 832, pp.68-97. In the context of numerical constrained optimization, we investigate stochastic algorithms, in particular evolution strategies, handling constraints via augmented Lagrangian approaches. In those approaches, the original constrained problem is turned into an unconstrained one and the function optimized is an augmented Lagrangian whose parameters are adapted during the optimization. The use of an augmented Lagrangian however breaks a central invariance property of evolution strategies, namely invariance to strictly increasing transformations of the objective function. We formalize nevertheless that an evolution strategy with augmented Lagrangian constraint handling should preserve invariance to strictly increasing affine transformations of the objective function and the scaling of the constraints—a subclass of strictly increasing transformations. We show that this invariance property is important for the linear convergence of these algorithms and show how both properties are connected. (10.1016/j.tcs.2018.10.006)
    DOI : 10.1016/j.tcs.2018.10.006
  • Parametric inference for diffusions observed at stopping times
    • Gobet Emmanuel
    • Stazhynski Uladzislau
    Electronic Journal of Statistics, Shaker Heights, OH : Institute of Mathematical Statistics, 2020, 14 (1). In this paper we study the problem of parametric inference for multidimensional diffusions based on observations at random stopping times. We work in the asymptotic framework of high frequency data over a fixed horizon. Previous works on the subject (such as [Doh87, GJ93, Gob01, AM04] among others) consider only deterministic, strongly predictable or random, independent of the process, observation times, and do not cover our setting. Under mild assumptions we construct a consistent sequence of estimators, for a large class of stopping time observation grids (studied in [GL14, GS18]). Further we carry out the asymptotic analysis of the estimation error and establish a Central Limit Theorem (CLT) with a mixed Gaussian limit. In addition, in the case of a 1-dimensional parameter, for any sequence of estimators verifying CLT conditions without bias, we prove a uniform a.s. lower bound on the asymptotic variance, and show that this bound is sharp. (10.1214/20-EJS1708)
    DOI : 10.1214/20-EJS1708
  • The boundary of random planar maps via looptrees
    • Kortchemski Igor
    • Richier Loïc
    Annales de la Faculté des Sciences de Toulouse. Mathématiques., Université Paul Sabatier _ Cellule Mathdoc, 2020, 29 (2), pp.391-430. (10.5802/afst.1636)
    DOI : 10.5802/afst.1636
  • A game theory approach to the existence and uniqueness of nonlinear Perron-Frobenius eigenvectors
    • Akian Marianne
    • Gaubert Stéphane
    • Hochart Antoine
    Discrete and Continuous Dynamical Systems - Series A, American Institute of Mathematical Sciences, 2020, 40, pp.207--231. We establish a generalized Perron-Frobenius theorem, based on a combinatorial criterion which entails the existence of an eigenvector for any nonlinear order-preserving and positively homogeneous map $f$ acting on the open orthant $\mathbb{R}_{\scriptscriptstyle >0}^n$. This criterion involves dominions, i.e., sets of states that can be made invariant by one player in a two-person game that only depends on the behavior of $f$ "at infinity". In this way, we characterize the situation in which for all $\alpha, \beta > 0$, the "slice space" $\mathcal{S}_\alpha^\beta := \{ x \in \mathbb{R}_{\scriptscriptstyle >0}^n \mid \alpha x \leq f(x) \leq \beta x \}$ is bounded in Hilbert's projective metric, or, equivalently, for all uniform perturbations $g$ of $f$, all the orbits of $g$ are bounded in Hilbert's projective metric. This solves a problem raised by Gaubert and Gunawardena (Trans. AMS, 2004). We also show that the uniqueness of an eigenvector is characterized by a dominion condition, involving a different game depending now on the local behavior of $f$ near an eigenvector. We show that the dominion conditions can be verified by directed hypergraph methods. We finally illustrate these results by considering specific classes of nonlinear maps, including Shapley operators, generalized means and nonnegative tensors. (10.3934/dcds.2020009)
    DOI : 10.3934/dcds.2020009
  • Avis en réponse à la saisine du 2 juillet 2020 relative au projet de décret modifiant l’article D.531-2 du code de l'environnement
    • Comité Scientifique Du Haut Conseil Des Biotechnologies .
    • Angevin Frédérique
    • Bagnis Claude
    • Bar-Hen Avner
    • Barny Marie-Anne
    • Boireau Pascal
    • Brévault Thierry
    • Chauvel Bruno B.
    • Collonnier Cécile
    • Couvet Denis
    • Dassa Elie
    • Demeneix Barbara
    • Franche Claudine
    • Guerche Philippe
    • Guillemain Joël
    • Hernandez Raquet Guillermina
    • Khalife Jamal
    • Klonjkowski Bernard
    • Lavielle Marc
    • Le Corre Valérie
    • Lefèvre François
    • Lemaire Olivier
    • Lereclus Didier D.
    • Maximilien Rémy
    • Meurs Eliane
    • Naffakh Nadia
    • Négre Didier
    • Noyer Jean-Louis
    • Ochatt Sergio
    • Pages Jean-Christophe
    • Raynaud Xavier
    • Regnault-Roger Catherine
    • Renard Michel M.
    • Renault Tristan
    • Saindrenan Patrick
    • Simonet Pascal
    • Troadec Marie-Bérengère
    • Vaissière Bernard
    • de Verneuil Hubert
    • Vilotte Jean-Luc
    , 2020, pp.44 p.. Les analyses contenues dans le rapport de surveillance de Bayer Agriculture BVBA ne font apparaître aucun problème majeur associé à la culture de maïs MON 810 en 2018. Toutefois, le CS du HCB identifie encore certaines faiblesses et limites méthodologiques concernant la surveillance de la sensibilité des ravageurs ciblés à la toxine Cry1Ab, remettant en question les conclusions du rapport. Le HCB estime notamment que l’utilisation d’une dose diagnostic présente certaines limites pour la détection précoce de l’évolution de la résistance, tant dans son principe intrinsèque que dans sa mise en oeuvre par Bayer, et recommande une méthode alternative de type F2 screen permettant de déterminer la fréquence des allèles de résistance au sein d’une population de ravageurs cibles. Par ailleurs, le HCB formule des recommandations destinées à renforcer la mise en oeuvre des zones refuges pour prévenir ou retarder le développement de résistance à la toxine Cry1Ab chez les ravageurs ciblés. Concernant la surveillance générale, le CS du HCB relève un problème de pertinence méthodologique quant aux questions étudiées, avec des règles de décision arbitraires, des conclusions incorrectement justifiées et un possible biais associé au format d’enquête auprès du panel d’agriculteurs qui ont accepté de répondre au questionnaire. Enfin, le CS du HCB recommande que le rapport de surveillance considère la présence de téosinte dans des zones de culture du maïs MON 810 en Espagne et les risques potentiels associés à une éventuelle introgression de gènes de maïs MON 810 chez le téosinte.
  • Orlicz Random Fourier Features
    • Chamakh Linda
    • Gobet Emmanuel
    • Szabó Zoltán
    Journal of Machine Learning Research, Microtome Publishing, 2020, 21 (145), pp.1−37. Kernel techniques are among the most widely-applied and influential tools in machine learning with applications at virtually all areas of the field. To combine this expressive power with computational efficiency numerous randomized schemes have been proposed in the literature, among which probably random Fourier features (RFF) are the simplest and most popular. While RFFs were originally designed for the approximation of kernel values, recently they have been adapted to kernel derivatives, and hence to the solution of large-scale tasks involving function derivatives. Unfortunately, the understanding of the RFF scheme for the approximation of higher-order kernel derivatives is quite limited due to the challenging polynomial growing nature of the underlying function class in the empirical process. To tackle this difficulty, we establish a finite-sample deviation bound for a general class of polynomial-growth functions under α-exponential Orlicz condition on the distribution of the sample. Instantiating this result for RFFs, our finite-sample uniform guarantee implies a.s. convergence with tight rate for arbitrary kernel with α-exponential Orlicz spectrum and any order of derivative.
  • Computing invariant sets of random differential equations using polynomial chaos
    • Breden Maxime
    • Kuehn Christian
    SIAM Journal on Applied Dynamical Systems, Society for Industrial and Applied Mathematics, 2020, 19 (1), pp.577–618. Differential equations with random parameters have gained significant prominence in recent years due to their importance in mathematical modelling and data assimilation. In many cases, random ordinary differential equations (RODEs) are studied by using Monte-Carlo methods or by direct numerical simulation techniques using polynomial chaos (PC), i.e., by a series expansion of the random parameters in combination with forward integration. Here we take a dynamical systems viewpoint and focus on the invariant sets of differential equations such as steady states, stable/unstable manifolds, periodic orbits, and heteroclinic orbits. We employ PC to compute representations of all these different types of invariant sets for RODEs. This allows us to obtain fast sampling, geometric visualization of distributional properties of invariants sets, and uncertainty quantification of dynamical output such as periods or locations of orbits. We apply our techniques to a predator-prey model, where we compute steady states and stable/unstable manifolds. We also include several benchmarks to illustrate the numerical efficiency of adaptively chosen PC depending upon the random input. Then we employ the methods for the Lorenz system, obtaining computational PC representations of periodic orbits, stable/unstable manifolds and heteroclinic orbits. (10.1137/18M1235818)
    DOI : 10.1137/18M1235818
  • Fluctuation theory in the Boltzmann--Grad limit
    • Bodineau Thierry
    • Gallagher Isabelle
    • Saint-Raymond Laure
    • Simonella Sergio
    Journal of Statistical Physics, Springer Verlag, 2020, 180, pp.873–895. We develop a rigorous theory of hard-sphere dynamics in the kinetic regime, away from thermal equilibrium. In the low density limit, the empirical density obeys a law of large numbers and the dynamics is governed by the Boltzmann equation. Deviations from this behaviour are described by dynamical correlations, which can be fully characterized for short times. This provides both a fluctuating Boltzmann equation and large deviation asymptotics.
  • Diagonal Acceleration for Covariance Matrix Adaptation Evolution Strategies
    • Akimoto Youhei
    • Hansen Nikolaus
    Evolutionary Computation, Massachusetts Institute of Technology Press (MIT Press), 2020, 28 (3), pp.405-435. We introduce an acceleration for covariance matrix adaptation evolution strategies (CMA-ES) by means of adaptive diagonal decoding (dd-CMA). This diagonal acceleration endows the default CMA-ES with the advantages of separable CMA-ES without inheriting its drawbacks. Technically, we introduce a diagonal matrix $D$ that expresses coordinate-wise variances of the sampling distribution in $DCD$ form. The diagonal matrix can learn a rescaling of the problem in the coordinates within linear number of function evaluations. Diagonal decoding can also exploit separability of the problem, but, crucially, does not compromise the performance on non-separable problems. The latter is accomplished by modulating the learning rate for the diagonal matrix based on the condition number of the underlying correlation matrix. dd-CMA-ES not only combines the advantages of default and separable CMA-ES, but may achieve overadditive speedup: it improves the performance, and even the scaling, of the better of default and separable CMA-ES on classes of non-separable test functions that reflect, arguably, a landscape feature commonly observed in practice. The paper makes two further secondary contributions: we introduce two different approaches to guarantee positive definiteness of the covariance matrix with active CMA, which is valuable in particular with large population size; we revise the default parameter setting in CMA-ES, proposing accelerated settings in particular for large dimension. All our contributions can be viewed as independent improvements of CMA-ES, yet they are also complementary and can be seamlessly combined. In numerical experiments with dd-CMA-ES up to dimension 5120, we observe remarkable improvements over the original covariance matrix adaptation on functions with coordinate-wise ill-conditioning. The improvement is observed also for large population sizes up to about dimension squared. (10.1162/evco_a_00260)
    DOI : 10.1162/evco_a_00260
  • Null space gradient flows for constrained optimization with applications to shape optimization
    • Feppon Florian
    • Allaire Grégoire
    • Dapogny Charles
    ESAIM: Control, Optimisation and Calculus of Variations, EDP Sciences, 2020, 26, pp.90. The purpose of this article is to introduce a gradient-flow algorithm for solving equality and inequality constrained optimization problems, which is particularly suited for shape optimization applications. We rely on a variant of the Ordinary Differential Equation (ODE) approach proposed by Yamashita (Math. Program. 18 (1980) 155–168) for equality constrained problems: the search direction is a combination of a null space step and a range space step, aiming to decrease the value of the minimized objective function and the violation of the constraints, respectively. Our first contribution is to propose an extension of this ODE approach to optimization problems featuring both equality and inequality constraints. In the literature, a common practice consists in reducing inequality constraints to equality constraints by the introduction of additional slack variables. Here, we rather solve their local combinatorial character by computing the projection of the gradient of the objective function onto the cone of feasible directions. This is achieved by solving a dual quadratic programming subproblem whose size equals the number of active or violated constraints. The solution to this problem allows to identify the inequality constraints to which the optimization trajectory should remain tangent. Our second contribution is a formulation of our gradient flow in the context of – infinite-dimensional – Hilbert spaces, and of even more general optimization sets such as sets of shapes, as it occurs in shape optimization within the framework of Hadamard’s boundary variation method. The cornerstone of this formulation is the classical operation of extension and regularization of shape derivatives. The numerical efficiency and ease of implementation of our algorithm are demonstrated on realistic shape optimization problems. (10.1051/cocv/2020015)
    DOI : 10.1051/cocv/2020015
  • Universal limits of substitution-closed permutation classes
    • Bassino Frédérique
    • Bouvel Mathilde
    • Féray Valentin
    • Gerin Lucas
    • Maazoun Mickaël
    • Pierrot Adeline
    Journal of the European Mathematical Society, European Mathematical Society, 2020, 22 (11), pp.3565-3639. We consider uniform random permutations in proper substitution-closed classes and study their limiting behavior in the sense of permutons. The limit depends on the generating series of the simple permutations in the class. Under a mild sufficient condition, the limit is an elementary one-parameter deformation of the limit of uniform separable permutations, previously identified as the Brownian separable permuton. This limiting object is therefore in some sense universal. We identify two other regimes with different limiting objects. The first one is degenerate; the second one is nontrivial and related to stable trees. These results are obtained thanks to a characterization of the convergence of random permutons through the convergence of their expected pattern densities. The limit of expected pattern densities is then computed by using the substitution tree encoding of permutations and performing singularity analysis on the tree series. (10.4171/JEMS/993)
    DOI : 10.4171/JEMS/993
  • Intensity fluctuations in random waveguides
    • Garnier Josselin
    Communications in Mathematical Sciences, International Press, 2020, 18 (4), pp.947-971. (10.4310/CMS.2020.v18.n4.a3)
    DOI : 10.4310/CMS.2020.v18.n4.a3
  • Wave Propagation in Randomly Perturbed Weakly Coupled Waveguides
    • Borcea Liliana
    • Garnier Josselin
    Multiscale Modeling and Simulation: A SIAM Interdisciplinary Journal, Society for Industrial and Applied Mathematics, 2020, 18 (1), pp.44-78. We present an analysis of wave propagation in a two step-index, parallel waveguide system. The goal is to quantify the effect of scattering at randomly perturbed interfaces between the guiding layers of high index of refraction and the host medium. The analysis is based on the expansion of the solution of the wave equation in a complete set of guided, radiation and evanescent modes with amplitudes that are random fields, due to scattering. We obtain a detailed characterization of these amplitudes and thus quantify the transfer of power between the two waveguides in terms of their separation distance. The results show that, no matter how small the fluctuations of the interfacesare, they have significant effect at sufficiently large distance of propagation, which manifests in two ways: The first effect is well known and consists of power leakage from the guided modes to the radiation ones. The second effect consists of blurring of the periodic transfer of power between the waveguides and the eventual equipartition of power. Its quantification is the main practical result ofthe paper. (10.1137/18M1230591)
    DOI : 10.1137/18M1230591
  • High-Resolution Interferometric Synthetic Aperture Imaging in Scattering Media
    • Borcea Liliana
    • Garnier Josselin
    SIAM Journal on Imaging Sciences, Society for Industrial and Applied Mathematics, 2020, 13 (1), pp.291-316. The goal of synthetic aperture imaging is to estimate the reflectivity of a remoteregion of interest by processing data gathered with a moving sensor which emits periodically a signaland records the backscattered wave. We introduce and analyze a high-resolution interferometric method for synthetic aperture imaging through an unknown scattering medium which distorts thewave. The method builds on the coherent interferometric (CINT) approach which uses empiricalcross-correlations of the measurements to mitigate the distortion, at the expense of a loss of resolutionof the image. The new method shows that, while mitigating the wave distortion, it is possible toobtain a robust and sharp estimate of the modulus of the Fourier transform of the reflectivity function.A high-resolution image can then be obtained by a phase retrieval algorithm. (10.1137/19M1272470)
    DOI : 10.1137/19M1272470
  • The tropicalization of the entropic barrier
    • Allamigeon Xavier
    • Aznag Abdellah
    • Gaubert Stéphane
    • Hamdi Yassine
    , 2020. The entropic barrier, studied by Bubeck and Eldan (Proc. Mach. Learn. Research, 2015), is a self-concordant barrier with asymptotically optimal self-concordance parameter. In this paper, we study the tropicalization of the central path associated with the entropic barrier, i.e., the logarithmic limit of this central path for a parametric family of linear programs defined over the field of Puiseux series. Our main result is that the tropicalization of the entropic central path is a piecewise linear curve which coincides with the tropicalization of the logarithmic central path studied by Allamigeon et al. (SIAM J. Applied Alg. Geom., 2018). One consequence is that the number of linear pieces in the tropical entropic central path can be exponential in the dimension and the number of inequalities defining the linear program.
  • Medical innovations to maintain the function in patients with chronic PJI for whom explantation is not desirable: a pathophysiology-, multidisciplinary-, and experience-based approach
    • Ferry Tristan
    • Batailler Cécile
    • Brosset Sophie
    • Kolenda Camille
    • Goutelle Sylvain
    • Sappey-Marinier Elliot
    • Josse Jérôme
    • Laurent Frédéric
    • Lustig Sébastien
    SICOT-J, EDP Open, 2020, 6, pp.26. Introduction: PJI is the most dramatic complication after joint arthroplasty. In patients with chronic infection, prosthesis exchange is in theory the rule. However, this surgical approach is sometimes not desirable especially in elderly patients with multiple comorbidities, as it could be associated with a dramatic loss of function, reduction of the bone stock, fracture, or peroperative death. We propose here to report different approaches that can help to maintain the function in such patients based on a pathophysiology-, multidisciplinary-, and an experience-based approach. Methods: We describe the different points that are needed to treat such patients: (i) the multidisciplinary care management; (ii) understanding the mechanism of bacterial persistence; (iii) optimization of the conservative surgical approach; (iv) use of suppressive antimicrobial therapy (SAT); (v) implementation of innovative agents that could be used locally to target the biofilm. Results: In France, a nation-wide network called CRIOAc has been created and funded by the French Health ministry to manage complex bone and joint infection. Based on the understanding of the complex pathophysiology of PJI, it seems to be feasible to propose conservative surgical treatment such as “debridement antibiotics and implant retention” (with or without soft-tissue coverage) followed by SAT to control the disease progression. Finally, there is a rational for the use of particular agents that have the ability to target the bacteria embedded in biofilm such as bacteriophages and phage lysins. Discussion: This multistep approach is probably a key determinant to propose innovative management in patients with complex PJI, to improve the outcome. Conclusion: Conservative treatment has a high potential in patients with chronic PJI for whom explantation is not desirable. The next step will be to evaluate such practices in nation-wide clinical trials. (10.1051/sicotj/2020021)
    DOI : 10.1051/sicotj/2020021
  • How a moving passive observer can perceive its environment ? The Unruh effect revisited
    • Fink Mathias
    • Garnier Josselin
    Wave Motion, Elsevier, 2020, 93, pp.102462. (10.1016/j.wavemoti.2019.102462)
    DOI : 10.1016/j.wavemoti.2019.102462
  • Multipoint formulas for scattered far field in multidimensions
    • Novikov Roman
    Inverse Problems, IOP Publishing, 2020, 36 (9), pp.095001(12 pp.). We give asymptotic formulas for finding the scattering amplitude at fixed frequency and angles (scattered far field) from the scattering wave function given at $n$ points in dimension $d\geq 2$. These formulas are explicit and their precision is proportional to $n$. To our knowledge these formulas are new already for $n\geq 2$. (10.1088/1361-6420/aba891)
    DOI : 10.1088/1361-6420/aba891
  • Support optimization in additive manufacturing for geometric and thermo-mechanical constraints
    • Allaire Grégoire
    • Bihr Martin
    • Bogosel Beniamin
    Structural and Multidisciplinary Optimization, Springer Verlag, 2020, 61, pp.2377-2399. Supports are often required to safely complete the building of complicated structures by additive manufacturing technologies. In particular, supports are used as scaffoldings to reinforce overhanging regions of the structure and/or are necessary to mitigate the thermal deformations and residual stresses created by the intense heat flux produced by the source term (typically a laser beam). However, including supports increase the fabrication cost and their removal is not an easy matter. Therefore, it is crucial to minimize their volume while maintaining their efficiency. Based on earlier works, we propose here some new optimization criteria. First, simple geometric criteria are considered like the projected area and the volume of supports required for overhangs: they are minimized by varying the structure orientation with respect to the baseplate. In addition, an accessibility criterion is suggested for the removal of supports, which can be used to forbid some parts of the structure to be supported. Second, shape and topology optimization of supports for compliance minimization is performed. The novelty comes from the applied surface loads which are coming either from pseudo gravity loads on overhanging parts or from equivalent thermal loads arising from the layer by layer building process. Here, only the supports are optimized, with a given non-optimizable structure, but of course many generalizations are possible, including optimizing both the structure and its supports. Our optimization algorithm relies on the level set method and shape derivatives computed by the Hadamard method. Numerical examples are given in 2-d and 3-d.
  • Uncertainty Quantification for Stochastic Approximation Limits Using Chaos Expansion
    • Crépey Stéphane
    • Fort Gersende
    • Gobet Emmanuel
    • Stazhynski Uladzislau
    SIAM/ASA Journal on Uncertainty Quantification, ASA, American Statistical Association, 2020, 8 (3), pp.1061–1089. The uncertainty quantification for the limit of a Stochastic Approximation (SA) algorithm is analyzed. In our setup, this limit $f^*$ is defined as a zero of an intractable function and is modeled as uncertain through a parameter $\theta$. We aim at deriving the function $f^*$, as well as the probabilistic distribution of $f^*(\theta)$ given a probability distribution $\pi$ for $\theta$. We introduce the so-called Uncertainty Quantification for SA (UQSA) algorithm, an SA algorithm in increasing dimension for computing the basis coefficients of a chaos expansion of $\theta \mapsto f^*(\theta)$ on an orthogonal basis of a suitable Hilbert space. UQSA, run with a finite number of iterations $K$, returns a finite set of coefficients, providing an approximation $\widehat{f^*_K}(\cdot)$ of $f^*$. We establish the almost-sure and $L^p$-convergences in the Hilbert space of the sequence of functions $\widehat{f^*_K}(\cdot)$ when the number of iterations $K$ tends to infinity. This is done under mild, tractable conditions, uncovered by the existing literature for convergence analysis of infinite dimensional SA algorithms. For a suitable choice of the Hilbert basis, the algorithm also provides an approximation of the expectation, of the variance-covariance matrix and of higher order moments of the quantity $\widehat{f^*_K}(\theta)$ when $\theta$ is random with distribution $\pi$. UQSA is illustrated and the role of its design parameters is discussed numerically. (10.1137/18M1178517)
    DOI : 10.1137/18M1178517
  • A MOMENT CLOSURE BASED ON A PROJECTION ON THE BOUNDARY OF THE REALIZABILITY DOMAIN: 1D CASE
    • Pichard Teddy
    Kinetic and Related Models, AIMS, 2020, 13 (6), pp.1243-1280. This work aims to develop and test a projection technique for the construction of closing equations of moment systems. One possibility to define such a closure consists in reconstructing an underlying kinetic distribution from a vector of moments, then expressing the closure based on this reconstructed function. Exploiting the geometry of the realizability domain, i.e. the set of moments of positive distribution function, we decompose any realizable vectors into two parts, one corresponding to the moments of a chosen equilibrium function, and one obtain by a projection onto the boundary of the realizability domain in the direction of equilibrium function. A realizable closure of both of these parts are computed with standard techniques providing a realizable closure for the full system. This technique is tested for the reduction of a radiative transfer equation in slab geometry. (10.3934/xx.xx.xx.xx)
    DOI : 10.3934/xx.xx.xx.xx
  • A second order analysis of McKean-Vlasov semigroups
    • Arnaudon Marc
    • del Moral Pierre
    The Annals of Applied Probability, Institute of Mathematical Statistics (IMS), 2020. We propose a second order differential calculus to analyze the regularity and the stability properties of the distribution semigroup associated with McKean-Vlasov diffusions. This methodology provides second order Taylor type expansions with remainder for both the evolution semigroup as well as the stochastic flow associated with this class of nonlinear diffusions. Bismut-Elworthy-Li formulae for the gradient and the Hessian of the integro-differential operators associated with these expansions are also presented. The article also provides explicit Dyson-Phillips expansions and a refined analysis of the norm of these integro-differential operators. Under some natural and easily verifiable regularity conditions we derive a series of exponential decays inequalities with respect to the time horizon. We illustrate the impact of these results with a second order extension of the Alekseev-Gröbner lemma to nonlinear measure valued semigroups and interacting diffusion flows. This second order perturbation analysis provides direct proofs of several uniform propagation of chaos properties w.r.t. the time parameter, including bias, fluctuation error estimate as well as exponential concentration inequalities. (10.1214/20-AAP1568)
    DOI : 10.1214/20-AAP1568
  • Problem and Non-Problem Gamblers: A Cross-Sectional Clustering Study by Gambling Characteristics
    • Guillou-Landréat Morgane
    • Chereau Boudet Isabelle
    • Perrot Bastien
    • Romo Lucia
    • Codina Irene
    • Magalon David
    • Fatseas Melina
    • Luquiens Amandine
    • Brousse Georges
    • Challet-Bouju Gaëlle
    • Grall-Bronnec Marie
    BMJ Open, BMJ Publishing Group, 2020, 10 (2), pp.e030424. OBJECTIVES: Gambling characteristics are factors that could influence problem gambling development. The aim of this study was to identify a typology of gamblers to frame risky behaviour based on gambling characteristics (age of initiation/of problem gambling, type of gambling: pure chance/chance with pseudoskills/chance with elements of skill, gambling online/offline, amount wagered monthly) and to investigate clinical factors associated with these different profiles in a large representative sample of gamblers. DESIGN AND SETTING: The study is a cross-sectional analysis to the baseline data of the french JEU cohort study (study protocol : Challet-Bouju et al, 2014). Recruitment (April 2009 to September 2011) involved clinicians and researchers from seven institutions that offer care for or conduct research on problem gamblers (PG). Participants were recruited in gambling places, and in care centres. Only participants who reported gambling in the previous year between 18 and 65 years old were included.Participants gave their written informed consent, it was approved by the French Research Ethics Committee. PARTICIPANTS: The participants were 628 gamblers : 256 non-problem gamblers (NPG), 169 problem gamblers without treatment (PGWT) and 203 problem gamblers seeking treatment (PGST). RESULTS: Six clustering models were tested, the one with three clusters displayed a lower classification error rate (7.92%) and was better suited to clinical interpretation : 'Early Onset and Short Course' (47.5%), 'Early Onset and Long Course' (35%) and 'Late Onset and Short Course' (17.5%). Gambling characteristics differed significantly between the three clusters. CONCLUSIONS: We defined clusters through the analysis of gambling variables, easy to identify, by psychiatrists or by physicians in primary care. Simple screening concerning these gambling characteristics could be constructed to prevent and to help PG identification. It is important to consider gambling characteristics : policy measures targeting gambling characteristics may reduce the risk of PG or minimise harm from gambling. TRIAL REGISTRATION NUMBER: NCT01207674 (ClinicalTrials.gov); Results. (10.1136/bmjopen-2019-030424)
    DOI : 10.1136/bmjopen-2019-030424