Séminaire de mathématiques appliquées (archives)

Alexandre Pasco
Etablissement de l'orateur
LMJL
Date et heure de l'exposé
Lieu de l'exposé
Salle des Séminaires
Résumé de l'exposé

We consider the problem of state estimation from $m$ linear measurements, where the state $u$ to recover is an element of the manifold $\mathcal{M}$ of solutions of a parameter-dependent equation. The state is estimated using a prior knowledge on $\mathcal{M}$ coming from model order reduction. Variational approaches based on linear approximation of $\mathcal{M}$ yields a recovery error li-mited by the Kolmogorov $m$-width of $\mathcal{M}$. To overcome this issue, piecewise-affine approximations of $\mathcal{M}$ have also be considered, that consist in using a library of linear spaces among which one is selected by minimizing some distance to $\mathcal{M}$. In this work, we propose a state estimation method relying on dictionary-based model reduction, where a space is selected from a library generated by a dictionary of snapshots, using a distance to the manifold. The selection is performed among a set of candidate spaces obtained from the path of a $\ell_1$-regularized least-squares problem. Then, in the framework of parameter-dependent operator equations (or PDEs) with affine parameterizations, we provide an efficient offline-online decomposition based on randomized linear algebra, that ensures efficient and stable computations while preserving theoretical guarantees.

References: https://arxiv.org/abs/2303.10771

Lucile Laulin
Etablissement de l'orateur
LMJL
Date et heure de l'exposé
Lieu de l'exposé
Salle des Séminaires
Résumé de l'exposé

La marche aléatoire de l'éléphant (ERW) est une marche aléatoire discrète qui a été introduite au début des années 2000 par deux physiciens afin d'étudier l’influence d’un paramètre de mémoire sur le comportement de la marche aléatoire. Dans cet exposé, on présentera plusieurs possibilités pour étudier et obtenir des résultats sur l’ERW. On s’intéressera à l’approche martingale, puis au lien avec les urnes de Polya ou encore avec les arbres aléatoires récursifs. En particulier, on expliquera comment l’utilisation des trois approches est nécessaire pour obtenir des informations sur la variable aléatoire limite qui apparaît dans le régime super-diffusif.

Matthieu Dolbeault
Etablissement de l'orateur
Laboratoire Jacques-Louis Lions, Sorbonne Université
Date et heure de l'exposé
Lieu de l'exposé
Salle des Séminaires
Résumé de l'exposé

Abstract

In this talk, we investigate sampling strategies for approximation of functions by weighted least-squares. Although a quasilinear sampling budget can already be achieved by iid random draws according to the adapted density [3], further reductions of the needed number of points are possible [2, 4], achieving provable performance estimates thanks to the solution to the Kadison-Singer problem [6]. However this involves a subsampling step, which is not algorithmically tractable. We show how greedy sampling methods [1, 5] can circumvent this defect, while attaining optimal sample sizes.

References

[1] J. Batson, D. A. Spielman, and N. Srivastava. “Twice-ramanujan spar- sifiers”. In: SIAM Journal on Computing 41.6 (2012).

[2] A. Cohen and M. Dolbeault. “Optimal pointwise sampling for L2 ap- proximation”. In: Journal of Complexity 68 (2022), p. 101602.

[3] A. Cohen and G. Migliorati. “Optimal weighted least-squares methods”. In: SMAI J. Comput. Math. 3 (2017), pp. 181–203.

[4] C. Haberstich, A. Nouy, and G. Perrin. “Boosted optimal weighted least- squares”. In: Math. Comp. 91.335 (2022), pp. 1281–1315.

[5] Y. T. Lee and H. Sun. “Constructing linear-sized spectral sparsification in almost-linear time”. In: SIAM J. Comput. 47.6 (2018), pp. 2315–2336.

[6] A. W. Marcus, D. A. Spielman, and N. Srivastava. “Interlacing families II: Mixed characteristic polynomials and the Kadison-Singer problem”. In: Ann. of Math. (2) 182.1 (2015), pp. 327–350.

André Harnist
Etablissement de l'orateur
INRIA PARIS
Date et heure de l'exposé
Lieu de l'exposé
Salle des séminaires
Résumé de l'exposé

In this talk, we present a posteriori estimates for finite element approximations of nonlinear elliptic problems satisfying strong-monotonicity and Lipschitz-continuity properties. These estimates include, and build on, any iterative linearization method that satisfies a few clearly identified assumptions; this includes the Picard, Newton, and Zarantonello linearizations. The estimates give a guaranteed upper bound on an augmented energy difference reliability with constant one, as well as a lower bound efficiency up to a generic constant. We prove that for the Zarantonello linearization, this generic constant only depends on the space dimension, the mesh shape regularity, and possibly the approximation polynomial degree in four or more space dimensions, making the estimates robust with respect to the strength of the nonlinearity. For the other linearizations, there is only a local and computable dependence on the nonlinearity. Numerical experiments illustrate and validate the theoretical results, for both smooth and singular solutions.

Angèle Niclas
Etablissement de l'orateur
Ecole polytechnique, CMAP
Date et heure de l'exposé
Lieu de l'exposé
Salle des séminaires
Résumé de l'exposé

This talk aims at introducing a new multi-frequency method to reconstruct width defects in waveguides. Different inverse methods already exist. However, those methods are not using some frequencies, called resonant frequencies, where propagation equations are known to be ill-conditioned. Since waves seem very sensible to defects at these particular frequencies, we exploit them instead. After studying the forward problem at these resonant frequencies, we approximate the wavefield and focus on the inverse problem. Given partial wavefield measurements, we reconstruct slowly varying width defects in a stable and precise way and provide numerical validations and comparisons with existing methods.

Wojciech Reise
Etablissement de l'orateur
DataShape (Inria) et Laboratoire de Mathématiques d'Orsay
Date et heure de l'exposé
Lieu de l'exposé
Salle des Séminaires
Résumé de l'exposé

Abstract

A method for constructing signatures of random reparametrizations of periodic functions is presented.

The proposed signatures are functions, which contain information about the height and order of local extrema of the observation. In contrast to other statistical methods for reparametrized curves, the observations can be of different lengths and the construction does not involve aligning them.

The signature is shown to be stable with respect to changes in the distribution of reparametrizations and to enjoy standard CLT properties, including in the case of dependent observations.

The positioning of a vehicle based on magnetic signals is the industrial application which motivated this work.

Ongoing work with Frédéric Chazal and Bertrand Michel.

References

  1. Berry, E., Chen, Y.-C., Cisewski-Kehe, J. & Fasy, B. T. Functional Summaries of Persistence Diagrams. <arXiv:1804.01618> [stat] (2018).
  2. Bristeau, P.-J. Techniques d’estimation du déplacement d’un véhicule sans GPS et autres exemples de conception de systèmes de navigation MEMS. (2012).
  3. Chazal, F., Fasy, B. T., Lecci, F., Rinaldo, A. & Wasserman, L. Stochastic Convergence of Persistence Landscapes and Silhouettes. in Annual Symposium on Computational Geometry - SOCG’14 474–483 (ACM Press, 2014). doi:10.1145/2582112.2582128.
  4. Kosorok, M. R. Introduction to Empirical Processes and Semiparametric Inference. (Springer New York, 2008). doi:10.1007/978-0-387-74978-5.
  5. Perez, D. On C0-persistent homology and trees. 41 (2022).
  6. Chazal F, Michel B. An Introduction to Topological Data Analysis: Fundamental and Practical Aspects for Data Scientists. Front Artif Intell. 2021 Sep 29;4:667963. doi: <10.3389/frai.2021.667963>. PMID: 34661095; PMCID: PMC8511823.
Kathrin Smetana
Etablissement de l'orateur
Stevens Institute of Technology
Date et heure de l'exposé
Lieu de l'exposé
Salle des séminaires and Remotely on Zoom
Résumé de l'exposé

Heterogeneous problems that take place at multiple scales are ubiquitous in science and engineering. Examples are wind turbines made from composites or groundwater flow relevant e.g., for the design of flood prevention measures. However, finite element or finite volume methods require an often prohibitively large amount of computational time for such tasks. Multiscale methods that are based on ansatz functions which incorporate the local behavior of the (numerical) solution of the partial differential equations (PDEs) have been developed to tackle these heterogeneous problems. Localizable multiscale methods that allow controlling the error due to localization and the (global) approximation error at a (quasi-optimal) rate and do not rely on structural assumptions such as scale separation or periodicity have only been developed within the last decade. Here, localizable multiscale methods allow the efficient construction of the basis functions by solving the PDE (in parallel) on several small subdomains at low cost.

While there has been a significant progress in recent years for these types of multiscale methods for linear PDEs, very few results have been obtained so far for nonlinear PDEs. In this talk, we will show how randomized methods and their probabilistic numerical analysis can be exploited for the construction and numerical analysis of such types of multiscale methods for nonlinear PDEs.

Anouar Meynaoui
Etablissement de l'orateur
IRMAR
Date et heure de l'exposé
Lieu de l'exposé
Salle des Séminaires
Résumé de l'exposé

Dependence measures based on reproducing kernel Hilbert spaces, also known as Hilbert-Schmidt Independence Criterion and denoted HSIC, are widely used to statistically decide whether or not two random vectors are dependent. Recently, non-parametric HSIC-based statistical tests of independence have been performed. However, these tests lead to the question of the choice of the kernels associated to the HSIC. In particular, there is as yet no method to objectively select specific kernels with theoretical guarantees in terms of first and second kind errors. One of the main contributions of this work is to develop a new HSIC-based aggregated procedure which avoids such a kernel choice, and to provide theoretical guarantees for this procedure. To achieve this, we first introduce non-asymptotic single tests based on Gaussian kernels with a given bandwidth, which are of prescribed level $\alpha \in (0,1)$. From a theoretical point of view, we upper-bound their uniform separation rate of testing over Sobolev and Nikol'skii balls. Then, we aggregate several single tests, and obtain similar upper-bounds for the uniform separation rate of the aggregated procedure over the same regularity spaces. Another main contribution is that we provide a lower-bound for the non-asymptotic minimax separation rate of testing over Sobolev balls, and deduce that the aggregated procedure is adaptive in the minimax sense over such regularity spaces. Finally, from a practical point of view, we perform numerical studies in order to assess the efficiency of our aggregated procedure and compare it to existing independence tests in the literature.

References:

-> This presentation will be based on the paper :

Adaptive test of independence based on HSIC measures (https://arxiv.org/abs/1902.06441)

-> To be prepared :

  • First part of the talk deals with optimality of non parametric independence statistical tests, see Sections 0.1 and 0.2 of the PhD thesis of Melisande Albert

https://perso.math.univ-toulouse.fr/albert/files/2016/11/These-malbert.pdf

  • Second part of the talk deals with kernel based measures of independence, see

Measuring Statistical Dependence with Hilbert-Schmidt Norms (https://is.mpg.de/publications/3774)

Maxime Herda
Etablissement de l'orateur
Inria Lille
Date et heure de l'exposé
Lieu de l'exposé
Salle des séminaires
Résumé de l'exposé

In this talk, I will consider a nonlocal version of the Shigesada-Kawazaki-Teramoto (SKT) cross-diffusion system, which arises in population dynamics. This system has entropy dissipation properties on which one can rely to design a robust and convergent numerical scheme for its numerical simulation. In terms of numerical analysis, I will present discrete compactness techniques, entropy-dissipation estimates and a new adaptation of the so-called duality estimates for parabolic equations in Laplacian form. I will also present numerical experiments illustrating the influence of the nonlocality in the system: on convergence properties, as an approximation of the local system and on the development of diffusive instabilities. This is a joint work with Antoine Zurek (UTC).

Anthony Ozier-Lafontaine
Etablissement de l'orateur
LMJL
Date et heure de l'exposé
Lieu de l'exposé
Salle des Séminaires
Résumé de l'exposé

Single-cell RNA sequencing (scRNAseq) is a high-throughput technology quantifying gene expression at the single-cell level, for thousands of cells and tens of thousands of genes. A major statistical challenge in scRNAseq data analysis is to distinguish biological information from technical noise in order to compare conditions or tissues. Differential Expression Analysis (DEA) is usually performed with univariate two-sample tests and thus does not account for the multivariate aspect of scRNAseq data that carries information about gene dependencies and underlying regulatory networks and pathways. Applying multivariate two-sample tests would allow to perform Differential Transcriptome Analysis (DTA), to assess for the global similarity of the compared datasets.

We propose a kernel based two-sample test that can be used for DEA as well as for DTA. The Maximum Mean Discrepency (MMD) test is the most famous kernel two-sample test [1], it is based on the distance between the mean embeddings of the empirical distributions in an high-dimensional feature space, obtained through a non-linear embedding called the feature map. Our package implements a normalized version of the MMD test derived from the non-linear classification method KFDA [2], then regularized by a kernel PCA-like dimension reduction [3]. Besides reaching state of the art performances in DEA with competitive computational cost, the non-linear discriminant transformation obtained from the KFDA approach offers visualization tools highlighting the main differences between the two conditions in terms of cells, allowing to identify condition-specific sub-populations.

[1] Arthur Gretton, Karsten M Borgwardt, Malte Rasch, Bernhard Schölkopf, and Alex J Smola. A Kernel Method for the Two-Sample-Problem. page 8, 2007.

[2] Zaid Harchaoui, Francis Bach, and Eric Moulines. Testing for Homogeneity with Kernel Fisher Discriminant Analysis. arXiv:0804.1026 [stat], April 2008. arXiv: 0804.1026.

[3] Zaid Harchaoui, Felicien Vallet, Alexandre Lung-Yut-Fong, and Olivier Cappe. A regularized kernel-based approach to unsupervised audio segmentation. In 2009 IEEE International Conference on Acoustics, Speech and Signal Processing, pages 1665–1668, Taipei, Taiwan, April 2009. IEEE.

For kernel methods:

[4] Le cours de Jean-Philippe Vert et Julien Mairal https://members.cbio.mines-paristech.fr/~jvert/svn/kernelcourse/course/2021mva/index.html

[5] Krikamol Muandet, Kenji Fukumizu, Bharath Sriperumbudur, and Bernhard Sch ̈olkopf. Kernel Mean Embedding of Distributions: A Review and Beyond. Foundations and Trends in Machine Learning, 10(1-2):1–141, 2017. arXiv: 1605.09522.