default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGersende Fort
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2023
[j22]Gersende Fort, Eric Moulines:
Stochastic variable metric proximal gradient with variance reduction for non-convex composite optimization. Stat. Comput. 33(3): 65 (2023)- [j21]Gersende Fort
, Barbara Pascal, Patrice Abry, Nelly Pustelnik:
Covid19 Reproduction Number: Credibility Intervals by Blockwise Proximal Monte Carlo Samplers. IEEE Trans. Signal Process. 71: 888-900 (2023) - [j20]Aymeric Dieuleveut, Gersende Fort, Eric Moulines, Hoi-To Wai:
Stochastic Approximation Beyond Gradient for Signal Processing and Machine Learning. IEEE Trans. Signal Process. 71: 3117-3148 (2023) - 2021
- [j19]Gersende Fort, P. Gach, Eric Moulines:
Fast incremental expectation maximization for finite-sum optimization: nonasymptotic convergence. Stat. Comput. 31(4): 48 (2021) - 2020
- [j18]Stéphane Crépey, Gersende Fort, Emmanuel Gobet, Uladzislau Stazhynski:
Uncertainty Quantification for Stochastic Approximation Limits Using Chaos Expansion. SIAM/ASA J. Uncertain. Quantification 8(3): 1061-1089 (2020) - 2019
- [j17]Gersende Fort, Edouard Ollier, Adeline Samson:
Stochastic proximal-gradient algorithms for penalized mixed models. Stat. Comput. 29(2): 231-253 (2019) - 2017
- [j16]Yves F. Atchadé, Gersende Fort, Eric Moulines:
On Perturbed Proximal Gradient Algorithms. J. Mach. Learn. Res. 18: 10:1-10:33 (2017) - [j15]Gersende Fort, Emmanuel Gobet, Eric Moulines:
MCMC design-based non-parametric regression for rare event. Application to nested risk computations. Monte Carlo Methods Appl. 23(1): 21-42 (2017) - [j14]Gersende Fort, Benjamin Jourdain, Tony Lelièvre, Gabriel Stoltz:
Self-healing umbrella sampling: convergence and efficiency. Stat. Comput. 27(1): 147-168 (2017) - [j13]Gemma Morral, Pascal Bianchi, Gersende Fort:
Success and Failure of Adaptation-Diffusion Algorithms With Decaying Step Size in Multiagent Networks. IEEE Trans. Signal Process. 65(11): 2798-2813 (2017) - [j12]Hajer Braham, Sana Ben Jemaa, Gersende Fort, Eric Moulines, Berna Sayraç:
Fixed Rank Kriging for Cellular Coverage Analysis. IEEE Trans. Veh. Technol. 66(5): 4212-4222 (2017) - 2016
- [j11]Amandine Schreck, Gersende Fort, Sylvain Le Corff, Eric Moulines:
A Shrinkage-Thresholding Metropolis Adjusted Langevin Algorithm for Bayesian Variable Selection. IEEE J. Sel. Top. Signal Process. 10(2): 366-375 (2016) - [j10]Gersende Fort, Eric Moulines, Amandine Schreck, Matti Vihola:
Convergence of Markovian Stochastic Approximation with Discontinuous Dynamics. SIAM J. Control. Optim. 54(2): 866-893 (2016) - [j9]Hajer Braham, Sana Ben Jemaa, Gersende Fort, Eric Moulines, Berna Sayraç:
Spatial Prediction Under Location Uncertainty in Cellular Networks. IEEE Trans. Wirel. Commun. 15(11): 7633-7643 (2016) - 2015
- [j8]Christophe Andrieu, Gersende Fort, Matti Vihola:
Quantitative Convergence Rates for Subgeometric Markov Chains. J. Appl. Probab. 52(2): 391-404 (2015) - [j7]Gersende Fort, Benjamin Jourdain, Estelle Kuhn, Tony Lelièvre, Gabriel Stoltz:
Convergence of the Wang-Landau algorithm. Math. Comput. 84(295): 2297-2327 (2015) - 2013
- [j6]Pascal Bianchi, Gersende Fort, Walid Hachem:
Performance of a Distributed Stochastic Approximation Algorithm. IEEE Trans. Inf. Theory 59(11): 7405-7418 (2013) - [j5]Sylvain Le Corff, Gersende Fort:
Convergence of a Particle-Based Approximation of the Block Online Expectation Maximization Algorithm. ACM Trans. Model. Comput. Simul. 23(1): 2:1-2:22 (2013) - [j4]Amandine Schreck, Gersende Fort, Eric Moulines:
Adaptive Equi-Energy Sampler: Convergence and Illustration. ACM Trans. Model. Comput. Simul. 23(1): 5:1-5:27 (2013) - 2011
- [j3]Pierre Etoré, Gersende Fort, Benjamin Jourdain, Eric Moulines:
On adaptive stratification. Ann. Oper. Res. 189(1): 127-154 (2011) - 2007
- [j2]Florence Forbes, Gersende Fort:
Combining Monte Carlo and Mean-Field-Like Methods for Inference in Hidden Markov Random Fields. IEEE Trans. Image Process. 16(3): 824-837 (2007) - 2005
- [j1]Gersende Fort, Sophie Lambert-Lacroix:
Classification using partial least squares with penalized logistic regression. Bioinform. 21(7): 1104-1111 (2005)
Conference and Workshop Papers
- 2023
- [c20]Patrice Abry, Juliette Chevallier, Gersende Fort, Barbara Pascal:
Pandemic Intensity Estimation from Stochastic Approximation-Based Algorithms. CAMSAP 2023: 356-360 - [c19]Patrice Abry, Gersende Fort, Barbara Pascal, Nelly Pustelnik:
Proximal-Langevin Samplers for Nonsmooth Composite Posteriors: Application to the Estimation of Covid19 Reproduction Number. EUSIPCO 2023: 1813-1817 - 2022
- [c18]Patrice Abry, Gersende Fort, Barbara Pascal, Nelly Pustelnik:
Temporal evolution of the Covid19 pandemic reproduction number: Estimations from proximal optimization to Monte Carlo sampling. EMBC 2022: 167-170 - [c17]Hugo Artigas, Barbara Pascal, Gersende Fort, Patrice Abry, Nelly Pustelnik:
Credibility interval Design for Covid19 Reproduction Number from Nonsmooth Langevin-type Monte Carlo sampling. EUSIPCO 2022: 2196-2200 - 2021
- [c16]Gersende Fort, Eric Moulines, Hoi-To Wai:
Geom-Spider-EM: Faster Variance Reduced Stochastic Expectation Maximization for Nonconvex Finite-Sum Optimization. ICASSP 2021: 3135-3139 - [c15]Aymeric Dieuleveut, Gersende Fort, Eric Moulines, Geneviève Robin:
Federated-EM with heterogeneity mitigation and variance reduction. NeurIPS 2021: 29553-29566 - [c14]Gersende Fort, Eric Moulines:
The Perturbed Prox-Preconditioned Spider Algorithm: Non-Asymptotic Convergence Bounds. SSP 2021: 96-100 - [c13]Gersende Fort, Eric Moulines:
The Perturbed Prox-Preconditioned Spider Algorithm for EM-Based Large Scale Learning. SSP 2021: 316-320 - 2020
- [c12]Gersende Fort, Eric Moulines, Hoi-To Wai:
A Stochastic Path Integral Differential EstimatoR Expectation Maximization Algorithm. NeurIPS 2020 - 2018
- [c11]Gersende Fort, Laurent Risser, Yves F. Atchadé, Eric Moulines:
Stochastic Fista Algorithms: So Fast ? SSP 2018: 796-800 - 2014
- [c10]Gemma Morral, Pascal Bianchi, Gersende Fort:
Success and failure of adaptation-diffusion algorithms for consensus in multi-agent networks. CDC 2014: 1476-1481 - [c9]Hajer Braham, Sana Ben Jemaa, Berna Sayraç, Gersende Fort, Eric Moulines:
Coverage mapping using spatial interpolation with field measurements. PIMRC 2014: 1743-1747 - [c8]Hajer Braham, Sana Ben Jemaa, Berna Sayraç, Gersende Fort, Eric Moulines:
Low complexity spatial interpolation for cellular coverage analysis. WiOpt 2014: 188-195 - 2012
- [c7]Gemma Morral, Pascal Bianchi, Gersende Fort, Jérémie Jakubowicz:
Distributed stochastic approximation: The price of non-double stochasticity. ACSCC 2012: 1473-1477 - [c6]Sylvain Le Corff, Gersende Fort, Eric Moulines:
New Online EM Algorithms for General Hidden Markov Models. Application to the SLAM Problem. LVA/ICA 2012: 131-138 - [c5]Rémi Bardenet, Olivier Cappé, Gersende Fort, Balázs Kégl:
Adaptive Metropolis with Online Relabeling. AISTATS 2012: 91-99 - 2011
- [c4]Pascal Bianchi, Gersende Fort, Walid Hachem, Jérémie Jakubowicz:
Performance analysis of a distributed Robbins-Monro algorithm for sensor networks. EUSIPCO 2011: 1030-1034 - [c3]Pascal Bianchi, Gersende Fort, Walid Hachem, Jérémie Jakubowicz:
Convergence of a distributed parameter estimator for sensor networks with local averaging of the estimates. ICASSP 2011: 3764-3767 - 2006
- [c2]Gersende Fort, Eric Moulines, Sean P. Meyn, Pierre Priouret:
ODE methods for Markov chain stability with applications to MCMC. VALUETOOLS 2006: 42 - 1998
- [c1]Gersende Fort, Eric Moulines, Philippe Soulier:
On the Convergence of Iterated Random Maps with Applications to the MCEM Algorithm. COMPSTAT 1998: 317-322
Informal and Other Publications
- 2023
- [i11]Gersende Fort, Eric Moulines:
Stochastic Variable Metric Proximal Gradient with variance reduction for non-convex composite optimization. CoRR abs/2301.00631 (2023) - 2022
- [i10]Gersende Fort, Barbara Pascal, Patrice Abry, Nelly Pustelnik:
Covid19 Reproduction Number: Credibility Intervals by Blockwise Proximal Monte Carlo Samplers. CoRR abs/2203.09142 (2022) - 2021
- [i9]Gersende Fort, Eric Moulines:
The Perturbed Prox-Preconditioned SPIDER algorithm for EM-based large scale learning. CoRR abs/2105.11732 (2021) - [i8]Aymeric Dieuleveut, Gersende Fort, Eric Moulines, Geneviève Robin:
Federated Expectation Maximization with heterogeneity mitigation and variance reduction. CoRR abs/2111.02083 (2021) - 2020
- [i7]Gersende Fort, Eric Moulines, Hoi-To Wai:
Geom-SPIDER-EM: Faster Variance Reduced Stochastic Expectation Maximization for Nonconvex Finite-Sum Optimization. CoRR abs/2011.12392 (2020) - [i6]Gersende Fort, Eric Moulines, Hoi-To Wai:
A Stochastic Path-Integrated Differential EstimatoR Expectation Maximization Algorithm. CoRR abs/2012.01929 (2020) - [i5]Gersende Fort, P. Gach, Eric Moulines:
Fast Incremental Expectation Maximization for finite-sum optimization: nonasymptotic convergence. CoRR abs/2012.14670 (2020) - 2015
- [i4]Hajer Braham, Sana Ben Jemaa, Gersende Fort, Eric Moulines, Berna Sayraç:
Fixed Rank Kriging for Cellular Coverage Analysis. CoRR abs/1505.07062 (2015) - [i3]Hajer Braham, Sana Ben Jemaa, Gersende Fort, Eric Moulines, Berna Sayraç:
Spatial Prediction Under Location Uncertainty In Cellular Networks. CoRR abs/1510.03638 (2015) - 2014
- [i2]Gemma Morral, Pascal Bianchi, Gersende Fort:
Success and Failure of Adaptation-Diffusion Algorithms for Consensus in Multi-Agent Networks. CoRR abs/1410.6956 (2014) - 2012
- [i1]Pascal Bianchi, Gersende Fort, Walid Hachem:
Performance of a Distributed Stochastic Approximation Algorithm. CoRR abs/1203.1505 (2012)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-13 01:38 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
