{"id":146,"date":"2019-04-18T23:05:32","date_gmt":"2019-04-18T22:05:32","guid":{"rendered":"http:\/\/pageperso.math.univ-toulouse.fr\/gfort\/?page_id=146"},"modified":"2025-11-21T07:41:00","modified_gmt":"2025-11-21T06:41:00","slug":"journal-paper","status":"publish","type":"page","link":"https:\/\/perso.math.univ-toulouse.fr\/gfort\/publications-2\/journal-paper\/","title":{"rendered":"Journal Paper"},"content":{"rendered":"<p><span style=\"font-size: 10pt\"><em>The list of the submitted papers<a title=\"Technical Report\" href=\"https:\/\/perso.math.univ-toulouse.fr\/gfort\/publications-2\/technical-report\/\"> is here<\/a><\/em><\/span><\/p>\n<ol>\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>A. Dieuleveut, G. Fort, E. Moulines and H-T. Wai. <a href=\"https:\/\/hal.science\/hal-03979922\">Stochastic Approximation beyond Gradient for Signal Processing and Machine Learning<\/a>. HAL-03979922. IEEE Trans Signal Processing,71:3117-3148, 2023.<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:\/\/hal.archives-ouvertes.fr\/hal-03781216\">Stochastic Variable Metric Proximal Gradient with variance reduction for non-convex composite optimization.<\/a> September 2022, revised in December 2022.\u00a0 Accepted for publication in Statistics and Computing, March 2023. 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:\/\/hal.archives-ouvertes.fr\/hal-03611079v2\">Covid19 Reproduction Number: Credibility Intervals by Blockwise Proximal Monte Carlo Samplers.<\/a> HAL-03611079.\u00a0 IEEE Trans. Signal Processing, 71:888-900, 2023.<br \/>\n<\/small><\/span><\/li>\n<li style=\"text-align: justify\"><span style=\"font-size: 12pt\"><small>G. Fort, E. Moulines, P. Gach. <a href=\"https:\/\/hal.archives-ouvertes.fr\/hal-02617725v1\">Fast Incremental Expectation Maximization for non-convex finite-sum optimization: non asymptotic convergence bounds<\/a>, with a <em><a href=\"http:\/\/www.math.univ-toulouse.fr\/~gfort\/Slides\/FGM-supplementary.pdf\">Supplementary material.<\/a>\u00a0\u00a0 Matlab codes on <a href=\"https:\/\/github.com\/gfort-lab\/OpSiMorE\/tree\/master\/FIEM\">Github.<\/a>\u00a0 Revised in December 2020, under the title &#8220;<a href=\"https:\/\/hal.archives-ouvertes.fr\/hal-02617725v2\">Fast Incremental Expectation Maximization for finite-sum optimization: asymptotic convergence<\/a>&#8220;. <\/em>Accepted in<em> Statistics and Computing,<\/em> May 2021.<em><br \/>\n<\/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:\/\/hal.archives-ouvertes.fr\/hal-01629952\">Uncertainty quantification for Stochastic Approximation limits using Chaos Expansion<\/a>. Nov17, HAL-01629952. <small> <\/small><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><br \/>\n<\/small><\/span><\/li>\n<li style=\"text-align: justify\"><span style=\"font-size: 12pt\"><small>D. Barrera, S. Crepey, B. Diallo, G. Fort, E. Gobet and V. Stazhinksi. <a href=\"https:\/\/hal.archives-ouvertes.fr\/hal-01710394\">Stochastic Approximation Schemes for Economic Capital and Risk Margin Computations<\/a><\/small><small>,\u00a0 <em>ESAIM Proc (CEMRACS 2017)<\/em>, 65:182&#8211;218, 2019.<br \/>\n<\/small><\/span><\/li>\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:\/\/hal.archives-ouvertes.fr\/hal-01389996\">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 style=\"text-align: justify\"><span style=\"font-size: 12pt\"><small>G. Fort, E. Ollier and A. Leclerc-Samson.<a href=\"https:\/\/arxiv.org\/abs\/1704.08891\"> Stochastic Proximal Gradient Algorithms for Penalized Mixed Models<\/a>. arXiv:1704.08891. <i>Statistics and Computing, <\/i>29(2):231-253, 2019.<br \/>\n<\/small><\/span><\/li>\n<li style=\"text-align: justify\"><span style=\"font-size: 12pt\"><small><\/small><small>G. Fort<\/small><small>, E. Gobet and E. Moulines. <a href=\"https:\/\/hal.archives-ouvertes.fr\/hal-01394833v1\">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.<br \/>\n<\/small><\/span><\/li>\n<li style=\"text-align: justify\"><span style=\"font-size: 12pt\"><small>G. Morral, P. Bianchi and G. Fort. Success and Failure of Adaptation-Diffusion Algorithms for Consensus in Multi-Agent Networks. <em>IEEE Trans. Signal Processing<\/em>, 65(11):2798-2813, 2017.<\/small><\/span><\/li>\n<li style=\"text-align: justify\"><span style=\"font-size: 12pt\"><small>Y. Atchad\u00e9, G. Fort and E. Moulines. <a href=\"http:\/\/arxiv-web3.library.cornell.edu\/abs\/1402.2365\">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 style=\"text-align: justify\"><span style=\"font-size: 12pt\"><small>H. Braham, S. Ben Jemaa, G. Fort, E. Moulines and B. Sayrac. <a href=\"http:\/\/arxiv.org\/abs\/1510.03638\">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:\/\/arxiv.org\/abs\/1505.07062\">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=\"http:\/\/arxiv.org\/abs\/1403.6803\">Convergence of Markovian Stochastic Approximation with discontinuous dynamics<\/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\"><code><\/code><small>G. Fort, B. Jourdain, T. Leli\u00e8vre and G. Stoltz. <a href=\"http:\/\/arxiv.org\/abs\/1410.2109\"> 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 style=\"text-align: justify\"><span style=\"font-size: 12pt\"><small><i>.<\/i><\/small><small>A. Schreck, G. Fort, S. Le Corff and E. Moulines. <a href=\"http:\/\/arxiv.org\/abs\/1312.5658\">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=\"http:\/\/arxiv.org\/abs\/1402.4577\">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<li style=\"text-align: justify\"><span style=\"font-size: 12pt\"><small>G. Fort. <a href=\"http:\/\/math.univ-toulouse.fr\/%7Egfort\/Preprints\/fort:2014.pdf\">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=\"http:\/\/arxiv.org\/abs\/1309.0622\">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=\"http:\/\/arxiv.org\/abs\/1207.6880\"> 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>G. Fort, B. Jourdain, E. Kuhn, T. Leli\u00e8vre and G. Stoltz. <a href=\"http:\/\/arxiv.org\/abs\/1310.6550\">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>R. Bardenet, O. Capp\u00e9, G. Fort and B. Kegl. <a href=\"http:\/\/arxiv.org\/abs\/1210.2601\">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<li style=\"text-align: justify\"><span style=\"font-size: 12pt\"><small>P. Bianchi, G. Fort and W. Hachem.\u00a0 <a href=\"http:\/\/math.univ-toulouse.fr\/%7Egfort\/Preprints\/bianchi:fort:hachem:2013.pdf\">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>S. Le Corff and G. Fort. <a href=\"http:\/\/arxiv.org\/abs\/1108.3968\">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.<br \/>\n<\/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=\"http:\/\/math.univ-toulouse.fr\/%7Egfort\/Preprints\/fmpv_clt_arXiv.pdf\">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.<br \/>\n<\/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:\/\/www.math.univ-toulouse.fr\/%7Eschreck\/aees.pdf\">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=\"http:\/\/arxiv.org\/abs\/1111.1307\">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.<br \/>\n<\/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=\"http:\/\/www.sciencedirect.com\/science\/article\/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=\"http:\/\/arxiv.org\/abs\/1203.3036\">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><small>Limit theorems for some adaptive MCMC algorithms with subgeometric kernels, part II<\/small><small>. Bernoulli 18(3):975-1001, 2012.<br \/>\n<\/small><\/span><\/li>\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. Bayesian model comparison in cosmology with Population Monte Carlo.\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>P. Etor\u00e9, G. Fort, B. Jourdain and E. <\/small><small> <\/small><small>Moulines. <a href=\"http:\/\/math.univ-toulouse.fr\/%7Egfort\/Preprints\/Etore:Fort:Jourdain:Moulines:2009.pdf\">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 style=\"text-align: justify\"><span style=\"font-size: 12pt\"><small>Y. Atchad\u00e9 and G. Fort. <a href=\"http:\/\/math.univ-toulouse.fr\/%7Egfort\/Preprints\/atchade:fort:2009.pdf\">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<li style=\"text-align: justify\"><span style=\"font-size: 12pt\"><small>S. Connor and G. Fort. State-dependent Foster-Lyapunov criteria for subgeometric convergence of Markov chains.<em> Stoch. Processes Appl.119:4176-4193, 2009 ArXiv math.PR\/0901.2453<\/em><br \/>\n<\/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. Estimation of cosmological parameters using adaptive importance sampling. <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. Forgetting of the initial distribution for Hidden Markov Models. <em>Stoch. Process Appl.<\/em> 119(4):1235-1256, 2009. ArXiv.math.ST\/0703836.<br \/>\n<\/small><\/span><\/li>\n<li style=\"text-align: justify\"><span style=\"font-size: 12pt\"><small>R. Douc, G. Fort and A. Guillin. Subgeometric rates of convergence of f-ergodic strong Markov processes. <em>Stoch. Process Appl.<\/em>, 119(3):897-923, 2009. ArXiv math.ST\/0605791<br \/>\n<\/small><\/span><\/li>\n<li style=\"text-align: justify\"><span style=\"font-size: 12pt\"><small>G. Fort, S. Meyn, E. Moulines and P. Priouret. The ODE methog for the stability of skip-free Markov Chains with applications to MCMC.<em> Ann. Appl. Probab<\/em>. 18(2) :664-707, 2008<\/small><small><big><small><big>.<\/big><\/small><\/big><\/small><\/span><\/li>\n<li style=\"text-align: justify\"><span style=\"font-size: 12pt\"><small>F. Forbes and G. Fort. A convergence theorem for Variational EM-like algorithms: application to image segmentation.<em> IEEE Trans on Image Processing<\/em>, 16(3):824(837, 2007.<br \/>\n<\/small><\/span><\/li>\n<li style=\"text-align: justify\"><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 style=\"text-align: justify\"><span style=\"font-size: 12pt\"><small>G. Fort and S. Lambert-Lacroix. <a href=\"http:\/\/math.univ-toulouse.fr\/%7Egfort\/Preprints\/Fort:Lambert:2005.pdf\">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.<br \/>\n<\/small><\/span><\/li>\n<li style=\"text-align: justify\"><span style=\"font-size: 12pt\"><small>G. Fort and G.O. Roberts. <a href=\"http:\/\/math.univ-toulouse.fr\/%7Egfort\/Preprints\/Fort:Robert:2005.pdf\">Subgeometric ergodicity of strong Markov processes<\/a>. <em>Ann. Appli. Probab.<\/em> 15(2):1565-1589, 2005.<\/small><\/span><\/li>\n<li style=\"text-align: justify\"><span style=\"font-size: 12pt\"><small>R. Douc, G. Fort, E. Moulines and P. Soulier. <a href=\"http:\/\/math.univ-toulouse.fr\/%7Egfort\/Preprints\/douc:fort:moulines:soulier:2004.pdf\">Practical drift conditions for subgeometric rates of convergence<\/a>. <em>Ann. Appl. Probab.<\/em> 14(3):1353-1377, 2004.<br \/>\n<\/small><\/span><\/li>\n<li style=\"text-align: justify\"><span style=\"font-size: 12pt\"><small>G. Fort, E. Moulines, G.O. Robserts and J.S. Rosenthal.<a href=\"http:\/\/math.univ-toulouse.fr\/%7Egfort\/Preprints\/fort:moulines:roberts:rosenthal:2003.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=\"http:\/\/math.univ-toulouse.fr\/%7Egfort\/Preprints\/fort:moulines:2003:poly.pdf\">Polynomial ergodicity of Markov transition kernels<\/a>. <em>Stoch. Process Appl.<\/em> 103(1),57-99, 2003.<br \/>\n<\/small><\/span><\/li>\n<li style=\"text-align: justify\"><span style=\"font-size: 12pt\"><small>G. Fort and E. Moulines. <a href=\"http:\/\/math.univ-toulouse.fr\/%7Egfort\/Preprints\/fort:moulines.2003.pdf\">Convergence of the Monte Caro EM for curved exponential families<\/a>. <em>Ann. Stat.<\/em> 31(4):1220-1259, 2003.<br \/>\n<\/small><\/span><\/li>\n<li style=\"text-align: justify\"><span style=\"font-size: 12pt\"><small>G. Fort and E. Moulines. V-subgeometric ergodicity for a Hastings-Metropolis algorithm. <em>Stat. Probab. Lett.<\/em> 49(4):401-410, 2000.\u00a0<\/small><\/span><\/li>\n<\/ol>\n<p>&nbsp;<\/p>\n<p><em>MathScinet : here<\/em><\/p>\n<p><em>Google Scholar<\/em> :<a href=\"https:\/\/scholar.google.com\/citations?user=V3ev564AAAAJ&amp;hl=en\"> here<\/a><\/p>\n","protected":false},"excerpt":{"rendered":"<p>The list of the submitted papers is here G. Fort, F. Forbes and H.-D. Nguyen. Sequential Sample Average Majorization-Minimization. Accepted for publication in Statistics and Computing, November 2025. A. Dieuleveut, G. Fort, E. Moulines and H-T. Wai. Stochastic Approximation beyond Gradient for Signal Processing and Machine Learning. HAL-03979922. IEEE Trans Signal Processing,71:3117-3148, 2023. G. Fort [&hellip;]<\/p>\n","protected":false},"author":194,"featured_media":0,"parent":92,"menu_order":1,"comment_status":"closed","ping_status":"open","template":"full-width-page.php","meta":{"footnotes":""},"class_list":["post-146","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"https:\/\/perso.math.univ-toulouse.fr\/gfort\/wp-json\/wp\/v2\/pages\/146","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=146"}],"version-history":[{"count":36,"href":"https:\/\/perso.math.univ-toulouse.fr\/gfort\/wp-json\/wp\/v2\/pages\/146\/revisions"}],"predecessor-version":[{"id":5729,"href":"https:\/\/perso.math.univ-toulouse.fr\/gfort\/wp-json\/wp\/v2\/pages\/146\/revisions\/5729"}],"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=146"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}