{"id":3121,"date":"2021-08-27T20:58:02","date_gmt":"2021-08-27T19:58:02","guid":{"rendered":"http:\/\/pageperso.math.univ-toulouse.fr\/gfort\/?page_id=3121"},"modified":"2025-01-02T19:20:23","modified_gmt":"2025-01-02T18:20:23","slug":"codes","status":"publish","type":"page","link":"https:\/\/perso.math.univ-toulouse.fr\/gfort\/codes\/","title":{"rendered":"Codes"},"content":{"rendered":"<p><strong>MATLAB Codes<\/strong><\/p>\n<ol>\n<li><a href=\"https:\/\/www.math.univ-toulouse.fr\/%7Egfort\/GLM\/Programs.html\">Code and Data set <\/a>\n<ul>\n<li>Paper 1\u00a0 &#8220;Classification using Partial Leas Squares with Penalized logistic Regression&#8221;, with S. Lambert-Lacroix<\/li>\n<li>Paper 2 &#8220;Partial Least Squares for classification and feature selection in Microarray gene expression data&#8221;<\/li>\n<li>Codes developed by G. Fort<\/li>\n<\/ul>\n<\/li>\n<li><a href=\"https:\/\/www.math.univ-toulouse.fr\/%7Egfort\/INRIA\/MCVEM.html\">Code<\/a>\n<ul>\n<li>Paper &#8220;A convergence theorem for Variation-EM like algorithms: Applications to Image Segmentation&#8221;, with F. Forbes<\/li>\n<li>Codes developed by G. Fort<\/li>\n<\/ul>\n<\/li>\n<li><a href=\"https:\/\/www.math.univ-toulouse.fr\/%7Egfort\/AdaptStr.tar.gz\">Code<\/a>\n<ul>\n<li>Paper &#8220;On adaptive stratification&#8221;, with B. Jourdain, P. Etor\u00e9 and E. Moulines<\/li>\n<li>Codes developed by G. Fort<\/li>\n<\/ul>\n<\/li>\n<li><a href=\"https:\/\/arxiv.org\/abs\/1101.0950\">PMC applied to cosmology<\/a>\n<ul>\n<li>Paper &#8220;Estimation of cosmological parameters using adaptive importance sampling&#8221;, with D. Wraith, M. Kilbinger, K. Benabed, O. Capp\u00e9, J.F. Cardoso, S. Prunet and C.P. Robert<\/li>\n<li>These codes were developed by M. Kilbinger and K. Benabed (G. Fort participated to preliminary versions of the codes,developed in Matlab).<\/li>\n<\/ul>\n<\/li>\n<li><a href=\"https:\/\/sylvainlc.github.io\/\">Codes<\/a>\n<ul>\n<li>Paper 1 &#8220;Convergence of a particle-based approximation of the Block-Online Expectation Maximization algorithm&#8221;, with S. Le Corff<\/li>\n<li>Paper 2 &#8220;Online Expectation Maximization based algorithms for inference in Hidden Markov Models&#8221;, with S.Le Corff<\/li>\n<li>Paper 3 &#8220;New Online-EM algorithms for general Hidden Markov Models. Application to the SLAM&#8221;, with S. Le Corff and E. Moulines<\/li>\n<li>Codes developed by S. Le Corff &#8212; during his PhD under my co-supervision.<\/li>\n<\/ul>\n<\/li>\n<li><a href=\"http:\/\/amandine.schreck.free.fr\/\">Codes<\/a>\n<ul>\n<li>Paper &#8220;Adaptive Equi-Energy sampler: convergence and illustration&#8221;, with A. Schreck and E. Moulines<\/li>\n<li>Codes developed by A. Schreck &#8212; during her PhD under my co-supervision<\/li>\n<\/ul>\n<\/li>\n<li><a href=\"https:\/\/rbardenet.github.io\/\">Codes<\/a>\n<ul>\n<li>Paper &#8220;Adaptive Metropolis Online-Relabeling&#8221;, with R. Bardenet, O. Capp\u00e9 and B. Kegl<\/li>\n<li>Codes developed by R. Bardenet<\/li>\n<\/ul>\n<\/li>\n<li><a href=\"http:\/\/amandine.schreck.free.fr\/\">Codes<\/a>\n<ul>\n<li>Paper &#8220;Shrinkage-Threshoding Metropolis-Adjusted Langevin Algorithm&#8221;, with A. Schreck, S. Le Corff and E. Moulines.<\/li>\n<li>Codes developed by A. Schreck &#8212; during her PhD under my co-supervision<\/li>\n<\/ul>\n<\/li>\n<li><a href=\"https:\/\/github.com\/gfort-lab\/OpSiMorE\">Codes on github<\/a>\n<ul>\n<li>Paper &#8220;Fast Incremental Expectation Maximization for non-convex finite-sum optimization: non asymptotic convergence bounds&#8221; with E. Moulines and P. Gach<\/li>\n<li>Codes developed by G. Fort<\/li>\n<\/ul>\n<\/li>\n<li>Codes (TBA)\n<ul>\n<li>Paper 1 &#8220;The Perturbed Prox-Preconditioned SPIDER algorithm for EM-based large scale learning&#8221;, with E. Moulines<small>.\u00a0<\/small><\/li>\n<li>Paper 2 &#8220;The Perturbed Prox-Preconditioned SPIDER algorithm: non-asymptotic convergence bounds&#8221;, with E. Moulines.<\/li>\n<li>Paper 3 &#8212; TBA<\/li>\n<li>Codes developed by G. Fort<\/li>\n<\/ul>\n<\/li>\n<li><a href=\"https:\/\/github.com\/gfort-lab\/OpSiMorE\">Codes on github<\/a>\n<ul>\n<li style=\"text-align: justify\">Paper 1- &#8220;Temporal Evolution of the Covid19 pandemic reproduction number: Estimations from Proximal optimization to Monte Carlo sampling&#8221;, by P. Abry, G. Fort, B. Pascal and N. Pustelnik. Accepted for publication in <a href=\"https:\/\/hal.science\/hal-03565440\">EMBC 2022 proceedings<\/a>.<\/li>\n<li style=\"text-align: justify\">Paper 2- &#8220;Credibility Interval Design for Covid19 Reproduction Number from nonsmooth Langevin-type Monte Carlo sampling&#8221;, by H. Artigas, B. Pascal, G. Fort, P. Abry and N. Pustelnik. Accepted for publication in <a href=\"https:\/\/hal.science\/hal-03371837\">EUSIPCO 2022 proceedings<\/a>.<\/li>\n<li style=\"text-align: justify\">Paper 3- &#8220;Estimation et Intervalles de cr\u00e9dibilit\u00e9 pour le taux de reproduction de la Covid19 par \u00e9chantillonnage Monte Carlo Langevin Proximal&#8221;, by P. Abry, G. Fort, B. Pascal and N. Pustelnik. Accepted for publication in<a href=\"https:\/\/hal.science\/hal-03611891\"> GRETSI 2022 proceedings<\/a>.<\/li>\n<li style=\"text-align: justify\">Paper 4- &#8220;Credibility intervals for the reproduction number of the Covid-19 pandemic using Proximal Lanvevin samplers&#8221;, by P. Abry, G. Fort, B. Pascal and N. Pustelnik. <a href=\"https:\/\/hal.science\/hal-03902144\/\">Accepted for publication in EUSIPCO 2023<\/a>.<\/li>\n<li style=\"text-align: justify\">Paper 5- &#8220;Covid19 Reproduction Number: Credibility Intervals by Blockwise Proximal Monte Carlo samplers&#8221;, by G. Fort, B. Pascal, P. Abry and N. Pustelnik. <a href=\"https:\/\/hal.science\/hal-03611079\">Accepted for publication in IEEE Trans Signal Processing<\/a><\/li>\n<li style=\"text-align: justify\">Codes developed by G. Fort (and some of them, with H. Artigas).<\/li>\n<li style=\"text-align: justify\">Paper 6- &#8220;Pandemic Intensity Estimation From Stochastic Approximation-Based Algorithms&#8221;, by P. Abry, J. Chevallier, G. Fort and B. Pascal. Accepted for publication in <a href=\"https:\/\/ieeexplore.ieee.org\/document\/10403431\" rel=\"nofollow\">CAMSAP 2023<\/a> proceedings; see also <a href=\"https:\/\/hal.science\/hal-04174245v2\" rel=\"nofollow\">HAL version<\/a>.<\/li>\n<li style=\"text-align: justify\">Paper 7- &#8220;Hierarchical Bayesian Estimation of COVID-19 Reproduction Number&#8221;, by P. Abry, J. Chevallier, G. Fort and B. Pascal. Accepted for publication in <a href=\"https:\/\/hal.science\/hal-04695138\" rel=\"nofollow\">ICASSP 2025<\/a> proceedings.<\/li>\n<\/ul>\n<\/li>\n<\/ol>\n","protected":false},"excerpt":{"rendered":"<p>MATLAB Codes Code and Data set Paper 1\u00a0 &#8220;Classification using Partial Leas Squares with Penalized logistic Regression&#8221;, with S. Lambert-Lacroix Paper 2 &#8220;Partial Least Squares for classification and feature selection in Microarray gene expression data&#8221; Codes developed by G. Fort Code Paper &#8220;A convergence theorem for Variation-EM like algorithms: Applications to Image Segmentation&#8221;, with F. [&hellip;]<\/p>\n","protected":false},"author":194,"featured_media":0,"parent":0,"menu_order":5,"comment_status":"closed","ping_status":"open","template":"full-width-page.php","meta":{"footnotes":""},"class_list":["post-3121","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"https:\/\/perso.math.univ-toulouse.fr\/gfort\/wp-json\/wp\/v2\/pages\/3121","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=3121"}],"version-history":[{"count":8,"href":"https:\/\/perso.math.univ-toulouse.fr\/gfort\/wp-json\/wp\/v2\/pages\/3121\/revisions"}],"predecessor-version":[{"id":5657,"href":"https:\/\/perso.math.univ-toulouse.fr\/gfort\/wp-json\/wp\/v2\/pages\/3121\/revisions\/5657"}],"wp:attachment":[{"href":"https:\/\/perso.math.univ-toulouse.fr\/gfort\/wp-json\/wp\/v2\/media?parent=3121"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}