{"id":2944,"date":"2021-04-10T10:34:35","date_gmt":"2021-04-10T09:34:35","guid":{"rendered":"http:\/\/pageperso.math.univ-toulouse.fr\/gfort\/?page_id=2944"},"modified":"2025-11-26T10:24:39","modified_gmt":"2025-11-26T09:24:39","slug":"full-list","status":"publish","type":"page","link":"https:\/\/perso.math.univ-toulouse.fr\/gfort\/publications-2\/full-list\/","title":{"rendered":"Full list"},"content":{"rendered":"<p><span style=\"color: #000080\"><strong>Full list (accepted and\/or published)<\/strong><\/span><\/p>\n<p><span style=\"font-size: 10pt\"><em>Description of the research topics and results\u00a0<a href=\"https:\/\/sdrive.cnrs.fr\/s\/yZsaD4ZiWoQwHbb\">(in french)<\/a><\/em><\/span><\/p>\n<ul>\n<li style=\"text-align: justify\"><span style=\"font-size: 12pt\"><small>G. Fort, F. Forbes and H.-D. Nguyen. <a href=\"https:\/\/hal.science\/hal-04607609v2\">Sequential Sample Average Majorization-Minimization<\/a>. Accepted for publication in Statistics and Computing, November 2025.<\/small><\/span><\/li>\n<li style=\"text-align: justify\"><span style=\"font-size: 12pt\"><small>G. Fort and M. Pereyra. <a href=\"https:\/\/hal.science\/hal-05166306v1\/file\/2025_GRETSI_histoire_montecarlo.pdf\">Monte Carlo.<\/a>\u00a0 For publication on the &#8220;Histoire du Traitement du Signal&#8221; <a href=\"https:\/\/www.gretsi.fr\/historique\">webpage of the GRETSI association<\/a>\u00a0et\u00a0<a href=\"https:\/\/univ-tlse2.hal.science\/hal-05166306v1\">HAL-05166306v1<\/a>, June 2025.\u00a0 \u00a0\u00a0<\/small><\/span><\/li>\n<li style=\"text-align: justify\"><span style=\"font-size: 12pt\"><span style=\"font-size: 12pt\"><small>J. Chevallier and G. Fort. <a href=\"https:\/\/ieeexplore.ieee.org\/document\/10887998\">Sampling Nonsmooth Log-Concave Densities : A Comparative Study of Primal-Dual Based Proposal Distributions<\/a>. <\/small><\/span><\/span><span style=\"font-size: 12pt\"><small>ICASSP 2025\u00a0<a href=\"https:\/\/hal.science\/hal-04824190v2\"> HAL&#8211;04824190v1<\/a>.<\/small><\/span><\/li>\n<li style=\"text-align: justify\"><span style=\"font-size: 12pt\"><small>P. Abry,\u00a0 J. Chevallier, G. Fort and B. Pascal.\u00a0<a href=\"https:\/\/ieeexplore.ieee.org\/document\/10889999\">Hierarchical Bayesian Estimation of COVID-19 Reproduction Number.<\/a>\u00a0 ICASSP 2025, <a href=\"https:\/\/univ-tlse2.hal.science\/hal-04695138v2\">HAL-04695138v2<\/a>.<\/small><\/span><\/li>\n<\/ul>\n<ul>\n<li style=\"text-align: justify\"><span style=\"font-size: 12pt\"><small>P. Abry,\u00a0 J. Chevallier, G. Fort and B. Pascal. <a href=\"https:\/\/ieeexplore.ieee.org\/document\/10403431\">Pandemic Intensity Estimation From Stochastic Approximation-Based Algorithms.<\/a> Accepted to CAMSAP 2023,\u00a0 HAL-04174245v1.<\/small><\/span><\/li>\n<li style=\"text-align: justify\"><span style=\"font-size: 12pt\"><small>A. Dieuleveut, G. Fort, E. Moulines and H-T. Wai. <a href=\"https:\/\/ieeexplore.ieee.org\/document\/10202577\">Stochastic Approximation beyond Gradient for Signal Processing and Machine Learning<\/a>. HAL-03979922.\u00a0 IEEE Trans Signal Processing; 71:3117-3148, 2023.<br \/>\n<\/small><\/span><\/li>\n<li style=\"text-align: justify\"><span style=\"font-size: 12pt\"><span style=\"font-size: 12pt\"><span style=\"font-size: 12pt\"><small>P. Abry, G. Fort, B. Pascal and N. Pustelnik. <a href=\"https:\/\/eurasip.org\/Proceedings\/Eusipco\/Eusipco2023\/pdfs\/0001813.pdf\">Credibility intervals for the reproduction number of the Covid-19 pandemic using Proximal Lanvevin samplers<\/a>. HAL-03902144 Accepted for publication in EUSIPCO 2023.\u00a0<a href=\"https:\/\/bpascal-fr.github.io\/assets\/pdfs\/abry2022credibility_slides.pdf\">Slides<\/a> and <a href=\"https:\/\/bpascal-fr.github.io\/assets\/videos\/EUSIPCO23.mp4\">Video<\/a>, by B. Pascal <\/small><span style=\"font-size: 12pt\"><br \/>\n<\/span><\/span><\/span><\/span><small> <\/small><\/li>\n<li style=\"text-align: justify\"><span style=\"font-size: 12pt\"><small>G. Fort and E. Moulines. <a href=\"https:\/\/link.springer.com\/article\/10.1007\/s11222-023-10230-6\">Stochastic Variable Metric Proximal Gradient with variance reduction for non-convex composite optimization.<\/a> Statistics and Computing, Volume 33, Article 65, 30 pags.\u00a0 HAL-03781216<\/small><\/span><\/li>\n<li style=\"text-align: justify\"><span style=\"font-size: 12pt\"><small>G. Fort, B. Pascal, P. Abry and N. Pustelnik. <a href=\"https:\/\/ieeexplore.ieee.org\/document\/10049517\">Covid19 Reproduction Number: Credibility Intervals by Blockwise Proximal Monte Carlo Samplers..<\/a> HAL-03611079. IEEE Trans. Signal Processing, 71:888-900, 2023.<br \/>\n<\/small><\/span><\/li>\n<\/ul>\n<ul>\n<li style=\"text-align: justify\"><span style=\"font-size: 12pt\"><small>P.\u00a0 Abry, G. Fort, B. Pascal and N. Pustelnik. <a href=\"https:\/\/gretsi.fr\/data\/colloque\/pdf\/2022_abry770.pdf\">Estimation et Intervalles de cr\u00e9dibilit\u00e9 pour le taux de reproduction de la Covid19 par \u00e9chantillonnage Monte Carlo Langevin Proximal.<\/a> HAL-03611891. Accepted for publication in the GRETSI 2022 proceedings.\u00a0 <\/small><\/span><\/li>\n<li style=\"text-align: justify\"><span style=\"font-size: 12pt\"><span style=\"font-size: 12pt\"><small>H. Artigas, B. Pascal, G. Fort, P.\u00a0 Abry and N. Pustelnik.\u00a0 <a href=\"https:\/\/ieeexplore.ieee.org\/document\/9909547\">Credibility Interval Design for Covid19 Reproduction Number from nonsmooth Langevin-type Monte Carlo sampling<\/a>. <\/small><\/span><\/span><span style=\"font-size: 12pt\"><small>HAL-03371837. 2022 30th European Signal Processing Conference (EUSIPCO), Belgrade, Serbia, 2022, pp. 2196-2200.<\/small><\/span><\/li>\n<li style=\"text-align: justify\"><span style=\"font-size: 12pt\"><small>P. Abry, G. Fort, B. Pascal and N. Pustelnik. <a href=\"https:\/\/pubmed.ncbi.nlm.nih.gov\/36086050\/\">Temporal Evolution of the Covid19 pandemic reproduction number: Estimations from Proximal optimization to Monte Carlo sampling.<\/a>\u00a0\u00a0 HAL-03565440.\u00a02022 44th Annual International Conference of the IEEE Engineering in Medicine &amp; Biology Society (EMBC), Glasgow, Scotland, United Kingdom, 2022, pp. 167-170<br \/>\n<\/small><\/span><\/li>\n<li style=\"text-align: justify\"><span style=\"font-size: 12pt\"><small>H. Duy Nguyen, F. Forbes, G. Fort and O. Capp\u00e9. <a href=\"https:\/\/link.springer.com\/chapter\/10.1007\/978-3-031-09034-9_29\">An online Minorization-Maximization algorithm<\/a>. HAL-03542180. Accepted for publication in IFCS 2022 proceedings.<br \/>\n<\/small><\/span><\/li>\n<\/ul>\n<ul>\n<li style=\"text-align: justify\"><span style=\"font-size: 12pt\"><small>A. Dieuleveut, G. Fort, E. Moulines, G. Robin. <a href=\"https:\/\/proceedings.neurips.cc\/paper\/2021\/hash\/f740c8d9c193f16d8a07d3a8a751d13f-Abstract.html\">Federated Expectation Maximization with\u00a0 heterogeneity mitigation and variance reduction,<\/a> May 2021. Accepted for publication <em>i<\/em>n the Proceedings of the 35-th Conference NeurIPS, September 2021.<br \/>\n<\/small><\/span><\/li>\n<li style=\"text-align: justify\"><span style=\"font-size: 12pt\"><small>[Teaching materials] G. Fort, M. Lerasle and E. Moulines. Statistique et Introduction \u00e0 l&#8217;Apprentissage statistique &#8212;<a href=\"https:\/\/www.math.univ-toulouse.fr\/%7Egfort\/Slides\/mainpoly.pdf\"> Polycopi\u00e9<\/a>, Ecole Polytechnique.<br \/>\n<\/small><\/span><\/li>\n<li style=\"text-align: justify\"><span style=\"font-size: 12pt\"><small>G. Fort, E. Moulines and P. Gach. <a href=\"https:\/\/link.springer.com\/article\/10.1007\/s11222-021-10023-9\">The Fast Incremental Expectation Maximization for finite-sum optimization: asymptotic convergence.<\/a>\u00a0\u00a0 with a Supplementary material. Matlab codes on <a href=\"https:\/\/github.com\/gfort-lab\/OpSiMorE\/tree\/master\/FIEM\">Github<\/a>. <\/small><\/span><span style=\"font-size: 12pt\"><small>Accepted to <em>Statistics and Computing<\/em>, May 2021.<br \/>\n<\/small><\/span><\/li>\n<li style=\"text-align: justify\"><span style=\"font-size: 12pt\"><small>G. Fort and E. Moulines. <a href=\"https:\/\/ieeexplore.ieee.org\/document\/9513769\">The Perturbed Prox-Preconditioned SPIDER algorithm for EM-based large scale learning.<\/a> March 2021. Accepted to <em>IEEE Statistical Signal Processing Workshop<\/em> (SSP 2021)<br \/>\n<\/small><\/span><\/li>\n<li style=\"text-align: justify\"><span style=\"font-size: 12pt\"><small> G. Fort and E. Moulines. <a href=\"https:\/\/ieeexplore.ieee.org\/document\/9513846?signout=success\">The Perturbed Prox-Preconditioned SPIDER algorithm: non-asymptotic convergence bounds.<\/a> March 2021. Accepted to\u00a0 <em>IEEE Statistical Signal Processing Workshop<\/em> (SSP 2021).<em><br \/>\n<\/em><\/small><\/span><\/li>\n<li style=\"text-align: justify\"><span style=\"font-size: 12pt\"><small>G. Fort,\u00a0 E. Moulines, H.-T. Wai. <a href=\"https:\/\/ieeexplore.ieee.org\/document\/9414271\">Geom-SPIDER-EM: Faster Variance Reduced Stochastic Expectation Maximization for Nonconvex Finite-Sum Optimization,<\/a> <em>ICASSP 2021 &#8211; 2021 IEEE International Conference on Acoustics, Speech and Signal Processing<\/em> (ICASSP):3135&#8211;3139<\/small><\/span><span style=\"font-size: 12pt\"><small>. <a href=\"https:\/\/hal.archives-ouvertes.fr\/hal-03021394\">With supplementary material<\/a>. Matlab codes on Github.<\/small><\/span><\/li>\n<\/ul>\n<ul>\n<li style=\"text-align: justify\"><span style=\"font-size: 12pt\"><small>G. Fort, E. Moulines, H.T. Wai. <a href=\"https:\/\/proceedings.neurips.cc\/paper\/2020\/file\/c589c3a8f99401b24b9380e86d939842-Paper.pdf\">A Stochastic Path Integrated Differential Estimator Expectation Maximization Algorithm<\/a>.\u00a0 <em>In Conference Proceedings<\/em> <em>NeurIPS, accepted in September 2020. (<a href=\"https:\/\/papers.nips.cc\/paper\/2020\/hash\/c589c3a8f99401b24b9380e86d939842-Abstract.html\">see also here<\/a>)\u00a0 [<a href=\"https:\/\/perso.math.univ-toulouse.fr\/gfort\/communications\/contributed-international-conf\/\">poster, see here]<\/a>.<\/em><\/small><\/span><\/li>\n<li style=\"text-align: justify\"><span style=\"font-size: 12pt\"><small>S. Crepey, G. Fort, E. Gobet and U. Stazhynski. <a href=\"https:\/\/epubs.siam.org\/doi\/10.1137\/18M1178517\">Uncertainty quantification for Stochastic Approximation limits using Chaos Expansion<\/a>. Nov17, HAL-01629952.\u00a0\u00a0<\/small><\/span><span style=\"font-size: 12pt\"><small><em>SIAM-ASA Journal of Uncertainty Quantification<\/em>, 8(3):<span class=\"art_pages\">1061-1089, 2<\/span>020.<\/small><\/span><\/li>\n<\/ul>\n<ul>\n<li><span style=\"font-size: 12pt\"><small>D. Barrera, S. Crepey, B. Diallo, G. Fort, E. Gobet and V. Stazhinksi. <a href=\"https:\/\/www.esaim-proc.org\/articles\/proc\/abs\/2019\/01\/proc196508\/proc196508.html\">Stochastic Approximation Schemes for Economic Capital and Risk Margin Computations<\/a><\/small><small><a href=\"https:\/\/www.esaim-proc.org\/articles\/proc\/abs\/2019\/01\/proc196508\/proc196508.html\">,<\/a>\u00a0 <em>ESAIM Proc (CEMRACS 2017)<\/em>, 65:182&#8211;218, 2019.<\/small><\/span><\/li>\n<li><span style=\"font-size: 12pt\"><small>G. Fort, E. Ollier and A. Leclerc-Samson.<a href=\"https:\/\/link.springer.com\/article\/10.1007\/s11222-018-9805-7\"> Stochastic Proximal Gradient Algorithms for Penalized Mixed Models<\/a>. arXiv:1704.08891. <i>Statistics and Computing, <\/i>29(2):231-253, 2019.<\/small><\/span><\/li>\n<li><span style=\"font-size: 12pt\"><small>S. Crepey, G. Fort, E. Gobet and U. Stazhynski.<a href=\"https:\/\/www.gretsi.fr\/data\/colloque\/pdf\/2019_fort496.pdf\"> Quantification d\u2019Incertitude pour l\u2019Approximation Stochastique<\/a>.<em> GRETSI, August 2019<\/em>.<\/small><\/span><\/li>\n<\/ul>\n<ul>\n<li style=\"text-align: justify\"><span style=\"font-size: 12pt\"><small>G. Fort, <\/small><small>B. Jourdain, T. Leli\u00e8vre and G. Stoltz. <a href=\"https:\/\/link.springer.com\/article\/10.1007\/s10955-018-1992-2\">Convergence and Efficiency of Adaptive Importance Sampling techniques with partial biasing.<\/a>\u00a0 <i>Journal of Statistical Physics<\/i>, 171(2):220-268, 2018.<br \/>\n<\/small><\/span><\/li>\n<li><span style=\"font-size: 12pt\"><small>G. Fort, L. Risser, Y. Atchad\u00e9 and E. Moulines. <a href=\"https:\/\/ieeexplore.ieee.org\/document\/8450740\">Stochastic FISTA algorithms: so fast ? <\/a>. <em>Workshop in Statistical Signal Processing (SSP), June 2018.<\/em><\/small><\/span><\/li>\n<\/ul>\n<ul>\n<li><span style=\"font-size: 12pt\"><small>G. Fort<\/small><small>, E. Gobet and E. Moulines. <a href=\"https:\/\/www.degruyter.com\/document\/doi\/10.1515\/mcma-2017-0101\/html\">MCMC design-based non-parametric regression for rare event. Application to nested risk computation<\/a>. <em>Monte Carlo Methods and Applications<\/em>, 23(1):21&#8211;42, 2017.<\/small><\/span><\/li>\n<li><span style=\"font-size: 12pt\"><small>G. Morral, P. Bianchi and G. Fort. <a href=\"https:\/\/ieeexplore.ieee.org\/document\/7039609\">Success and Failure of Adaptation-Diffusion Algorithms for Consensus in Multi-Agent Networks<\/a>. <em>IEEE Trans. Signal Processing<\/em>, 65(11):2798-2813, 2017.<\/small><\/span><\/li>\n<li><span style=\"font-size: 12pt\"><small>Y. Atchad\u00e9, G. Fort and E. Moulines.<a href=\"https:\/\/jmlr.csail.mit.edu\/papers\/volume18\/15-038\/15-038.pdf\"> On perturbed proximal gradient algorithms<\/a>, <i>Submitted in February 2014 under the title &#8220;On stochastic proximal gradient algorithms&#8221;.<\/i> arXiv:1402:2365 math.ST.\u00a0 <em>JMLR<\/em>, 18(10):1-33, 2017.<\/small><\/span><\/li>\n<li><span style=\"font-size: 12pt\"><small>G. Fort, B. Jourdain, T. Leli\u00e8vre and G. Stoltz.<a href=\"https:\/\/link.springer.com\/article\/10.1007\/s11222-015-9613-2\"> Self-Healing Umbrella Sampling: convergence and efficiency.<\/a> arXiv math.PR 1410.2109, <i>submitted in October 2014. Revised in April 2015, Accepted Nov 15. Statistics and Computing, 27(1):147-168, 2017<\/i><\/small><\/span><\/li>\n<li><span style=\"font-size: 12pt\"><small>G. Fort, L. Risser, E. Moulines, E. Ollier and A. Leclerc-Samson. <a href=\"https:\/\/www.gretsi.fr\/data\/colloque\/pdf\/2017_fort322.pdf\">Algorithmes Gradient-Proximaux stochastiques<\/a>.<em> GRETSI, September 2017.<\/em><\/small><\/span><\/li>\n<\/ul>\n<ul>\n<li style=\"text-align: justify\"><span style=\"font-size: 12pt\"><small>H. Braham, S. Ben Jemaa, G. Fort, E. Moulines and B. Sayrac. <a href=\"https:\/\/ieeexplore.ieee.org\/document\/7559820\">Spatial prediction under location uncertainty in cellular networks,<\/a> arXiv:1510:03638,\u00a0<i> IEEE Trans. Wireless Communications, 15(11):7633-7643, 2016.<\/i><\/small><small><br \/>\n<\/small><\/span><\/li>\n<li style=\"text-align: justify\"><span style=\"font-size: 12pt\"><small>H. Braham, S. Ben Jemaa, G. Fort, E. Moulines and B. Sayrac. <a href=\"https:\/\/ieeexplore.ieee.org\/document\/7542153\">Fixed Rank Kriging for Cellular Coverage Analysis<\/a>. ArXiv:1505:07062, IEEE Trans. Vehicular Technology, 66(5):4212-4222, 2016.<\/small><\/span><\/li>\n<li style=\"text-align: justify\"><span style=\"font-size: 12pt\"><small>A. Schreck, G. Fort, E. Moulines and M. Vihola <a href=\"https:\/\/epubs.siam.org\/doi\/10.1137\/140962723\">Convergence of Markovian Stochastic Approximation with discontinuous dynamic<\/a> . arXiv math.ST 1403.6803, <i>submitted in March 2014<\/i>. SIAM J. Control Optim., 54(2):866-893, 2016<\/small><\/span><\/li>\n<li style=\"text-align: justify\"><span style=\"font-size: 12pt\"><small>A. Schreck, G. Fort, S. Le Corff and E. Moulines. <a href=\"https:\/\/ieeexplore.ieee.org\/document\/7312917\">A shrinkage-thresholding Metropolis adjusted Langevin algorithm for Bayesian variable selection<\/a>. arXiv math.ST 1312.5658<em>.\u00a0 IEEE J. of Selected Topics in Signal Processing, 10<\/em><\/small><small><em>(2):366-375, 2016.<\/em><\/small><\/span><\/li>\n<li style=\"text-align: justify\"><span style=\"font-size: 12pt\"><small>A. Durmus, G. Fort and E. Moulines.<\/small> <small><a href=\"https:\/\/projecteuclid.org\/journals\/annales-de-linstitut-henri-poincare-probabilites-et-statistiques\/volume-52\/issue-4\/Subgeometric-rates-of-convergence-in-Wasserstein-distance-for-Markov-chains\/10.1214\/15-AIHP699.full\">Subgeometric rates of convergence rates in Wasserstein distance for Markov chains<\/a><\/small>.<i><code><\/code><\/i><small> <\/small><small><em>arXiv:1402.4577math.PR. Ann. inst. Henri Poincar\u00e9, 52(4):1799-1822, 2016. <\/em><\/small><\/span><\/li>\n<\/ul>\n<ul>\n<li style=\"text-align: justify\"><span style=\"font-size: 12pt\"><small>G. Fort. <a href=\"https:\/\/www.esaim-ps.org\/articles\/ps\/abs\/2015\/01\/ps140013\/ps140013.html\">Central Limit Theorems for Stochastic Approximation with Controlled Markov Chain Dynamics<\/a>.\u00a0<i> EsaimPS, 19:60-80, <\/i><i>2015.\u00a0<\/i><\/small><small> arXiv math.PR 1309.311<\/small><small>C. <\/small><\/span><\/li>\n<li style=\"text-align: justify\"><span style=\"font-size: 12pt\"><small>Andrieu, G. Fort and M. Vihola. <a href=\"https:\/\/projecteuclid.org\/journals\/journal-of-applied-probability\/volume-52\/issue-2\/Quantitative-convergence-rates-for-subgeometric-Markov-chains\/10.1239\/jap\/1437658605.short\">Quantitative convergence rates for sub-geometric Markov chains<\/a>. <i>Advances in Applied Probability<\/i>, <i>52(2):391-404, 2015<\/i>. <a href=\"http:\/\/arxiv.org\/abs\/1309.0622\">arXiv math.PR 1309.0622<\/a><\/small><\/span><\/li>\n<li style=\"text-align: justify\"><span style=\"font-size: 12pt\"><small>G. Fort, B. Jourdain, E. Kuhn, T. Leli\u00e8vre and G. Stoltz. <a href=\"https:\/\/www.ams.org\/journals\/mcom\/2015-84-295\/S0025-5718-2015-02952-4\/S0025-5718-2015-02952-4.pdf\"> Convergence of the Wang-Landau algorithm.<\/a><\/small> <small><i>Math. Comp., 84:2297-2327, 2015.\u00a0<\/i> arXiv:1207.6880 [math.PR]<\/small><\/span><\/li>\n<li style=\"text-align: justify\"><span style=\"font-size: 12pt\"><small>R. Bardenet, O. Capp\u00e9, G. Fort and B. Kegl. <a href=\"\/\/projecteuclid.org\/journals\/bernoulli\/volume-21\/issue-3\/Adaptive-MCMC-with-online-relabeling\/10.3150\/13-BEJ578.full\">Adaptive MCMC with Online Relabeling. <\/a><\/small><small><i>(accepted for publication in 2013) Bernoulli, 21(3):1304-1340, 2015<\/i>. <\/small><small><a href=\"http:\/\/arxiv.org\/abs\/1210.2601\">arXiv:1210.2601<\/a> [stat.CO]<\/small><\/span><\/li>\n<\/ul>\n<ul>\n<li><span style=\"font-size: 12pt\"><small>G. Fort, B. Jourdain, E. Kuhn, T. Leli\u00e8vre and G. Stoltz. <a href=\"https:\/\/academic.oup.com\/amrx\/article\/2014\/2\/275\/159677\">Efficiency of the Wang-Landau algorithm<\/a>.<i>\u00a0 App. Math. Res. Express, 2914(2):275-311, 2014<\/i>. <i>\u00a0<\/i> <a href=\"http:\/\/arxiv.org\/abs\/1310.6550\">arXiv:1310.6550. <\/a><\/small><\/span><\/li>\n<li style=\"text-align: justify\"><span style=\"font-size: 12pt\"><small>G. Fort, E. Moulines, P. Priouret and P. Vandekerkhove. <a href=\"https:\/\/projecteuclid.org\/journals\/bernoulli\/volume-20\/issue-2\/A-central-limit-theorem-for-adaptive-and-interacting-Markov-chains\/10.3150\/12-BEJ493.full\">A Central\u00a0 Limit Theorem for Adaptive and Interacting Markov Chains<\/a>.arXiv:1107.2574 <a href=\"http:\/\/math.univ-toulouse.fr\/%7Egfort\/Preprints\/fmpv_clt_supp_arXiv.pdf\">Supplement paper<\/a>\u00a0\u00a0 Bernoulli 20(2):457-485, 2014.<\/small><\/span><\/li>\n<li style=\"text-align: justify\"><span style=\"font-size: 12pt\"><small>G. Morral, P. Bianchi and G. Fort. <a href=\"https:\/\/ieeexplore.ieee.org\/document\/7039609\">Success and Failure of Adaptation-Diffusion Algorithms for Consensus in Multiagent Networks<\/a>. P<i>roceedings of the 53rd IEEE Conference on Decision and Control (CDC 2014), <\/i><\/small><small><i>December 2014.<\/i><\/small><\/span><\/li>\n<li style=\"text-align: justify\"><span style=\"font-size: 12pt\"><small>H. Braham, S. Ben Jemaa, G. Fort, E. Moulines and B. Sayrac.<\/small><small><a href=\"https:\/\/ieeexplore.ieee.org\/document\/7136450\"> Coverage Mapping Using Spatial Interpolation With Field Measurements<\/a>.<\/small><small><i> Accepted for presentation and publication in the proceedings to : IEEE PIMRC \u2013 Mobile and Wireless Networks 2014, September 2014.<\/i><\/small><\/span><\/li>\n<li style=\"text-align: justify\"><span style=\"font-size: 12pt\"><small>H. Braham, S. Ben Jemaa, G. Fort, E. Moulines and B. Sayrac.\u00a0 <a href=\"https:\/\/ieeexplore.ieee.org\/document\/6850298\">Low complexity Spatial Interpolation For Cellular Coverage Analysis<\/a>.<i> Accepted for presentation and publications in the proceedings to : WiOpt 2014, May 2014.<\/i><\/small><\/span><\/li>\n<\/ul>\n<ul>\n<li style=\"text-align: justify\"><span style=\"font-size: 12pt\"><small>P. Bianchi, G. Fort and W. Hachem.\u00a0 <a href=\"https:\/\/ieeexplore.ieee.org\/document\/6574263\">Performance of a Distributed Stochastic Approximation Algorithm<\/a>,\u00a0 IEEE Trans. on Information Theory, 59(11):7405-7418, 2013.<\/small><\/span><\/li>\n<li style=\"text-align: justify\"><span style=\"font-size: 12pt\"><small style=\"text-align: justify\">S. Le Corff and G. Fort. <a href=\"https:\/\/projecteuclid.org\/journals\/electronic-journal-of-statistics\/volume-7\/issue-none\/Online-Expectation-Maximization-based-algorithms-for-inference-in-Hidden-Markov\/10.1214\/13-EJS789.full\">Online Expectation Maximization-based algorithms for inference in Hidden Markov Models<\/a><\/small>. <small>Electronic Journal of Statistics, 7:763-792, 2013.<\/small><small> arXiv math.ST 1108-3968<\/small><small>. <a href=\"http:\/\/arxiv.org\/abs\/1108.4130\">Supplement paper<\/a>, math.ST 1108-4130.<\/small><\/span><\/li>\n<li style=\"text-align: justify\"><span style=\"font-size: 12pt\"><small>A. Schreck, G. Fort and E. Moulines. <a href=\"https:\/\/dl.acm.org\/doi\/10.1145\/2414416.2414421\">Adaptive Equi-energy sampler : convergence and illustration<\/a>. ACM <\/small><small>Transactions on Modeling and Computer Simulation (TOMACS), 23(1):Article 5 &#8211; 27 pages, 2013.<\/small><\/span><\/li>\n<li style=\"text-align: justify\"><span style=\"font-size: 12pt\"><small>S. Le Corff and G. Fort. <a href=\"https:\/\/dl.acm.org\/doi\/abs\/10.1145\/2414416.2414418\">Convergence of a particle-based approximation of the Block online\u00a0 Expectation Maximization algorithm,<\/a> ACM Transactions on Modeling and Computer Simulation (TOMACS) 23(1):Article2 &#8211; 22 pages, 2013.<\/small><\/span><\/li>\n<li style=\"text-align: justify\"><span style=\"font-size: 12pt\"><small>G. Morral, P. Bianchi, G. Fort and J. Jakubowicz.<a href=\"https:\/\/www.gretsi.fr\/data\/colloque\/pdf\/2013_morraladell179.pdf\"> Approximation stochastique distribu\u00e9e : le co\u00fbt de la non bistochasticit<\/a>. GRETSI, September 2013.<\/small><\/span><\/li>\n<\/ul>\n<ul>\n<li><span style=\"font-size: 12pt\"><small>G. Fort, E. Moulines, P. Priouret and P. Vandekerkhove. <a href=\"https:\/\/www.sciencedirect.com\/science\/article\/abs\/pii\/S0167715212000387\">A simple variance inequality\u00a0 for U-statistics of a Markov chain with Applications.<\/a> Statistics &amp; Probability Letters 82(6):1193-1201, 2012.<\/small><\/span><\/li>\n<li style=\"text-align: justify\"><span style=\"font-size: 12pt\"><small>G. Fort, E. Moulines and P. Priouret. <a href=\"https:\/\/projecteuclid.org\/journals\/annals-of-statistics\/volume-39\/issue-6\/Convergence-of-adaptive-and-interacting-Markov-chain-Monte-Carlo-algorithms\/10.1214\/11-AOS938.full\">Convergence of adaptive and interacting\u00a0 Markov chain Monte Carlo algorithms.<\/a> Ann. Statist. 39(6):3262-3289, 2012.\u00a0 <\/small><small>[<a href=\"http:\/\/math.univ-toulouse.fr\/%7Egfort\/Preprints\/fort:moulines:priouret:2012_supp.pdf\">Supplementary material<\/a>],<\/small><\/span><\/li>\n<li style=\"text-align: justify\"><span style=\"font-size: 12pt\"><small>Y. Atchad\u00e9 and G. Fort. <\/small><a href=\"https:\/\/projecteuclid.org\/journals\/bernoulli\/volume-18\/issue-3\/Limit-theorems-for-some-adaptive-MCMC-algorithms-with-subgeometric-kernels\/10.3150\/11-BEJ360.full\"><small>Limit theorems for some adaptive MCMC algorithms with subgeometric kernels, part II<\/small><\/a><small>. Bernoulli 18(3):975-1001, 2012.<\/small><\/span><\/li>\n<li><span style=\"font-size: 12pt\"><small>G. Morral, P. Bianchi, G. Fort and J. Jakubowicz. <a href=\"https:\/\/ieeexplore.ieee.org\/document\/6489272\">Distributed Stochastic Approximation: The Price of Non-double Stochasticity.<\/a> ASILOMAR November 2012.<\/small><\/span><\/li>\n<li><span style=\"font-size: 12pt\"><small>R. Bardenet, O. Capp\u00e9, G. Fort and B. Kegl. <a href=\"https:\/\/proceedings.mlr.press\/v22\/bardenet12.html\">Adaptive Metropolis with online relabeling<\/a>. (<a href=\"http:\/\/jmlr.csail.mit.edu\/proceedings\/papers\/v22\/bardenet12\/bardenet12Supple.pdf\">Supplementary paper<\/a>). JMLR Workshop and Conference Proceedings Vol 22, p.91-99, AISTATS 2012<\/small><\/span><\/li>\n<li><span style=\"font-size: 12pt\"><small>S. Le Corff, G. Fort and E. Moulines. <a href=\"https:\/\/link.springer.com\/chapter\/10.1007\/978-3-642-28551-6_17\">New Online-EM algorithms for general Hidden Markov models. Application to the SLAM<\/a>, Proceedings of the 10th International Conference on Latent Variable Analysis and Signal Separation (LVA-ICA), Springer-Verlag Berlin, Heidelberg pages 131-138, 2012.<\/small><\/span><\/li>\n<\/ul>\n<ul>\n<li style=\"text-align: justify\"><span style=\"font-size: 12pt\"><small>P. Etor\u00e9, G. Fort, B. Jourdain and E. <\/small><small> <\/small><small>Moulines.<a href=\"https:\/\/link.springer.com\/article\/10.1007\/s10479-009-0638-9\"> On adaptive stratification<\/a>. <\/small><small>Annals of Operations Research 189(1):127-154, 2011.<\/small><small> <\/small><small><small>ArXiv math.PR\/0809.1135<\/small><\/small><\/span><\/li>\n<li><span style=\"font-size: 12pt\"><small>P. Bianchi, G. Fort, W. Hachem and J. Jakubowicz. <\/small><small><a href=\"https:\/\/ieeexplore.ieee.org\/document\/7074128\">Performance Analysis of a Distributed Robbins-Monro algorithm for Sensor Networks<\/a>. Proceedings of the 19th European Signal Processing Conference (EUSIPCO),\u00a0 pages 1030-1034, 2011.<\/small><\/span><\/li>\n<li><span style=\"font-size: 12pt\"><small>Y. Atchad\u00e9, G. Fort, E. Moulines and P. Priouret.\u00a0 In <\/small><small>D. Barber, A. T. Cemgil and S. Chiappia, editors. Bayesian Time Series <\/small><small>Models, Cambridge Univ. Press, 2011. <em>Chapter 2 : <a href=\"https:\/\/www.cambridge.org\/core\/books\/abs\/bayesian-time-series-models\/adaptive-markov-chain-monte-carlo-theory-and-methods\/CAF7CBF7D75301E4A313C5128112E649\">Adaptive Markov chain Monte Carlo : Theory and Methods<\/a><\/em>, 33-53.<\/small><\/span><\/li>\n<li style=\"text-align: justify\"><span style=\"font-size: 12pt\"><small>S. Le Corff, G. Fort and E. Moulines. <a href=\"https:\/\/www.gretsi.fr\/data\/colloque\/pdf\/2011_fort407.pdf\">Un algorithme EM r\u00e9cursif pour le SLAM<\/a>.\u00a0 Proceedings du Groupe d\u2019Etudes du Traitement du Signal et des Images (GRETSI), 2011.<\/small><\/span><\/li>\n<li><span style=\"font-size: 12pt\"><small>P. Bianchi, G. Fort, W. Hachem and J. Jakubowicz.<\/small> <small><a href=\"https:\/\/www.gretsi.fr\/data\/colloque\/pdf\/2011_jakubowicz245.pdf\">Sur un algorithme de Robbins-Monro distribu\u00e9<\/a>. <\/small><small>Proceedings du Groupe d\u2019Etudes du Traitement du Signal et des Images (GRETSI), 2011.<\/small><\/span><\/li>\n<li><span style=\"font-size: 12pt\"><small>S. Le Corff, G. Fort and E. Moulines.<\/small> <small><a href=\"http:\/\/math.univ-toulouse.fr\/%7Egfort\/Preprints\/lecorff:fort:moulines:2010.pdf\">Online Expectation-Maximization algorithm to solve the SLAM problem<\/a>, Proceedings of the 2011 IEEE Statistical Signal Processing Workshop (SSP), pages 225-228, 2011.<\/small><\/span><\/li>\n<li><span style=\"font-size: 12pt\"><small>S. Le Corff and G. Fort. Block Online EM for Hidden Markov Models with general state space, 2011. Proceedings of International Conference Applied Stochastic Models and Data Analysis (ASMDA), 2011.<\/small><\/span><\/li>\n<li><span style=\"font-size: 12pt\"><small>P. Bianchi, G. Fort, W. Hachem and J. Jakubowicz. <a href=\"https:\/\/ieeexplore.ieee.org\/document\/5947170\">Convergence of a distributed parameter estimator for sensor network with local averaging of the estimates<\/a>. Proceedings of the International Conference on Acoustics, Speech and Signal Processing (ICASSP), pages 3764-3767, 2011.<\/small><\/span><\/li>\n<\/ul>\n<ul>\n<li style=\"text-align: justify\"><span style=\"font-size: 12pt\"><small>M. Kilbinger, D. Wraith, <\/small><small>C. P. Robert, <\/small><small>K. Benabed, O. Capp\u00e9,\u00a0 J.F.Cardoso, G. Fort, S. Prunet, and F.R.Bouchet. <a href=\"https:\/\/academic.oup.com\/mnras\/article\/405\/4\/2381\/1046327\">Bayesian model comparison in cosmology with Population Monte Carlo.<\/a>\u00a0 MNRAS 405(4):2381-2390, 2010.<\/small><small> <a href=\"http:\/\/arxiv.org\/abs\/0912.1614\"><small>ArXiv astro-ph.CO\/0912.1614<\/small><\/a><\/small><\/span><\/li>\n<li style=\"text-align: justify\"><span style=\"font-size: 12pt\"><small>Y. Atchad\u00e9 and G. Fort. <a href=\"https:\/\/projecteuclid.org\/journals\/bernoulli\/volume-16\/issue-1\/Limit-theorems-for-some-adaptive-MCMC-algorithms-with-subgeometric-kernels\/10.3150\/09-BEJ199.full\">Limit theorems for some adaptive MCMC algorithms with subgeometric kernels<\/a><\/small><small>. Bernoulli <small><big>16(1):116-154, 2010. <\/big>ArXiv\u00a0 math.PR\/0807.2952 <\/small>\u00a0 <\/small><\/span><\/li>\n<\/ul>\n<ul>\n<li style=\"text-align: justify\"><span style=\"font-size: 12pt\"><small>S. Connor and G. Fort. <a href=\"https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0304414909001665\">State-dependent Foster-Lyapunov criteria for subgeometric convergence of Markov chains<\/a>.<em> Stoch. Processes Appl.119:4176-4193, 2009 ArXiv math.PR\/0901.2453<\/em><\/small><\/span><\/li>\n<li style=\"text-align: justify\"><span style=\"font-size: 12pt\"><small>D.Wraith, M. Kilbinger, K. Benabed, O. Capp\u00e9, J.F. Cardoso, G. Fort, S. Prunet and C.P. Robert. <a href=\"https:\/\/journals.aps.org\/prd\/abstract\/10.1103\/PhysRevD.80.023507\">Estimation of cosmological parameters using adaptive importance sampling<\/a>. <em>Phys. Rev. D<\/em>. 80(2), 2009.<\/small><\/span><\/li>\n<li style=\"text-align: justify\"><span style=\"font-size: 12pt\"><small>R. Douc, G. Fort, E. Moulines and P. Priouret. <a href=\"https:\/\/www.sciencedirect.com\/science\/article\/pii\/S030441490800104X\">Forgetting of the initial distribution for Hidden Markov Models.<\/a> <em>Stoch. Process Appl.<\/em> 119(4):1235-1256, 2009. ArXiv.math.ST\/0703836.<\/small><\/span><\/li>\n<li style=\"text-align: justify\"><span style=\"font-size: 12pt\"><small>R. Douc, G. Fort and A. Guillin. <a href=\"https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0304414908000641\">Subgeometric rates of convergence of f-ergodic strong Markov processes.<\/a> <em>Stoch. Process Appl.<\/em>, 119(3):897-923, 2009. ArXiv math.ST\/0605791<\/small><\/span><\/li>\n<\/ul>\n<ul>\n<li style=\"text-align: justify\"><span style=\"font-size: 12pt\"><small>G. Fort, S. Meyn, E. Moulines and P. Priouret. <a href=\"https:\/\/projecteuclid.org\/journals\/annals-of-applied-probability\/volume-18\/issue-2\/The-ODE-method-for-stability-of-skip-free-Markov-chains\/10.1214\/07-AAP471.full\">The ODE method for the stability of skip-free Markov Chains with applications to MCMC.<\/a><em> Ann. Appl. Probab<\/em>. 18(2) :664-707, 2008<\/small><small><big><small><big>.<\/big><\/small><\/big><\/small><\/span><\/li>\n<\/ul>\n<ul>\n<li><span style=\"font-size: 12pt\"><span style=\"font-size: 12pt\"><small>F. Forbes and G. Fort. <a href=\"https:\/\/ieeexplore.ieee.org\/document\/4099393\">Combining Monte Carlo and Mean-Field-Like Methods for Inference in Hidden Markov Random Fields<\/a>. <\/small><\/span><\/span><span style=\"font-size: 12pt\"><small><em>IEEE Trans on Image Processing<\/em>, 16(3):824(837, 2007.<\/small><\/span><\/li>\n<\/ul>\n<ul>\n<li><span style=\"font-size: 12pt\"><small>G. Fort, S. Meyn, E. Moulines and P. Priouret. <a href=\"https:\/\/dl.acm.org\/doi\/10.1145\/1190095.1190149\">ODE methods for Markov chain stability with applications to MCMC.<\/a> Proceedings of the 1st International Conference on Performance Evaluation Methodologies and Tools,\u00a0 Valuetools, Art. 42, 2006.<\/small><\/span><\/li>\n<\/ul>\n<ul>\n<li><span style=\"font-size: 12pt\"><small>G. Fort, S. Lambert-Lacroix, J. Peyre. <a href=\"http:\/\/math.univ-toulouse.fr\/%7Egfort\/Preprints\/fort:lambert:peyre:2005.pdf\">R\u00e9duction de dimension dans les mod\u00e8les g\u00e9n\u00e9ralis\u00e9s : application \u00e0 la classification de donn\u00e9es issues de biopuces<\/a>. <em>Journal de la SFDS<\/em>, 146(1-2):117-152, 2005. <a href=\"http:\/\/math.univ-toulouse.fr\/%7Egfort\/GLM\/PLSforGLM.html\">Matlab<\/a> code and Data set. <a href=\"http:\/\/math.univ-toulouse.fr\/%7Egfort\/Preprints\/erratumSFDS.html\">Erratum <\/a>on the research report <a href=\"http:\/\/www.stat.ucl.ac.be\/IAP\/publication_tr.html\">TR0471<\/a>.<\/small><\/span><\/li>\n<li><span style=\"font-size: 12pt\"><small>G. Fort and S. Lambert-Lacroix. <a href=\"https:\/\/academic.oup.com\/bioinformatics\/article\/21\/7\/1104\/268921\">Classification using Partial Least Squares with Penalized Logistic Regression<\/a>.<em> Bioinformatics<\/em>, 21(7):1104-1111, 2005. <a href=\"http:\/\/math.univ-toulouse.fr\/%7Egfort\/GLM\/PLSforGLM.html\">Matlab<\/a> codes and Data set.<\/small><\/span><\/li>\n<li><span style=\"font-size: 12pt\"><small>G. Fort and G.O. Roberts. <a href=\"https:\/\/projecteuclid.org\/journals\/annals-of-applied-probability\/volume-15\/issue-2\/Subgeometric-ergodicity-of-strong-Markov-processes\/10.1214\/105051605000000115.full\">Subgeometric ergodicity of strong Markov processes<\/a>. <em>Ann. Appli. Probab.<\/em> 15(2):1565-1589, 2005.<\/small><\/span><\/li>\n<li><span style=\"font-size: 12pt\"><small>G. Fort, E. Moulines and P. Soulier. In O. Capp\u00e9, E. Moulines and T. Ryden, editors. <a href=\"https:\/\/link.springer.com\/book\/10.1007\/0-387-28982-8\">Inference in Hidden Markov Models<\/a>, Springer\u00a0 2005. <em>Chapter 14:<\/em> <i>Elements of Markov Chain Theory, 511-562.<\/i><\/small><\/span><\/li>\n<\/ul>\n<ul>\n<li style=\"text-align: justify\"><span style=\"font-size: 12pt\"><small>R. Douc, G. Fort, E. Moulines and P. Soulier. <a href=\"https:\/\/projecteuclid.org\/journals\/annals-of-applied-probability\/volume-14\/issue-3\/Practical-drift-conditions-for-subgeometric-rates-of-convergence\/10.1214\/105051604000000323.full\">Practical drift conditions for subgeometric rates of convergence.<\/a> <em>Ann. Appl. Probab.<\/em> 14(3):1353-1377, 2004.<\/small><\/span><\/li>\n<li><span style=\"font-size: 12pt\"><small>G. Fort and S. Lambert-Lacroix. <a href=\"http:\/\/math.univ-toulouse.fr\/%7Egfort\/Preprints\/Fort:Lambert:2004.pdf\">Ridge-Partial Least Squares for Generalized Linear Models with binary response<\/a>. <em>COMPSTAT\u201904<\/em>, Proceedings in Computational Statistics, pages 1019-1026, 2004.<br \/>\n<\/small><\/span><\/li>\n<\/ul>\n<ul>\n<li><span style=\"font-size: 12pt\"><small>G. Fort, E. Moulines, G.O. Roberts and J.S. Rosenthal.<a href=\"https:\/\/www.jstor.org\/stable\/pdf\/3215845.pdf\"> On the geometric ergodicity of hybrid samplers.<\/a> <em>J. Appl. Probab<\/em>. 40(1):123-146, 2003.<\/small><\/span><\/li>\n<li style=\"text-align: justify\"><span style=\"font-size: 12pt\"><small>G. Fort and E. Moulines. <a href=\"\/\/www.sciencedirect.com\/science\/article\/pii\/S0304414902001825\">Polynomial ergodicity of Markov transition kernels.<\/a> <em>Stoch. Process Appl.<\/em> 103(1),57-99, 2003.<\/small><\/span><\/li>\n<li style=\"text-align: justify\"><span style=\"font-size: 12pt\"><small>G. Fort and E. Moulines. <a href=\"https:\/\/projecteuclid.org\/journals\/annals-of-statistics\/volume-31\/issue-4\/Convergence-of-the-Monte-Carlo-expectation-maximization-for-curved-exponential\/10.1214\/aos\/1059655912.full\">Convergence of the Monte Caro EM for curved exponential families<\/a>. <em>Ann. Stat.<\/em> 31(4):1220-1259, 2003.<\/small><\/span><\/li>\n<\/ul>\n<ul>\n<li><span style=\"font-size: 12pt\"><small>G. Fort and E. Moulines. <a href=\"https:\/\/www.sciencedirect.com\/science\/article\/abs\/pii\/S0167715200000742\">V-subgeometric ergodicity for a Hastings-Metropolis algorithm<\/a>. <em>Stat. Probab. Lett.<\/em> 49(4):401-410, 2000.<br \/>\n<\/small><\/span><\/li>\n<\/ul>\n<ul>\n<li><span style=\"font-size: 12pt\"><small>G. Fort and E. Moulines, and P. Soulier. <a href=\"https:\/\/link.springer.com\/chapter\/10.1007\/978-3-662-01131-7_41\">On the convergence of iterated random maps with applications to the MCEM algorithm.<\/a> <em>Computational Statistics<\/em>, August, 1998.<\/small><\/span><\/li>\n<li><span style=\"font-size: 12pt\"><small>G. Fort, O. Capp\u00e9, E. Moulines, and P. Soulier. <a href=\"https:\/\/ieeexplore.ieee.org\/document\/739339\">Optimization via simulation for maximum likelihood estimation in incomplete data models<\/a>. In <em>Proc. IEEE Workshop on Stat. Signal and Array Proc.<\/em>, pages 80-83, 1998.<\/small><\/span><\/li>\n<\/ul>\n","protected":false},"excerpt":{"rendered":"<p>Full list (accepted and\/or published) Description of the research topics and results\u00a0(in french) G. Fort, F. Forbes and H.-D. Nguyen. Sequential Sample Average Majorization-Minimization. Accepted for publication in Statistics and Computing, November 2025. G. Fort and M. Pereyra. Monte Carlo.\u00a0 For publication on the &#8220;Histoire du Traitement du Signal&#8221; webpage of the GRETSI association\u00a0et\u00a0HAL-05166306v1, June [&hellip;]<\/p>\n","protected":false},"author":194,"featured_media":0,"parent":92,"menu_order":0,"comment_status":"closed","ping_status":"open","template":"full-width-page.php","meta":{"footnotes":""},"class_list":["post-2944","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"https:\/\/perso.math.univ-toulouse.fr\/gfort\/wp-json\/wp\/v2\/pages\/2944","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=2944"}],"version-history":[{"count":73,"href":"https:\/\/perso.math.univ-toulouse.fr\/gfort\/wp-json\/wp\/v2\/pages\/2944\/revisions"}],"predecessor-version":[{"id":5756,"href":"https:\/\/perso.math.univ-toulouse.fr\/gfort\/wp-json\/wp\/v2\/pages\/2944\/revisions\/5756"}],"up":[{"embeddable":true,"href":"https:\/\/perso.math.univ-toulouse.fr\/gfort\/wp-json\/wp\/v2\/pages\/92"}],"wp:attachment":[{"href":"https:\/\/perso.math.univ-toulouse.fr\/gfort\/wp-json\/wp\/v2\/media?parent=2944"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}