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. 2309.05337
  4. Cited By
Stochastic Gradient Descent-like relaxation is equivalent to Metropolis
  dynamics in discrete optimization and inference problems

Stochastic Gradient Descent-like relaxation is equivalent to Metropolis dynamics in discrete optimization and inference problems

11 September 2023
Maria Chiara Angelini
A. Cavaliere
Raffaele Marino
F. Ricci-Tersenghi
ArXivPDFHTML

Papers citing "Stochastic Gradient Descent-like relaxation is equivalent to Metropolis dynamics in discrete optimization and inference problems"

6 / 6 papers shown
Title
A Short Review on Novel Approaches for Maximum Clique Problem: from
  Classical algorithms to Graph Neural Networks and Quantum algorithms
A Short Review on Novel Approaches for Maximum Clique Problem: from Classical algorithms to Graph Neural Networks and Quantum algorithms
Raffaele Marino
L. Buffoni
Bogdan Zavalnij
GNN
32
5
0
13 Mar 2024
Engineered Ordinary Differential Equations as Classification Algorithm
  (EODECA): thorough characterization and testing
Engineered Ordinary Differential Equations as Classification Algorithm (EODECA): thorough characterization and testing
Raffaele Marino
L. Buffoni
Lorenzo Chicchi
Lorenzo Giambagli
Duccio Fanelli
27
1
0
22 Dec 2023
Complex Recurrent Spectral Network
Complex Recurrent Spectral Network
Lorenzo Chicchi
Lorenzo Giambagli
L. Buffoni
Raffaele Marino
Duccio Fanelli
22
6
0
12 Dec 2023
Phase transitions in the mini-batch size for sparse and dense two-layer
  neural networks
Phase transitions in the mini-batch size for sparse and dense two-layer neural networks
Raffaele Marino
F. Ricci-Tersenghi
18
14
0
10 May 2023
Nonequilibrium Monte Carlo for unfreezing variables in hard
  combinatorial optimization
Nonequilibrium Monte Carlo for unfreezing variables in hard combinatorial optimization
Masoud Mohseni
D. Eppens
J. Strümpfer
Raffaele Marino
Vasil S. Denchev
A. Ho
Sergei V. Isakov
Sergio Boixo
F. Ricci-Tersenghi
Hartmut Neven
21
20
0
26 Nov 2021
Hiding Quiet Solutions in Random Constraint Satisfaction Problems
Hiding Quiet Solutions in Random Constraint Satisfaction Problems
Florent Krzakala
Lenka Zdeborová
65
110
0
14 Jan 2009
1