{"id":97,"date":"2019-04-18T16:13:26","date_gmt":"2019-04-18T15:13:26","guid":{"rendered":"http:\/\/pageperso.math.univ-toulouse.fr\/gfort\/?page_id=97"},"modified":"2025-11-26T10:24:56","modified_gmt":"2025-11-26T09:24:56","slug":"research","status":"publish","type":"page","link":"https:\/\/perso.math.univ-toulouse.fr\/gfort\/research\/","title":{"rendered":"Research"},"content":{"rendered":"<div id=\"attachment_1765\" style=\"width: 310px\" class=\"wp-caption alignleft\"><a href=\"https:\/\/perso.math.univ-toulouse.fr\/gfort\/files\/2019\/04\/P1050723.jpg\"><img loading=\"lazy\" decoding=\"async\" aria-describedby=\"caption-attachment-1765\" class=\"wp-image-1765 size-medium\" src=\"https:\/\/perso.math.univ-toulouse.fr\/gfort\/files\/2019\/04\/P1050723-300x225.jpg\" alt=\"p1050723\" width=\"300\" height=\"225\" srcset=\"https:\/\/perso.math.univ-toulouse.fr\/wp-content\/uploads\/sites\/147\/2019\/04\/P1050723-300x225.jpg 300w, https:\/\/perso.math.univ-toulouse.fr\/wp-content\/uploads\/sites\/147\/2019\/04\/P1050723-1024x768.jpg 1024w, https:\/\/perso.math.univ-toulouse.fr\/wp-content\/uploads\/sites\/147\/2019\/04\/P1050723-100x75.jpg 100w, https:\/\/perso.math.univ-toulouse.fr\/wp-content\/uploads\/sites\/147\/2019\/04\/P1050723-150x113.jpg 150w, https:\/\/perso.math.univ-toulouse.fr\/wp-content\/uploads\/sites\/147\/2019\/04\/P1050723-200x150.jpg 200w, https:\/\/perso.math.univ-toulouse.fr\/wp-content\/uploads\/sites\/147\/2019\/04\/P1050723-450x338.jpg 450w, https:\/\/perso.math.univ-toulouse.fr\/wp-content\/uploads\/sites\/147\/2019\/04\/P1050723-600x450.jpg 600w, https:\/\/perso.math.univ-toulouse.fr\/wp-content\/uploads\/sites\/147\/2019\/04\/P1050723-900x675.jpg 900w, https:\/\/perso.math.univ-toulouse.fr\/wp-content\/uploads\/sites\/147\/2019\/04\/P1050723.jpg 1400w\" sizes=\"auto, (max-width: 300px) 100vw, 300px\" \/><\/a><p id=\"caption-attachment-1765\" class=\"wp-caption-text\">Japan, Kyoto, Golden pavilion<\/p><\/div>\n<h3 style=\"text-align: center\"><strong><span style=\"color: #5472c4\">Computational Statistical Learning<\/span><\/strong><\/h3>\n<h3 style=\"text-align: center\"><strong>Bayesian Inverse Problems<\/strong><\/h3>\n<h3 style=\"text-align: center\"><strong>Stochastic algorithms<\/strong><\/h3>\n<h3 style=\"text-align: center\"><strong>Monte Carlo methods<\/strong><\/h3>\n<h3 style=\"text-align: center\">Markov chains<\/h3>\n<p>&nbsp;<\/p>\n<p>&nbsp;<\/p>\n<p>Description of the research topics and results\u00a0<a href=\"https:\/\/sdrive.cnrs.fr\/s\/yZsaD4ZiWoQwHbb\">(in french)<\/a><\/p>\n<p style=\"text-align: justify\"><span style=\"color: #5472c4\"><em>Monte Carlo methods<\/em><\/span>: Adaptive Importance Sampling, Adaptive Biasing Force methods for Monte Carlo sampling, Markov chain Monte Carlo (MCMC) methods, Adaptive MCMC, Interacting MCMC, Sequential Monte Carlo.<\/p>\n<p style=\"text-align: justify\"><em><span style=\"color: #5472c4\">Stochastic optimization<\/span><\/em>: Monte Carlo Expectation Maximization (MCEM), Stochastic Approximation Expectation Maximization, Online MCEM, Stochastic Approximation with Markovian inputs, Stochastic Gradient, Perturbed Proximal-Gradient, Perturbed Nesterov-based accelerations, Distributed Stochastic Approximation, Federated Expectation Maximization, Stochastic Majorize-Minimization algorithms.<\/p>\n<p style=\"text-align: justify\"><em><span style=\"color: #5472c4\">Markov chain theory<\/span><\/em>: sub-exponential ergodicity by drift inequalities, explicit control of convergence, limit theorems for adaptive Markov chains. Applications to the theoretical analysis of MCMC samplers.<\/p>\n<p style=\"text-align: justify\"><span style=\"color: #5472c4\"><em>Bayesian Inverse problems applied to<\/em><\/span><span style=\"color: #5472c4\">:<\/span> microarray classification, image segmentation, simultaneous localization and mapping, inference of cosmological parameters,\u00a0 kriging-based approach for cellular coverage analysis, Covid-19 reproduction number estimation.<\/p>\n","protected":false},"excerpt":{"rendered":"<p>Computational Statistical Learning Bayesian Inverse Problems Stochastic algorithms Monte Carlo methods Markov chains &nbsp; &nbsp; Description of the research topics and results\u00a0(in french) Monte Carlo methods: Adaptive Importance Sampling, Adaptive Biasing Force methods for Monte Carlo sampling, Markov chain Monte Carlo (MCMC) methods, Adaptive MCMC, Interacting MCMC, Sequential Monte Carlo. Stochastic optimization: Monte Carlo Expectation [&hellip;]<\/p>\n","protected":false},"author":194,"featured_media":0,"parent":0,"menu_order":2,"comment_status":"closed","ping_status":"open","template":"full-width-page.php","meta":{"footnotes":""},"class_list":["post-97","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"https:\/\/perso.math.univ-toulouse.fr\/gfort\/wp-json\/wp\/v2\/pages\/97","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/perso.math.univ-toulouse.fr\/gfort\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/perso.math.univ-toulouse.fr\/gfort\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/perso.math.univ-toulouse.fr\/gfort\/wp-json\/wp\/v2\/users\/194"}],"replies":[{"embeddable":true,"href":"https:\/\/perso.math.univ-toulouse.fr\/gfort\/wp-json\/wp\/v2\/comments?post=97"}],"version-history":[{"count":23,"href":"https:\/\/perso.math.univ-toulouse.fr\/gfort\/wp-json\/wp\/v2\/pages\/97\/revisions"}],"predecessor-version":[{"id":5754,"href":"https:\/\/perso.math.univ-toulouse.fr\/gfort\/wp-json\/wp\/v2\/pages\/97\/revisions\/5754"}],"wp:attachment":[{"href":"https:\/\/perso.math.univ-toulouse.fr\/gfort\/wp-json\/wp\/v2\/media?parent=97"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}