ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1703.00329
  4. Cited By
Convergence rate of a simulated annealing algorithm with noisy
  observations

Convergence rate of a simulated annealing algorithm with noisy observations

1 March 2017
Clément Bouttier
Ioana Gavra
ArXiv (abs)PDFHTML

Papers citing "Convergence rate of a simulated annealing algorithm with noisy observations"

5 / 5 papers shown
Title
An Invariant Information Geometric Method for High-Dimensional Online
  Optimization
An Invariant Information Geometric Method for High-Dimensional Online Optimization
Zhengfei Zhang
Yunyue Wei
Yanan Sui
59
1
0
03 Jan 2024
PyPop7: A Pure-Python Library for Population-Based Black-Box
  Optimization
PyPop7: A Pure-Python Library for Population-Based Black-Box Optimization
Qiqi Duan
Guochen Zhou
Chang Shao
Zhuowei Wang
Mingyang Feng
Yuwei Huang
Yajing Tan
Yijun Yang
Qi Zhao
Yuhui Shi
120
6
0
12 Dec 2022
Uniform Generalization Bound on Time and Inverse Temperature for
  Gradient Descent Algorithm and its Application to Analysis of Simulated
  Annealing
Uniform Generalization Bound on Time and Inverse Temperature for Gradient Descent Algorithm and its Application to Analysis of Simulated Annealing
Keisuke Suzuki
AI4CE
76
0
0
25 May 2022
Dynamic social learning under graph constraints
Dynamic social learning under graph constraints
Konstantin Avrachenkov
Vivek Borkar
Sharayu Moharir
S. Shah
10
3
0
08 Jul 2020
Sample Efficient Graph-Based Optimization with Noisy Observations
Sample Efficient Graph-Based Optimization with Noisy Observations
Thanh Tan Nguyen
A. Shameli
Yasin Abbasi-Yadkori
Anup B. Rao
Branislav Kveton
13
1
0
04 Jun 2020
1