Synapse
⌘+K
Synapse
PulseExploreClubsResearchersJournals
Instagram
HomeClubsExplore
March 15, 2024Mathematics of ComputationOpen Access

Convergence of Langevin-simulated annealing algorithms with multiplicative noise

View Full Paper
Ask AI
Bookmark
Share

Authors

PBPierre BrasGPGilles Pagès

Discussion

Loading...

Member takes

Overview

Key Points

Key points are not available for this paper at this time.

Cite This Study

Bras et al. (2024) studied this question.

synapsesocial.com/papers/68e73cbeb6db6435876b64bfhttps://doi.org/10.1090/mcom/3899
View Full Paper
Ask AI
Bookmark
Share

Also Consider

Synapse has enriched 4 closely related papers on similar clinical questions. Consider them for comparative context:

  1. 1Identifying and attacking the saddle point problem in high-dimensional non-convex optimization2014 · 456 citations
  2. 2Empirical Analysis of the Hessian of Over-Parametrized Neural Networks2017 · 165 citations
  3. 3Equilibrated adaptive learning rates for non-convex optimization2015 · 152 citations
  4. 4Nonasymptotic convergence analysis for the unadjusted Langevin algorithm2017 · 202 citations