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.

2025

  • Parameters estimation of a Threshold CKLS process from continuous and discrete observations
    • Mazzonetto Sara
    • Nieto Benoît
    Scandinavian Journal of Statistics, Wiley, 2025, 52 (4), pp.1670-1707. We consider a continuous time process that is self-exciting and ergodic, called threshold Chan–Karolyi–Longstaff–Sanders (CKLS) process. This process is a generalization of various models in econometrics, such as Vasicek model, Cox-Ingersoll-Ross, and Black-Scholes, allowing for the presence of several thresholds which determine changes in the dynamics. We study the asymptotic behavior of maximum-likelihood and quasi-maximum-likelihood estimators of the drift parameters in the case of continuous time and discrete time observations. We show that for high frequency observations and infinite horizon the estimators satisfy the same asymptotic normality property as in the case of continuous time observations. We also discuss diffusion coefficient estimation. Finally, we apply our estimators to simulated and real data to motivate considering (multiple) thresholds. (10.1111/sjos.70005)
    DOI : 10.1111/sjos.70005
  • Dynamics of a kinetic model describing protein exchanges in a cell population
    • Magal Pierre
    • Raoul Gaël
    Journal of Mathematical Biology, Springer, 2025, 91 (6), pp.76. We consider a cell population structured by a positive real number, describing the number of P-glycoproteins carried by the cell. We are interested in the effect of those proteins on the growth of the population: those proteins are indeed involve in the resistance of cancer cells to chemotherapy drugs. To describe this dynamics, we introduce a kinetic model. We then introduce a rigorous hydrodynamic limit, showing that if the exchanges are frequent, then the dynamics of the model can be described by a system of two coupled differential equations. Finally, we also show that the kinetic model converges to a unique limit in large times. The main idea of this analysis is to use Wasserstein distance estimates to describe the effect of the kinetic operator, combined to more classical estimates on the macroscopic quantities. (10.1007/s00285-025-02295-w)
    DOI : 10.1007/s00285-025-02295-w
  • Universal complexity bounds based on value iteration for stochastic mean payoff games and entropy games
    • Allamigeon Xavier
    • Gaubert Stéphane
    • Katz Ricardo
    • Skomra Mateusz
    Information and Computation, Elsevier, 2025, 302, pp.105236. We develop value iteration-based algorithms to solve in a unified manner different classes of combinatorial zero-sum games with mean-payoff type rewards. These algorithms rely on an oracle, evaluating the dynamic programming operator up to a given precision. We show that the number of calls to the oracle needed to determine exact optimal (positional) strategies is, up to a factor polynomial in the dimension, of order R/sep, where the “separation” sep is defined as the minimal difference between distinct values arising from strategies, and R is a metric estimate, involving the norm of approximate sub and super-eigenvectors of the dynamic programming operator. We illustrate this method by two applications. The first one is a new proof, leading to improved complexity estimates, of a theorem of Boros, Elbassioni, Gurvich and Makino, showing that turn-based mean-payoff games with a fixed number of random positions can be solved in pseudo-polynomial time. The second one concerns entropy games, a model introduced by Asarin, Cervelle, Degorre, Dima, Horn and Kozyakin. The rank of an entropy game is defined as the maximal rank among all the ambiguity matrices determined by strategies of the two players. We show that entropy games with a fixed rank, in their original formulation, can be solved in polynomial time, and that an extension of entropy games incorporating weights can be solved in pseudo-polynomial time under the same fixed rank condition. (10.1016/j.ic.2024.105236)
    DOI : 10.1016/j.ic.2024.105236
  • A new approach for the unitary Dyson Brownian motion through the theory of viscosity solutions
    • Bertucci Charles
    • Pesce Valentin
    , 2025. In this paper, we study the unitary Dyson Brownian motion through a partial differential equation approach recently introduced for the real Dyson case. The main difference with the real Dyson case is that the spectrum is now on the circle and not on the real line, which leads to particular attention to comparison principles. First we recall why the system of particles which are the eigenvalues of unitary Dyson Brownian motion is well posed thanks to a containment function. Then we proved that the primitive of the limit spectral measure of the unitary Dyson Brownian motion is the unique solution to a viscosity equation obtained by primitive the Dyson equation on the circle. Finally, we study some properties of solutions of Dyson's equation on the circle. We prove a L ∞ regularization. We also look at the long time behaviour in law of a solution through a study of the so-called free entropy of the system. We conclude by discussing the uniform convergence towards the uniform measure on the circle of a solution of the Dyson equation.
  • Optimal Liquidation with Signals: the General Propagator Case
    • Abi Jaber Eduardo
    • Neuman Eyal
    Mathematical Finance, Wiley, 2025, 35 (4), pp.841–866. We consider a class of optimal liquidation problems where the agent's transactions create transient price impact driven by a Volterra-type propagator along with temporary price impact. We formulate these problems as minimization of a revenue-risk functionals, where the agent also exploits available information on a progressively measurable price predicting signal. By using an infinite dimensional stochastic control approach, we characterize the value function in terms of a solution to a free-boundary $L^2$-valued backward stochastic differential equation and an operator-valued Riccati equation. We then derive analytic solutions to these equations which yields an explicit expression for the optimal trading strategy. We show that our formulas can be implemented in a straightforward and efficient way for a large class of price impact kernels with possible singularities such as the power-law kernel.
  • Ergodic behavior of products of random positive operators
    • Ligonnière Maxime
    ALEA : Latin American Journal of Probability and Mathematical Statistics, Instituto Nacional de Matemática Pura e Aplicada (Rio de Janeiro, Brasil) [2006-....], 2025, XXII, pp.93-129. This article is devoted to the study of products of random operators of the form $M_{0,n}=M_0\cdots M_{n-1}$, where $(M_{n})_{n\geq 0}$ is an ergodic sequence of positive operators acting on the space of signed measures on some set $\XX$. Under suitable conditions, in particular, a Doeblin-type minoration suited for non conservative operators, we obtain asymptotic results of the form \[ \mu M_{0,n} \simeq \mu({h}) r_n \pi_n,\] for any positive measure $\mu$, where $\tilde{h}$ is a random bounded function, $(r_n)_{n\geq 0}$ is a random non negative sequence and $(\pi_n)$ is a random sequence of probability measures on $\XX$. Moreover, $\tilde{h}$, $(r_n)$ and $(\pi_n)$ do not depend on the choice of the measure $\mu$. We prove additionally that $n^{-1} \log (r_n)$ converges almost surely to the Lyapunov exponent $\lambda$ of the process $(M_{0,n})_{n\geq 0}$ and that the sequence of random probability measures $(\pi_n)$ converges weakly towards a random probability measure. These results are analogous to previous estimates from Hennion in the case of $d\times d$ matrices, that were obtained with different techniques, based on a projective contraction in Hilbert distance. In the case where the sequence $(M_n)$ is i.i.d, we additionally exhibit an expression of the Lyapunov exponent $\lambda$ as an integral with respect to the weak limit of the sequence of random probability measures $(\pi_n)$ and exhibit an oscillation behavior of $r_n$ and $\Vert \mu M_{0,n} \Vert$ when $\lambda=0$. We provide a detailed comparison of our assumptions with the ones of Hennion and present an example of application of our results to the modelling of an age structured population. (10.30757/ALEA.v22-03)
    DOI : 10.30757/ALEA.v22-03
  • Accelerating Nash Learning from Human Feedback via Mirror Prox
    • Tiapkin Daniil
    • Calandriello Daniele
    • Belomestny Denis
    • Moulines Eric
    • Naumov Alexey
    • Rasul Kashif
    • Valko Michal
    • Menard Pierre
    , 2025. Traditional Reinforcement Learning from Human Feedback (RLHF) often relies on reward models, frequently assuming preference structures like the Bradley-Terry model, which may not accurately capture the complexities of real human preferences (e.g., intransitivity). Nash Learning from Human Feedback (NLHF) offers a more direct alternative by framing the problem as finding a Nash equilibrium of a game defined by these preferences. In this work, we introduce Nash Mirror Prox ($\mathtt{Nash-MP}$), an online NLHF algorithm that leverages the Mirror Prox optimization scheme to achieve fast and stable convergence to the Nash equilibrium. Our theoretical analysis establishes that Nash-MP exhibits last-iterate linear convergence towards the $β$-regularized Nash equilibrium. Specifically, we prove that the KL-divergence to the optimal policy decreases at a rate of order $(1+2β)^{-N/2}$, where $N$ is a number of preference queries. We further demonstrate last-iterate linear convergence for the exploitability gap and uniformly for the span semi-norm of log-probabilities, with all these rates being independent of the size of the action space. Furthermore, we propose and analyze an approximate version of Nash-MP where proximal steps are estimated using stochastic policy gradients, making the algorithm closer to applications. Finally, we detail a practical implementation strategy for fine-tuning large language models and present experiments that demonstrate its competitive performance and compatibility with existing methods. (10.48550/arXiv.2505.19731)
    DOI : 10.48550/arXiv.2505.19731
  • Bridging multifluid and drift-diffusion models for bounded plasmas
    • Gangemi G M
    • Alvarez Laguna Alejandro
    • Massot M.
    • Hillewaert K.
    • Magin T.
    Physics of Plasmas, American Institute of Physics, 2025, 32 (2), pp.023502. Fluid models represent a valid alternative to kinetic approaches in simulating low-temperature discharges: a well-designed strategy must be able to combine the ability to predict a smooth transition from the quasineutral bulk to the sheath, where a space charge is built at a reasonable computational cost. These approaches belong to two families: multifluid models, where momenta of each species are modeled separately, and drift-diffusion models, where the dynamics of particles is dependent only on the gradient of particle concentration and on the electric force. It is shown that an equivalence between the two models exists and that it corresponds to a threshold Knudsen number, in the order of the square root of the electron-to-ion mass ratio; for an argon isothermal discharge, this value is given by a neutral background pressure Pn≳1000 Pa. This equivalence allows us to derive two analytical formulas for a priori estimation of the sheath width: the first one does not need any additional hypothesis but relies only on the natural transition from the quasineutral bulk to the sheath; the second approach improves the prediction by imposing a threshold value for the charge separation. The new analytical expressions provide better estimations of the floating sheath dimension in collisions-dominated regimes when tested against two models from the literature. (10.1063/5.0240640)
    DOI : 10.1063/5.0240640
  • Ergodic control of a heterogeneous population and application to electricity pricing
    • Jacquet Quentin
    • van Ackooij Wim
    • Alasseur Clémence
    • Gaubert Stéphane
    IEEE Transactions on Automatic Control, Institute of Electrical and Electronics Engineers, 2025. We consider a control problem for a heterogeneous population composed of agents able to switch at any time between different options. The controller aims to maximize an average gain per time unit, supposing that the population is of infinite size. This leads to an ergodic control problem for a “mean-field” Markov Decision Process in which the state space is a product of simplices, and the population evolves according to controlled linear dynamics. By exploiting contraction properties of the dynamics in Hilbert’s projective metric, we prove that the infinite-dimensional ergodic eigenproblem admits a solution and show that the latter is in general non unique. This allows us to obtain optimal strategies, and to quantify the gap between steady-state strategies and optimal ones. In particular, we prove in the one-dimensional case that there exist cyclic policies – alternating between discount and profit taking stages – which secure a greater gain than constant-price policies. On numerical aspects, we develop a policy iteration algorithm with “on-the-fly” generated transitions, specifically adapted to decomposable models, leading to substantial memory savings. We finally apply our results on realistic instances coming from an electricity pricing problem encountered in the retail markets, and numerically observe the emergence of cyclic promotions for sufficient inertia in the customer behavior.
  • Maxwell's equations with hypersingularities at a negative index material conical tip
    • Bonnet-Ben Dhia Anne-Sophie
    • Chesnel Lucas
    • Rihani Mahran
    Pure and Applied Analysis, Mathematical Sciences Publishers, 2025, 7 (1), pp.127–169. We study a transmission problem for the time harmonic Maxwell's equations between a classical positive material and a so-called negative index material in which both the permittivity ε and the permeability µ take negative values. Additionally, we assume that the interface between the two domains is smooth everywhere except at a point where it coincides locally with a conical tip. In this context, it is known that for certain critical values of the contrasts in ε and in µ, the corresponding scalar operators are not of Fredholm type in the usual H^1 spaces. In this work, we show that in these situations, the Maxwell's equations are not well-posed in the classical L^2 framework due to existence of hypersingular fields which are of infinite energy at the tip. By combining the T-coercivity approach and the Kondratiev theory, we explain how to construct new functional frameworks to recover well-posedness of the Maxwell's problem. We also explain how to select the setting which is consistent with the limiting absorption principle. From a technical point of view, the fields as well as their curls decompose as the sum of an explicit singular part, related to the black hole singularities of the scalar operators, and a smooth part belonging to some weighted spaces. The analysis we propose rely in particular on the proof of new key results of scalar and vector potential representations of singular fields.
  • Macroscopic limit from a structured population model to the Kirkpatrick-Barton model
    • Raoul Gaël
    Bulletin des Sciences Mathématiques, Elsevier, 2025, 205, pp.103697. We consider an ecology model in which the population is structured by a spatial variable and a phenotypic trait. The model combines a parabolic operator on the spatial variable with a kinetic operator on the trait variable. We prove the existence of solutions to that model, and show that these solutions are unique. The kinetic operator present in the model, that represents the effect of sexual reproductions, satisfies a Tanaka-type inequality: it implies a contraction of the Wasserstein distance in the space of phenotypic traits. We combine this contraction argument with parabolic estimates controlling the spatial regularity of solutions to prove the convergence of the population size and the mean phenotypic trait to solutions of the Kirkpatrick-Barton model, which is a well-established model in evolutionary ecology. Specifically, at high reproductive rates, we provide explicit convergence estimates for the moments of solutions of the kinetic model. (10.48550/arXiv.1706.04094)
    DOI : 10.48550/arXiv.1706.04094
  • From Stochastic Zakharov System to Multiplicative Stochastic Nonlinear Schrödinger Equation
    • Barrué Grégoire
    • de Bouard Anne
    • Debussche Arnaud
    Stochastics and Partial Differential Equations: Analysis and Computations, Springer US, 2025, pp.1-40. We study the convergence of a Zakharov system driven by a time white noise, colored in space, to a multiplicative stochastic nonlinear Schrödinger equation, as the ion-sound speed tends to infinity. In the absence of noise, the conservation of energy gives bounds on the solutions, but this evolution becomes singular in the presence of the noise. To overcome this difficulty, we show that the problem may be recasted in the diffusion-approximation framework, and make use of the perturbed test-function method. We also obtain convergence in probability. The result is limited to dimension one, to avoid too much technicalities. As a prerequisite, we prove the existence and uniqueness of regular solutions of the stochastic Zakharov system.
  • Kinetic theory and moment models of electrons in a reactive weakly-ionized non-equilibrium plasma
    • Laguna Alejandro Alvarez
    • Pichard Teddy
    Kinetic and Related Models, AIMS, 2025. <div><p>We study the electrons in a multi-component weakly-ionized plasma with an external electric field under conditions that are far from thermodynamic equilibrium, representative of a gas discharge plasma. Our starting point is the generalized Boltzmann equation with elastic, inelastic and reactive collisions. We perform a dimensional analysis of the equation and an asymptotic analysis of the collision operators for small electron-to-atom mass ratios and small ionization levels. The dimensional analysis leads to a diffusive scaling for the electron transport. We perform a Hilbert expansion of the electron distribution function that, in the asymptotic limit, results in a reduced model characterized by a spherically symmetric distribution function in the velocity space with a small anisotropic perturbation. We show that the spherical-harmonics expansion model, widely used in low-temperature plasmas, is a particular case of our approach. We approximate the solution of our kinetic model with a truncated moment hierarchy. Finally, we study the moment problem for a particular case: a Langevin collision (equivalent to Maxwell molecules) for the electron-gas elastic collisions. The resulting Stieltjes moment problem leads to an advection-diffusion-reaction system of equations that is approximated with two different closures: the quadrature method of moments and a Hermitian moment closure. A special focus is given along the derivations and approximations to the notion of entropy dissipation.</p></div> (10.3934/krm.2025007)
    DOI : 10.3934/krm.2025007
  • An analysis of the noise schedule for score-based generative models
    • Strasman Stanislas
    • Ocello Antonio
    • Boyer Claire
    • Le Corff Sylvain
    • Lemaire Vincent
    Transactions on Machine Learning Research Journal, [Amherst Massachusetts]: OpenReview.net, 2022, 2025. Score-based generative models (SGMs) aim at estimating a target data distribution by learning score functions using only noise-perturbed samples from the target. Recent literature has focused extensively on assessing the error between the target and estimated distributions, gauging the generative quality through the Kullback-Leibler (KL) divergence and Wasserstein distances. Under mild assumptions on the data distribution, we establish an upper bound for the KL divergence between the target and the estimated distributions, explicitly depending on any time-dependent noise schedule. Under additional regularity assumptions, taking advantage of favorable underlying contraction mechanisms, we provide a tighter error bound in Wasserstein distance compared to state-of-the-art results. In addition to being tractable, this upper bound jointly incorporates properties of the target distribution and SGM hyperparameters that need to be tuned during training. Finally, we illustrate these bounds through numerical experiments using simulated and CIFAR-10 datasets, identifying an optimal range of noise schedules within a parametric family.
  • Development of a rabbit model of uterine rupture after caesarean section, Histological, biomechanical and polarimetric analysis of the uterine tissue
    • Debras Elodie
    • Maudot Constance
    • Allain Jean-Marc
    • Pierangelo Angelo
    • Courilleau Aymeric
    • Rivière Julie
    • Dahirel Michèle
    • Richard Christophe
    • Gelin Valérie
    • Morin Gwendoline
    • Capmas Perrine
    • Chavatte-Palmer Pascale
    Reproduction & Fertility, Bioscientifica Ltd, 2025. Uterine rupture is a major complication of caesarean section (CS) associated with a high foetal and maternal morbidity. The objective is to develop an in-vivo model of uterus healing and rupture after CS in order to analyse histological phenomena controlling scarring tissue development and potential cause of defects. Eighteen pregnant primiparous female rabbits were bred naturally. At caesarean, after 28 days of gestation, foetuses were either extracted through a longitudinal incision in one of the uterine horns (“CS horn”) or via a short incision at the tip of the contralateral horn (“control horn”). The uterine horns were sutured by single layer, all by the same surgeon. They were mated again 14 days later and euthanized at G28. Genital tracts were collected for histological, biomechanical and polarimetric analyses. Macroscopically, 2/18 presented a dehiscence and 1/18 a spontaneous rupture. The mean thickness of the scarred area was significantly lower 0.9 mm [0.7-1.4] that the non-scarring area on CS horns 2.2 [1.6-2.3] or control horns 2 [1.5-2.3] (p&lt;0.0001). The scar zone was statistically more fibrous (p&lt;0.0001), containing fewer vessels (p=0.03) and oestrogen (p&lt;0.001) and progesterone receptors (p&lt;0.0001). After balloon inflation, ruptured occurred in the scar zone in 8 out of 17 cases (47%). Polarimetry revealed that the scar zone was statistically inhomogeneous (73%). Multifactorial analysis allowed to identify groups with poor uterine healing and less resistant to rupture (balloon inflation) mostly in case of thin myometrium in the scar and a group with strong resistant to rupture and correct healing characteristics. Lay summary Caesarean section rates are rising across the world. When a caesarean section is carried out, it can lead to scarring on the uterus that can affect its resistance to pressure. During the next pregnancy, the uterus can tear, increasing risks to the mother and baby. We carried out caesarean sections in a rabbit, allowing us to analyse the scar on the uterus, the healing and tissue resistance. The scarred part of the uterus was statistically thinner, more fibrous and contained fewer vessels and hormone receptors than the area without scarring. Under similar conditions, poor healing was observed in some animals, reducing resistance in following pregnancies. These results suggest that individual and genetic factor have an effect on healing after a caesarean section. This study may enable us to improve our knowledge and management care for patients who have a caesarean section in order to reduce complications. (10.1530/raf-25-0018)
    DOI : 10.1530/raf-25-0018
  • Solving inverse source wave problem from Carleman estimates to observer design
    • Boulakia Muriel
    • de Buhan Maya
    • Delaunay Tiphaine
    • Imperiale Sébastien
    • Moireau Philippe
    Mathematical Control and Related Fields, AIMS, 2025. In this work, we are interested by the identification in a wave equation of a space dependent source term multiplied by a known time and space dependent function, from internal velocity or field measurements. The first part of the work consists in proving stability inequalities associated with this inverse problem from adapted Carleman estimates. Then, we present a sequential reconstruction strategy which is proved to be equivalent to the minimization of a cost functional with Tikhonov regularization. Based on the obtained stability estimates, the reconstruction error is evaluated with respect to the noise intensity. Finally, the proposed method is illustrated with numerical simulations, both in the case of regular source terms and of piecewise constant source terms. (10.3934/mcrf.2025007)
    DOI : 10.3934/mcrf.2025007
  • Taking Advantage of Multiple Scattering for Optical Reflection Tomography
    • Wasik Thomas
    • Barolle Victor
    • Aubry Alexandre
    • Garnier Josselin
    , 2025. <div><p>Optical Diffraction Tomography (ODT) is a powerful non-invasive imaging technique widely used in biological and medical applications. While significant progress has been made in transmission configuration, reflection ODT remains challenging due to the ill-posed nature of the inverse problem. We present a novel optimization algorithm for 3D refractive index (RI) reconstruction in reflection-mode microscopy. Our method takes advantage of the multiply-scattered waves that are reflected by uncontrolled background structures and that illuminate the foreground RI from behind. It tackles the ill-posed nature of the problem using weighted time loss, positivity constraints and Total Variation regularization. We have validated our method with data generated by detailed 2D and 3D simulations, demonstrating its performance under weak multiple scattering conditions and with simplified forward models used in the optimization routine for computational efficiency.</p><p>In addition, we highlight the need for multi-wavelength analysis and the use of regularization to ensure the reconstruction of the low spatial frequencies of the foreground RI.</p></div>
  • A stochastic use of the Kurdyka-Lojasiewicz property: Investigation of optimization algorithms behaviours in a non-convex differentiable framework
    • Fest Jean-Baptiste
    • Repetti Audrey
    • Chouzenoux Emilie
    Foundations of Data Science, American Institute of Mathematical Sciences, 2025. Asymptotic analysis of generic stochastic algorithms often relies on descent conditions. In a convex setting, some technical shortcuts can be considered to establish asymptotic convergence guarantees of the associated scheme. However, in a non-convex setting, obtaining similar guarantees is usually more complicated, and relies on the use of the Kurdyka-Łojasiewicz (KŁ) property. While this tool has become popular in the field of deterministic optimization, it is much less widespread in the stochastic context and the few works making use of it are essentially based on trajectory-by-trajectory approaches. In this paper, we propose a new framework for using the KŁ property in a non-convex stochastic setting based on conditioning theory. We show that this framework allows for deeper asymptotic investigations on stochastic schemes verifying some generic descent conditions. We further show that our methodology can be used to prove convergence of generic stochastic gradient descent (SGD) schemes, and unifies conditions investigated in multiple articles of the literature.
  • Adaptive Destruction Processes for Diffusion Samplers
    • Gritsaev Timofei
    • Morozov Nikita
    • Tamogashev Kirill
    • Tiapkin Daniil
    • Samsonov Sergey
    • Naumov Alexey
    • Vetrov Dmitry
    • Malkin Nikolay
    , 2025. This paper explores the challenges and benefits of a trainable destruction process in diffusion samplers -- diffusion-based generative models trained to sample an unnormalised density without access to data samples. Contrary to the majority of work that views diffusion samplers as approximations to an underlying continuous-time model, we view diffusion models as discrete-time policies trained to produce samples in very few generation steps. We propose to trade some of the elegance of the underlying theory for flexibility in the definition of the generative and destruction policies. In particular, we decouple the generation and destruction variances, enabling both transition kernels to be learned as unconstrained Gaussian densities. We show that, when the number of steps is limited, training both generation and destruction processes results in faster convergence and improved sampling quality on various benchmarks. Through a robust ablation study, we investigate the design choices necessary to facilitate stable training. Finally, we show the scalability of our approach through experiments on GAN latent space sampling for conditional image generation. (10.48550/arXiv.2506.01541)
    DOI : 10.48550/arXiv.2506.01541
  • Efficient treatment of the model error in the calibration of computer codes: the Complete Maximum a Posteriori method
    • Kahol Omar
    • Congedo Pietro Marco
    • Le Maitre Olivier
    • Denimal Goy Enora
    International Journal for Uncertainty Quantification, Begell House Publishers, 2025. <div><p>Computer models are widely used for the prediction of complex physical phenomena. Based on observations of these physical phenomena, it is possible to calibrate the model parameters. In most cases, such computer models are mis-specified, and the calibration process must be improved by including a model error term. The model error hyperparameters are, however, rarely learned jointly with the model parameters to reduce the dimensionality of the problem. Sequential and non-sequential approaches have been introduced to estimate the hyperparameters. The former, such as the Kennedy and O'Hagan (KOH) framework, estimates the model error hyperparameters before calibrating the model parameters. The latter, such as the Full Maximum a Posteriori (FMP), introduces a functional dependence between the model parameters and the model error hyperparameters. Despite being more reliable in some cases (bimodality e.g.), the FMP method still fails to estimate correctly the posterior distribution shape. This work proposes a new methodology for treating the model error term in computer code calibration. It builds upon the KOH and FMP framework. Called the Complete Maximum a Posteriori (CMP) method, it provides a closed-form expression for the marginalization integral over the model error hyperparameters, significantly reducing the dimensionality of the calibration problem. Such expression re- lies on a set of assumptions that are more general and less stringent than the ones usually employed. The CMP method is applied to four examples of increasing complexity, from elementary to real fluid dynamics problems, including or not bimodality. Compared to the true reference solution and unlike the KOH and FMP, the CMP method correctly captures the shape of the posterior distribution, including all modes and their weights. Moreover, it provides an accurate estimate of the distribution tails</p></div> (10.1615/Int.J.UncertaintyQuantification.2025056317)
    DOI : 10.1615/Int.J.UncertaintyQuantification.2025056317
  • PSWF-Radon approach to reconstruction from band-limited Hankel transform
    • Goncharov Fedor
    • Isaev Mikhail
    • Novikov Roman
    • Zaytsev Rodion
    Applied and Computational Harmonic Analysis, Elsevier, 2025. We give new formulas for reconstructions from band-limited Hankel transform of integer or half-integer order. Our formulas rely on the PSWF-Radon approach to super-resolution in multidimensional Fourier analysis. This approach consists of combining the theory of classical one-dimensional prolate spheroidal wave functions with the Radon transform theory. We also use the relation between Fourier and Hankel transforms and Cormack-type inversion of the Radon transform. Finally, we investigate numerically the capabilities of our approach to super-resolution for band-limited Hankel inversion in relation to varying levels of noise.
  • Inverse scattering for the multipoint potentials of Bethe-Peierls-Thomas-Fermi type
    • Kuo Pei-Cheng
    • Novikov Roman
    Inverse Problems, IOP Publishing, 2025, 41 (6), pp.065021. <div><p>We consider the Schrödinger equation with a multipoint potential of the Bethe-Peierls-Thomas-Fermi type. We show that such a potential in dimension d = 2 or d = 3 is uniquely determined by its scattering amplitude at a fixed positive energy. Moreover, we show that there is no non-zero potential of this type with zero scattering amplitude at a fixed positive energy and a fixed incident direction. Nevertheless, we also show that a multipoint potential of this type is not uniquely determined by its scattering amplitude at a positive energy E and a fixed incident direction. Our proofs also contribute to the theory of inverse source problem for the Helmholtz equation with multipoint source.</p></div> (10.1088/1361-6420/ade282)
    DOI : 10.1088/1361-6420/ade282
  • ExceedGAN: Simulation above extreme thresholds using Generative Adversarial Networks
    • Allouche Michaël
    • Girard Stéphane
    • Gobet Emmanuel
    Extremes, Springer Verlag (Germany), 2025. This paper devises a novel neural-inspired approach for simulating multivariate extremes. Specifically, we propose a GAN-based generative model for sampling multivariate data exceeding large thresholds, giving rise to what we refer to as the ExceedGAN algorithm. Our approach is based on approximating marginal log-quantile functions using feedforward neural networks with eLU activation functions specifically introduced for bias correction. An error bound is provided {on the margins}, assuming a $J$th order condition from extreme value theory. The numerical experiments illustrate that ExceedGAN outperforms competitors, both on synthetic and real-world data sets.
  • Byzantine-Robust Gossip: Insights from a Dual Approach
    • Gaucher Renaud
    • Dieuleveut Aymeric
    • Hendrikx Hadrien
    , 2025. Distributed learning has many computational benefits but is vulnerable to attacks from a subset of devices transmitting incorrect information. This paper investigates Byzantine resilient algorithms in a decentralized setting, where devices communicate directly in a peer-to-peer manner within a communication network. We leverage the so-called dual approach for decentralized optimization and propose a Byzantine-robust algorithm. We provide convergence guarantees in the average consensus subcase, discuss the potential of the dual approach beyond this subcase, and re-interpret existing algorithms using the dual framework. Lastly, we experimentally show the soundness of our method.
  • Long time behavior of a degenerate stochastic system modeling the response of a population face to environmental impacts
    • Collet Pierre
    • Ecotière Claire
    • Méléard Sylvie
    Electronic Communications in Probability, Institute of Mathematical Statistics (IMS), 2025, 30 (none). We study the asymptotics of a two-dimensional stochastic differential system with a degenerate diffusion matrix. This system describes the dynamics of a population where individuals contribute to the degradation of their environment through two different behaviors. We exploit the almost one-dimensional form of the dynamical system to compute explicitly the Freidlin-Wentzell action functional. That allows to give conditions under which the small noise regime of the invariant measure is concentrated around the equilibrium of the dynamical system having the smallest diffusion coefficient. (10.1214/24-ECP650)
    DOI : 10.1214/24-ECP650